Sciweavers

491 search results - page 55 / 99
» Parallel Implementation of a Generalized Conjugate Gradient ...
Sort
View
ANCS
2009
ACM
13 years 5 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
SPAA
2003
ACM
14 years 26 days ago
Nonblocking k-compare-single-swap
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
Victor Luchangco, Mark Moir, Nir Shavit
DAC
2005
ACM
14 years 8 months ago
Multi-threaded reachability
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
SPAA
2010
ACM
14 years 13 days ago
Flat combining and the synchronization-parallelism tradeoff
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
ICDCS
1998
IEEE
13 years 12 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen