An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems

B. S. Panda, Sajal K. Das. An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. In Burkhard Monien, Viktor K. Prasanna, Sriram Vajapeyam, editors, High Performance Computing - HiPC 2001, 8th International Conference, Hyderabad, India, December, 17-20, 2001, Proceedings. Volume 2228 of Lecture Notes in Computer Science, pages 47-57, Springer, 2001. [doi]

Abstract

Abstract is missing.