Sciweavers

239 search results - page 29 / 48
» On-line scheduling of parallel jobs on two machines
Sort
View
ICPPW
2005
IEEE
14 years 1 months ago
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
Sanjoy K. Baruah, Nathan Fisher
HPDC
2009
IEEE
14 years 2 months ago
Trace-based evaluation of job runtime and queue wait time predictions in grids
Large-scale distributed computing systems such as grids are serving a growing number of scientists. These environments bring about not only the advantages of an economy of scale, ...
Omer Ozan Sonmez, Nezih Yigitbasi, Alexandru Iosup...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 14 days ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
HIPC
2004
Springer
14 years 1 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
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