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

Fingerprint

Heterogeneous networks
scheduling
Scheduling
resources
Scheduling algorithms
Cost functions
Processing
costs
performance
time

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Cite this

Elleithy, A., Rizvi, S. S., & Elleithy, K. M. (2010). Optimization and job scheduling in heterogeneous networks. In Novel Algorithms and Techniques in Telecommunications and Networking (pp. 257-262). (Novel Algorithms and Techniques in Telecommunications and Networking). https://doi.org/10.1007/978-90-481-3662-9-44
Elleithy, Abdelrahman ; Rizvi, Syed S. ; Elleithy, Khaled M. / Optimization and job scheduling in heterogeneous networks. Novel Algorithms and Techniques in Telecommunications and Networking. 2010. pp. 257-262 (Novel Algorithms and Techniques in Telecommunications and Networking).
@inproceedings{87ce0bbd7d084114bc3ed1abfd866660,
title = "Optimization and job scheduling in heterogeneous networks",
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.",
author = "Abdelrahman Elleithy and Rizvi, {Syed S.} and Elleithy, {Khaled M.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-90-481-3662-9-44",
language = "English (US)",
isbn = "9789048136612",
series = "Novel Algorithms and Techniques in Telecommunications and Networking",
pages = "257--262",
booktitle = "Novel Algorithms and Techniques in Telecommunications and Networking",

}

Elleithy, A, Rizvi, SS & Elleithy, KM 2010, Optimization and job scheduling in heterogeneous networks. in Novel Algorithms and Techniques in Telecommunications and Networking. Novel Algorithms and Techniques in Telecommunications and Networking, pp. 257-262, 2008 International Conference on Telecommunications and Networking, TeNe 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008, 12/5/08. https://doi.org/10.1007/978-90-481-3662-9-44

Optimization and job scheduling in heterogeneous networks. / Elleithy, Abdelrahman; Rizvi, Syed S.; Elleithy, Khaled M.

Novel Algorithms and Techniques in Telecommunications and Networking. 2010. p. 257-262 (Novel Algorithms and Techniques in Telecommunications and Networking).

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

TY - GEN

T1 - Optimization and job scheduling in heterogeneous networks

AU - Elleithy, Abdelrahman

AU - Rizvi, Syed S.

AU - Elleithy, Khaled M.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84878965036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878965036&partnerID=8YFLogxK

U2 - 10.1007/978-90-481-3662-9-44

DO - 10.1007/978-90-481-3662-9-44

M3 - Conference contribution

AN - SCOPUS:84878965036

SN - 9789048136612

T3 - Novel Algorithms and Techniques in Telecommunications and Networking

SP - 257

EP - 262

BT - Novel Algorithms and Techniques in Telecommunications and Networking

ER -

Elleithy A, Rizvi SS, Elleithy KM. Optimization and job scheduling in heterogeneous networks. In Novel Algorithms and Techniques in Telecommunications and Networking. 2010. p. 257-262. (Novel Algorithms and Techniques in Telecommunications and Networking). https://doi.org/10.1007/978-90-481-3662-9-44