Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job

Sameer Bataineh; Thomas G. Robertazzi

doi:10.1109/12.324544

Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job

Sameer Bataineh, Thomas G. Robertazzi

Research output: Contribution to journal › Article › peer-review

62 Citations (Scopus)

Abstract

Optimal load allocation for load Sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.

Original language	English
Pages (from-to)	1184-1196
Number of pages	13
Journal	IEEE Transactions on Computers
Volume	43
Issue number	10
DOIs	https://doi.org/10.1109/12.324544
Publication status	Published - Oct 1994
Externally published	Yes

Keywords

Load sharing
divisible job
load balancing
multiprocessors

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/12.324544

Cite this

@article{f80ae2bc1ddb4a68bfca1ed6358edab4,

title = "Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job",

abstract = "Optimal load allocation for load Sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.",

keywords = "Load sharing, divisible job, load balancing, multiprocessors",

author = "Sameer Bataineh and Robertazzi, {Thomas G.}",

note = "Funding Information: Manuscript received May 29, 1992; revised April 10, 1993. This work was supported by the BMDOlIST and managed by the Office of the Naval Research under grant No. N00014-91-J4063. S. Bataineh is with the Department of Electrical Engineering, Jordan University of Science and Technology, Irbid, P.O. Box 3030, Jordan. T.-Y. Hsiung and T. G. Robertazzi are with the Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, NY 11794 USA; e-mail: tom @ sbee.sunysb.edu. IEEE Log Number 9401636.",

year = "1994",

month = oct,

doi = "10.1109/12.324544",

language = "English",

volume = "43",

pages = "1184--1196",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

T1 - Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job

AU - Bataineh, Sameer

AU - Robertazzi, Thomas G.

N1 - Funding Information: Manuscript received May 29, 1992; revised April 10, 1993. This work was supported by the BMDOlIST and managed by the Office of the Naval Research under grant No. N00014-91-J4063. S. Bataineh is with the Department of Electrical Engineering, Jordan University of Science and Technology, Irbid, P.O. Box 3030, Jordan. T.-Y. Hsiung and T. G. Robertazzi are with the Department of Electrical Engineering, SUNY at Stony Brook, Stony Brook, NY 11794 USA; e-mail: tom @ sbee.sunysb.edu. IEEE Log Number 9401636.

PY - 1994/10

Y1 - 1994/10

N2 - Optimal load allocation for load Sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.

AB - Optimal load allocation for load Sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.

KW - Load sharing

KW - divisible job

KW - load balancing

KW - multiprocessors

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

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

U2 - 10.1109/12.324544

DO - 10.1109/12.324544

M3 - Article

AN - SCOPUS:0028518217

SN - 0018-9340

VL - 43

SP - 1184

EP - 1196

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 10

ER -

Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this