Sciweavers

370 search results - page 13 / 74
» The perfectly synchronized round-based model of distributed ...
Sort
View
PODC
1999
ACM
13 years 11 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
IPPS
2007
IEEE
14 years 1 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
IPPS
2000
IEEE
13 years 11 months ago
Declarative Concurrency in Java
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...
Rafael Ramirez, Andrew E. Santosa
LCTRTS
2010
Springer
13 years 5 months ago
Translating concurrent action oriented specifications to synchronous guarded actions
Concurrent Action-Oriented Specifications (CAOS) model the behavior of a synchronous hardware circuit as asynchronous guarded at an abstraction level higher than the Register Tran...
Jens Brandt, Klaus Schneider, Sandeep K. Shukla
IPPS
2007
IEEE
14 years 1 months ago
ParalleX: A Study of A New Parallel Computation Model
This paper proposes the study of a new computation model that attempts to address the underlying sources of performance degradation (e.g. latency, overhead, and starvation) and th...
Guang R. Gao, Thomas L. Sterling, Rick Stevens, Ma...