It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

Hybrid-Policy Co-allocation Model in Computational Grid | Xiao | Journal of Software
Journal of Software, Vol 7, No 2 (2012), 382-388, Feb 2012
doi:10.4304/jsw.7.2.382-388

Hybrid-Policy Co-allocation Model in Computational Grid

Peng Xiao, Zhigang Hu, Xilong Qu

Abstract


To address the issue of resource co-allocation with deadline constraint in grids, a novel approach is proposed to evaluate the deadline-guarantee of co-allocation schemes that obtained from conventional co-allocation policies. Based on this approach, a hybrid-policy co-allocation model is also proposed to address the issue of deadline-constrained resource co-allocation in grid environments. The proposed model combines multiple co-allocation policies and selects the one with optimal deadline-guarantee for scheduling. In this way, the hybrid-policy model combines the merits of different policies, and overcomes the shortcomings of those policies. Extensive simulations are conducted to verify the effectiveness and the performance of the proposed model in terms of deadline-miss rate. Experimental results show that it can provide co-allocation scheme with improved deadline-guarantee and lower down the deadline-miss rate for real-time applications.


Keywords


grid computing; resource co-allocation; deadline; quality of service

References


I Foster, C Kesselman. The Grid2: Blueprint for a New Computing Infrastructure. San Francisco: Morgan Kaufmann, 2004.

K Czajkowski, I Foster, C Kesselman. Resource Co-Allocation in Computational Grids. Proc of Int’l Symp on High Performance Distributed Computing (HPDC 1999), IEEE Computer Society Press, 1999:219-228.

I Foster, C Kesselman, et al. A Distributed Resource Management Architecture that Supports Advance Reservation and Co-Allocation. Proc of Int’l Workshop on Quality of Service, 1999:27-36.

M J Lewis, A J Ferrari, et al. Support for Extensibility and Site Autonomy in the Legion Grid System Object Model. Journal of Parallel and Distributed Computing, 2003, 63(5): 525-538.

R Wolski, J Brevik, G Obertelli, N Spring, A Su. Writing Programs that Run EveryWare on the Computational Grid. IEEE Transactions on Parallel and Distributed Systems, 2001, 12(10):1066-1080.

I Foster, C Kesselman. Globus: A Metacomputing Infrastructure Toolkit. Journal of Supercomputer Applications, 1997, 11(2):115-128.

W Leinberger, G Karypis, V Kumar. Job Scheduling in the presence of Multiple Resource Requirements. Proc of ACM/IEEE Conf on Supercomputing, IEEE Computer Society Press, 1999.

H H Mohamed, D H J Epema. An Evaluation of the Close-to-Files Processor and Data Co-Allocation Policy in Multiclusters. Proc. of Int’l Conf. on Cluster Computing, 2004:287-298.

L He, S A Jarvis, et al. Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(2): 99-112.

A I D Bucur, D H J Epema. Scheduling Policies for Processor Coallocation in Multicluster System. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(7):958-962.

A I D Bucur, D H J Epema. The Performance of Processor Co-Allocation in Multicluster Systems. Proc of IEEE/ACM Int’l Symp on Cluster Computing and the Grid, IEEE Computer Society Press, 2003:302-309.

A I D Bucur, D H J Epema. The Maximal Utilization of Processor Co-Allocation in Multicluster Systems. Proc. of Int’l Symp. on Parallel and Distributed Processing, 2003.

R Buyya. Economic-based Distributed Resource Management and Scheduling for Grid Computing. Australia: Monash University, 2002.

V Berten, J Goossens, E Jeannot. On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(2):113-124.

A Roy, V Sander. Advance Reservation API. GFD-E.5, Scheduling Working Group, Global Grid Forum, 2002.

A C Sodan, C Doshi, L Barsanti, D Taylor. Gang Scheduling and Adaptive Resource Allocation to Mitigate Advance Reservation Impact. Proc. of IEEE Int’l Symp. on Cluster Computing and the Grid, IEEE Computer Society, 2006.

M Wu, X H Sun, Y Chen. QoS Oriented Resource Reservation in Shared Environments. Proc. of Int’l Symp. on Cluster Computing and the Grid, 2006:601-608.

H E Bal et al. The Distributed ASCI Supercomputer Project. ACM Operating Systems Review, 2000, 34(4):76-96.

M Wu, X H Sun, Y Chen. QoS Oriented Resource Reservation in Shared Environments. Proc of Int’l Symp on Cluster Computing and the Grid. IEEE Computer Society Press, 2006:601-608.

D Gross, C M Harris. Fundamentals of Queuing Theory. USA: John Wiley and Sons, 1998.

C L Dumitrescu, I Raicu, I Foster. The Design, Usage, and Performance of GRUBER: A Grid Usage Service Level Agreement based Brokering Infrastructure. Journal of Grid Computing, 2007, 5(1):99-126.

H H Mohamed, D H J Epema. Experiences with the KOALA Co-Allocating Scheduler in Multiclusters. Proc of Int’l Symp on Cluster Computing and the Grid, IEEE Computer Society Press, 2005:784-791.

R Buyya, M Murshed. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing. Journal of Concurrency and Computation: Practice & Experience, 2002, 14:1175-1220.

U Lublin, D G Feitelson. The Workload on Parallel Supercomputers: Modeling the Characteristics of Rigid Jobs. Journal of Parallel and Distributed Computing, 2003, 63(11):1105-1122

H Casanova. Benefits and Drawbacks of Redundant Batch Requests [J]. Journal of Grid Computing, 2007, 5(2):235-250


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.