Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers (1994)

Pacific Grove, CA, USA

Oct. 31, 1994 to Nov. 2, 1994

ISSN: 1058-6393

ISBN: 0-8186-6405-3

pp: 1052-1057

P.K. Murthy , Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA

E.A. Lee , Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA

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 J is increased. We show that the asymptotic behavior is cyclic in the following sense: there exist constants T and /spl rho/ such that the critical path in the precedence graph of blocking factor J+/spl rho/ has weight given by CP(J+/spl rho/)=CP(J)+p/spl lambda/ /spl forall/J>T (Eq 1) Where /spl lambda/ is the maximum cycle mean in the original graph, and /spl rho/ is an integer computable from the graph.<>

INDEX TERMS

signal processing, multiprocessing programs, processor scheduling, resource allocation, data flow graphs

CITATION

P. Murthy and E. Lee, "On the optimal blocking factor for blocked, non-overlapped multiprocessor schedules,"

*Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers(ACSSC)*, Pacific Grove, CA, USA, 1995, pp. 1052-1057.

doi:10.1109/ACSSC.1994.471620

CITATIONS