Optimal scheduling of iterative data-flow programs onto multiprocessors with non-negligible interprocessor communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1593, Issue , 1999, Pages 732-743

  Antony Louis Piriyakumar, D ^a   Levi, Paul ^a   Siva Ram Murthy, C ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Data flow programs; Interprocessor communication; Intra and inter iteration precedences; Iteration bound; Iteration period; Multiprocessor schedules; Optimal scheduling; Unfolding and retiming

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DATA TRANSFER; MULTIPROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; SET THEORY;

DATA FLOW PROGRAM; INTER PROCESSOR COMMUNICATION; INTRA AND INTER ITERATION PRECEDENCES; ITERATION BOUND; ITERATION PERIODS; OPTIMAL SCHEDULING; RETIMING;

ITERATIVE METHODS;

EID: 84875204530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. K.K. Parhi and D.G. Messerschmitt, “Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding”, IEEE Transactions on Computers, vol. 40, no. 2, pp. 178-194, Feb. 1991.
2. L.E. Lucke and K.K. Parhi, “Data-flow transformations for critical path time reduction in high-level DSP synthesis”, IEEE Transactions on Computer- Aided Design, vol. 12, no. 7, July 1993.
3. D.A. Schwartz and T.P. Barnwell, “cyclo-static solutions: Optimal multiprocessor realizations of recursive algorithms”, VLSI Signal processing II, IEEE Press, 1986.
4. K.K. Parhi, “Algorithm transformation techniques for concurrent processors”, Proceedings of the IEEE, vol. 77, no. 12, Dec. 1989.
5. T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors”, IEEE. Trans. on Parallel and Distributed Systems, vol. 5, no. 9, pp. 951-967, September. 1994.
6. M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., 1979.
7. T. Yang and C Fu, “Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machine”, IEEE Transactions on Parallel and Distributed Systems, vol. 8, No. 6, pp. 608-622, June 1997.
8. C.E. Leiserson, F. Rose, and J. Saxe, “optimizing synchronous circuitry by retiming”, Proc. Third Caltech Conf. VLSI, Pasadena, CA, pp. 87-116, March 1983.
9. J.J. Hwang, Y.C. Cow, F.D. Anger, and C.Y. Lee, “Scheduling Precedence Graphs in Systems with Interprocessor Communication times”, SIAM Journal of Computing, pp. 244-257, 1989.
10. S. Selvakumar and C. Siva Ram Murthy, “Scheduling Precedence constrained Task Graphs with Non-negligible Intertask Communication onto Multiprocessors”, IEEE Transactions on Parallel and Distributed Systems, vol.5, no.3, pp.328-336, 1994.
11. N.J. Nilson, Principles of Artificial Intelligence, Springer-Verlag, 1980.
12. D. Antony Louis Piriyakumar, C. Siva Ram Murthy, and Paul Levi, “A New A* Based Optimal Task Scheduling in Heterogeneous Multiprocess or Systems Applied to Computer Vision”, HPCN-98, Amsterdam, April, 1998.