Scheduling divisible loads with nonlinear communication time

Kai Wang; Thomas G. Robertazzi

doi:10.1109/TAES.2015.130677

Scheduling divisible loads with nonlinear communication time

Kai Wang
, Thomas G. Robertazzi

Electrical Engineering

Stony Brook University

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

9 Scopus citations

Abstract

A scheduling model for single level tree networks with various distribution policies is studied in which the communication time from the root to each node is nonlinear in the size of the load. An iterative method is implemented to solve the optimal load distribution. The difference between sublinear and superlinear complexity is examined, where many applications arise in the aerospace field.

Original language	English
Article number	7272883
Pages (from-to)	2479-2485
Number of pages	7
Journal	IEEE Transactions on Aerospace and Electronic Systems
Volume	51
Issue number	3
DOIs	https://doi.org/10.1109/TAES.2015.130677
State	Published - Jul 1 2015

Keywords

Complexity theory
Hidden Markov models
Load modeling
Mathematical model
Optimal scheduling
Processor scheduling
Scheduling

Access to Document

10.1109/TAES.2015.130677

Cite this

@article{62d6d1bc80b549fda9f0e92722112fad,

title = "Scheduling divisible loads with nonlinear communication time",

abstract = "A scheduling model for single level tree networks with various distribution policies is studied in which the communication time from the root to each node is nonlinear in the size of the load. An iterative method is implemented to solve the optimal load distribution. The difference between sublinear and superlinear complexity is examined, where many applications arise in the aerospace field.",

keywords = "Complexity theory, Hidden Markov models, Load modeling, Mathematical model, Optimal scheduling, Processor scheduling, Scheduling",

author = "Kai Wang and Robertazzi, \{Thomas G.\}",

note = "Publisher Copyright: {\textcopyright} 1965-2011 IEEE.",

year = "2015",

month = jul,

day = "1",

doi = "10.1109/TAES.2015.130677",

language = "English",

volume = "51",

pages = "2479--2485",

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

issn = "0018-9251",

number = "3",

}

TY - JOUR

T1 - Scheduling divisible loads with nonlinear communication time

AU - Wang, Kai

AU - Robertazzi, Thomas G.

PY - 2015/7/1

Y1 - 2015/7/1

N2 - A scheduling model for single level tree networks with various distribution policies is studied in which the communication time from the root to each node is nonlinear in the size of the load. An iterative method is implemented to solve the optimal load distribution. The difference between sublinear and superlinear complexity is examined, where many applications arise in the aerospace field.

AB - A scheduling model for single level tree networks with various distribution policies is studied in which the communication time from the root to each node is nonlinear in the size of the load. An iterative method is implemented to solve the optimal load distribution. The difference between sublinear and superlinear complexity is examined, where many applications arise in the aerospace field.

KW - Complexity theory

KW - Hidden Markov models

KW - Load modeling

KW - Mathematical model

KW - Optimal scheduling

KW - Processor scheduling

KW - Scheduling

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

U2 - 10.1109/TAES.2015.130677

DO - 10.1109/TAES.2015.130677

M3 - Article

AN - SCOPUS:84942895688

SN - 0018-9251

VL - 51

SP - 2479

EP - 2485

JO - IEEE Transactions on Aerospace and Electronic Systems

JF - IEEE Transactions on Aerospace and Electronic Systems

IS - 3

M1 - 7272883

ER -

Scheduling divisible loads with nonlinear communication time

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this