The structure of the “THE”-multiprogramming system

From MaRDI portal
Publication:5548674

DOI10.1145/363095.363143zbMath0164.18704OpenAlexW2103444363WikidataQ30053288 ScholiaQ30053288MaRDI QIDQ5548674

Edsger W. Dijkstra

Publication date: 1968

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363095.363143



Related Items

Relation-based semantics for concurrencyGoldilocks and the three specificationsTop-down development of layered fault tolerant systems and its problems -- a deontic perspectiveEvidential reasoning using stochastic simulation of causal modelsProving programs correct: Some techniques and examplesA semantics for concurrent separation logicA New Property of Choice-Free Petri Net SystemsMethods and means of parallel processing of informationA pragmatic proposal for the improvement of program modularity and reliabilityLinking operational semantics and algebraic semantics for a probabilistic timed shared-variable languageStarvation-free mutual exclusion with semaphoresAppraising two decades of distributed computing theory researchPROCESSES AND THEIR INTERACTIONSAn experience using different synchronisation mechanisms on a shared memory multiprocessorsSemantic decomposition of computer programs: An aid to program testingTransforming sequential systems into concurrent systemsAn axiomatic proof technique for parallel programsAbstract state machines: a unifying view of models of computation and of system design frameworksThe synchronization of independent processesA survey of concurrent object-oriented languagesA starvation-free solution to the mutual exclusion problemOn an extension of Dijkstra's semaphore primitivesON SOME RECENT ADVANCES IN COMPLEX SOFTWARE NETWORKS: MODELING, ANALYSIS, EVOLUTION AND APPLICATIONSProzessumschaltungen in BetriebssystemenPort automata and the algebra of concurrent porcessesProduct optimization in stepwise design