• DocumentCode
    937468
  • Title

    Counterexample to a conjecture in multiprocessor scheduling

  • Author

    Laurentini, A.

  • Author_Institution
    Politecnico di Torino, Istituto di Elettrotecnica, Torino, Italy
  • Volume
    12
  • Issue
    10
  • fYear
    1976
  • Firstpage
    246
  • Lastpage
    248
  • Abstract
    A counterexample to a conjecture on an upper bound to the execution time of a graph of tasks by the longest-path scheduling algorithm is presented.
  • Keywords
    multiprocessing systems; scheduling; execution time; graph of tasks; multiprocessor scheduling; upper bound;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19760190
  • Filename
    4239758
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=937468