IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 5    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 5,May 2012
Expeditious Scheduling for Precedence Constraint Tasks in Grid
Full Text(PDF, )  PP.209-213  
Joshua Samuel Raj, Daphne.S and Dr. V. Vasudevan
Grid computing, Job scheduling, Resource Matching, Makespan
The tremendous potential of grid computing is efficient scheduling, to exploit the computationally intense problems. In the commonly used decentralized models, large scale scheduling implies time sequence constraints, which makes the models intractable. To resolve this constraint, disintegration and cyclic scheduling are often applied to such scheduling which is time consuming and introducing more complexities. The significance of this paper is marked by speed and efficiency that the task-resource mapping in such a non-deterministic computing environment leads to concerns over scheduling problem to minimize the expected makespan and delay in allocation of tasks thereby reduce the turnaround time for precedence-constraint tasks imposed by application tasks to identify suitable resources. Our rigorous performance evaluation shows that our variant Expeditious Matching algorithm generates schedules with smaller makespan and higher robustness compared with other existing approach gratuitous to the new enhancement.
[1] J Katia Leal., Eduardo Huedo., Ignacio M. Llorente.: tralized model for scheduling independent tasks in Federated Grids”. Future Generation Computer Systems 25 (8) (2009) 840–852.

[2] D. A. Reed.: “Grids, the TeraGrid, and Beyond puter 36 (1) (2003) 62–68.

[3] J. Nabrzyski., J. M. Schopf., J. Weglarz.: “ agement: State of the Art and Future Trends demic Publishers, 2003.

[4] J. Breckling., T. D. Braun., H. J. Siegel., N. Beck., L. Bolo M.Maheswaran., A. I. Reuther., J. P. Robert B. Yao.:“A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing sy tems. In Reliable Distributed Systems”, 1998. Proceedings. S venteenth IEEE Symposium on, pages 330– IN, 1998.

[5] G. Q. Liu., K. L. Poh., M. Xie.: “Iterative list scheduling for heterogeneous computing”. J. Parallel Distrib. Comput., 65(5):654–665, 2005.

[6] H. Topcuoglu., S. Hariri., M. Wu.: “Performance-Effective and Low- Complexity Task Scheduling for Heterogeneous Computing”. IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 260–274, March 2002

[7] Y. K. Kwok., I. Ahmad.: “Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors”. IEEE Trans. Parallel Distrib. Syst., 7(5):506–521, 1996.

[8] G. C. Sih., E.A.Lee.: “A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures”. IEEE Trans. Parallel Distrib. Syst., 4(2):175–187, 1993.

[9] Radulescu., A. J. C. Van Gemund.: “Fast and effective task scheduling in heterogeneous systems”. In HCW ’00: Proceedings of the 9th Heterogeneous Computing Workshop, page 229, Washington, DC, USA, 2000. IEEE Computer Society.

[10] D. Saha., D. Menasce., S. Porto, et al., “Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures”, Journal of Parallel and Distributed Computing 28 (1) (1995) 1–18.

[11] D. Silva., W. Cirne., F. Brasileiro.: “Trading cycle for information: using replication to scheduling bag of tasks application on computational grids”, in: Proceeding in Ruro-Par, August 2003.

[12] S. Wang., I. Hsu., Z. Huang.: “Dynamic scheduling method for computational grid environments”, in: Proceedings of the International Conference on Parallel and Distributed Systems, July 2005, pp. 22–28.

[13] Matei Ripeanu.: “Peer-to-peer architecture case study: Gnutella network”, in: Proceedings First International Conference on Peer-to-Peer Computing, August 2001, pp. 99–100.

[14] M. Maheswaran., S. Ali., H. Siegel., D. Hensgen,, Richard F. Freund.: “Dynamic mapping of a class of independent tasks onto heterogeneous computing systems”, Journal of Parallel and Distributed Computing 59 (1999) 107–131.

[15] X. Tang., K. Li., G. Liao., R. Li.: “A stochastic scheduling algorithm for precedence constrained tasks on Grid”. J.future generation computer sys. 2011.04.007.

[16] Ruay-Shiung Chang., Chun-Fu Lin., Jen-Jom Chen.: “Selecting the most fitting resource for task execution”. Future Generation Computer Systems., 27 (2011) 227–231

[17] Anthony Sulistio., Uros Cibej., Srikumar Venugopal., Borut Robic., Rajkumar Buyya.: “A Toolkit for Modelling and Simulating Data Grids: An Extension to GridSim, Concurrency and Computation: Practice and Experience (CCPE)”, Wiley Press, New York, USA, Sep.2008.

Untitled Page