Cooperating Sequential Processes

Dijkstra, Edsger W.

doi:10.1007/978-1-4757-3472-0_2

Cited by 802 publications

(504 citation statements)

References 0 publications

Supporting

Mentioning

493

Contrasting

Unclassified

Order By: Relevance

“…Other (educational) problems from the field of logic (e.g., the muddy children problem [8]) and from the field of distributed problem solving (e.g., the mutual exclusion problem [6]) do not have all these advantages. The muddy children problem is scalable, and simulating the environment is easy, but the problem is heavy in terms of reasoning.…”

Section: Discussionmentioning

confidence: 99%

The Distributed Weighing Problem: A Lesson in Cooperation Without Communication

Bosse

Hoogendoorn

Jonker

2005

Multiagent System Technologies

View full text Add to dashboard Cite

Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are complex and difficult to model, and therefore not suitable for education. This paper presents the distributed weighing problem as a novel problem to be used for educational purposes within the domain of cooperation without communication. An example agent-based architecture is developed of which parts can be provided to students as a starting-point for practical exercises in cooperative problem solving without communication. Two example strategies are discussed and implemented using this example architecture. Moreover, it is shown how such strategies can be tested and formally validated against a number of desired properties. The educational benefits of the distributed weighing problem are presented as observed in a course for 6 groups of each 3 students.

show abstract

Section: Discussionmentioning

confidence: 99%

The Distributed Weighing Problem: A Lesson in Cooperation Without Communication

Bosse

Hoogendoorn

Jonker

2005

Multiagent System Technologies

View full text Add to dashboard Cite

show abstract

“…For that, we have considered four wellknown mutual exclusion protocols designed for the SC semantics: Dekker's [5], Lamport's [12], Peterson's [16], and Szymanski's [18]. All of these protocols are incorrect under TSO.…”

Section: Methodsmentioning

confidence: 99%

Getting Rid of Store-Buffers in TSO Analysis

Atig

Bouajjani

Parlato

2011

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. We propose an approach for reducing the TSO reachability analysis of concurrent programs to their SC reachability analysis, under some conditions on the explored behaviors. First, we propose a linear code-to-code translation that takes as input a concurrent program P and produces a concurrent program P such that, running P under SC yields the same set of reachable (shared) states as running P under TSO with at most k context-switches for each thread, for a fixed k. Basically, we show that it is possible to use only O(k) additional copies of the shared variables of P as local variables to simulate the store buffers, even if they are unbounded. Furthermore, we show that our translation can be extended so that an unbounded number of context-switches is possible, under the condition that each write operation sent to the store buffer stays there for at most k contextswitches of the thread. Experimental results show that bugs due to TSO can be detected with small bounds, using off-the-shelf SC analysis tools.

show abstract

“…In programming languages, concurrency control is based upon the concept of the co-ordination of a set of cooperating processes by synchronisation. Language constructs such as semaphores [96], monitors [97], mutual exclusion [98], path expressions [99] and message passing [100] have been provided to support this concept. By contrast, in databases, concurrency is viewed as a system efficiency activity which allows parallel execution and parallel access to the data.…”

Section: Concurrency Control and Transactionsmentioning

confidence: 99%

The Napier88 Persistent Programming Language and Environment

Morrison

Connor

Kirby

et al. 2000

Fully Integrated Data Environments

View full text Add to dashboard Cite

Abstract. Persistent programming systems are designed as an implementation technology for long lived, concurrently accessed and potentially large bodies of data and programs, known here as persistent application systems (PASs). Within a PAS the persistence concept is used to abstract over the physical properties of data such as where it is kept, how long it is kept and in what form it is kept. As such it is seen as having a number of benefits in simplifying the task of PAS programming. Here, we describe the integrated design of the Napier88 persistent programming system and how Napier88 may be used to develop PASs.

show abstract

Cooperating Sequential Processes

Cited by 802 publications

References 0 publications

The Distributed Weighing Problem: A Lesson in Cooperation Without Communication

The Distributed Weighing Problem: A Lesson in Cooperation Without Communication

Getting Rid of Store-Buffers in TSO Analysis

The Napier88 Persistent Programming Language and Environment

Contact Info

Product

Resources

About