• DocumentCode
    1279712
  • Title

    Worst case analysis of Lawler´s algorithm for scheduling trees with communication delays

  • Author

    Guinand, F. ; Rapine, C. ; Trystram, D.

  • Author_Institution
    IMAG, Grenoble, France
  • Volume
    8
  • Issue
    10
  • fYear
    1997
  • fDate
    10/1/1997 12:00:00 AM
  • Firstpage
    1085
  • Lastpage
    1086
  • Abstract
    This paper establishes the exact upper bound for Lawler´s heuristic proving that its schedule of a UECT tree on m identical processors does not exceed an optimal solution by more than m/2 time units
  • Keywords
    communication complexity; delays; processor scheduling; trees (mathematics); Lawler´s algorithm; UECT tree; communication delays; exact upper bound; heuristic proving; scheduling trees; worst case analysis; Algorithm design and analysis; Computer aided software engineering; Costs; Delay effects; Optimal scheduling; Parallel machines; Processor scheduling; Scheduling algorithm; Tree graphs; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.629491
  • Filename
    629491
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1279712