Adaptively Parallel Processor Allocation for Cilk Jobs
The problem of allocating processor resources fairly and efficiently to parallel jobs has been studied extensively in the past. Most of this work, however, assumes that the instantaneous parallelism of the jobs is known and used by the job scheduler to make its decisions. In this project, we conside...
Main Authors: | Sen, Siddhartha, Agrawal, Kunal |
---|---|
Format: | Article |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3849 |
Similar Items
-
Fast Serial Append File I/O Mode For Cilk
by: CaracaÅ , Alexandru
Published: (2003) -
Provably Efficient Adaptive Scheduling for Parallel Jobs
by: He, Yuxiong, et al.
Published: (2007) -
The Named-State Register File
by: Nuth, Peter R.
Published: (2004) -
Mapping Unstructured Parallelism to Series-Parallel DAGs
by: Pan, Yan, et al.
Published: (2003) -
Design and Evaluation of the Hamal Parallel Computer
by: Grossman, J.P.
Published: (2004)