• DocumentCode
    506059
  • Title

    A fast static scheduling algorithm for DAGs on an unbounded number of processors

  • Author

    Yang, Tao ; Gerasoulis, Apostolos

  • Author_Institution
    Department of Computer Science, Rutgers University, New Brunswick, NJ
  • fYear
    1991
  • fDate
    18-22 Nov. 1991
  • Firstpage
    633
  • Lastpage
    642
  • Abstract
    No abstract available
  • Keywords
    Clustering algorithms; Computational complexity; Computational modeling; Computer science; Heuristic algorithms; Optimal scheduling; Processor scheduling; Scheduling algorithm; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Supercomputing, 1991. Supercomputing '91. Proceedings of the 1991 ACM/IEEE Conference on
  • Conference_Location
    Albuquerque, NM, USA
  • Print_ISBN
    0-89791-459-7
  • Type

    conf

  • DOI
    10.1145/125826.126138
  • Filename
    5348892
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=506059