Grids are dynamic systems in which an important factor is played by the scheduling policies. Moreover scheduling mathematical problems on grids is not a trivial task as it is difficult to estimate their runtimes. This issue is even harder if these problems are part of a workflow. This paper tries to solve this aspect by offering a unified view related to scheduling independent and dependent task batches and a solution in the form of a Scheduling Algorithm and Platform adapted for this particular scenario. Experimental results show that the envisioned heuristic is efficient with regard to other classic approaches.
Hammond K., Al Zain A., Cooperman G., Petcu D., Trinder P. SymGrid: A framework for symbolic computation on the grid, Lecture Notes in Computer Science , Springer, Vol. 4641, 2007, pp. 447–456.
Trinder P. , 'SymGrid: A framework for symbolic computation on the grid ' (2007 ) 4641 Lecture Notes in Computer Science : 447 -456 .
Carstea A., Macariu G. Towards a grid enabled symbolic computation architecture, Pollack Periodica , Akademiai Kiado, Vol. 3, No. 2, 2008, pp. 15–26.
Macariu G. , 'Towards a grid enabled symbolic computation architecture ' (2008 ) 3 Pollack Periodica, Akademiai Kiado : 15 -26 .
OpenMath organization , http://www.openmath.org/
ActiveBPEL , http://www.activevos.com/community-open-source.php
Dong F., Akl S. G. Scheduling algorithms for grid computing: State of the art and open problems, Technical Report, Queen’s University , 2006.
Yu J., Buyya R. Workflow scheduling algorithms for grid computing, Technical Report , The University of Melbourne , 2007.
Sakellariou R., Zhao H. A hybrid heuristic for dag scheduling on heterogeneous systems, Proceedings of the 18th International Parallel and Distributed Processing Symposium , 26–30 April, 2004, pp. 111–123.
Shi Z., Dongarra J. J. Scheduling workflow applications on processors with different capabilities, Future Generation Computing Systems , Amsterdam, Elsevier, Vol. 22, No. 6, 2006, pp. 665–675.
Dongarra J. J. , 'Scheduling workflow applications on processors with different capabilities ' (2006 ) 22 Future Generation Computing Systems, Amsterdam, Elsevier : 665 -675 .
Zhao H., Sakellariou R. An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm, Lecture Notes in Computer Science , Springer-Verlag, Vol. 2790, 2003, pp. 189–194.
Sakellariou R. , 'An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm ' (2003 ) 2790 Lecture Notes in Computer Science : 189 -194 .
Smith W., Foster I. T., Taylor V. E. Predicting application run times using historical information, Lecture Notes in Computer Science , Springer-Verlag, Vol. 1459, 1998, pp. 122–142.
Taylor V. E. , 'Predicting application run times using historical information ' (1998 ) 1459 Lecture Notes in Computer Science : 122 -142 .
Lee C., Schartzman Y., Hardy J., Snavely A. Are user runtime estimates inherently inaccurate? Lecture Notes in Computer Science , Springer-Verlag, Vol. 3277, 2005, pp. 253–263.
Snavely A. , 'Are user runtime estimates inherently inaccurate? ' (2005 ) 3277 Lecture Notes in Computer Science : 253 -263 .
Mu’alem A. W., Feitelson D. G. Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling, IEEE Transactions in Parallel Distributed Systems , Vol. 12, No. 6, 2001, pp. 529–543.
Feitelson D. G. , 'Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling ' (2001 ) 12 IEEE Transactions in Parallel Distributed Systems : 529 -543 .
Srinivasan S., Kettimuthu R., Subramani V., Sadayappan P. Characterization of backfilling strategies for parallel job scheduling, Proceedings of the 2002 International Conference on Parallel Processing Workshops , 2002, pp. 514–519.
Chiang S., Arpaci-Dusseau A. C., Vernon M. K. The impact of more accurate requested runtimes on production job scheduling performance, Lecture Notes in Computer Science , Springer-Verlag, Vol. 2537, 2002, pp. 103–127.
Vernon M. K. , 'The impact of more accurate requested runtimes on production job scheduling performance ' (2002 ) 2537 Lecture Notes in Computer Science : 103 -127 .
Arora M., Das S. K., Biswas R. A decentralized scheduling and load balancing algorithm for heterogeneous grid environments, Proceedings of International Conference on Parallel Processing Workshops (ICPPW’02) , 2002, pp. 499–505.
Sabin G., Kettimuthu R., Rajan A., Sadayappan P. Scheduling of parallel jobs in a heterogeneous multi-site environment, Lecture Notes in Computer Science , Springer-Verlag, Vol. 2862, 2003, pp. 87–104.
Sadayappan P. , 'Scheduling of parallel jobs in a heterogeneous multi-site environment ' (2003 ) 2862 Lecture Notes in Computer Science : 87 -104 .
Lawson B. G., Smirni E. Multiple-queue backfilling scheduling with priorities and reservations for parallel systems, Lecture Nodes in Computer Science , Springer-Verlag, Vol. 2537, 2002, pp. 72–87.
Smirni E. , 'Multiple-queue backfilling scheduling with priorities and reservations for parallel systems ' (2002 ) 2537 Lecture Nodes in Computer Science : 72 -87 .
Konovalov A., Linton S. Symbolic computation software composability protocol specification, CIRCA preprint 2007/5 , University of St Andrews, Retrieved November 2008 from http://www-circa.mcs.st-and.ac.uk/preprints.html , 2007