Name
Abstract | ||
|---|---|---|
Many modern computing platforms are "task-hungry": their performance is enhanced by always having as many tasks available for execution as possible. IC-scheduling, a master-worker framework for executing static computations that have intertask dependencies (modeled as DAGS), was developed with precisely the goal of rendering a computation-dag's tasks eligible for execution at the maximum possible rate. The current paper addresses the problem of enhancing IC-scheduling so that it can accommodate the varying computational resources of different workers, by clustering a computation-DAG'S tasks, while still producing eligible (now, clustered) tasks at the maximum possible rate. The task-clustering strategies presented exploit the structure of the computation being performed, ranging from a strategy that works for any DAG, to ones that build increasingly on the explicit structure of the dag being scheduled. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.2478/s13537-011-0002-4 | OPEN COMPUTER SCIENCE |
Keywords | Field | DocType |
scheduling DAGS, scheduling for task-hungry computing platforms, scheduling for heterogeneous computing platforms | Computer science,Parallel computing,Exploit,Ranging,Rendering (computer graphics),Cluster analysis,Computation,Distributed computing | Journal |
Volume | Issue | ISSN |
1 | 1 | 2299-1093 |
Citations | PageRank | References |
4 | 0.40 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gennaro Cordasco | 1 | 344 | 47.06 |
| Arnold L. Rosenberg | 2 | 2107 | 640.21 |
| Mark Sims | 3 | 62 | 3.96 |