ICCAD 2006 - PDF Preprint Papers

ICCAD 2006 International Conference on Computer-Aided Design

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICCAD-2006 Paper

click to vote

ICCAD
2006
IEEE

304views Hardware» more ICCAD 2006»

Trunk decomposition based global routing optimization

14 years 9 months ago

Download www.cecs.uci.edu

We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...

Devang Jariwala, John Lillis

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	304	Trunk decomposition based global routing optimization	claim
2	208	Automation in mixed-signal design: challenges and solutions in the wake of the nano era	claim
3	190	Factor cuts	claim
4	189	Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems	claim
5	184	Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs	claim
6	183	Soft error derating computation in sequential circuits	claim
7	180	A bitmask-based code compression technique for embedded systems	claim
8	177	Fast and accurate transaction level models using result oriented modeling	claim
9	177	Application-specific customization of parameterized FPGA soft-core processors	claim
10	169	Microarchitecture parameter selection to optimize system performance under process variation	claim
11	165	A fast block structure preserving model order reduction for inverse inductance circuits	claim
12	157	From single core to multi-core: preparing for a new exponential	claim
13	155	Adaptive multi-domain thermal modeling and analysis for integrated circuit synthesis and design	claim
14	152	System-wide energy minimization for real-time tasks: lower bound and approximation	claim
15	152	Performance-oriented statistical parameter reduction of parameterized systems via reduced rank regression	claim
16	152	Fast and robust quadratic placement combined with an exact linear net model	claim
17	152	CMOS-MEMS integration: why, how and what?	claim
18	150	Conjoining soft-core FPGA processors	claim
19	150	Design and integration methods for a multi-threaded dual core 65nm Xeon® processor	claim
20	149	Thermal sensor allocation and placement for reconfigurable systems	claim
21	149	Fast decap allocation based on algebraic multigrid	claim
22	147	Analysis and modeling of CD variation for statistical static timing	claim
23	146	An analytical model for negative bias temperature instability	claim
24	146	Cost-aware synthesis of asynchronous circuits based on partial acknowledgement	claim
25	143	Molecular organic electronic circuits	claim
26	141	An accurate sparse matrix based framework for statistical static timing analysis	claim
27	141	Design optimization for single-event upset robustness using simultaneous dual-VDD and sizing techniques	claim
28	141	A code refinement methodology for performance-improved synthesis from C	claim
29	141	Algorithms for MIS vector generation and pruning	claim
30	140	Efficient Boolean characteristic function for fast timed ATPG	claim
31	139	Analog placement with symmetry and other placement constraints	claim
32	138	Analytical modeling of SRAM dynamic stability	claim
33	138	Stepping forward with interpolants in unbounded model checking	claim
34	137	Yield prediction for 3D capacitive interconnections	claim
35	136	An electrothermally-aware full-chip substrate temperature gradient evaluation methodology for leakage dominant technologies with implications for power estimation and hot-spot management	claim
36	135	Efficient process-hotspot detection using range pattern matching	claim
37	134	A delay fault model for at-speed fault simulation and test generation	claim
38	133	Stable and compact inductance modeling of 3-D interconnect structures	claim
39	133	An adaptive two-level management for the flash translation layer in embedded systems	claim
40	132	Exploiting soft redundancy for error-resilient on-chip memory design	claim
41	132	Clock buffer polarity assignment for power noise reduction	claim
42	131	Fast wire length estimation by net bundling for block placement	claim
43	131	High-level synthesis challenges and solutions for a dynamically reconfigurable processor	claim
44	130	Timing-driven placement for heterogeneous field programmable gate array	claim
45	130	On bounding the delay of a critical path	claim
46	129	Near-term industrial perspective of analog CAD	claim
47	129	Energy budgeting for battery-powered sensors with a known task schedule	claim
48	129	A high-quality mixed-size analytical placer considering preplaced blocks and density constraints	claim
49	128	Improvements to combinational equivalence checking	claim
50	127	Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization	claim
51	127	Importance of volume discretization of single and coupled interconnects	claim
52	127	Platform-based resource binding using a distributed register-file microarchitecture	claim
53	126	Optimizing yield in global routing	claim
54	126	Exploring linear structures of critical path delay faults to reduce test efforts	claim
55	125	Performances improvement of FPGA using novel multilevel hierarchical interconnection structure	claim
56	125	Performance analysis of concurrent systems with early evaluation	claim
57	125	Leveraging protocol knowledge in slack matching	claim
58	124	A linear-time approach for static timing analysis covering all process corners	claim
59	124	Robust system level design with analog platforms	claim
60	124	Combinatorial algorithms for fast clock mesh optimization	claim
61	124	Simultaneous power and thermal integrity driven via stapling in 3D ICs	claim
62	124	Prospects for emerging nanoelectronics in mainstream information processing systems	claim
63	123	A network-flow approach to timing-driven incremental placement for ASICs	claim
64	123	A revisit to floorplan optimization by Lagrangian relaxation	claim
65	122	Fill for shallow trench isolation CMP	claim
66	122	Network coding for routability improvement in VLSI	claim
67	121	Carbon nanotube transistor circuits: models and tools for design and performance optimization	claim
68	119	Energy management for real-time embedded systems with reliability requirements	claim
69	119	Post-placement voltage island generation	claim
70	119	Automatic memory reductions for RTL model verification	claim
71	119	FastRoute: a step to integrate global routing into placement	claim
72	119	Dynamic power management using machine learning	claim
73	118	Design automation for analog: the next generation of tool challenges	claim
74	117	Post-routing redundant via insertion and line end extension with via density consideration	claim
75	117	A timing dependent power estimation framework considering coupling	claim
76	116	Enhanced error vector magnitude (EVM) measurements for testing WLAN transceivers	claim
77	115	Thermal characterization and optimization in platform FPGAs	claim
78	115	Handling inductance in early power grid verification	claim
79	114	Studying a GALS FPGA architecture using a parameterized automatic design flow	claim
80	113	A novel framework for faster-than-at-speed delay test considering IR-drop effects	claim
81	113	Design and CAD challenges in 45nm CMOS and beyond	claim
82	113	Layer minimization of escape routing in area array packaging	claim
83	113	A framework for statistical timing analysis using non-linear delay and slew models	claim
84	113	A new statistical max operation for propagating skewness in statistical timing analysis	claim
85	113	Organic electronic device modeling at the nanoscale	claim
86	112	A new RLC buffer insertion algorithm	claim
87	111	State re-encoding for peak current minimization	claim
88	111	UML for ESL design: basic principles, tools, and applications	claim
89	111	Mapping arbitrary logic functions into synchronous embedded memories for area reduction on FPGAs	claim
90	111	An efficient technique for synthesis and optimization of polynomials in GF(2m)	claim
91	111	Accelerating high-level bounded model checking	claim
92	110	Information processing in nanoscale arrays: DNA assembly, molecular devices, nano-array architectures	claim
93	110	Voltage island aware floorplanning for power and timing optimization	claim
94	108	Soft error reduction in combinational logic using gate resizing and flipflop selection	claim
95	108	Formal model of data reuse analysis for hierarchical memory organizations	claim
96	108	From molecular interactions to gates: a systematic approach	claim
97	107	Current path analysis for electrostatic discharge protection	claim
98	107	Decoupling capacitor planning and sizing for noise and leakage reduction	claim
99	106	Wire density driven global routing for CMP variation and timing	claim
100	106	Counterflow pipelining: architectural support for preemption in asynchronous systems using anti-tokens	claim
101	105	An optimal simultaneous diode/jumper insertion algorithm for antenna fixing	claim
102	104	Fullwave volumetric Maxwell solver using conduction modes	claim
103	104	Dynamic voltage and frequency management based on variable update intervals for frequency setting	claim
104	103	A statistical framework for post-silicon tuning through body bias clustering	claim
105	102	Optimal memoryless encoding for low power off-chip data buses	claim
106	102	From micro to nano: MEMS as an interface to the nano world	claim
107	101	Leakage power dependent temperature estimation to predict thermal runaway in FinFET circuits	claim
108	101	A unified non-rectangular device and circuit simulation model for timing and power	claim
109	101	Temperature-aware leakage minimization technique for real-time systems	claim
110	101	Guaranteeing performance yield in high-level synthesis	claim
111	101	A spectrally accurate integral equation solver for molecular surface electrostatics	claim
112	101	Thermal-induced leakage power optimization by redundant resource allocation	claim
113	100	Nanowire addressing with randomized-contact decoders	claim
114	100	Faster, parametric trajectory-based macromodels via localized linear reductions	claim
115	100	Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search	claim
116	99	Information theoretic approach to address delay and reliability in long on-chip interconnects	claim
117	99	Variability and yield improvement: rules, models, and characterization	claim
118	99	Runtime distribution-aware dynamic voltage scaling	claim
119	98	On the use of Bloom filters for defect maps in nanocomputing	claim
120	96	Application-independent defect-tolerant crossbar nano-architectures	claim
121	96	Loop pipelining for high-throughput stream computation using self-timed rings	claim
122	96	Technology migration techniques for simplified layouts with restrictive design rules	claim
123	96	Cache miss clustering for banked memory systems	claim
124	95	Timing model reduction for hierarchical timing analysis	claim
125	95	Robust estimation of parametric yield under limited descriptions of uncertainty	claim
126	93	Precise identification of the worst-case voltage drop conditions in power grid verification	claim
127	91	Verification of analog/mixed-signal circuits using labeled hybrid petri nets	claim
128	88	Practical variation-aware interconnect delay and slew analysis for statistical timing verification	claim
129	71	Using CAD to shape experiments in molecular QCA	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers