Performance Evaluation of Scheduling Precedence-Constained Computations on Message-Passing Systems

Abstract

Scheduling precedence graphs with communication times is the theoretical basis for achieving efficient parallelism in message-passing machines. The lack of global information on the tasks, due to communication, has lead to develop local scheduling heuristics such as the Earliest-Task-First. Using knowledge on computation, communication, and system topology… (More)
DOI: 10.1109/71.334905

Topics

  • Presentations referencing similar topics