Sciweavers

25 search results - page 2 / 5
» Chromatic capacity and graph operations
Sort
View
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
13 years 11 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...
TON
2008
122views more  TON 2008»
13 years 5 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
INFOCOM
2006
IEEE
13 years 11 months ago
On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
Vivek Vishnumurthy, Paul Francis
USENIX
2007
13 years 7 months ago
A Comparison of Structured and Unstructured P2P Approaches to Heterogeneous Random Peer Selection
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
Vivek Vishnumurthy, Paul Francis
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
13 years 11 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth