This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Declustering: A New Multiprocessor Scheduling Technique
June 1993 (vol. 4 no. 6)
pp. 625-637

The authors present a new compile-time scheduling heuristic called declustering, whichschedules acyclic precedence graphs that fit the synchronous data flow (SDF) modelonto multiprocessor architectures. This technique accounts for interprocessorcommunication (IPC) overheads and considers interconnection constraints in thearchitecture so that shared resource contention can be avoided. The algorithm initiallyinvokes a new clustering method that uses graph-analysis techniques to isolateparallelism instances. When constructing an initial set of clusters, this procedure explicitly addresses the tradeoff between exploiting parallelism and incurring communication cost. By hierarchically combining these clusters and then systematically decomposing this hierarchy, the declustering method exposes parallelism instances in order of importance and attains a cluster granularity that fits the characteristics of the architecture. It is shown that declustering retains the clustering advantage of avoiding IPC, yet overcomes the inflexibility associated with traditional clustering approaches.

[1] E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing,"IEEE Trans. Comput., vol. C-36, no. 1, pp. 24-35, Jan. 1987.
[2] E.A. Lee and S. Ha, "Scheduling Strategies for Multiprocessor Real-Time DSP,"Proc. IEEE Global Telecomm. Conf. and Exhibition (Globecom), Vol. 2, 1989, pp. 1279-1283.
[3] V. Sarkar,Partitioning and Scheduling Parallel Programs for Multiprocessing, MIT Press, 1989.
[4] C. Papadimitriou and M. Yannakakis, "Toward an architecture-independent analysis of parallel algorithms,"SIAM J. Comput., vol. 19, no. 2, pp. 322-328, Apr. 1990.
[5] W. W. Chu, L. J. Holloway, M. T. Lan, and K. Efe, "Task allocation in distributed data processing,"IEEE Comput. Mag., pp. 57-69, Nov. 1980.
[6] K. Efe, "Heuristic models of task assignment scheduling in distributed systems,"IEEE Comput. Mag., pp. 50-56, June 1982.
[7] H. S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE-3, no. 1, pp. 85-93, Jan. 1977.
[8] G. C. Sih and E. A. Lee, "Scheduling to account for interprocessor communication within interconnection-constrained processor networks," inICPP Proc., Aug. 1990, pp. 9-16.
[9] G. C. Sih and E. A. Lee, "Dynamic-level scheduling for heterogeneous processor networks," inProc. 2nd IEEE Symp. Parallel and Distributed Processing(Dallas, TX), Dec. 1990, pp. 42-49.
[10] T. L. Adam, K. M. Chandy, and J. R. Dickson, "A comparison of list schedules for parallel processing systems,"Commun. ACM, vol. 17, no. 12, pp. 685-690, Dec. 1974.
[11] B. Greenblatt and C. J. Linn, "Branch and bound algorithms for scheduling communicating tasks in a distributed system," inProc. Compcon 1987, pp. 12-16.
[12] V. B. Gylys and J. A. Edwards, "Optimal partitioning of workload for distributed systems," inProc. Compcon, Fall 1976, pp. 353-357.
[13] S. J. Kim and J. C. Browne, "A general approach to mapping of parallel computations upon multiprocessor architectures," inICPP Proc., vol. 3, Aug. 1988, pp. 1-8.
[14] J. C. Bier, E. E. Goei, W. H. Ho, P. D. Lapsley, M. P. O'Reilly, G. C. Sih, and E. A. Lee, "Gabriel: A design environment for DSP,"IEEE Micro, vol. 10, no. 5, pp. 28-45, Oct., 1990.
[15] A. Gerasoulis, S. Venugopal, and T. Yang, "Clustering task graphs for message passing architectures," inICS Proc., June 1990, pp. 447-456.

Index Terms:
Index Termsmultiprocessor scheduling; compile-time; scheduling heuristic; declustering; acyclicprecedence graphs; interprocessor communication; shared resource; contention;graph-analysis; multiprocessing systems; scheduling
Citation:
G.C. Sih, E.A. Lee, "Declustering: A New Multiprocessor Scheduling Technique," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 625-637, June 1993, doi:10.1109/71.242160
Usage of this product signifies your acceptance of the Terms of Use.