# On the Optimal Blocking Factor for Blocked, Non-overlapped Multiprocessor Schedules ^{1}

Praveen. K. Murthy, Edward. A. Lee
In Proc.of IEEE Asilomar Conf. on Signals, Systems, and Computers

Oct. 31 - Nov. 2, Pacific Grove, CA 1994

Prepublished version |

Published version |

## ABSTRACT

This paper addresses the issue of determining the blocked non-overlapped multiprocessor schedule of optimal blocking factor for signal processing programs expressed as synchronous dataflow (SDF) graphs.The main result of this paper is a graph-theoretic characterization of the behavior of the critical path in the precedence graph of blocking factor J as is increased. We show that the asymptotic behavior is cyclic in the following sense: there exist constants T and such that the critical path in the precedence graph of blocking factor J + has weight given by

where is the maximum cycle mean in the original graph, and is an integer computable from the graph.

1.This research was supported by ARPA and the US Air Force (under the RASSP program), NSF (MIP9201605), ONT (via NRL), and the California MICRO program.