Sciweavers

116 search results - page 10 / 24
» Fundamental Network Processor Performance Bounds
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
ISCA
2003
IEEE
157views Hardware» more  ISCA 2003»
14 years 6 hour ago
Pipeline Damping: A Microarchitectural Technique to Reduce Inductive Noise in Supply Voltage
Scaling of CMOS technology causes the power supply voltages to fall and supply currents to rise at the same time as operating speeds are increasing. Falling supply voltages cause ...
Michael D. Powell, T. N. Vijaykumar
IPPS
2009
IEEE
14 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
EUROPAR
2005
Springer
14 years 7 days ago
Dynamic Page Migration Under Brownian Motion
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
Marcin Bienkowski, Miroslaw Korzeniowski
SIROCCO
2000
13 years 8 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman