Sciweavers

3838 search results - page 4 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 1 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
15 years 2 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
79
Voted
TOPNOC
2008
14 years 9 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
DAC
2009
ACM
15 years 10 months ago
Flip-chip routing with unified area-I/O pad assignments for package-board co-design
In this paper, we present a novel flip-chip routing algorithm for package-board co-design. Unlike the previous works that can consider only either free- or pre-assignment routing,...
Jia-Wei Fang, Martin D. F. Wong, Yao-Wen Chang