GRID Scheduling

Papers

• Genetic Algorithm Based Scheduler for Computational Grids
  Aggarwal, Mona; Kent, Robert, D; Ngom, Alioune
  Proceedings of the 19th International Symposium on High Performance Computing Systems and Application (HPCS 2005) pp. 209--215
   

• An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling 
  Annie S. Wu, Han Yu, Shiyuan Jin, Kuo-Chi Lin, and Guy Schiavone
  http://www.cs.ucf.edu/~ecl/papers/0403.ieee.pds.pdf 
   

• A Genetic Algorithm for Multiprocessor Scheduling 
   

• Probabilistic Job Scheduling for Distributed Real-time Applications (1993)
  Azer Bestavros and Dimitrios Spartiotis
   

Grid Scheduling

• [ANDRI'04] A. Andrieux, D. Berry, J. Garibaldi, S. Jarvis, J. MacLaren, D. Ouelhadj, D. Snelling, "Open Issues in Grid Scheduling", National e-Science Centre and the Inter-disciplinary Scheduling Network technical paper UKeS-2004-03, 2004.
   

• [FUJIM'04] N. Fujimoto and K. Hagihara, "A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks'', SAINT 2004 Workshop on High Performance Grid Computing and Networking, IEEE Press, pp.674-680, Tokyo, Japan, January 26-30, 2004.
   

• [KRAUT'02] K. Krauter, R. Buyya, and M. Maheswaran, A Taxonomy and Survey of Grid Resource Management Systems, Software Practice and Experiance, Vol. 32, No. 2, Feb. 2002, pp. 135-164.
   

• [SPOON'03] D. P. Spooner, S. A. Jarvis, J. Cao, S. Saini, G. R. Nudd., "Local Grid Scheduling Techniques using Performance Prediction", IEE Proc. Comp. Digit. Tech., 150(2):87-96, 2003.
   

Classical Job Scheduling Techniques

(Backfilling & other queue based techniques, Gang scheduling, etc.)

• [AIDA’98] K. Aida, H. Kasahara, and S. Narita, Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs, in Job Scheduling Strategies for Parallel Processing, vol. 1291, Lecture Notes in Computer Science, D. G. Feitelson and L. Rudolph, Eds.: Springer-Verlag, 1998.
   

• [AIDA’00] K. Aida., Effect of Job Size Characteristics on Job Scheduling Performance. In Workshop on Job Scheduling Strategies for Parallel Processing, pages 1–17, 2000.
   

• A Comparative Study of Online Scheduling Algorithms for Networks of Workstations
  O. Arndt, B. Freisleben, T. Kielmann, and F. Thilo.
  Cluster Computing, 3(2):95–112, 2000.
  http://citeseer.ist.psu.edu/cache/papers/cs/13180/http:zSzzSzwww.cs.vu.nlzSz~kielmannzSzpaperszSzcc99.pdf/arndt98comparative.pdf
   

• Taxonomy of Scheduling in General-Purpose, Distributed Computing Systems
  Casavant, Thomas, and Kuhl.
  IEEE Transactions on Software Engineering, Vol. 14, No. 2, pp. 141-154, February 1988.
  http://www.cs.umanitoba.ca/~maheswar/anc2002/PAPERS/CaK88.pdf
   

• [CHIAN 02] S. H. Chiang, A. Arpaci-Dusseau, and M. K. Vernon, The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance. In Job Scheduling Strategies for Parallel Processing, pp. 103-127, Springer-Verlag, 2002. Lect. Notes Comput. Sci. Vol. 2537.
   

• [CIRNE’01] W. Cirne and F. Berman., A Comprehensive Model of the Supercomputer Workload., Proceedings of IEEE 4th Annual Workshop on Job Scheduling Strategies for Parallel Processing. Cambridge, MA. 2001.
   

• [CIRNE’02] W. Cirne and F. Berman, Using Moldability to Improve the Performance of Supercomputer Jobs,, Journal of Parallel and Distributed Computing, vol. 62, no. 10, pages 1571-1601, October 2002
   

• [FEITE’94] D. G. Feitelson, (1994). Job scheduling in multiprogrammed parallel systems. Technical report, IBM Research Report RC.
   

• [FEITE’95] D. G. Feitelson and L. Rudolph., Parallel job scheduling: Issues and approaches., In D.G. Feitelson and L. Rudolph, editors, IPPS ’95 Workshop: Job Scheduling Strategies for Parallel Processing, volume 949, pages 1–18. Springer-Verlag, New York, 1995. Lect. Notes in Computer Science.

• [FEITE’96] D. G. Feitelson and L. Rudolph., Toward convergence in job schedulers for parallel supercomputers. In D.G. Feitelson and L. Rudolph, editors, IPPS ’95 Workshop: Job Scheduling Strategies for Parallel Processing, volume 1162, pages 1–26. Springer-Verlag, 1996. Lect. Notes in Computer Science.

• [FEITE’99] D. G. Feitelson and M. Naaman., Self-Tuning Systems., In IEEE Software 16(2), pages 52–60, April/May, 1999.

• [GIBBS’97] R.Gibbons., A Historical Application Profiler for Use by Parallel Schedulers. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291, pages 58-77. Springer-Verlag, 1997.

• [HOVES’03] M. Hovestadt, O. Kao, A. Keller, and A. Streit, Scheduling in HPC Resource Management Systems: Queuing vs. Planning'. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, (ed.), Springer Verlag, Lect. Notes Comput. Sci. vol. 2862. pp. 1-20, 2003.

• [JACKS’01] D. Jackson, Q. Snell, and M. J. Clement. Core algorithms of the maui scheduler. In JSSPP, pages 87–102, 2001.

•  

• [JACKS’01b] D. Jackson, Q. Snell, M. Clement, Core algorithms of the Maui scheduler. In Feitelson, D. G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 2221 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (2001) 87–102.
   

• [JONES 99] J. P. Jones and B. Nitzberg, Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization, In Job Scheduling Strategies for Parallel Processing, pp. 1-16, Springer-Verlag, 1999. Lect. Notes Comput. Sci. Vol. 1659.
   

• Randomization, Speculation, and Adaptation in Batch Schedulers [KELEH’00a]
  P. J. Keleher D. Perkovic.
  In Supercomputing, 2000.
   

• [KELEH’00b] P. J. Keleher, D. Zotkin, and D. Perkovic., Attacking the Bottlenecks of Backfilling Schedulers. Cluster Computing, 3(4):245–254, 2000.

• [KETTIM’02] R. Kettimuthu, V. Subramani, S. Srinivasan, T. B. Gopalsamy, D. K. Panda and P. Sadayappan, Selective Pre-emption Strategies for Parallel Job Scheduling, Proceedings of 2002 International Conference on Parallel Processing (ICPP 2002), August 2002

• [LAWSO’02a] B. Lawson and E. Smirni, “Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems”. In Job Scheduling Strategies for Parallel Processing, Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2537, pp. 72-87, 2002.

• [LAWSO’02b] B. Lawson, E. Smirni, and D. Puiu. Self-adapting Backfilling Scheduling for Parallel Systems. In Proceedings of the 2002 International Conference on Parallel Processing (ICPP 2002), pages 583-592, Vancouver, B.C., August 2002.

• [LI’91] K. Li and K. Cheng. A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System. J. Parallel and Distributed Computing, 12:79{83, 1991.

• [LIFKA’95] D. A. Lifka., The ANL/IBM SP Scheduling System. In D.G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295–303. Springer–Verlag, Lecture Notes in Computer Science LNCS 949, 1995.

• [MAJUM’88] S. Majumdar, D. L. Eager, and R. B. Bunt., Scheduling in multiprogrammed parallel systems. In Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems, pages 104-113. ACM Press. 1988.

• [MANSH’93a] R. K. Mansharamani and M. K. Vernon., Comparison of processor allocation policies for parallel systems. Technical report, Computer Sciences Department, University of Wisconsin, December 1993.

• [MANSH’93b] R. K. Mansharamani and M. K. Vernon., Properties of the eqs parallel processor allocation policy. Technical Report 1192, Computer Science Department, University of Wisconsin-Madison, November 1993.

• [MOREI’99] J. E. Moreira, H. Franke, W. Chan, L. L. Fong, M. A. Jette, and A. Yoo. A Gang-Scheduling System for ASCI Blue-Pacific. In High-Performance Computing and Networking, 7th International Conference, volume 1593 of Lecture Notes in Computer Science, pages 831–840. Springer-Verlag, April 1999.

• [MUALE’01] A. W. Mu’alem and D. G. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the ibm sp2 with backfilling. In IEEE Transactions on Parallel and Distributed Computing, volume 12, pages 529–543, 2001.

• [OUSTE’82] J. K. Ousterhout., Scheduling Techniques for Concurrent Systems. In 3rd International Conference on Distributed Computing Systems, pages 22–30, 1982.

• [PERKO’00] D. Perkovic and P. J. Keleher. Randomization, speculation, and adaptation in batch schedulers. Cluster Computing, 3(4):245–254, 2000.

• [SHMUE’03] E. Shmueli and D. G. Feitelson, Backfilling with Lookahead to Optimize the Performance of Parallel Job Scheduling, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, (ed.), Springer Verlag, Lect. Notes Comput. Sci. vol. 2862. pp. 228-251, 2003.

• [SILVA’99] F. Silva and I. D. Scherson, Towards Flexibility and Scalability in Parallel Job Scheduling 11th IASTED International Conference on Parallel and Distributed Computing and Systems, Boston, USA, November 1999.

• [SKOVI’96] J. Skovira, W. Chan, H. Zhou, and D. Lifka, The EASY – LoadLeveller API Project. In Workshop on on Job Scheduling Strategies for Parallel Processing, pages 41-47, 1996.

• [SNELL’02] Q. O. Snell, M. J. Clement, and D. B. Jackson, Pre-emption Based Backfill, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, (ed.), Springer Verlag, Lect. Notes Comput. Sci. vol. 2537. pp. 24-37, 2002.

• [SRINI 02] S. Srinivasan, R. Kettimuthu, V. Subramani and P. Sadayappan, Selective Reservation Strategies for Backfill Job Scheduling. In Job Scheduling Strategies for Parallel Processing, Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2537, pp. 55-71, 2002.

• [STREI’01] A. Streit, On job scheduling for hpc-clusters and the dynp scheduler. Lecture Notes in Computer Science, 2001, pages 2228.

• [SUBHL’96] J. Subhlok, T. Gross, and T Suzuoka. Impact of Job Mix on Optimizations for Space Sharing Scheduler. In Proc. of Supercomputing '96, 1996.
   

• [SUBRA’02] V. Subramani, R. Kettimuthu, S. Srinivasan, and P. Sadayappan., Distributed job scheduling on computational grids using multiple simultaneous requests. In Proceedings of the 11th High Performance Distributed Computing Conference, 2002. 
   

• [TALBY’99] D. Talby and D. G. Feitelson. Supporting Priorities and Improving Utilization of the IBM SP2 Scheduler Using Slack-Based Backfilling. TR 98-13, Hebrew University, Jerusalem, April 1999.
   

• [TRAVE’95] B. Traversat, A Dynamic-Backfilling Algorithm for Efficient Space-Sharing Scheduling on an IBM SP2, Bernard Traversat, NAS, NASA Ames Research Center, October 1995
   

• [WARD’02] W. A. Ward, Jr., C. L. Mahood and J. E. West, “Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy”. In Job Scheduling Strategies for Parallel Processing, Springer-Verlag, Lect. Notes Comput. Sci. Vol. 2537, pp. 88-102, 2002.
   

• [WEISSM’95] Weissman, Jon. Scheduling Parallel Computations in a Heterogeneous Environment. PhD thesis. University of Virginia, August 1995.
   

• [ZHANG’00] Y. Zhang, et al., Improving parallel job scheduling by combining gang scheduling and backfilling techniques, Proceedings of the 14th International Parallel & Distributed Processing Symposium, Cancun, Mexico, May 2000.
   

• [ZHANG’01] Y. Zhang, H. Franke, J. E. Moreira and A. Sivasubramaniam, An integrated approach to parallel scheduling using gang-scheduling, backfilling and migration, Proceedings of 7th Annual Workshop on Job Scheduling Strategies for Parallel Processing, Boston, June 2001, pp.109-127.