A product form solution for tree networks with divisible loads

Thomas G. Robertazzi

doi:10.1142/S0129626411000035

A product form solution for tree networks with divisible loads

Thomas G. Robertazzi

Electrical Engineering

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

6 Scopus citations

Abstract

A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form solution answers a long standing open question for divisible load scheduling.

Original language	English
Pages (from-to)	13-20
Number of pages	8
Journal	Parallel Processing Letters
Volume	21
Issue number	1
DOIs	https://doi.org/10.1142/S0129626411000035
State	Published - Mar 2011

Keywords

divisible load scheduling
product from solution
queueing networks

Access to Document

10.1142/S0129626411000035

Cite this

@article{7c4525774f57482da5e7737797a98655,

title = "A product form solution for tree networks with divisible loads",

abstract = "A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form solution answers a long standing open question for divisible load scheduling.",

keywords = "divisible load scheduling, product from solution, queueing networks",

author = "Robertazzi, \{Thomas G.\}",

year = "2011",

month = mar,

doi = "10.1142/S0129626411000035",

language = "English",

volume = "21",

pages = "13--20",

journal = "Parallel Processing Letters",

issn = "0129-6264",

number = "1",

}

TY - JOUR

T1 - A product form solution for tree networks with divisible loads

AU - Robertazzi, Thomas G.

PY - 2011/3

Y1 - 2011/3

N2 - A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form solution answers a long standing open question for divisible load scheduling.

AB - A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form solution answers a long standing open question for divisible load scheduling.

KW - divisible load scheduling

KW - product from solution

KW - queueing networks

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

U2 - 10.1142/S0129626411000035

DO - 10.1142/S0129626411000035

M3 - Article

AN - SCOPUS:79953100354

SN - 0129-6264

VL - 21

SP - 13

EP - 20

JO - Parallel Processing Letters

JF - Parallel Processing Letters

IS - 1

ER -

A product form solution for tree networks with divisible loads

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this