Scheduling second-order computational load in master-slave paradigm

S. Suresh, Cui Run, Hyong Joong Kim, Thomas G. Robertazzi, Young Il Kim

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Scheduling divisible loads with the nonlinear computational complexity is a challenging task as the recursive equations are nonlinear and it is difficult to find closed-form expression for processing time and load fractions. In this study we attempt to address a divisible load scheduling problem for computational loads having second-order computational complexity in a master-slave paradigm with nonblocking mode of communication. First, we develop algebraic means of determining the optimal size of load fractions assigned to the processors in the network using a mild assumption on communication-to- computation speed ratio. We use numerical simulation to verify the closeness of the proposed solution. Like in earlier works which consider processing loads with first-order computational complexity, we study the conditions for optimal sequence and arrangements using the closed-form expression for optimal processing time. Our finding reveals that the condition for optimal sequence and arrangements for second-order computational loads are the same as that of linear computational loads. This scheduling algorithm can be used for aerospace applications such as Hough transform for image processing and pattern recognition using hidden Markov model (HMM).

Original languageEnglish
Article number6129670
Pages (from-to)780-793
Number of pages14
JournalIEEE Transactions on Aerospace and Electronic Systems
Volume48
Issue number1
DOIs
Publication statusPublished - 2012 Jan 1

Fingerprint

Computational complexity
Scheduling
Processing
Aerospace applications
Hough transforms
Communication
Hidden Markov models
Scheduling algorithms
Nonlinear equations
Pattern recognition
Image processing
Computer simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Aerospace Engineering

Cite this

Scheduling second-order computational load in master-slave paradigm. / Suresh, S.; Run, Cui; Kim, Hyong Joong; Robertazzi, Thomas G.; Kim, Young Il.

In: IEEE Transactions on Aerospace and Electronic Systems, Vol. 48, No. 1, 6129670, 01.01.2012, p. 780-793.

Research output: Contribution to journalArticle

Suresh, S. ; Run, Cui ; Kim, Hyong Joong ; Robertazzi, Thomas G. ; Kim, Young Il. / Scheduling second-order computational load in master-slave paradigm. In: IEEE Transactions on Aerospace and Electronic Systems. 2012 ; Vol. 48, No. 1. pp. 780-793.
@article{c97d61d5bf784ac4be267883e4b411b9,
title = "Scheduling second-order computational load in master-slave paradigm",
abstract = "Scheduling divisible loads with the nonlinear computational complexity is a challenging task as the recursive equations are nonlinear and it is difficult to find closed-form expression for processing time and load fractions. In this study we attempt to address a divisible load scheduling problem for computational loads having second-order computational complexity in a master-slave paradigm with nonblocking mode of communication. First, we develop algebraic means of determining the optimal size of load fractions assigned to the processors in the network using a mild assumption on communication-to- computation speed ratio. We use numerical simulation to verify the closeness of the proposed solution. Like in earlier works which consider processing loads with first-order computational complexity, we study the conditions for optimal sequence and arrangements using the closed-form expression for optimal processing time. Our finding reveals that the condition for optimal sequence and arrangements for second-order computational loads are the same as that of linear computational loads. This scheduling algorithm can be used for aerospace applications such as Hough transform for image processing and pattern recognition using hidden Markov model (HMM).",
author = "S. Suresh and Cui Run and Kim, {Hyong Joong} and Robertazzi, {Thomas G.} and Kim, {Young Il}",
year = "2012",
month = "1",
day = "1",
doi = "10.1109/TAES.2012.6129670",
language = "English",
volume = "48",
pages = "780--793",
journal = "IEEE Transactions on Aerospace and Electronic Systems",
issn = "0018-9251",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Scheduling second-order computational load in master-slave paradigm

AU - Suresh, S.

AU - Run, Cui

AU - Kim, Hyong Joong

AU - Robertazzi, Thomas G.

AU - Kim, Young Il

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Scheduling divisible loads with the nonlinear computational complexity is a challenging task as the recursive equations are nonlinear and it is difficult to find closed-form expression for processing time and load fractions. In this study we attempt to address a divisible load scheduling problem for computational loads having second-order computational complexity in a master-slave paradigm with nonblocking mode of communication. First, we develop algebraic means of determining the optimal size of load fractions assigned to the processors in the network using a mild assumption on communication-to- computation speed ratio. We use numerical simulation to verify the closeness of the proposed solution. Like in earlier works which consider processing loads with first-order computational complexity, we study the conditions for optimal sequence and arrangements using the closed-form expression for optimal processing time. Our finding reveals that the condition for optimal sequence and arrangements for second-order computational loads are the same as that of linear computational loads. This scheduling algorithm can be used for aerospace applications such as Hough transform for image processing and pattern recognition using hidden Markov model (HMM).

AB - Scheduling divisible loads with the nonlinear computational complexity is a challenging task as the recursive equations are nonlinear and it is difficult to find closed-form expression for processing time and load fractions. In this study we attempt to address a divisible load scheduling problem for computational loads having second-order computational complexity in a master-slave paradigm with nonblocking mode of communication. First, we develop algebraic means of determining the optimal size of load fractions assigned to the processors in the network using a mild assumption on communication-to- computation speed ratio. We use numerical simulation to verify the closeness of the proposed solution. Like in earlier works which consider processing loads with first-order computational complexity, we study the conditions for optimal sequence and arrangements using the closed-form expression for optimal processing time. Our finding reveals that the condition for optimal sequence and arrangements for second-order computational loads are the same as that of linear computational loads. This scheduling algorithm can be used for aerospace applications such as Hough transform for image processing and pattern recognition using hidden Markov model (HMM).

UR - http://www.scopus.com/inward/record.url?scp=84862927025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862927025&partnerID=8YFLogxK

U2 - 10.1109/TAES.2012.6129670

DO - 10.1109/TAES.2012.6129670

M3 - Article

AN - SCOPUS:84862927025

VL - 48

SP - 780

EP - 793

JO - IEEE Transactions on Aerospace and Electronic Systems

JF - IEEE Transactions on Aerospace and Electronic Systems

SN - 0018-9251

IS - 1

M1 - 6129670

ER -