Sciweavers

356 search results - page 3 / 72
» Parallelizing time with polynomial circuits
Sort
View
ICPP
1996
IEEE
13 years 11 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
14 years 9 days ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
DAC
2009
ACM
14 years 8 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
FSTTCS
2009
Springer
14 years 1 months ago
The Power of Depth 2 Circuits over Algebras
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
CONCUR
1998
Springer
13 years 11 months ago
It's About Time: Real-Time Logics Reviewed
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...
Thomas A. Henzinger