437 search results - page 9 / 88 » Quincy: fair scheduling for distributed computing clusters |
124
click to vote
CCGRID
2008
IEEE
15 years 1 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
98
Voted
IPPS
2003
IEEE
15 years 4 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
CJ
1999
14 years 11 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
87
Voted
FTDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters+md task cluster scheduling on distrib...
89
Voted
JSSPP
2005
Springer
15 years 5 months ago
2005
Springer
Sociology, computer networking and operations research provide evidence of the importance of fairness in queuing disciplines. Currently, there is no accepted model for characteriz...