116 search results - page 14 / 24 » Fundamental Network Processor Performance Bounds |
IPPS
2005
IEEE
14 years 9 days ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
IPL
1998
13 years 6 months ago
1998
We propose, and justify, an economic theory to guide memory system design, operation, and analysis. Our theory treats memory random-access latency, and its cost per installed mega...
TCOM
2010
13 years 5 months ago
2010
—Accurate positional information is essential for many applications in wireless networks. Time-of-arrival (TOA) and angle-of-arrival (AOA) are the two most commonly used signal m...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...
SIGCOMM
2012
ACM
11 years 9 months ago
2012
ACM
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...