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

Sameer Bataineh, Thomas G. Robertazzi

Research output: Contribution to journalArticlepeer-review

61 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 languageEnglish
Pages (from-to)1184-1196
Number of pages13
JournalIEEE Transactions on Computers
Volume43
Issue number10
DOIs
Publication statusPublished - Oct 1994

Keywords

  • Load sharing
  • divisible job
  • load balancing
  • multiprocessors

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job'. Together they form a unique fingerprint.

Cite this