Abstract
No current task schedulers for distributed-memory MIMD machines produce optimal schedules in general, so it is possible for optimizations to be performed after scheduling. Message merging, communication reordering, and task duplication are shown to be effective post-scheduling optimizations. The percentage decrease in execution time is dependent on the original schedule, so improvements are not always achievable for every schedule. However, significant decreases in execution time (up to 50%) are possible, which makes the investment in extra processing time worthwhile. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Shafer, S., & Ghose, K. (1999). Post-scheduling optimization of parallel programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 440–444). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_58
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
