Sciweavers

1461 search results - page 152 / 293
» Comparing the Optimal Performance of Parallel Architectures
Sort
View
127
Voted
ICS
1995
Tsinghua U.
15 years 7 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
168
Voted
PEWASUN
2008
ACM
15 years 4 months ago
Communication models for throughput optimization in mesh networks
There has been extensive research focused on maximizing the throughput of wireless networks in general and mesh networks in particular. Recently, techniques have been developed th...
Stephan Bohacek, Peng Wang
IEEEPACT
2000
IEEE
15 years 7 months ago
Global Register Partitioning
Modern computers have taken advantage of the instruction-level parallelism (ILP) available in programs with advances in both architecture and compiler design. Unfortunately, large...
Jason Hiser, Steve Carr, Philip H. Sweany
118
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
125
Voted
TVLSI
2008
139views more  TVLSI 2008»
15 years 3 months ago
Ternary CAM Power and Delay Model: Extensions and Uses
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
Banit Agrawal, Timothy Sherwood