Sciweavers

206 search results - page 8 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
JSSPP
2005
Springer
14 years 1 months ago
Unfairness Metrics for Space-Sharing Parallel Job Schedulers
Sociology, computer networking and operations research provide evidence of the importance of fairness in queuing disciplines. Currently, there is no accepted model for characteriz...
Gerald Sabin, P. Sadayappan
ICDCS
2003
IEEE
14 years 25 days ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
CLUSTER
2005
IEEE
14 years 1 months ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
CLUSTER
2005
IEEE
14 years 1 months ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
13 years 11 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers