Sciweavers

502 search results - page 33 / 101
» Efficient Structured Data Access in Parallel File Systems
Sort
View
ICDCS
2007
IEEE
14 years 18 days ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
USENIX
1996
13 years 10 months ago
Transparent Fault Tolerance for Parallel Applications on Networks of Workstations
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
Daniel J. Scales, Monica S. Lam
ICS
2000
Tsinghua U.
14 years 9 days ago
Push vs. pull: data movement for linked data structures
As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetchin...
Chia-Lin Yang, Alvin R. Lebeck
ISCAPDCS
2001
13 years 10 months ago
AMOS-SDDS: A Scalable Distributed Data Manager for Windows Multicomputers
Known parallel DBMS offer at present only static partitioning schemes. Adding a storage node is then a cumbersome operation that typically requires the manual data redistribution....
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...
PODC
2010
ACM
13 years 10 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer