Cooperating Sequential Processes, Technical Report EWD-123January 1965
- Author:
- Edsger Wybe Dijkstra
Abstract
No abstract available.
Cited By
- Reveliotis S An MPC scheme for traffic coordination in open and irreversible, zone-controlled, guidepath-based transport systems 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE), (1782-1788)
- Batko P and Kuta M (2018). Actor model of Anemone functional language, The Journal of Supercomputing, 74:4, (1485-1496), Online publication date: 1-Apr-2018.
- Ricci A (2016). Programming with event loops and control loops - From actors to agents, Computer Languages, Systems and Structures, 45:C, (80-104), Online publication date: 1-Apr-2016.
- Kawakatsu T, Kinoshita A, Takasu A and Adachi J Divide-and-Conquer Parallelism for Learning Mixture Models Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVIII - Volume 9940, (23-47)
- Buhr P, Dice D and Hesselink W (2015). High-performance N-thread software solutions for mutual exclusion, Concurrency and Computation: Practice & Experience, 27:3, (651-701), Online publication date: 10-Mar-2015.
Morrison A and Afek Y Temporally Bounding TSO for Fence-Free Asymmetric Synchronization Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, (45-58)- Tassarotti J, Dreyer D and Vafeiadis V Verifying read-copy-update in a logic for weak memory Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, (110-120)
- Morrison A and Afek Y (2015). Temporally Bounding TSO for Fence-Free Asymmetric Synchronization, ACM SIGPLAN Notices, 50:4, (45-58), Online publication date: 12-May-2015.
- Morrison A and Afek Y (2015). Temporally Bounding TSO for Fence-Free Asymmetric Synchronization, ACM SIGARCH Computer Architecture News, 43:1, (45-58), Online publication date: 29-May-2015.
- Tassarotti J, Dreyer D and Vafeiadis V (2015). Verifying read-copy-update in a logic for weak memory, ACM SIGPLAN Notices, 50:6, (110-120), Online publication date: 7-Aug-2015.
- Nazeem A and Reveliotis S (2015). Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks, Discrete Event Dynamic Systems, 25:1-2, (31-63), Online publication date: 1-Jun-2015.
- Meshman Y, Rinetzky N and Yahav E Pattern-based synthesis of synchronization for the C++ memory model Proceedings of the 15th Conference on Formal Methods in Computer-Aided Design, (120-127)
- Turon A, Vafeiadis V and Dreyer D GPS Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, (691-707)
- Taft S, Moore B, Pinho L and Michell S Safe parallel programming in ada with language extensions Proceedings of the 2014 ACM SIGAda annual conference on High integrity language technology, (87-96)
- Taft S, Moore B, Pinho L and Michell S (2014). Safe parallel programming in ada with language extensions, ACM SIGAda Ada Letters, 34:3, (87-96), Online publication date: 26-Nov-2014.
- Turon A, Vafeiadis V and Dreyer D (2014). GPS, ACM SIGPLAN Notices, 49:10, (691-707), Online publication date: 31-Dec-2015.
- Ricci A From Actor Event-Loop to Agent Control-Loop Proceedings of the 4th International Workshop on Programming based on Actors Agents & Decentralized Control, (121-132)
- Rios J (2013). Algorithm 928, ACM Transactions on Mathematical Software, 39:3, (1-10), Online publication date: 1-Apr-2013.
- Hung W and Garg V AutoSynch Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, (253-262)
- Hung W and Garg V (2013). AutoSynch, ACM SIGPLAN Notices, 48:6, (253-262), Online publication date: 23-Jun-2013.
- Blelloch G, Fineman J, Gibbons P and Shun J Internally deterministic parallel algorithms can be fast Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, (181-192)
- Blelloch G, Fineman J, Gibbons P and Shun J (2012). Internally deterministic parallel algorithms can be fast, ACM SIGPLAN Notices, 47:8, (181-192), Online publication date: 11-Sep-2012.
- Kuperstein M, Vechev M and Yahav E (2011). Partial-coherence abstractions for relaxed memory models, ACM SIGPLAN Notices, 46:6, (187-198), Online publication date: 4-Jun-2011.
- Kuperstein M, Vechev M and Yahav E Partial-coherence abstractions for relaxed memory models Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (187-198)
- Sharma B, Bhatia R and Singh A DMX in MANETs Proceedings of the International Conference on Advances in Computing and Artificial Intelligence, (50-55)
- Felko I Simulation-based deadlock avoidance and optimization in bidirectional AGVS Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, (152-161)
- Atig M, Bouajjani A and Parlato G Getting rid of store-buffers in TSO analysis Proceedings of the 23rd international conference on Computer aided verification, (99-115)
- Vasudevan N, Namjoshi K and Edwards S Simple and fast biased locks Proceedings of the 19th international conference on Parallel architectures and compilation techniques, (65-74)
- Kuperstein M, Vechev M and Yahav E Automatic inference of memory fences Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design, (111-120)
- Sookoor T, Hnat T, Hooimeijer P, Weimer W and Whitehouse K Macrodebugging Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, (141-154)
- Smirnov A, Kashevnik A, Shilov N, Oliver I, Balandin S and Boldyrev S Anonymous Agent Coordination in Smart Spaces Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces, (42-51)
- Grogono P and Shearing B Concurrent software engineering Proceedings of the 2008 C3S2E conference, (99-108)
- Sethi M and Anand A On concurrency improvements in enterprise SOA middleware Proceedings of the ACM/IFIP/USENIX Middleware '08 Conference Companion, (42-47)
- Sánchez C, Sipma H and Manna Z A family of distributed deadlock avoidance protocols and their reachable state spaces Proceedings of the 10th international conference on Fundamental approaches to software engineering, (155-169)
- Lee J and Mooney V (2006). A Novel {O(n)} Parallel Banker's Algorithm for System-on-a-Chip, IEEE Transactions on Parallel and Distributed Systems, 17:12, (1377-1389), Online publication date: 1-Dec-2006.
- Boehm B A view of 20th and 21st century software engineering Proceedings of the 28th international conference on Software engineering, (12-29)
- Sánchez C, Sipma H, Manna Z and Gill C Efficient distributed deadlock avoidance with liveness guarantees Proceedings of the 6th ACM & IEEE International conference on Embedded software, (12-20)
- Sánchez C, Sipma H, Manna Z, Subramonian V and Gill C On efficient distributed deadlock avoidance for real-time and embedded systems Proceedings of the 20th international conference on Parallel and distributed processing, (133-133)
- Danturi P, Nesterenko M and Tixeuil S Self-stabilizing philosophers with generic conflicts Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems, (214-230)
- Sánchez C, Sipma H, Gill C and Manna Z Distributed priority inheritance for real-time and embedded systems Proceedings of the 10th international conference on Principles of Distributed Systems, (110-125)
- Chiang C (2005). Implicit heterogeneous and parallel programming, ACM SIGSOFT Software Engineering Notes, 30:3, (1-6), Online publication date: 1-May-2005.
- Lee J and Mooney V A novel O(n) parallel banker's algorithm for System-on-a-Chip Proceedings of the 2005 Asia and South Pacific Design Automation Conference, (1304-1308)
- Sánchez C, Sipma H, Subramonian V, Gill C and Manna Z Thread allocation protocols for distributed real-time and embedded systems Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (159-173)
- Lee J and Mooney V A novel deadlock avoidance algorithm and its hardware implementation Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, (200-205)
- Reynolds J Advancing learning goals Proceedings of the 34th conference on Winter simulation: exploring new frontiers, (1804-1808)
- Dijkstra E Cooperating sequential processes The origin of concurrent programming, (65-138)
- Levine G (2001). Conflict resolution for readers and writers, ACM SIGAda Ada Letters, XXI:2, (81-88), Online publication date: 1-Jun-2001.
- Zuberi K and Shin K (2001). EMERALDS, IEEE Transactions on Software Engineering, 27:10, (909-928), Online publication date: 1-Oct-2001.
- Zuberi K, Pillai P and Shin K EMERALDS Proceedings of the seventeenth ACM symposium on Operating systems principles, (277-299)
- Zuberi K, Pillai P and Shin K (1999). EMERALDS, ACM SIGOPS Operating Systems Review, 33:5, (277-299), Online publication date: 12-Dec-1999.
- Goubault E Schedulers as abstract interpretations of higher-dimensional automata Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (134-145)
- Hilzer R (1992). Synchronization of the producer/consumer problem using semaphores, monitors, and the Ada rendezvous, ACM SIGOPS Operating Systems Review, 26:3, (31-39), Online publication date: 1-Jul-1992.
- Bagheri B, Clark T and Scott L (1992). Pfortran, ACM SIGPLAN Fortran Forum, 11:3, (20-31), Online publication date: 1-Sep-1992.
- Stoyenko A, Hamacher V and Holt R (1991). Analyzing Hard-Real-Time Programs for Guaranteed Schedulability, IEEE Transactions on Software Engineering, 17:8, (737-750), Online publication date: 1-Aug-1991.
- Gingras A (1990). Dining philosophers revisited, ACM SIGCSE Bulletin, 22:3, (21-ff.), Online publication date: 1-Aug-1990.
- Xue X, Sun Z, Zhou J and Xu X (1990). A message-based distributed kernel for a full heterogeneous environment, Journal of Computer Science and Technology, 5:1, (47-56), Online publication date: 1-Jan-1990.
- Guzzi M, Hoeflinger J, Padua D and Lawrie D Cedar Fortran and other Vector and parallel Fortran dialects Proceedings of the 1988 ACM/IEEE conference on Supercomputing, (114-121)
- Fussell D, Kedem Z and Silberschatz A Deadlock removal using partial rollback in database systems Proceedings of the 1981 ACM SIGMOD international conference on Management of data, (65-73)
- Keller R and Sleep M Applicative caching Proceedings of the 1981 conference on Functional programming languages and computer architecture, (131-140)
- Georgiadis P, Papazoglou M and Maritsas D Towards a parallel SIMULA machine Proceedings of the 8th annual symposium on Computer Architecture, (263-278)
- Ryan K Software engineering and simulation Proceedings of the 11th conference on Winter simulation - Volume 2, (477-482)
- Daley J (1978). SIMBAS, ACM SIGSIM Simulation Digest, 10:1-2, (14-18), Online publication date: 1-Sep-1978.
- Russell D and Bredt T (1975). Error resynchronization in producer-consumer systems, ACM SIGOPS Operating Systems Review, 9:5, (106-113), Online publication date: 1-Nov-1975.
- Parnas D and Siewiorek D (1975). Use of the concept of transparency in the design of hierarchically structured systems, Communications of the ACM, 18:7, (401-408), Online publication date: 1-Jul-1975.
- Russell D and Bredt T Error resynchronization in producer-consumer systems Proceedings of the fifth ACM symposium on Operating systems principles, (106-113)
- Knott G (1974). A proposal for certain process management and intercommunication primitives, ACM SIGOPS Operating Systems Review, 8:4, (7-44), Online publication date: 1-Oct-1974.
- Couger J (1973). Curriculum recommendations for undergraduate programs in information systems, Communications of the ACM, 16:12, (727-749), Online publication date: 1-Dec-1973.
- Bouknight W, Grossman G and Grothe D The ARPA network terminal system a new approach to network access Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design, (73-79)
- Thomas R and Henderson D McROSS Proceedings of the May 16-18, 1972, spring joint computer conference, (281-293)
- Ashenhurst R (1972). Curriculum recommendations for graduate professional programs in information systems, Communications of the ACM, 15:5, (363-398), Online publication date: 1-May-1972.
- Gilbert P and Chandler W (1972). Interference between communicating parallel processes, Communications of the ACM, 15:6, (427-437), Online publication date: 1-Jun-1972.
- Bétourné C, Boulenger J, Ferrié J, Kaiser C, Krakowiak S and Mossière J (1970). Process management and resource sharing in the multiaccess system in ESOPE, Communications of the ACM, 13:12, (727-733), Online publication date: 1-Dec-1970.
- Habermann A (1969). Prevention of system deadlocks, Communications of the ACM, 12:7, (373-ff.), Online publication date: 1-Jul-1969.
- Wilkinson P A model for the local area of a data communication network software organization Proceedings of the first ACM symposium on Problems in the optimization of data communications systems, (155-181)
- Bétourné C, Boulenger J, Ferrié J, Kaiser C, Kott J, Krakowiak S and Mossière J Process management and resource sharing in the multiaccess system "ESOPE" Proceedings of the second symposium on Operating systems principles, (67-74)
Recommendations
Technical Note: The MAPt/Pht/∞ Queueing System and Multiclass [MAPt/Pht/∞]K Queueing Network
In this paper we demonstrate how a key adjustment to known numerically exact methods for evaluating time-dependent moments of the number of entities in the Pht/Pht/∞ queueing system and [Pht/Pht/∞]K queueing network may be implemented to capture the ...
Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and workload levels are generally approximated by a multidimensional reflected Brownian motion RBM. Decomposition approximations, on the other hand, ...
The variance of departure processes: puzzling behavior and open problems
We consider the variability of queueing departure processes. Previous results have shown the so-called BRAVO effect occurring in M/M/1/K and GI/G/1 queues: Balancing Reduces Asymptotic Variance of Outputs. A factor of (1 2/ ) appears in GI/G/1 and a ...