Sciweavers

272 search results - page 4 / 55
» On Efficient Models for Model Checking Message-Passing Distr...
Sort
View
WOA
2001
14 years 11 months ago
A Contract Decommitment Protocol for Automated Negotiation in Time Variant Environments
Negotiation is a fundamental mechanism in distributed multi-agent systems. Since negotiation is a time-spending process, in many scenarios agents have to take into account the pas...
Federico Bergenti, Agostino Poggi, Matteo Somacher
HIPS
1998
IEEE
15 years 1 months ago
Constructive and Adaptable Distributed Shared Memory
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system ...
Jordi Bataller, José M. Bernabéu-Aub...
JCP
2006
100views more  JCP 2006»
14 years 9 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
110
Voted
WAN
1998
Springer
15 years 1 months ago
Performance Analysis of Wavefront Algorithms on Very-Large Scale Distributed Systems
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
Adolfy Hoisie, Olaf M. Lubeck, Harvey J. Wasserman
112
Voted
PLDI
2012
ACM
12 years 12 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