A Shared Memory Computer Display System

DOI10.1109/PGEC.1966.264564MaRDI QIDQ5524887zbMATH OpenFDO

Authors Arthur Bernstein

Publication date 1966

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/PGEC.1966.264564

zbMATH Keywords

numerical analysis

Cited in

(19)

• On formulating simultaneity for studying parallelism and synchronization
• Defining conditional independence using collapses
• The identification of parallel micro-operations
• Data-race and concurrent-write freedom are undecidable.
• Verifying the correctness of distributed systems via mergeable parallelism
• Parallélisation sémantique
• Parallel operator schemata over variable arrays and the maximal parallelism problem
• scientific article; zbMATH DE number 3519891 (Why is no real title available?)
• A theory of transaction parallelism in blockchains
• Reversible debugging of concurrent Erlang programs: supporting imperative primitives
• Model checking race-freedom when ``sequential consistency for data-race-free programs is guaranteed
• Specifying and reasoning about shared-variable concurrency
• An introduction to parallel dynamic programming
• A generalized notion of semantic independence
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Implementing stochastic control software on supercomputing machines
• Models of central capacity and concurrency
• Scalable and structured scheduling
• Simple section interchange and properties of non-computable functions

This page was built for publication: A Shared Memory Computer Display System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5524887)