• DocumentCode
    3606465
  • Title

    Scheduling divisible loads with nonlinear communication time

  • Author

    Kai Wang ; Robertazzi, Thomas G.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Stony Brook Univ., Stony Brook, NY, USA
  • Volume
    51
  • Issue
    3
  • fYear
    2015
  • fDate
    7/1/2015 12:00:00 AM
  • Firstpage
    2479
  • Lastpage
    2485
  • 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
    aerospace computing; communication complexity; iterative methods; aerospace field; divisible load scheduling; iterative method; nonlinear communication time; single level tree networks; sublinear complexity; superlinear complexity; Complexity theory; Hidden Markov models; Load modeling; Mathematical model; Optimal scheduling; Processor scheduling; Scheduling;
  • fLanguage
    English
  • Journal_Title
    Aerospace and Electronic Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9251
  • Type

    jour

  • DOI
    10.1109/TAES.2015.130677
  • Filename
    7272883
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3606465