An Efficient Iterative Modulo Scheduling Approach for Improved Resource Allocation for Effective Multimedia Communication on Grid Computing Environment

(*) Corresponding author

Authors' affiliations

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


This paper discusses Iterative modulo scheduling techniques on heterogeneous resource for multimedia services to deal with the demands of next-generation multimedia applications on grid computing environment. The proposed scheduling algorithm has the subsequent features, which can be make use of on grid computing background. Initially the algorithm assistance with the resource practice constrained scheduling. The grid mainly consists of the resources that are possessed by decentralized society. Second, the algorithm performs the optimization-based scheduling. It gives an optimal solution to the grid resource allocation problem. Third, the algorithm takes for granted that a set of resources is dispersed geographically and varied in natural world. Fourth, the scheduling method dynamically adjusts to the grid status. It tracks the present workload of the various resources. The proposed algorithm performance is estimated with a set of predefined metrics. In addition to that the simulation results show the outperformance of the Iterative modulo scheduling algorithm.
Copyright © 2013 Praise Worthy Prize - All rights reserved.


Resource Allocation; Scheduling; Grid Computing; Mixed Ancestral Graph

Full Text:



Abramson D, Giddy J, Kotler L. High performance parametric modeling with Nimrod/G: Killer application for the Global Grid? Proceedings International Parallel and Distributed Processing Symposium (IPDPS 2000), Cancun, Mexico, 1–5 May 2000. IEEE Computer Society Press: Los Alamitos, CA, 2000.

Buyya R, Abramson D, Giddy J. A case for economy Grid architecture for service-oriented Grid computing. Proceedings of the International Parallel and Distributed Processing Symposium: 10th IEEE International Heterogeneous Computing Workshop (HCW 2001), 23 April 2001, San Francisco, CA. IEEE Computer Society Press: Los Alamitos, CA, 2001.

Fanxin Kong, Hongyan Hao, Jianmin Zuo, Classification and Dynamic Fuzzy Clustering of Mold Resources Based on Mold Manufacturing Grid Platform, (2012) International Review on Computers and Software (IRECOS), 7 (5), pp. 2447-2452.

Ferguson D, Nikolaou C, Sairamesh J, Yemini Y. Economic models for allocating resources in computer systems. Market- Based Control: A Paradigm for Distributed Resource Allocation. World Scientific Press: Singapore, 1996.

Chapin S, Karpovich J, Grimshaw A. The Legion resource management system. Proceedings of the 5th Workshop on Job Scheduling Strategies for Parallel Processing, San Juan, Puerto Rico, 16 April 1999. Springer: Berlin, 1999.

Litzkow M, Livny M, Mutka M. Condor—a hunter of idle workstations. Proceedings 8th International Conference of Distributed Computing Systems (ICDCS 1988), San Jose, CA, January 1988. IEEE Computer Society Press: Los Alamitos, CA, 1988.

Berman F, Wolski R. The AppLeS Project: A status report. Proceedings of the 8th NEC Research Symposium, Berlin,Germany, May 1997.

Casanova H, Dongarra J. NetSolve: A network server for solving computational science problems. International Journal of Supercomputing Applications and High Performance Computing 1997; 11(3):212–223.

Kapadia N, Fortes J. PUNCH: An architecture for Web-enabled wide-area network-computing. Cluster Computing:

The Journal of Networks, Software Tools and Applications 1999; 2(2):153–164.

S. Verboven, P. Hellinckx, F. Arickx, and J. Broeckhove, “Runtime prediction based grid scheduling of parameter sweep jobs,” J. Internet Technol., vol. 11, no. 1, pp. 47–53, 2010.

C.-H. Hsu and S.-C. Chen, “A two-level scheduling strategy for optimizing communications of data parallel programs in clusters,” Int. J. Ad Hoc Ubiquitous Comput., vol. 6, no. 4, pp. 263–269, 2010.

C.-H. Hsu and T.-L. Chen, “Performance and economization-oriented scheduling techniques for managing applications with QoS demands in grids,” Int. J. Ad Hoc Ubiquitous Comput., vol. 5, no. 4, pp. 219–226, 2010.

G. Q. Liu, K. L. Poh, and M. Xie, “Iterative list scheduling for heterogeneous computing,” J. Parallel Distrib. Comput., vol. 65, no. 5, pp. 654–665, 2005.

Y. K. Kwok and I. Ahmad, “Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors,” IEEE Trans. Parallel Distrib. Syst., vol. 7, no. 5, pp. 506–521, May 1996.

X. Qin and H. Jiang, “Reliability-driven scheduling for real-time tasks with precedence constraints in heterogeneous distributed systems,” in Proc. Parallel Distrib. Comput. Syst. Conf., Nov. 2000, pp. 617–623.

H. Zhao and R. Sakellariou, “An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm,” in Proc. Int. Conf. Euro-Par, LNCS 2790. 2003, pp. 189–194.

G. C. Sih and E. A. Lee, “Dynamic-level scheduling for heterogeneous processor networks,” in Proc. IEEE Int. Conf. Parallel Distrib. Syst.Process., Dec. 1990, pp. 42–49.

M. Kafil and I. Ahmad, “Optimal task assignment in heterogeneous distributed computing systems,” IEEE Concurrency, vol. 6, no. 3, pp. 42–50, Jul.–Sep. 1998.

Rau,B.R. Iterative Modulo scheduling HPL technical report Hewlett-Packard Laboratories,1994.

Rau B R and Glaeser C D some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. In proc Fourteenth annual workshop on microprogramming,(October 1981) 183-198.

Lam.M Software pipelining : an effective scheduling technique for VLIW machines. In proc ACM SIGPLAN ’91 conference on programming language design and implementation (june 1991) 219-228.

Hsu P.Y.T Highly concurrent scalar processing PhD thesis university of Illinois Urbana-Champaign 1986

Dehnert, J.C., and Towle,R.A Compiling for the Cydra 5. The Journal of Supercomputing 7,1/2(May 1993),181-228.

Hu.T.C Parallel sequencing and assembly line problems. Operations Research 9, 6 (1961), 841-848.

Ramamoorythy,C.V., Chandy,K.M and Gonzalez, M.J Optimal scheduling strategies in a multiprocessor system. IEEE transactions on computers C-21.2 (February 1972), 137-146.

B.Ramakrishna Rao, “iterative modulo scheduling: an algorithm for software pipelining loops” Hewlett-Packard Laboratories, 1501 Page Mill Road, Bldg.3L, Palo Alto, CA 94304.

Adam,T.L., Chandy,K.M and Dickson J.R A comparison of list schedules for parallel processing systems . Communication of the ACM 17, 12(December 1974) 685-690.

T. Guesmi, S. Hasnaoui, H. Rezig, Network Priority Mapping Using Dynamic RT-CORBA Scheduling Service, (2006) International Review on Computers and Software (IRECOS), 1 (2), pp. 124-131.

E. Ilavarasan, P. Thambidurai, Genetic Algorithm for Task Scheduling on Distributed Heterogeneous Computing System, (2006) International Review on Computers and Software (IRECOS), 1 (3), pp. 233-242.


  • There are currently no refbacks.

Please send any question about this web site to
Copyright © 2005-2024 Praise Worthy Prize