Filters








69 Hits in 4.7 sec

A parallel Steiner tree heuristic for macro cell routing

Christian Fobel, Gary Grewal
2008 2008 IEEE International Conference on Computer Design  
In this paper, a two-phase, parallel (multiprocessor) algorithm is proposed for quickly constructing a diverse pool of high-quality Steiner trees for routing of multiterminal nets.  ...  Global routing of macro cells remains an important but time-consuming step in the VLSI design cycle.  ...  Finding a global route then becomes equivalent to finding a minimum-cost subtree in the routing graph that spans all of the terminal vertices.  ... 
doi:10.1109/iccd.2008.4751836 dblp:conf/iccd/FobelG08 fatcat:jjvgnnakjbemjiouzc3hrjd3k4

Page 5111 of Mathematical Reviews Vol. , Issue 911 [page]

1991 Mathematical Reviews  
D. (1-MND) Multiterminal global routing: a deterministic approximation scheme.  ...  Summary: “We consider the problem of routing multiterminal nets in a two-dimensional gate-array.  ... 

Board-level multiterminal net assignment for the partial cross-bar architecture

Xiaoyu Song, W.N.N. Hung, A. Mishchenko, M. Chrzanowska-Jeske, A. Kennings, A. Coppola
2003 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems.  ...  The approach transforms the FPGA board-level routing task into a single, large Boolean equation with the property that any assignment of input variables that satisfies the equation specifies a valid routing  ...  A multiterminal board level routing problem (BLRP) is defined as follows.  ... 
doi:10.1109/tvlsi.2003.812322 fatcat:co7brzurtzcy3h2jyy4hzkaory

Board-level multiterminal net assignment

Xiaoyu Song, William N. N. Hung, Alan Mishchenko, Malgorzata Chrzanowska-Jeske, Alan Coppola, Andrew Kennings
2002 Proceedings of the 12th ACM Great Lakes Symposium on VLSI - GLSVLSI '02  
The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems.  ...  The approach transforms the FPGA board-level routing task into a single, large Boolean equation with the property that any assignment of input variables that satisfies the equation specifies a valid routing  ...  A multiterminal board level routing problem (BLRP) is defined as follows.  ... 
doi:10.1145/505334.505335 fatcat:o5ogprsganbtpolodaoe2marwu

Board-level multiterminal net assignment

Xiaoyu Song, William N. N. Hung, Alan Mishchenko, Malgorzata Chrzanowska-Jeske, Alan Coppola, Andrew Kennings
2002 Proceedings of the 12th ACM Great Lakes Symposium on VLSI - GLSVLSI '02  
The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems.  ...  The approach transforms the FPGA board-level routing task into a single, large Boolean equation with the property that any assignment of input variables that satisfies the equation specifies a valid routing  ...  A multiterminal board level routing problem (BLRP) is defined as follows.  ... 
doi:10.1145/505306.505335 dblp:conf/glvlsi/SongHMCCK02 fatcat:kqbs6krqovamxbjrne3hyeffli

Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach [article]

Sreeram Kannan, Pramod Viswanath
2011 arXiv   pre-print
Our main result is the approximate optimality of a simple layering principle: local physical-layer schemes combined with global routing.  ...  The key technical idea is the modeling of a wireless network by an undirected "polymatroidal" network, for which we establish a max-flow min-cut approximation theorem.  ...  information is routed globally.  ... 
arXiv:1111.4768v1 fatcat:z4ewzy6n7rbupccwbxyhqysfha

Fundamentals of Green Communications and Computing: Modeling and Simulation

Murat Kocaoglu, Derya Malak, Ozgur B. Akan
2012 Computer  
Cov er Fe at ure routes does not minimize CO 2 emissions because different components use different energy sources.  ...  serve as a springboard for developing techniques to achieve that limit.  ...  At present, to ensure fair channel access among multiple users, most networks rely on deterministic channel-allocation schemes (for example, time division multiple access) or random access techniques,  ... 
doi:10.1109/mc.2012.248 fatcat:ksosrnsdsvbtllpuiqbjpw7x7u

Algorithm Engineering for Cut Problems [article]

Alexander Noe
2021 arXiv   pre-print
This work develops highly-efficient algorithms for the (global) minimum cut problem, the balanced graph partitioning problem and the multiterminal cut problem.  ...  There is a multitude of cut or partitioning problems that have been the focus of research for multiple decades.  ...  Li and Panigrahi [128] give a deterministic algorithm that finds a global minimum cut on weighted graphs in O m1+ plus poly-logarithmic maximum flows for any constant  > 0.  ... 
arXiv:2108.04566v1 fatcat:4tpyybkhsvg6toiuxkvdvychqu

Side Information Aware Coding Strategies for Sensor Networks

S.C. Draper, G.W. Wornell
2004 IEEE Journal on Selected Areas in Communications  
They have a successive coding structure that gives an inherently less complex way to attain a number of prior results, as well as some novel results, for the Chief Executive Officer problem, multiterminal  ...  The strategies have a modular and decentralized architecture.  ...  A sensor network is shown consisting of nine sensor nodes and tree-structured data routing.  ... 
doi:10.1109/jsac.2004.830875 fatcat:6x6yzyqsnrgijpbgjmufveyl3i

Recent advances in VLSI layout

E.S. Kuh, T. Ohtsuki
1990 Proceedings of the IEEE  
Recent advances in floorplanning and placement and in global and detailed routing pertinent to these design styles are reviewed.  ...  The former has received a great deal of attention among computer scientists and has found interesting applications in gridless routing and compaction.  ...  For a multiterminal net, the half-perimeter length is, at best, a crude approximation.  ... 
doi:10.1109/5.52212 fatcat:ffytetht4relvc3td7j54r4neu

Euclidean Information Theory of Networks [article]

Shao-Lun Huang, Changho Suh, Lizhong Zheng
2015 arXiv   pre-print
For a given network, we construct a novel deterministic model that quantifies the ability of the network in transmitting private and common messages across users.  ...  With this deterministic model, we also investigate the role of feedback for multi-layer networks, from which we identify a variety of scenarios in which feedback can improve transmission efficiency.  ...  First observe that we use the routing-only scheme to pass information through the network.  ... 
arXiv:1505.04673v3 fatcat:mcwqohcnlbalbmu2ilu3oseksq

Further Research on Node Based Bottleneck Improvement Problem for Multicut [chapter]

Xiucui Guan, Jie Su
2006 Lecture Notes in Computer Science  
ECCO was started in 1987 by a group of leading experts in Operations Research and Management Science.  ...  ECCO wants to provide a forum for researchers in combinatorial optimization, either in its theoretical aspects or in business, industry or public administration applications.  ...  We propose a general framework to formulate and solve these problems. We report computational results on a variety of test problems.  ... 
doi:10.1007/11816157_107 fatcat:xjdnf4kesrbczoh4ilvxxixqei

Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control

2005 IEEE Journal on Selected Areas in Communications  
Under the rigorous framework of nonlinearly constrained utility maximization, we prove the convergence of this coupled algorithm to the global optimum of joint power control and congestion control, for  ...  This paper presents a step toward a systematic understanding of "layering" as "optimization decomposition," where the overall communication network is modeled by a generalized network utility maximization  ...  The set of possible physical layer resource allocation schemes is represented by , that of possible scheduling or contention based medium access schemes by , and that of single-path or multipath routing  ... 
doi:10.1109/jsac.2004.837347 fatcat:o5mt77kcnbalrftjyn4ul7uwiq

Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners [article]

Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2022 arXiv   pre-print
Moreover, usually by "good" path we mean a path whose weight approximates the original distance between its endpoints – but a priori the number of edges (or "hops") in the path could be huge.  ...  distances to within a factor of 1+ϵ, for any ϵ > 0.  ...  Compact routing schemes A routing scheme is a distributed algorithm for delivering packets of information from any given source node to any specified destination in a given network.  ... 
arXiv:2107.14221v2 fatcat:dwdkmbygvzggvm5zz372xbalhm

The two-unicast problem [article]

Sudeep Kamath, Venkat Anantharam, David Tse, Chih-Chun Wang
2015 arXiv   pre-print
We consider the communication capacity of wireline networks for a two-unicast traffic pattern.  ...  We propose a simple outer bound for the problem that we call the Generalized Network Sharing (GNS) bound.  ...  This has been improved to an approximation algorithm that approximates it to within an O(log k) factor in [38] . IV.  ... 
arXiv:1506.01105v1 fatcat:j5dsdg3unze45brkippxj6lxdy
« Previous Showing results 1 — 15 out of 69 results