Sciweavers

1095 search results - page 205 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
DEBS
2007
ACM
13 years 11 months ago
Modeling the communication costs of content-based routing: the case of subscription forwarding
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, ...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
ICDCS
2009
IEEE
13 years 5 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
PODC
2009
ACM
14 years 8 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
IPPS
2008
IEEE
14 years 1 months ago
PROD: Relayed file retrieving in overlay networks
— To share and exchange the files among Internet users, Peerto-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P fil...
Zhiyong Xu, D. Stefanescu, Honggang Zhang, Laxmi N...
COREGRID
2007
Springer
14 years 1 months ago
Total Exchange Performance Prediction on Grid Environments
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have b...
Luiz Angelo Steffenel, Emmanuel Jeannot