Closed form solutions for bus and tree networks of processors load sharing a divisible job

Author

Bataineh, Sameer ; Hsiung, Te-Yu ; Robertazzi, Thomas G.

Author_Institution

Dept. of Electr. Eng., Jordan Univ. of Sci. & Technol., Irbid, Jordan

Volume

43

Issue

10

fYear

1994

fDate

10/1/1994 12:00:00 AM

Firstpage

1184

Lastpage

1196

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

multiprocessor interconnection networks; resource allocation; system buses; bus networks; closed form solutions; front-end processors; optimal data allocation; optimal load allocation; processors load sharing; symmetric tree networks; tree networks; Closed-form solution; Communication system control; Equations; Filtering; Image processing; Kalman filters; Load management; Process control; Signal processing; Timing;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.324544

Filename

324544