chapter  13
6 Pages


The quantities can be computed using Dijkstra’s algorithm (Section 3.13.1) to solve the all-pairs shortest path problem on the synchronization graph in time .

concrete manner that can contribute to the development of future multiprocessor implementation tools, we introduce a flexible framework for combining arbitrary multiprocessor scheduling algorithms for iterative dataflow graphs, including the diverse set that we discussed in Chapter 6, with algorithms for optimizing IPC and synchronization costs of a given schedule, such as those covered in Chapters 10-12.