Concurrency in Ada
ACM Computing Surveys (CSUR)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Proceedings of the conference on TRI-Ada '97
Monitors: an operating system structuring concept
Communications of the ACM
The structure of the “THE”-multiprogramming system
Communications of the ACM
Patterns and the Democratization of Concurrent Programming
IEEE Concurrency
The Dining Philosophers in Ada 95
Ada-Europe '96 Proceedings of the 1996 Ada-Europe International Conference on Reliable Software Technologies
Petri nets based proofs of Ada 95 solution for preference control
APSEC '97 Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science Conference
Guide for the use of the Ada Ravenscar Profile in high integrity systems
ACM SIGAda Ada Letters
Concurrent Program Metrics Drawn by Quasar
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
A buffer container class hierarchy using Ada 2005
Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference
Weak Fairness Semantic Drawbacks in Java Multithreading
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Parallelism generics for Ada 2005 and beyond
Proceedings of the ACM SIGAda annual international conference on SIGAda
A new approach for concurrent program slicing
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Learning concurrency paradigms is necessary but it is not sufficient since the choice of run-time semantics may introduce subtle programming errors. It is the aim of this paper to exemplify the importance of process queuing and awaking policies resulting from possible choices of the monitor concept implementation.The first part of the paper compares the behaviour of concurrent processes sharing a unique waiting queue for condition synchronization when implemented in Java or in Ada. A particular solution of the dining philosophers paradigm will be used to show how the difference in the monitor semantics may lead or not to deadlock. This comparison provides insight for deriving a correct Java implementation. The second part of the paper shows how the implementation can be refined when using Ada entry families and requeue with requeue once restriction. The result is elegant, safe and fair, and deterministic. This paper ends with quantitative comparisons of concurrency complexity and of concurrency effectiveness.We conclude that Java and C# multithreading need defensive concurrent programming while Ada allows more latitude for developing correct concurrent programs.