Cited By
View all- Zhu HJong C(2002)Interconnection optimization in data path allocation using minimal cost maximal flow algorithmMicroelectronics Journal10.1016/S0026-2692(02)00048-433:9(749-759)Online publication date: Sep-2002
Solving large scale assignment problems in high-level synthesis by approximative quadratic programming
Pages 19 - 24
References
[1]
E. Balas, "An additive algorithm for solving linear programs with 0-1 variables," Oper. Res., Vol. 13, pp. 517-546, 1965.
[2]
F. Balasa, F. Catthoor, H. De Man, "Dataflow-driven memory allocation for mtflti-dimensional processing systems", Proc. IEEE Int. Conf. Comp. Aided Design, pp. 31-34, 1994.
[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]
G. De Michelli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 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.
Index Terms
- Solving large scale assignment problems in high-level synthesis by approximative quadratic programming
Recommendations
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
In this paper, we present an original method to solve convex bilevel programming problems in an optimistic approach. Both upper and lower level objective functions are convex and the feasible region is a polyhedron. The enumeration sequential linear ...
A decomposition algorithm for solving large-scale quadratic programming problems
In this paper an algorithm for solving large-scale programming is proposed. We decompose a large-scale quadratic programming into a serial of small-scale ones and then approximate the solution of the large-scale quadratic programming via the solutions ...
Comments
Information & Contributors
Information
Published In
March 2001
152 pages
Copyright © 2001 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 2001
Check for updates
Qualifiers
- Article
Conference
GLSVLSI01
Sponsor:
Acceptance Rates
Overall Acceptance Rate 312 of 1,156 submissions, 27%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 167Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025
Other Metrics
Citations
Cited By
View all- Zhu HJong C(2002)Interconnection optimization in data path allocation using minimal cost maximal flow algorithmMicroelectronics Journal10.1016/S0026-2692(02)00048-433:9(749-759)Online publication date: Sep-2002
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in