Sciweavers

484 search results - page 40 / 97
» Scheduling real time parallel structure on cluster computing
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
CCGRID
2007
IEEE
14 years 2 months ago
Relative Performance of Scheduling Algorithms in Grid Environments
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
Yang Zhang, Charles Koelbel, Ken Kennedy
JSSPP
2004
Springer
14 years 1 months ago
Performance Implications of Failures in Large-Scale Cluster Scheduling
As we continue to evolve into large-scale parallel systems, many of them employing hundreds of computing engines to take on mission-critical roles, it is crucial to design those s...
Yanyong Zhang, Mark S. Squillante, Anand Sivasubra...
JSSPP
2005
Springer
14 years 1 months ago
Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles u...
Dayi Zhou, Virginia Mary Lo
PDP
2005
IEEE
14 years 1 months ago
Memory Bandwidth Aware Scheduling for SMP Cluster Nodes
Clusters of SMPs are becoming increasingly common. However, the shared memory design of SMPs and the consequential contention between system processors for access to main memory c...
Evangelos Koukis, Nectarios Koziris