Sciweavers

153 search results - page 15 / 31
» An experimental study of greedy routing algorithms
Sort
View
ICS
1999
Tsinghua U.
15 years 1 months ago
Reorganizing global schedules for register allocation
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...
Gang Chen, Michael D. Smith
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
15 years 2 months ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu
ATS
2004
IEEE
87views Hardware» more  ATS 2004»
15 years 1 months ago
Low Power BIST with Smoother and Scan-Chain Reorder
In this paper, we propose a low-power testing methodology for the scan-based BIST. A smoother is included in the test pattern generator (TPG) to reduce average power consumption d...
Nan-Cheng Lai, Sying-Jyan Wang, Yu-Hsuan Fu
AOR
2010
14 years 7 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
GCC
2003
Springer
15 years 2 months ago
Improving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
Dongfeng Chen, Shoubao Yang