Relaxed Parallel Scheduling Algorithms Investigation of Support Resource Reservation from Grid

Jun Chen; Bo Li; Er Fei Wang

doi:10.4028/www.scientific.net/AMM.182-183.1849

Paper Titles

A Real-Time Sea-Sky-Line Detection Method under Complicated Sea-Sky Background
p.1826

A Image Enhancement Algorithm Combined Wavelet Transform with Image Fusion
p.1832

Color Image Encryption Based on the Multiple-Order Discrete Fractional Cosine Transform and Chaos in YCbCr Space
p.1839

Histogram Equalization Based on Rough Set
p.1844

Relaxed Parallel Scheduling Algorithms Investigation of Support Resource Reservation from Grid
p.1849

Iterated Hybrid Localization Algorithm for Random Wireless Sensor Networks Based on Centroid and DV-Hop Algorithm
p.1854

Application of Different Algorithms to Predict the Faults and Fractures in Carbonate Formation
p.1858

Moving Object Detection Based on Edge Difference and Contour Matching
p.1863

A Region-Based Image Matching Combining Global and Local Features
p.1868

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 182-183Relaxed Parallel Scheduling Algorithms...

Relaxed Parallel Scheduling Algorithms Investigation of Support Resource Reservation from Grid

Abstract:

In this paper, the grid computing environment resource reservation problem of using the parallel machine, proposed the relaxed time parallel scheduling models and algorithms support resource reservation. The simulation results of FCFS and EASY backfill algorithms in resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. Show that the relaxation mechanism, the average waiting time and the average bounded slowdown factor of non-reserved jobs down. EASY backfill algorithm which guarantees AR jobs quality of service at the same time, the better the performance improvement of non-AR jobs.

You might also be interested in these eBooks

Applied Mechanics and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 182-183)

Pages:

1849-1853

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.182-183.1849

Citation:

Cite this paper

Online since:

June 2012

Authors:

Jun Chen, Bo Li, Er Fei Wang

Keywords:

Grid Computing, Relaxed Time, Resource Reservation, Scheduling Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Foster I, Kesselman C, Tuecke S. The Anatomy of the Grid: Enabling Scalable Virtual Organizations[J]. Int'1 J. High-performance Computing Application, 2001, 15(3): 200~222.

DOI: 10.1177/109434200101500302

Google Scholar

[2] Foster I, Roy A, Sander V. A Quality of Service Architecture that Combines Resource Reservation and Adaptation[A]. In: Proc. of the 8th Intl. Workshop on Quality of Service (I-WQOS)[C]. Pittsburgh, PA. 2000. 181~188.

DOI: 10.1109/iwqos.2000.847954

Google Scholar

[3] Sulistio A, R B. A Grid Simulation Infrastructure Supporting Advance Reservation [J]. Proceedings of the 16th International Conference on Parallel and Distributed Computing and Systems, MIT, Cambridge, USA, 2004, 1-7.

Google Scholar

[4] Kwang Mong Sim and Ka Fung Ng, A Relaxed-Criteria Bargaining Protocol for Grid Resource Management, Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops (CCGRIDW'06)0-7695-2585-7/06 $20. 00 © 2006 IEEE.

DOI: 10.1109/ccgrid.2006.1630900

Google Scholar

[5] KWANG MONG SIM, Kowloon Tong, Relaxed-criteria G-negotiation for Grid Resource Co-allocation (Position Paper), ACM SIGecom Exchanges, Vol. 6, No. 2, December 2006, Pages 37–46.

DOI: 10.1145/1228621.1228625

Google Scholar

[6] William A. Ward, Jr., Carrie L. Mahood, and John E. West, Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy, D.G. Feitelson et al. (Eds. ): JSSPP 2002, LNCS 2537, p.88–102, 2002. Springer-Verlag Berlin Heidelberg (2002).

DOI: 10.1007/3-540-36180-4_6

Google Scholar