Advertisement

A novel resource co-allocation model with constraints to budget and deadline in computational grid

  • Zhi-gang Hu (胡志刚)Email author
  • Peng Xiao (肖 鹏)
Article
  • 29 Downloads

Abstract

To address the issue of resource co-allocation with constraints to budget and deadline in grid environments, a novel co-allocation model based on virtual resource agent was proposed. The model optimized resources deployment and price scheme through a three-side co-allocation mechanism, and applied queuing system to model the work of grid resources for providing quantitative deadline guarantees for grid applications. The validity and solutions of the model were presented theoretically. Extensive simulations were conducted to examine the effectiveness and the performance of the model by comparing with other co-allocation policies in terms of deadline violation rate, resource benefit and resource utilization. Experimental results show that compared with the three typical co-allocation policies, the proposed model can reduce the deadline violation rate to about 3.5% for the grid applications with constraints to budget and deadline. Also, the system benefits can be increased by about 30% compared with the those widely-used co-allocation policies.

Key words

co-allocation computational grid grid economy queuing theory deadline 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    FOSTER I, KESSELMAN C. The grid: Blueprint for a new computing infrastructure [M]. Singapore: Elsevier Inc, 2004.Google Scholar
  2. [2]
    CZAJKOWSKI K, FOSTER I, KESSELMAN C. Resource coallocation in computational grids [C]// Proceedings of Inter Symp on High Performance Distributed Computing. California: IEEE Computer Society Press, 1999: 219–228.Google Scholar
  3. [3]
    LEWIS M J, FERRARI A J, HUMPHREY M A. Support for extensibility and site autonomy in the legion grid system object model [J]. Journal of Parallel and Distributed Computing, 2003, 63(5): 525–538.CrossRefGoogle Scholar
  4. [4]
    WOLSKI R, BREVIK J, OBERTELLI G, SPRING N. Writing programs that run EveryWare on the computational grid [J]. IEEE Trans on Parallel and Distributed Systems, 2001, 12(10): 1066–1080.CrossRefGoogle Scholar
  5. [5]
    LEINBERGER W, KARYPIS G, KUMAR V. Job scheduling in the presence of multiple resource requirements [C]// Proceedings of ACM/IEEE Conf on Supercomputing. Portland: IEEE Computer Society Press, 1999.Google Scholar
  6. [6]
    MOHAMED H H, EPEMA D H J. An evaluation of the close-to-files processor and data co-allocation policy in multiclusters [C]// Proceedings of Inter Conf on Cluster Computing. San Diego: IEEE Computer Society Press, 2004: 287–298.Google Scholar
  7. [7]
    HE L G, JARVIS S A, SPOONER D P. Allocating non-real-time and soft real-time jobs in multiclusters [J]. IEEE Trans on Parallel and Distributed Systems, 2006, 17(2): 99–112.CrossRefGoogle Scholar
  8. [8]
    BUCUR A I D, EPEMA D H J. Scheduling policies for processor co-allocation in multicluster system [J]. IEEE Trans on Parallel and Distributed Systems, 2007, 18(7): 958–962.CrossRefGoogle Scholar
  9. [9]
    BUCUR A I D, EPEMA D H J. The performance of processor co-allocation in multicluster systems [C]// Proceedings of IEEE/ACM Inter Symp on Cluster Computing and the Grid. Tokyo: IEEE Computer Society Press, 2003: 302–309.Google Scholar
  10. [10]
    BAL H, BHOEDJANG R R, HOFMAN R. The distributed ASCI supercomputer project [J]. ACM Operating Systems Review, 2000, 34(4): 76–96.CrossRefGoogle Scholar
  11. [11]
    BUYYA R, ABRAMSON D, VENUGOPAL S. The grid economy [J]. Proceeding of the IEEE, 2005, 93(3): 698–714.CrossRefGoogle Scholar
  12. [12]
    WALDSPURGER C A, HOGG T, HUBERMAN B A, et al. Spawn: A distributed computational economy [J]. IEEE Trans on Software Engineering, 1992, 18(2): 103–117.CrossRefGoogle Scholar
  13. [13]
    NISAN N, LONDON S, REGEV O. Globally distributed computation over the internet: The POPCORN project [C]// Proceedings of Inter Conf on Distributed Computing Systems, Amsterdam: IEEE Computer Society Press, 1998: 592–601.Google Scholar
  14. [14]
    ABRAMSON D, GIDDY J, FOSTER I. High performance parametric modeling with nimrod/G: killer application for the global grid? [C]// Proceedings of Inter Symp on Parallel and Distributed Processing. Chicago: IEEE Computer Society Press, 2000.Google Scholar
  15. [15]
    BUYYA R. Economic-based distributed resource management and scheduling for grid computing [D]. Melbourne: Monash University, 2002.zbMATHGoogle Scholar
  16. [16]
    KWOK Y K, HWANG K, SONG S. Selfish grids: Game-theoretic modeling and NAS/PSA benchmark evaluation [J]. IEEE Trans on Parallel and Distributed Systems, 2007, 18(5): 621–636.CrossRefGoogle Scholar
  17. [17]
    RZADCA K, TRYSTRAM D, WIERZBICKI A. Fair game-theoretic resource management in dedicated grids [C]// Proceedings of Inter Symp on Cluster Computing and the Grid. Rio de Janeiro: IEEE Computer Society Press, 2007: 343–350.Google Scholar
  18. [18]
    KHAN S U, AHMAD I. Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation [C]// Proceedings of Inter Symp on Parallel and Distributed Processing. Rhodes Island: IEEE Computer Society Press, 2006.Google Scholar
  19. [19]
    OSBORNE M, RUBINSTEIN A. A course in game theory [M]. Cambridge: Massachusetts Institution of Technology Press, 1994.zbMATHGoogle Scholar
  20. [20]
    MOHAMED H H, EPEMA D H J. Experiences with the KOALA co-allocating scheduler in multiclusters [C]// Proceedings of Inter Symp on Cluster Computing and the Grid. Cardiff: IEEE Computer Society Press, 2005: 784–791.Google Scholar
  21. [21]
    GROSS D, HARRIS C M. Fundamentals of queuing theory [M]. 3rd ed. New Jersey: John Wiley and Sons Inc, 1998.zbMATHGoogle Scholar
  22. [22]
    BUYYA R, MURSHED M. GridSim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing [J]. Concurrency and Computation: Practice and Experience, 2002, 14: 1175–1220.CrossRefGoogle Scholar
  23. [23]
    LUBLIN U, FEITELSON D G. The workload on parallel supercomputers: Modeling the characteristics of rigid jobs [J]. Journal of Parallel and Distributed Computing, 2003, 63(11):1105–1122.CrossRefGoogle Scholar
  24. [24]
    DUMITRESCU C L, RAICU I, FOSTER I. The design, usage, and performance of GRUBER: A grid usage service level agreement based brokering infrastructure [J]. Journal of Grid Computing, 2007, 5(1): 99–126.CrossRefGoogle Scholar
  25. [25]
    BERTEN V, GOOSSENS J, JEANNOT E. On the distribution of sequential jobs in random brokering for heterogeneous computational grids [J]. IEEE Trans on Parallel and Distributed Systems, 2006, 17(2): 113–124.CrossRefGoogle Scholar

Copyright information

© Central South University Press and Springer-Verlag GmbH 2009

Authors and Affiliations

  1. 1.School of Information Science and EngineeringCentral South UniversityChangshaChina
  2. 2.School of SoftwareCentral South UniversityChangshaChina

Personalised recommendations