吉林大学学报(工学版) ›› 2012, Vol. 42 ›› Issue (01): 150-155.

• paper • Previous Articles     Next Articles

Relaxed reservation policy for parameter sweep applications in computational grid

XIAO Peng1,2, HU Zhi-gang2   

  1. 1. Department of Computer and Communication, Hu'nan Institute of Engineering, Xiangtan 411104, China;
    2. School of Information Science and Engineering, Central South University, Changsha 410083, China
  • Received:2010-04-23 Online:2012-01-01 Published:2012-01-01

Abstract:

To mitigate the negative effects brought in by advance reservation, a reservation admission model based on two dimensional relaxed strategy was proposed. The model allowed the acceptance of new reservation requests that overlap with existing ones under certain conditions in grid environment. Both the system benefit and risk of the proposed admission model were theoretically analyzed. Experiment results show that the relaxed reservation strategy can achieve higher resource utilization and lower rejection rate compared with conventional reservation policy and backfilling-based reservation mechanism. In addition, it also shows better self-adaptability to system dynamic reservation change.

Key words: computer application, grid computing, resource reservation, parameter sweep task, reservation violation, co-allocation

CLC Number: 

  • TP393


[1] Roy A, Sander V. Advance reservation API
[S]. GFD-E.5, Global Grid Forum, 2002.

[2] Foster I, Kesselman C. The Grid 2
[M]. San Francisco: Morgan Kaufmann, 2004.

[3] Smith W, Foster I, Taylor V. Scheduling with advanced reservations//Proceedings of International Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, 2000:127-132.

[4] Foster I, Roy A, Sander V. A quality of service architecture that combines resource reservation and application adaptation//Proceedings of International Workshop on QoS, IEEE Computer Society Press, 2000:181-188.

[5] Miyashita K, Masuda K, Higashitani F. Coordinated service allocation through flexible reservation
[J]. IEEE Transactions on Services Computing, 2008, 1(2):117-128.

[6] Castillo C, Rouskas G N, Harfoush K. Efficient resource management using advance reservations for heterogeneous grids//International Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, 2008.

[7] Sulistio A, Kim K H, Buyya R. Managing cancellations and no-shows of reservations with overbooking to increase resource revenue//Proceedings of International Symposium on Cluster Computing and the Grid, IEEE Computer Society Press, 2008:267-276.

[8] Tsafrir D, Etsion Y, Feitelson D G. Backfilling using system-generated predictions rather than user runtime estimates
[J]. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(6):789-803.

[9] Cao J W, Zimmermann F. Queue scheduling and advance reservations with COSY//Proceedings of International Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, 2004.

[10] 胡春明, 怀进鹏, 沃天宇. 一种基于松弛时间的服务网格资源能力预留机制
[J]. 计算机研究与发展, 2007, 44(1):20-28. Hu Chun-ming, Huai Jin-peng, Wo Tian-yu. Flexible resource capacity reservation mechanism for service grid using slack time
[J]. Journal of Computer Research and Development, 2007, 44(1):20-28.

[11] Rajah K, Ranka S, Xia Y. Advance reservations and scheduling for bulk transfers in research networks
[J]. IEEE Transactions on Parallel and Distributed Systems, 2009, 20(11):1682-1697.

[12] Kaushik N R, Figueira S M, Chiappari S A. Flexible time-windows for advance reservation scheduling//Proceedings of International Symposium on Modeling, Analysis, and Simulation of Computer and Tele Systems, IEEE Computer Society Press, 2006:218-225.

[13] Wu L, Wu C, Cui J, et al. An adaptive advance reservation mechanism for grid computing// Proceedings of International Conference on Parallel and Distributed Computing, Applications and Technologies, IEEE Computer Society Press, 2005:400-403.

[14] Zhao J F, Huang T L, Pang F, et al. Genetic algorithm based on greedy strategy in the 0-1 knapsack problem//International Conference on Genetic and Evolutionary Computing, IEEE Computer Society Press, 2009:105-107.

[15] 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.

[1] LIU Fu,ZONG Yu-xuan,KANG Bing,ZHANG Yi-meng,LIN Cai-xia,ZHAO Hong-wei. Dorsal hand vein recognition system based on optimized texture features [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1844-1850.
[2] WANG Li-min,LIU Yang,SUN Ming-hui,LI Mei-hui. Ensemble of unrestricted K-dependence Bayesian classifiers based on Markov blanket [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1851-1858.
[3] JIN Shun-fu,WANG Bao-shuai,HAO Shan-shan,JIA Xiao-guang,HUO Zhan-qiang. Synchronous sleeping based energy saving strategy of reservation virtual machines in cloud data centers and its performance research [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1859-1866.
[4] ZHAO Dong,SUN Ming-yu,ZHU Jin-long,YU Fan-hua,LIU Guang-jie,CHEN Hui-ling. Improved moth-flame optimization method based on combination of particle swarm optimization and simplex method [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1867-1872.
[5] LIU En-ze,WU Wen-fu. Agricultural surface multiple feature decision fusion disease judgment algorithm based on machine vision [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(6): 1873-1878.
[6] OUYANG Dan-tong, FAN Qi. Clause-level context-aware open information extraction [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1563-1570.
[7] LIU Fu, LAN Xu-teng, HOU Tao, KANG Bing, LIU Yun, LIN Cai-xia. Metagenomic clustering method based on k-mer frequency optimization [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1593-1599.
[8] GUI Chun, HUANG Wang-xing. Network clustering method based on improved label propagation algorithm [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1600-1605.
[9] LIU Yuan-ning, LIU Shuai, ZHU Xiao-dong, CHEN Yi-hao, ZHENG Shao-ge, SHEN Chun-zhuang. LOG operator and adaptive optimization Gabor filtering for iris recognition [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1606-1613.
[10] CHE Xiang-jiu, WANG Li, GUO Xiao-xin. Improved boundary detection based on multi-scale cues fusion [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1621-1628.
[11] ZHAO Hong-wei, LIU Yu-qi, DONG Li-yan, WANG Yu, LIU Pei. Dynamic route optimization algorithm based on hybrid in ITS [J]. 吉林大学学报(工学版), 2018, 48(4): 1214-1223.
[12] HUANG Hui, FENG Xi-an, WEI Yan, XU Chi, CHEN Hui-ling. An intelligent system based on enhanced kernel extreme learning machine for choosing the second major [J]. 吉林大学学报(工学版), 2018, 48(4): 1224-1230.
[13] FU Wen-bo, ZHANG Jie, CHEN Yong-le. Network topology discovery algorithm against routing spoofing attack in Internet of things [J]. 吉林大学学报(工学版), 2018, 48(4): 1231-1236.
[14] CAO Jie, SU Zhe, LI Xiao-xu. Image annotation method based on Corr-LDA model [J]. 吉林大学学报(工学版), 2018, 48(4): 1237-1243.
[15] HOU Yong-hong, WANG Li-wei, XING Jia-ming. HTTP-based dynamic adaptive streaming video transmission algorithm [J]. 吉林大学学报(工学版), 2018, 48(4): 1244-1253.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!