Sciweavers

1609 search results - page 127 / 322
» A Microeconomic Scheduler for Parallel Computers
Sort
View
ICPP
2003
IEEE
15 years 11 months ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera
HPDC
2007
IEEE
16 years 24 days 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
HPCC
2007
Springer
16 years 19 days ago
Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
Bo Li, Dongfeng Zhao
CCGRID
2002
IEEE
15 years 11 months ago
User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers
This paper presents a performance analysis of marketbased batch schedulers for clusters of workstations. In contrast to previous work, we use user-centric performance metrics as t...
Brent N. Chun, David E. Culler
JSSPP
2009
Springer
16 years 1 months ago
Limits of Work-Stealing Scheduling
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
Zeljko Vrba, Håvard Espeland, Pål Halv...