A new guaranteed heuristic for the software pipelining problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A new guaranteed heuristic for the software pipelining problem

Full text

Pdf (893 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 10th international conference on Supercomputing table of contents

Philadelphia, Pennsylvania, United States

Pages: 261 - 269

Year of Publication: 1996

ISBN:0-89791-803-7

Authors

Pierre-Yves Calland	Laboratoire LIP, URA CNRS 1398, Ecole Normale Supérieure de Lyon, F-69364 LYON Cedex 07
Alain Darte	Laboratoire LIP, URA CNRS 1398, Ecole Normale Supérieure de Lyon, F-69364 LYON Cedex 07
Yves Robert	Laboratoire LIP, URA CNRS 1398, Ecole Normale Supérieure de Lyon, F-69364 LYON Cedex 07

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 11, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237578.237613 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alexander Aiken , Alexandru Nicolau, Perfect Pipelining: A New Loop Parallelization Technique, Proceedings of the 2nd European Symposium on Programming, p.221-235, March 21-24, 1988
	2	P.-Y. Calland, A. Darte, and Y. Robert. A new guaranteed heuristic for the software pipelining problem. Research Report 95-42, LIP, http://www.ens-lyon.fr/LIP, 1995.
	3	E. G. Coffman. Computer and job-shop scheduling theory. John Wiley, 1976.
	4	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	5	Paul Feautrier, Fine-Grain Scheduling under Resource Constraints, Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, p.1-15, August 08-10, 1994
	6	F. G asperoni and U. Schwiegelshohn. Generating close to optimum loop schedules on parallel processors. Parallel Processing Letters, 4(4):391-403, 1994.
	7	Ramaswamy Govindarajan , Erik R. Altman , Guang R. Gao, A Framework for Resource-Constrained Rate-Optimal Software Pipelining, Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing, p.640-651, September 06-08, 1994
	8	C. Hanen and A. Munier. Cyclic scheduling on parallel processors: an overview. In P. Chrdtienne, E. G. Coffman, J. K. Lenstra, and Z. Liu, editors, Scheduling Theory and its Apphcat~ons. John Wiley g; Sons Ltd, 1994.
	9	C.E. Leiserson and J.B. Saxe. Retiming synchronous circuitry. Algorithm~ca, 6:5-35, 1991.
	10	Jian Wang , Christine Eisenbeis , Martin Jourdan , Bogong Su, Decomposed software pipelining: a new perspective and a new approach, International Journal of Parallel Programming, v.22 n.3, p.351-373, June 1994 [doi>10.1007/BF02577737]