Scheduling nonlinear computational loads

Jui Tsun Hung; Thomas G. Robertazzi

doi:10.1109/TAES.2008.4655372

Scheduling nonlinear computational loads

Jui Tsun Hung
, Thomas G. Robertazzi

Electrical Engineering

Stony Brook University

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

22 Scopus citations

Abstract

A scheduling model for a tree network is studied where the computation time for each node is nonlinear in the size of the assigned load. Optimal load allocation and speedup for simultaneous load distribution for a quadratic nonlinearity are obtained using simple equations. An iterative solution for sequential load distribution is presented for a nonlinearity of arbitraty power. Superlinear speedup is possible when computational complexity is nonlinear in the size of assigned loads. Aerospace applications include spectrum computation, radar and sensor data processing, and satellite image processing.

Original language	English
Pages (from-to)	1169-1182
Number of pages	14
Journal	IEEE Transactions on Aerospace and Electronic Systems
Volume	44
Issue number	3
DOIs	https://doi.org/10.1109/TAES.2008.4655372
State	Published - 2008

Access to Document

10.1109/TAES.2008.4655372

Cite this

@article{9fe1c20cb9a94eb0aa8656859b259432,

title = "Scheduling nonlinear computational loads",

abstract = "A scheduling model for a tree network is studied where the computation time for each node is nonlinear in the size of the assigned load. Optimal load allocation and speedup for simultaneous load distribution for a quadratic nonlinearity are obtained using simple equations. An iterative solution for sequential load distribution is presented for a nonlinearity of arbitraty power. Superlinear speedup is possible when computational complexity is nonlinear in the size of assigned loads. Aerospace applications include spectrum computation, radar and sensor data processing, and satellite image processing.",

author = "Hung, \{Jui Tsun\} and Robertazzi, \{Thomas G.\}",

year = "2008",

doi = "10.1109/TAES.2008.4655372",

language = "English",

volume = "44",

pages = "1169--1182",

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

issn = "0018-9251",

number = "3",

}

TY - JOUR

T1 - Scheduling nonlinear computational loads

AU - Hung, Jui Tsun

AU - Robertazzi, Thomas G.

PY - 2008

Y1 - 2008

N2 - A scheduling model for a tree network is studied where the computation time for each node is nonlinear in the size of the assigned load. Optimal load allocation and speedup for simultaneous load distribution for a quadratic nonlinearity are obtained using simple equations. An iterative solution for sequential load distribution is presented for a nonlinearity of arbitraty power. Superlinear speedup is possible when computational complexity is nonlinear in the size of assigned loads. Aerospace applications include spectrum computation, radar and sensor data processing, and satellite image processing.

AB - A scheduling model for a tree network is studied where the computation time for each node is nonlinear in the size of the assigned load. Optimal load allocation and speedup for simultaneous load distribution for a quadratic nonlinearity are obtained using simple equations. An iterative solution for sequential load distribution is presented for a nonlinearity of arbitraty power. Superlinear speedup is possible when computational complexity is nonlinear in the size of assigned loads. Aerospace applications include spectrum computation, radar and sensor data processing, and satellite image processing.

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

U2 - 10.1109/TAES.2008.4655372

DO - 10.1109/TAES.2008.4655372

M3 - Article

AN - SCOPUS:55349141115

SN - 0018-9251

VL - 44

SP - 1169

EP - 1182

JO - IEEE Transactions on Aerospace and Electronic Systems

JF - IEEE Transactions on Aerospace and Electronic Systems

IS - 3

ER -

Scheduling nonlinear computational loads

Abstract

Access to Document

Other files and links

Fingerprint

Cite this