Sciweavers

292 search results - page 41 / 59
» Objects Shared by Byzantine Processes
Sort
View
NRHM
2000
149views more  NRHM 2000»
13 years 8 months ago
Navigable history: a reader's view of writer's time
Collecting, analyzing, and sharing information via a hypertext results in the continuous modification of information content over a long period of time. Such tasks will benefit fr...
Frank M. Shipman III, Hao-wei Hsieh
PLDI
2012
ACM
11 years 11 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
HPDC
2010
IEEE
13 years 9 months ago
Scalability of communicators and groups in MPI
As the number of cores inside compute clusters continues to grow, the scalability of MPI (Message Passing Interface) is important to ensure that programs can continue to execute o...
Humaira Kamal, Seyed M. Mirtaheri, Alan Wagner
AGIS
2008
319views more  AGIS 2008»
13 years 8 months ago
An Efficient Algorithm for Raster-to-Vector Data Conversion
Data conversion from raster to vector (R2V) is a key function in Geographic Information Systems (GIS) and remote sensing (RS) image processing for integrating GIS and RS data. The...
Junhua Teng, Fahui Wang, Yu Liu
MOBICOM
2004
ACM
14 years 2 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu