Optimization and job scheduling in heterogeneous networks

Abdelrahman Elleithy, Syed S. Rizvi, Khaled M. Elleithy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationNovel Algorithms and Techniques in Telecommunications and Networking
Pages257-262
Number of pages6
DOIs
StatePublished - Dec 1 2010
Event2008 International Conference on Telecommunications and Networking, TeNe 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008 -
Duration: Dec 5 2008Dec 13 2008

Publication series

NameNovel Algorithms and Techniques in Telecommunications and Networking

Other

Other2008 International Conference on Telecommunications and Networking, TeNe 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008
Period12/5/0812/13/08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Fingerprint Dive into the research topics of 'Optimization and job scheduling in heterogeneous networks'. Together they form a unique fingerprint.

Cite this