Sciweavers

9 search results - page 1 / 2
» Concurrency Can't Be Observed, Asynchronously
Sort
View
APLAS
2010
ACM
13 years 1 months ago
Concurrency Can't Be Observed, Asynchronously
Abstract. The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the
Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Giac...
ENTCS
2008
153views more  ENTCS 2008»
13 years 4 months ago
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
Johan Dovland, Einar Broch Johnsen, Olaf Owe
ECAI
2006
Springer
13 years 8 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
COORDINATION
2007
Springer
13 years 11 months ago
Reactors: A Data-Oriented Synchronous/Asynchronous Programming Model for Distributed Applications
Our aim is to define the kernel of a simple and uniform programming model—the reactor model—suitable for building and evolving internet-scale programs. A reactor consists of t...
John Field, Maria-Cristina V. Marinescu, Christian...
DSN
2004
IEEE
13 years 8 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...