DocumentCode
1232406
Title
Optimal divisible job load sharing for bus networks
Author
Sohn, Jeeho ; Robertazzi, Thomas G.
Author_Institution
Dept. of Electr. Eng., State Univ. of New York, Stony Brook, NY, USA
Volume
32
Issue
1
fYear
1996
Firstpage
34
Lastpage
40
Abstract
Optimal load allocation for load sharing a divisible job over N processors interconnected in bus-oriented network is considered. The processors are equipped with front-end processors. It is analytically proved, for the first time, that a minimal solution time is achieved when the computation by each processor finishes at the same time. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are also obtained.
Keywords
multiprocessor interconnection networks; processor scheduling; resource allocation; bus networks; closed form solutions; divisible job; front-end processors; load sharing; minimal solution time; minimum finish time; optimal data allocation; optimal load allocation; processor interconnection; Bandwidth; Closed-form solution; Filtering; Image processing; Kalman filters; Parallel processing; Processor scheduling; Sections; Signal processing; Timing;
fLanguage
English
Journal_Title
Aerospace and Electronic Systems, IEEE Transactions on
Publisher
ieee
ISSN
0018-9251
Type
jour
DOI
10.1109/7.481247
Filename
481247
Link To Document