Sciweavers

1906 search results - page 222 / 382
» Dependable Self-Hosting Distributed Systems Using Constraint...
Sort
View
123
Voted
IQIS
2004
ACM
15 years 9 months ago
A Framework for Analysis of Data Freshness
Data freshness has been identified as one of the most important data quality attributes in information systems. This importance increases particularly in the context of distribute...
Mokrane Bouzeghoub, Verónika Peralta
CCS
2009
ACM
15 years 11 months ago
NISAN: network information service for anonymization networks
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
Andriy Panchenko, Stefan Richter, Arne Rache
159
Voted
SIGSOFT
1994
ACM
15 years 8 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
15 years 10 months ago
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
EUROPAR
2004
Springer
15 years 9 months ago
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis