Sciweavers

4866 search results - page 161 / 974
» UML for Global Computing
Sort
View
DAC
2002
ACM
16 years 5 months ago
Towards global routing with RLC crosstalk constraints
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
James D. Z. Ma, Lei He
ISVLSI
2006
IEEE
115views VLSI» more  ISVLSI 2006»
15 years 10 months ago
Performance and Power Analysis of Globally Asynchronous Locally Synchronous Multi-Processor Systems
This paper investigates the performance and power dissipation of Globally Asynchronous Locally Synchronous (GALS) multi-processor systems. We show that communication loops are a s...
Zhiyi Yu, Bevan M. Baas
PLDI
2006
ACM
15 years 10 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
ASAP
2005
IEEE
135views Hardware» more  ASAP 2005»
15 years 10 months ago
Via-Aware Global Routing for Good VLSI Manufacturability and High Yield
CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in w...
Yang Yang, Tong Jing, Xianlong Hong, Yu Hu, Qi Zhu...
HAPTICS
2005
IEEE
15 years 10 months ago
A Closest Point Algorithm for Parametric Surfaces with Global Uniform Asymptotic Stability
— We present an algorithm that determines the point on a convex parametric surface patch that is closest to a given (possibly moving) point. Any initial point belonging to the su...
Volkan Patoglu, R. Brent Gillespie