Optimal divisible job load sharing for bus networks

Jeeho Sohn; Thomas G. Robertazzi

doi:10.1109/7.481247

Optimal divisible job load sharing for bus networks

Jeeho Sohn
, Thomas G. Robertazzi

Electrical Engineering

Stony Brook University

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

67 Scopus citations

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.

Original language	English
Pages (from-to)	34-40
Number of pages	7
Journal	IEEE Transactions on Aerospace and Electronic Systems
Volume	32
Issue number	1
DOIs	https://doi.org/10.1109/7.481247
State	Published - 1996

Access to Document

10.1109/7.481247

Cite this

@article{22ad1194313b4cf5b6638e2126976e92,

title = "Optimal divisible job load sharing for bus networks",

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.",

author = "Jeeho Sohn and Robertazzi, \{Thomas G.\}",

year = "1996",

doi = "10.1109/7.481247",

language = "English",

volume = "32",

pages = "34--40",

journal = "IEEE Transactions on Aerospace and Electronic Systems",

issn = "0018-9251",

number = "1",

}

TY - JOUR

T1 - Optimal divisible job load sharing for bus networks

AU - Sohn, Jeeho

AU - Robertazzi, Thomas G.

PY - 1996

Y1 - 1996

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

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

UR - https://www.scopus.com/pages/publications/0029777576

U2 - 10.1109/7.481247

DO - 10.1109/7.481247

M3 - Article

AN - SCOPUS:0029777576

SN - 0018-9251

VL - 32

SP - 34

EP - 40

JO - IEEE Transactions on Aerospace and Electronic Systems

JF - IEEE Transactions on Aerospace and Electronic Systems

IS - 1

ER -

Optimal divisible job load sharing for bus networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this