This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to ...
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
Peng Li, Hyeonjoong Cho, Binoy Ravindran, E. Dougl...
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...