Sciweavers

375 search results - page 60 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
GCA
2009
13 years 5 months ago
A Learning Approach to Mechanism Design in Grid Resource Allocation
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
Mahmoud Moravej, Saeed Parsa
CCGRID
2002
IEEE
14 years 19 days 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
PDP
2008
IEEE
14 years 2 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
ICS
2005
Tsinghua U.
14 years 1 months ago
Power-aware resource allocation in high-end systems via online simulation
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...
Barry Lawson, Evgenia Smirni
CLUSTER
2004
IEEE
13 years 11 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