Sciweavers

375 search results - page 50 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
HPDC
2007
IEEE
14 years 2 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely
ISPA
2007
Springer
14 years 1 months ago
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
JSSPP
2004
Springer
14 years 1 months ago
Parallel Computer Workload Modeling with Markov Chains
Abstract. In order to evaluate different scheduling strategies for parallel computers, simulations are often executed. As the scheduling quality highly depends on the workload tha...
Baiyi Song, Carsten Ernemann, Ramin Yahyapour
IPPS
2005
IEEE
14 years 1 months ago
Scheduling Algorithms for Effective Thread Pairing on Hybrid Multiprocessors
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
Robert L. McGregor, Christos D. Antonopoulos, Dimi...