Declustering: A New Multiprocessor Scheduling Technique

IEEE Transactions on Parallel and Distributed Systems

Volumn 4, Issue 6, 1993, Pages 625-637

  Lee, Edward A ^b  

^a QUALCOMM INC   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Clustering; declustering; interprocessor communication; multiprocessor scheduling; parallel processing; parallelism detection

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; DATA HANDLING; GRAPH THEORY; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; PROGRAM COMPILERS; SCHEDULING;

ACYCLIC PRECEDENCE GRAPHS; CLUSTERING; DECLUSTERING; INTERPROCESSOR COMMUNICATION; MULTIPROCESSOR SCHEDULING; PARALLELISM DETECTION; SYNCHRONOUS DATA FLOW MODEL;

PARALLEL PROCESSING SYSTEMS;

EID: 0027606923     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.242160     Document Type: Article

References (15)

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, Jan. 1987.
2. E. A. Lee and S. Ha, “Scheduling strategies for multiprocessor real-time DSP,” in Proc. Globecom, Nov. 1989.
3. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. Cambridge, MA: M.I.T. 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,” in ICPP Proc., Aug. 1990, pp. 9–16.
9. G. C. Sih and E. A. Lee, “Dynamic-level scheduling for heterogeneous processor net-works,” in Proc. 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,” in Proc. Compcon 1987, pp. 12–16.
12. V. B. Gylys and J. A. Edwards, “Optimal partitioning of workload for distributed systems,” in Proc. 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,” in ICPP 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,” in ICS Proc., June 1990, pp. 447–456.