Sciweavers

223 search results - page 1 / 45
» Scheduling Memory Constrained Jobs on Distributed Memory Par...
Sort
View
HIPC
2004
Springer
13 years 10 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
HPCC
2007
Springer
13 years 11 months ago
Coarse-Grain Time Slicing with Resource-Share Control in Parallel-Job Scheduling
Abstract. We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides con...
Bryan Esbaugh, Angela C. Sodan
IPPS
2000
IEEE
13 years 9 months ago
Gang Scheduling with Memory Considerations
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
Anat Batat, Dror G. Feitelson
SKG
2006
IEEE
13 years 11 months ago
Remote Memory Management and Prefetching Techniques for Jobs in Grid
Predominant resources for execution of any application are computational power and memory. On one side, computational power has grown many folds faster than memory capacity. On th...
S. Radha, S. Mary Saira Bhanu, N. P. Gopalan