1720 search results - page 177 / 344 » Unranking Combinations in Parallel |
144
click to vote
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
131
click to vote
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
146
Voted
PDP
2005
IEEE
15 years 10 months ago
2005
IEEE
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
119
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
122
click to vote
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...