Sciweavers

165 search results - page 3 / 33
» Graph Partitioning Based on Link Distributions
Sort
View
MOBICOM
2006
ACM
13 years 11 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
PODC
2010
ACM
13 years 9 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
ICC
2007
IEEE
139views Communications» more  ICC 2007»
13 years 11 months ago
Distributed Link Scheduling for TDMA Mesh Networks
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
Petar Djukic, Shahrokh Valaee
PLDI
2003
ACM
13 years 10 months ago
Region-based hierarchical operation partitioning for multicluster processors
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
Michael L. Chu, Kevin Fan, Scott A. Mahlke
IPPS
2008
IEEE
13 years 11 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri