Abstract
A heterogeneous network is a connected network of different platforms and operating systems. Job scheduling is a problem of selecting a free resource for unexecuted task from a pool of submitted tasks. Furthermore, it is required to find for every resource the best order of the tasks assigned to it. The purpose of this paper is to develop an efficient algorithm for job scheduling in heterogeneous networks. The algorithm should include parameters such as properties of resources and properties of jobs. The algorithm includes a cost function that is required to be optimized which includes parameters such as the total processing time, average waiting time. Our results demonstrate that the proposed algoritghm can be efficiently used to determine the performance of different job scheduling algorithms under different sets of loads.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Lu , Y. Zomaya, “A Hybrid Policy for Job Scheduling and Load Balancing in Heterogeneous Computational Grids,” Sixth International Symposium on Parallel and Distributed Computing (ISPDC’07), pp. 19–26, 2007.
L. Markov, “Two Stage Optimization of Job Scheduling and Assignment in Heterogeneous Compute Farms,” 10th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS’04), pp. 119–124, 2004
W. Homer, C. Lee, W. Chen, T. Lee, “A Job Schedule Model Based on Grid Environment,” First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS’07), pp. 43–49, 2007.
S. Fitzgerald, I. Foster, C. Kesselman, V. Laszewski, G. Smith, and S. Tuecke, “A Directory Service for Configuring High-Performance Distributed Computations,” Proc of 6th IEEE Symp. on High-Performance Computing, 1997, pp.365– 375, 1997.
J. Frey, T. Tannenbaum, I. Foster, M. Livny, and S. Tuecke,”A Computation Management Agent for Multi-Institutional Gridsm” Proc. 10th IEEE Symp. on High-Performance Computing, San Francisco, CA, USA, 2001
R. Buyya, J. Abramson, and J. Giddy, J. Nimrod, “ Architecture for a Resource Management and Scheduling System in a Global Computational Grid,” 4th IEEE Conf. on High-Performance Computing in the Asia-Pacific Region, China, 2000
H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, “Heuristics for Scheduling Parameter Sweep Applications in Grid Environments,” Proceedings of the 9th Heterogeneous Computing workshop (HCW’2000), pp349–363, 2000.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Elleithy, A., Rizvi, S.S., Elleithy, K.M. (2010). Optimization and Job Scheduling in Heterogeneous Networks. In: Sobh, T., Elleithy, K., Mahmood, A. (eds) Novel Algorithms and Techniques in Telecommunications and Networking. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3662-9_44
Download citation
DOI: https://doi.org/10.1007/978-90-481-3662-9_44
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3661-2
Online ISBN: 978-90-481-3662-9
eBook Packages: EngineeringEngineering (R0)