Sciweavers

614 search results - page 65 / 123
» Resource Minimization Job Scheduling
Sort
View
BIRTHDAY
2009
Springer
15 years 8 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
FOCS
2007
IEEE
15 years 7 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
HPDC
2007
IEEE
15 years 10 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
149
Voted
HPCS
2006
IEEE
15 years 10 months ago
Evaluation of Knapsack-Based Scheduling Using the NPACI JOBLOG
GridX1 is a computational grid deployment of off-theshelf components using shared resources at several Canadian research institutions. This work evaluates the applicability of kna...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Rafae...
JEC
2006
107views more  JEC 2006»
15 years 3 months ago
A dynamically reconfigurable cache for multithreaded processors
Chip multi-processors (CMP) are rapidly emerging as an important design paradigm for both high performance and embedded processors. These machines provide an important performance...
Alex Settle, Dan Connors, Enric Gibert, Antonio Go...