Sciweavers

217 search results - page 2 / 44
» Scheduling a Job Mix in a Partitionable Parallel System
Sort
View
TOCS
2008
154views more  TOCS 2008»
13 years 4 months ago
Adaptive work-stealing with parallelism feedback
We present an adaptive work-stealing thread scheduler, ASTEAL, for fork-join multithreaded jobs, like those written using the Cilk multithreaded language or the Hood work-stealing...
Kunal Agrawal, Charles E. Leiserson, Yuxiong He, W...
SIGMETRICS
2002
ACM
130views Hardware» more  SIGMETRICS 2002»
13 years 4 months ago
Multiple-queue backfilling scheduling with priorities and reservations for parallel systems
We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computational grid. Our algorithm continuously monitors the system (i.e., the intensi...
Barry G. Lawson, Evgenia Smirni
PDP
2010
IEEE
13 years 8 months ago
Malleable-Lab: A Tool for Evaluating Adaptive Online Schedulers on Malleable Jobs
—The emergence of multi-core computers has led to explosive development of parallel applications and hence the need of efficient schedulers for parallel jobs. Adaptive online sc...
Yangjie Cao, Hongyang Sun, Wen-Jing Hsu, Depei Qia...
IPPS
2006
IEEE
13 years 10 months ago
Multisite co-allocation algorithms for computational grid
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
Weizhe Zhang, A. M. K. Cheng, Mingzeng Hu
CCGRID
2002
IEEE
13 years 9 months ago
A Malleable-Job System for Timeshared Parallel Machines
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
Laxmikant V. Kalé, Sameer Kumar, Jayant DeS...