Analyzing Asynchronous Pipeline Schedules

International Journal of Parallel Programming

Volumn 26, Issue 1, 1998, Pages 5-42

  Donaldson, Val ^a   Ferrante, Jeanne ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distributed memory parallelism; Loop optimization; Pipelining; Task scheduling

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PIPELINE PROCESSING SYSTEMS; SCHEDULING;

DISTRIBUTED MEMORY PARALLELISM;

DATA STORAGE EQUIPMENT;

EID: 0032001422     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018786922750     Document Type: Article

References (24)

1. R. Reiter, Scheduling parallel computations, J. ACM 15(4): 590-599 (October 1968).
2. D. A. Padua and M. J. Wolfe, Advanced compiler optimizations for supercomputers, Comm. ACM 29(12):1184-1201 (December 1986).
3. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, MIT Press, Cambridge, Massachusetts (1989).
4. T. Yang and A. Gerasoulis, DSC: scheduling parallel tasks on an unbounded number of processors, IEEE Trans. Parallel and Distrib. Syst. 5(9):951-967 (September 1994).
5. P. M. Kogge, The Architecture of Pipelined Computers, Hemisphere Publishing, New York (1981).
6. A. Aiken and A. Nicolau, Optimal loop parallelization, Proc. SIGPLAN'88 Conf. on Progr. Lang. Design and Implementation, Atlanta, Georgia, 308-317 (June 1988).
7. M. Lam, Software pipelining: an effective scheduling technique for VLIW machines, Proc. SIGPLAN'88 Conf. Progr. Lang. Design and Implementation, Atlanta, Georgia, 318-328 (June 1988).
8. S. Banerjee, T. Hamada, P. M. Chau, and R. D. Fellman, Macro pipelining based scheduling on high performance heterogeneous multiprocessor systems, IEEE Trans. Signal Processing 43(8): 1468-1484 (June 1995).
9. P. D. Hoang and J. M. Rabaey, Scheduling of DSP programs onto multiprocessors for maximum through-put, IEEE Trans. Signal Processing 41(6):2225-2235 (June 1993).
10. A. Beguelin, J. J. Dongarra, G. A. Geist, R. Manchek, and V. S. Sunderam, Graphical development tools for network-based concurrent supercomputing, Proc. Supercomputing '91, Albuquerque, New Mexico, pp. 435-444 (November 1991).
11. T. Yang, C. Fu, A. Gerasoulis, and V. Sarkar, Mapping iterative task graphs on distributed memory machines, Proc. 24th Int'l. Conf. Parallel Proc., Oconomowoc, Wisconsin, Vol. II, pp. 151-158 (August 1995).
12. F. Commoner, A. W. Holt, S. Even, and A. Pnueli, Marked directed graphs, J. Comput. Syst. Sci. 5(5):511-523 (October 1971).
13. S. Y. Kung, P. S. Lewis, and S. C. Lo, Performance analysis and optimization of VLSI dataflow arrays, J. Parallel and Distribut. Comput. 4(6):592-618 (December 1987).
14. F. Gasperoni and U. Schwiegelshohn, Scheduling loops on parallel processors: a simple algorithm with close to optimum performance, Second Joint Int'l. Conf. Vector and Parallel Processing (CONPAR 92-VAPP V), Lyon, France, pp. 625-636 (September 1992).
15. S. M. Burns, Performance analysis and optimization of asynchronous circuits, Ph.D. Thesis, California Institute of Technology, Pasadena, California (1991).
16. F. T. Leighton, Introduction to Parallel Algorithm and Architecture: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, California (1992).
17. C. V. Ramamoorthy and G. S. Ho, Performance evaluation of asynchronous concurrent systems using Petri nets, IEEE Trans. Software Engineering SE-6(5):440-449 (September 1980).
18. V. Donaldson and J. Ferrante, Determining asynchronous acyclic pipeline execution times, Proc. 10th Int'l. Parallel Processing Symp., Honolulu, Hawai, pp. 568-572 (April 1996).
19. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, Massachusetts (1990).
20. D. B. Johnson, Finding all the elementary circuits of a directed graph, SIAM J. Comput. 4(1):77-84 (March 1975).
21. E. L. Lawier, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York (1976).
22. H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems, SIAM J. Computing 18(5):1013-1036 (October 1989).
23. G. B. Dantzig, W. O. Blattner, and M. R. Rao, Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem, in P. Rosenstiehl (ed.), Theory of Graphs, Dunod, Paris, and Gordon and Breach, New York, pp. 77-83 (1967).
24. M. Hartmann and J. B. Orlin, Finding minimum cost to time ratio cycles with small integral transit times, Networks 23(6):567-574 (September 1993).