Solving large scale assignment problems in high-level synthesis by approximative quadratic programming

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Solving large scale assignment problems in high-level synthesis by approximative quadratic programming

Full text

Pdf (239 KB)

Source

Great Lakes Symposium on VLSI archive
Proceedings of the 11th Great Lakes symposium on VLSI table of contents

West Lafayette, Indiana, United States

Pages: 19 - 24

Year of Publication: 2001

ISBN:1-58113-351-0

Authors

Florin Balasa	University of Illinois at Chicago, Dept. EECS, Chicago, IL
Werner Geurts	Target Compiler Technologies, Leuven, B-3001, Belgium
Francky Catthoor	Interuniv. Microelectronics Center, Katholieke Universiteit Leuven
Hugo De Man	Interuniv. Microelectronics Center, Katholieke Universiteit Leuven

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, 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/368122.368149 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	E. Balas, "An additive algorithm for solving linear programs with 0-1 variables," Oper. Res., Vol. 13, pp. 517-546, 1965.
	2	Florin Balasa , Francky Catthoor , Hugo De Man, Dataflow-driven memory allocation for multi-dimensional signal processing systems, Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, p.31-34, November 06-10, 1994, San Jose, California, United States
	3	E.R. Barnes, "An algorithm for partitioning the nodes of a graph," SIAM J. Alg. Discrete Methods, Vol. 3, No. 4, 1982.
	4	M. Carter, "The indefinite zero-one quadratic problem," Discrete Applied Math., Vol. 7, pp. 23-44, 1984.
	5	H. De Man et al., "Architecture-driven synthesis techniques for mapping digital signal processing algorithms into silicon," Proc. of the IEEE, Vol. 78, No. 2, pp. 319-335, 1990.
	6	Giovanni De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill Higher Education, 1994
	7	M.R. Garey, D.S. Johnson, L. Stockmeyer, "Some simplified NP-complete graph problems," Theor. Computer Science, Vol. 1, pp. 237-267, 1976.
	8	A.M. Geoffrion, "Integer programming by implicit enumeration and Balas' method," SIAM Review, Vol. 9, No. 2, 178- 190, April 1967.
	9	W. Geurts, F. Catthoor, H. De Man, "Quadratic zero-one programming based synthesis of application specific data paths," IEEE Trans. CAD, Vol. 14, No. 1, pp. 1-11, 1995.
	10	F. Glover, E. Woolsey, "Converting the 0-1 polynomial programming problem to a 0-1 linear program," Operations Research, Vol. 22, No. 1, pp. 180-182, Jan. 1974.
	11	R.D. McBride, J.S. Yormark, "An implicit enumeration algorithm for quadratic integer programming," Management Science, Vol. 26, No. 3, pp. 282-296, March 1980.
	12	N. Park, A.C. Parker, "Sehwa: a software package for synthesis of pipelines from behavioral specifications," IEEE Trans. on CAD, Vol. CAD-7, No. 3, pp. 356-370, March 1988.
	13	H.A. Taha, "A Balasian-based algorithm for zero-one polynomial programming," Management Science, Vol. 18, No. 6, pp. 328-343, Feb. 1972.
	14	* * * , LAMPS User Guide - Linear and Mathematical Programming System, Advanced Math. Software Ltd., 1993.