Sciweavers

CLUSTER
2004
IEEE
13 years 8 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
JSSPP
1997
Springer
13 years 8 months ago
Implications of I/O for Gang Scheduled Workloads
This paper examinestheimplicationsofgang schedulingfor generalpurpose multiprocessors. The workloads in these environments include both compute-bound parallel jobs, which often re...
Walter Lee, Matthew Frank, Victor Lee, Kenneth Mac...
IPPS
2000
IEEE
13 years 9 months ago
Improving Throughput and Utilization in Parallel Machines through Concurrent Gang
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
Fabrício Alves Barbosa da Silva, Isaac D. S...
ANSS
2002
IEEE
13 years 9 months ago
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
Helen D. Karatza
IPPS
2003
IEEE
13 years 9 months ago
Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources
Fine-grained parallel applications require all their processes to run simultaneously on distinct processors to achieve good efficiency. This is typically accomplished by space sl...
Eitan Frachtenberg, Dror G. Feitelson, Fabrizio Pe...
IEEEPACT
2006
IEEE
13 years 10 months ago
Hardware support for spin management in overcommitted virtual machines
Multiprocessor operating systems (OSs) pose several unique and conflicting challenges to System Virtual Machines (System VMs). For example, most existing system VMs resort to gan...
Philip M. Wells, Koushik Chakraborty, Gurindar S. ...