Name
Abstract | ||
|---|---|---|
Among many attempts to design DAG scheduling algorithms that would face grid environment requirements, the strategy of number of eligible jobs maximization seems promising. Therefore, this paper presents the results of thorough analysis and evaluation of this strategy and its implementation called PRIO. We have analysed a large space of random DAGs and various resources parameters to compare results of PRIO algorithm with standard critical path length prioritization, FIFO prioritization as well as with quasi-optimal solution. Results of this comparison, in terms of the makespan and robustness, are supplemented by a theoretical and specific case analysis. We conclude with an assessment of usefulness of the current implementation of eligible jobs maximization strategy. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-69384-0_31 | Journal of Pharmacology and Experimental Therapeutics |
Keywords | Field | DocType |
eligible job,specific case analysis,dag scheduling,eligible jobs maximization algorithm,dag scheduling algorithm,eligible jobs maximization,prio algorithm,maximization strategy,grid environment requirement,fifo prioritization,thorough analysis,current implementation,critical path,scheduling algorithm,dag | Mathematical optimization,Job shop scheduling,Fair-share scheduling,FIFO (computing and electronics),Computer science,Scheduling (computing),Algorithm,Robustness (computer science),Critical path method,Grid,Maximization,Distributed computing | Conference |
Volume | ISSN | Citations |
5101 | 0302-9743 | 2 |
PageRank | References | Authors |
0.38 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Szepieniec | 1 | 50 | 11.49 |
| Marian Bubak | 2 | 1497 | 231.68 |