On the complexity of list scheduling algorithms for distributed-memory systems

  • Authors:
  • Andrei Rădulescu;Arjan J. C. van Gemund

  • Affiliations:
  • Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands;Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands

  • Venue:
  • ICS '99 Proceedings of the 13th international conference on Supercomputing
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract