Sciweavers

613 search results - page 14 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
PODC
2009
ACM
15 years 7 months ago
The weakest failure detector for solving k-set agreement
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
Eli Gafni, Petr Kuznetsov
CC
2010
Springer
172views System Software» more  CC 2010»
15 years 9 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
ICCS
2005
Springer
15 years 8 months ago
Dynamic Memory Management in the Loci Framework
Abstract. Resource management is a critical concern in high-performance computing software. While management of processing resources to increase performance is the most critical, e...
Yang Zhang, Edward A. Luke
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 8 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu
SIAMCOMP
2008
148views more  SIAMCOMP 2008»
15 years 28 days ago
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...