• DocumentCode
    3783664
  • Title

    A comparison of the static task graph scheduling algorithms

  • Author

    J. Brest;V. Zumer

  • Author_Institution
    Fac. of Electr. Eng. & Comput. Sci., Maribor Univ., Slovenia
  • fYear
    2001
  • fDate
    6/23/1905 12:00:00 AM
  • Firstpage
    43
  • Abstract
    In this paper the new algorithm for static task graph scheduling on multiprocessor systems is proposed and a comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a prototype standard task graph set.
  • Keywords
    "Scheduling algorithm","Processor scheduling","Costs","Prototypes","Parallel processing","Computer networks","Computational efficiency","Computer science","Large-scale systems","Concurrent computing"
  • Publisher
    ieee
  • Conference_Titel
    Information Technology Interfaces, 2001. ITI 2001. Proceedings of the 23rd International Conference on
  • ISSN
    1330-1012
  • Print_ISBN
    953-96769-3-2
  • Type

    conf

  • DOI
    10.1109/ITI.2001.937995
  • Filename
    937995
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3783664