Algorithms for simultaneous satisfaction of multiple constraints and objective optimization in a placement flow with application to congestion control

Zhong, Ke; Dutt, Shantanu

doi:10.1145/514126.514129

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. An example of multi-chip systems with grid interconnect topology physical device to eliminate high density interconnect regions (which is achieved by minimizing the maximum subdomain degree) can significantly reduce the peak demand of routing resources and thus, help in reducing the peak congestion [17], [38]. Similarly, in the context of multi-chip configurations, a partitioned design cannot be mapped on to a set of chips, if there is a partition that exceeds the number of available I/O pins.…”

Section: Introductionmentioning

confidence: 99%

Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

Selvakkumaran¹,

Karypis²

2003

View full text Add to dashboard Cite

Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

show abstract

Section: Introductionmentioning

confidence: 99%

Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

Selvakkumaran¹,

Karypis²

2003

View full text Add to dashboard Cite

show abstract

Algorithms for simultaneous satisfaction of multiple constraints and objective optimization in a placement flow with application to congestion control

Cited by 1 publication

References 0 publications

Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

Contact Info

Product

Resources

About