Sciweavers

92 search results - page 8 / 19
» Bottleneck Domination and Bottleneck Independent Domination ...
Sort
View
PODC
2010
ACM
14 years 26 days ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
ICS
2004
Tsinghua U.
14 years 4 months ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
INFOCOM
2003
IEEE
14 years 4 months ago
Receiver-Driven Bandwidth Sharing for TCP
— Applications using TCP, such as web-browsers, ftp, and various P2P programs, dominate most of the Internet traffic today. In many cases the last-hop access links are bottlenec...
Puneet Mehra, Christophe De Vleeschouwer, Avideh Z...
WWW
2006
ACM
14 years 11 months ago
Why is connectivity in developing regions expensive: policy challenges more than technical limitations?
I present analysis examining some of the causes of poor connectivity in developing countries. Based on a technoeconomic analysis and design, I show that technical limitations per ...
Rahul Tongia
ICCAD
2003
IEEE
119views Hardware» more  ICCAD 2003»
14 years 7 months ago
Analytical Bound for Unwanted Clock Skew due to Wire Width Variation
Under modern VLSI technology, process variations greatly affect circuit performance, especially clock skew which is very timing sensitive. Unwanted skew due to process variation f...
Anand Rajaram, Bing Lu, Wei Guo, Rabi N. Mahapatra...