Journal of Computer Science and Technology

, Volume 18, Issue 4, pp 442–451 | Cite as

QoS guided Min-Min heuristic for grid task scheduling

  • XiaoShan He
  • Xianhe Sun
  • Gregor von Laszewski


Task scheduling is an integrated component of computing. With the emergence of Grid and ubiquitous computing, new challenges appear in task scheduling based on properties such as security, quality of service, and lack of central control within distributed administrative domains. A Grid task scheduling framework must be able to deal with these issues. One of the goals of Grid task scheduling is to achieve high system throughput while matching applications with the available computing resources. This matching of resources in a non-deterministically shared heterogeneous environment leads to concerns over Quality of Service (QoS). In this paper a novel QoS guided task scheduling algorithm for Grid computing is introduced. The proposed novel algorithm is based on a general adaptive scheduling heuristics that includes QoS guidance. The algorithm is evaluated within a simulated Grid environment. The experimental results show that the new QoS guided Min-Min heuristic can lead to significant performance gain for a variety of applications. The approach is compared with others based on the quality of the prediction formulated by inaccurate information.


task scheduling Grid computing quality of service (QoS) non-dedicated computing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Braun T D, Siegel H J, Beck Net al. A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems.IEEE Workshop on Advances in Parallel and Distributed Systems, West Lafayette, In, Oct., 1998, pp. 330–335.Google Scholar
  2. [2]
    Maheswaran M, Ali S, Siegel H Jet al. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. InThe 8th IEEE Heterogeneous Computing Workshop (HCW'99), San Juan, Puerto Rico, Apr., 1999, pp. 30–44.Google Scholar
  3. [3]
    Al-Saqabi K, Sarwar S, Saleh K. Distributed gang scheduling in networks of heterogeneous workstations.Computer Communications Journal, 1997, pp. 338–348.Google Scholar
  4. [4]
    Michael Litzkow, Miron Livny, Matt Mutka. Condor — A hunter of idle workstations. InProc. the 8th International Conference of Distributed Computing Systems, San Jose, CA, June, 1988, pp. 104–111.Google Scholar
  5. [5]
    Buyya R, Abramson D, Giddy J. Nimrod/G: An architecture of a resource management and scheduling system in a global computational Grid.High Performance Computing Asia 2000, Beijing, China, May 14–17, 2000, pp. 283–289.Google Scholar
  6. [6]
    Papadimitriou C. Complexity Theory. Addison Wesley, Reading, MA, 1994.Google Scholar
  7. [7]
    Xian-He Sun, Wu Ming. GHS: A performance prediction and task scheduling system for Grid computing. InProc. 2003 IEEE International Parallel and Distributed Processing Symposium, Nice, France, April, 2003.Google Scholar
  8. [8]
    Eric B Baum, Warren D Smith. Propagating distributions up directed acyclic graphs.Neural Computation, 1999, 11(1): 215–227.CrossRefGoogle Scholar
  9. [9]
    Henri Casanova, Arnaud Legrand, Dmitrii Zagorodnov, Francine Berman. Heuristics for scheduling parameter sweep applications in grid environments. InProc. the 9th Hetergeneous Computing Workshop (HCW'2000), Cancun, Mexico, 2000, pp. 349–363.Google Scholar
  10. [10]
    Rich Wolski, Neil Spring, Jim Hayes. The network weather service: A distributed resource performance forecasting service for metacomputing.Journal of Future Generation Computing Systems, October, 1999, 15(5–6): 757–768.CrossRefGoogle Scholar
  11. [11]
    Gong L, Sun X H, Waston E. Performance modeling and prediction of non-dedicated network computing.IEEE Trans. Computer, September, 2002, 51(9): 1041–1055.CrossRefGoogle Scholar
  12. [12]
    Foster I, Roy A, Sander V. A quality of service architecture that combines resources reservation and application adaptation. InProc. the 8th Int. Workshop on Quality of Service, Pittsburgh, PA, USA, June 5–7, 2000, pp. 181–188.Google Scholar
  13. [13]
    Diot C, Seneviratne A. Quality of service in heterogeneous distributed systems. InProc. the 30th Hawaii International Conference on System Sciences HICSS30, Hawaii, January, 1997, pp. 238–247.Google Scholar
  14. [14]
    Gilbert C Sih, Edward A Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures.IEEE Trans. Parallel and Distributed Systems, Feb., 1993, 4: 175–187.CrossRefGoogle Scholar
  15. [15]
    Czajkowski K, Foster I, Karonis Net al. A resource management architecture for metacomputing systems. InProc. IPPS/SPDP'98 Workshop on Job Scheduling Strategies for Parallel Processing, 1998, pp. 62–82.Google Scholar
  16. [16]
    Steve Chapin, Dimitrios, Katramatos, John Karpovich, Andrew Grimshaw. The legion resource management system. InProc. the 5th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'99), in Conjunction with the International Parallel and Distributed Processing Symposium (IPDPS'99), Germany, April 1999, pp. 162–178.Google Scholar
  17. [17]
    David Fernández-Baca. Allocating modules to processors in a distributed system.IEEE Trans. Software Engineering, November, 1989, 15(11): 1427–1436.Google Scholar
  18. [18]
    Henri Casanova, Graziano Obertelli, Francine Berman, Rich Wolski. The AppLeS parameter sweep template: User-level middleware for the grid. InProc. the Super Computing Conference (SC'2000), Nov. 2000.Google Scholar
  19. [19]
    Freund R F, Gherrity M, Ambrosius Set al. Scheduling resources in multi-user, heterogenous, computing environments with SmartNet. InThe 7th IEEE Heterogeneous Computing Workshop (HCW'98), Orlando, Florida, USA, Mar. 1998, pp. 184–199.Google Scholar
  20. [20]
    Buyya R, Murshed M, Abramson D. A deadline and budget constrained cost-time optimization algorithm for scheduling task farming applications on global Grids. InThe 2002 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02), Las Vegas, Nevada, USA, June 2002.Google Scholar
  21. [21]
    Rajesh Raman, Miron Livny, Marvin Solomon. Match-making: Distributed resource management for high throughput computing. InProc. the Seventh IEEE International Symposium on High Performance Distributed Computing, Chicago, IL, July 28–31, 1998, pp. 140–146.Google Scholar
  22. [22]
    Pinedo M. Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs, NJ, 1995.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2003

Authors and Affiliations

  • XiaoShan He
    • 1
  • Xianhe Sun
    • 1
  • Gregor von Laszewski
    • 2
  1. 1.Department of Computer ScienceIllinois Institute of TechnologyUSA
  2. 2.Mathematics and Computer Science DivisionArgonne National LaboratoryUSA

Personalised recommendations