scispace - formally typeset
Search or ask a question
Institution

Center for Discrete Mathematics and Theoretical Computer Science

FacilityPiscataway, New Jersey, United States
About: Center for Discrete Mathematics and Theoretical Computer Science is a facility organization based out in Piscataway, New Jersey, United States. It is known for research contribution in the topics: Local search (optimization) & Optimization problem. The organization has 140 authors who have published 175 publications receiving 2345 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a homogeneous polynomial for a general hypergraph is defined, and a remarkable connection between clique number and the homogeneous polynomial of a generalized hypergraph has been established.

3 citations

Journal ArticleDOI
TL;DR: Experimental results show that the algorithm can resolve all MW constraints and mitigate the half-row fragmentation effect without any extra area overhead in a reasonable time.

3 citations

Proceedings ArticleDOI
01 Feb 2021
TL;DR: In this article, an analytical placement algorithm for heterogeneous FPGAs to optimize its worst slack and clock constraints simultaneously is presented, and a two-stage clock region refinement method is presented to effectively resolve the clock and resource violations.
Abstract: Modern FPGAs often contain heterogeneous architectures and clocking resources which must be considered to achieve desired solutions. As the design complexity keeps growing, placement has become critical for FPGA timing closure. In this paper, we present an analytical placement algorithm for heterogeneous FPGAs to optimize its worst slack and clock constraints simultaneously. First, a heterogeneity-aware and memory-friendly delay model is developed to accurately and rapidly assess each connection delay. Then, a two-stage clock region refinement method is presented to effectively resolve the clock and resource violations. Finally, we develop a novel timing-based co-optimization method to generate optimized placement without any clocking violations. Compared with the state-of-the-art placer based on the advanced commercial tool Xilinx Vivado 2019.1 with the Xilinx 7 Series FPGA architecture, our algorithm achieves the best worst slack and routed wirelength while satisfying all clock constraints.

3 citations

Journal ArticleDOI
TL;DR: In this article, the authors proposed a topology-aware single bus routing algorithm, which is integrated into a negotiation-based global routing to determine the desired routing regions for each bus and allocate the tracks to each segment of buses under the guidance of the global routing result.
Abstract: As one of the most important routing problems in the complex network within a very-large-scale integration (VLSI) circuit, bus routing has become much more challenging when witnessing the advanced technology node enters the deep nanometer era because all bus bits need to be routed with the same routing topology in the context. In particular, the nonuniform routing track configuration and obstacles bring the largest difficulty for maintaining the same topology for all bus bits. In this paper, we first present a track handling technique to unify the nonuniform routing track configuration with obstacles. Then, we formulate the topology-aware single bus routing as an unsplittable flow problem (UFP), which is integrated into a negotiation-based global routing to determine the desired routing regions for each bus. A topology-aware track assignment is also presented to allocate the tracks to each segment of buses under the guidance of the global routing result. Finally, a detailed routing scheme is proposed to connect the segments of each bus. We evaluate our routing result with the benchmark suite of the 2018 CAD Contest. Compared with the top-3 state-of-the-art methods, experimental results show that our proposed algorithm achieves the best overall score regarding specified time limitations.

2 citations

Proceedings ArticleDOI
01 Oct 2010
TL;DR: A real-time streaming media playout algorithm based on RBF (radial basis function) delay prediction is proposed that takes the initiative to adjust the time interval to ensure the continuity of playout and reduce average buffer delay in different situation with time-based forecasts.
Abstract: Analyzing two important indicators of real-time streaming media system, and then aiming at the drawbacks of the conventional real-time streaming media playout algorithm and the playout algorithm based on Differencing AR, a real-time streaming media playout algorithm based on RBF (radial basis function) delay prediction is proposed. The algorithm takes the initiative to adjust the time interval to ensure the continuity of playout and reduce average buffer delay in different situation with time-based forecasts by predicting the receive time and playout time. Finally, compared with other algorithms, the experiment result shows that this algorithm is effective.

2 citations


Authors

Showing all 148 results

NameH-indexPapersCitations
Aravind Srinivasan6026613711
Ding-Zhu Du5242113489
Elena N. Naumova472328593
Rebecca N. Wright371134722
Boris Mirkin351786722
Mona Singh32915451
Fred S. Roberts321815286
Tanya Y. Berger-Wolf311353624
Rephael Wenger26671900
Marios Mavronicolas261512880
Seoung Bum Kim261652260
M. Montaz Ali261013093
Lazaros K. Gallos24694770
Myong K. Jeong24951955
Nina H. Fefferman231072362
Network Information
Related Institutions (5)
Hong Kong University of Science and Technology
52.4K papers, 1.9M citations

73% related

Google
39.8K papers, 2.1M citations

73% related

Microsoft
86.9K papers, 4.1M citations

73% related

Georgia Institute of Technology
119K papers, 4.6M citations

73% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20233
20226
202112
202017
20198
201822