Sciweavers

6939 search results - page 443 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
ICPP
2006
IEEE
15 years 10 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
CCGRID
2003
IEEE
15 years 9 months ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...
PPOPP
2012
ACM
13 years 12 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
MIDDLEWARE
2004
Springer
15 years 9 months ago
Ganymed: Scalable Replication for Transactional Web Applications
Data grids, large scale web applications generating dynamic content and database service providing pose significant scalability challenges to database engines. Replication is the ...
Christian Plattner, Gustavo Alonso
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 9 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...