Sciweavers

122 search results - page 22 / 25
» Using Disjoint Reachability for Parallelization
Sort
View
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
11 years 9 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...
AIPS
2008
13 years 9 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
PPOPP
2009
ACM
14 years 8 months ago
MPIWiz: subgroup reproducible replay of mpi applications
Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has alway...
Ruini Xue, Xuezheng Liu, Ming Wu, Zhenyu Guo, Weng...
IPPS
2010
IEEE
13 years 5 months ago
Out-of-core distribution sort in the FG programming environment
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
Priya Natarajan, Thomas H. Cormen, Elena Riccio St...
ICDCS
2008
IEEE
14 years 1 months ago
Distributed Divide-and-Conquer Techniques for Effective DDoS Attack Defenses
Distributed Denial-of-Service (DDoS) attacks have emerged as a popular means of causing mass targeted service disruptions, often for extended periods of time. The relative ease an...
Muthusrinivasan Muthuprasanna, Govindarasu Manimar...