Optimization and Job Scheduling in Heterogeneous Networks

Loading...
Thumbnail Image

Authors

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

Issue Date

2010

Type

Article

Language

en_US

Keywords

Computer science , Networks , Algorithm , Job scheduling

Research Projects

Organizational Units

Journal Issue

Alternative Title

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.

Description

The final publication is available at www.springerlink.com

Citation

A. Elleithy, K. M. Elleithy, S. S. Rizvi, "Optimization and Job Scheduling in Heterogeneous Networks," 2010.

Publisher

Springer Netherlands

License

Journal

Volume

Issue

PubMed ID

DOI

ISSN

EISSN