scientific article
From MaRDI portal
Publication:4066554
zbMath0308.68007MaRDI QIDQ4066554
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (73)
Relation-based semantics for concurrency ⋮ Richard Bellman's contributions to computer science ⋮ Nonclairvoyant scheduling ⋮ The parallel complexity of deadlock detection ⋮ Fair service for mice in the presence of elephants ⋮ A modula-2 kernel for supporting monitors ⋮ Transformations of sequential specifications into concurrent specifications by synchronization guards ⋮ A non-blocking buffer mechanism for real-time event message communication ⋮ A calculus and logic of resources and processes ⋮ A middleware model supporting time-triggered message-triggered objects for standard linux systems ⋮ Joyce—A programming language for distributed systems ⋮ On process assignment in parallel computing ⋮ A semantics for concurrent separation logic ⋮ Resources, concurrency, and local reasoning ⋮ A proof of the optimality of the MIN paging algorithm using linear programming duality ⋮ On hash techniques in a paged environment ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Methods and means of parallel processing of information ⋮ Upper bounds for static resource allocation in a distributed system ⋮ A unified approach for studying the properties of transition systems ⋮ Distribution and synchronized automata ⋮ A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues ⋮ Optimization aspects of deadlock prevention in packet-switching networks ⋮ The implementation of synchronizing operations in various environments ⋮ A note on LPT scheduling ⋮ An operating system for interactive terminals ⋮ An experiment in language design for distributed systems ⋮ Multiprocessor scheduling under precedence constraints: polyhedral results ⋮ Concurrent communication and synchronization mechanisms ⋮ On the efficient implementation of conditional critical regions, and the construction of monitors ⋮ The implementation of concurrency for a PL/I-like language ⋮ Some properties of deadlock detection and recovery in readers and writers problems ⋮ Optimal multiprogramming ⋮ A survey of concurrent object-oriented languages ⋮ A monitor for small computers ⋮ Safe states in banker-like resource allocation problems ⋮ Optimal scheduling of homogeneous job systems ⋮ Compile time preparations for run time scheduling in monitors ⋮ On the paging-complexity of periodic arrangements ⋮ An experimental study of processor thrashing in multiprocessor systems ⋮ FIFO-optimal placement on pages of independently referenced sectors ⋮ Modelling a disc I/0 system ⋮ A highly reliable file system which supports multiprocessing ⋮ Self-stabilization (in spite of distributed control) in tree-structured systems ⋮ Parallel processing in an adaptable application oriented language processor ⋮ Bounds on list scheduling of UET tasks with restricted resource constraints ⋮ On the design and specification of message oriented programs ⋮ A classification of process coordination schemes in descriptive power ⋮ Abstract interface behavior of object-oriented languages with monitors ⋮ A multiprocessor implementation of joyce ⋮ A trichotomy: Interactions of factors prolonging sequential and concurrent mental processes in stochastic discrete mental (PERT) networks ⋮ The design of Edison ⋮ Detection of parallelism between statements by decomposing into separate sequential processes ⋮ Models of central capacity and concurrency ⋮ Fine-grained concurrency with separation logic ⋮ Systems implementation languages and IRONMAN ⋮ Possible worlds and resources: The semantics of \(\mathbf{BI}\) ⋮ Message passing between sequential processes: The reply primitive and the administrator concept ⋮ A communicating sequential process language and implementation ⋮ Task management in Ada—A critical evaluation for real-time multiprocessors ⋮ Two examples of block structuring ⋮ Pointer variables in concurrent Pascal ⋮ Extension of the Banker's algorithm for resource allocation in a distributed operating system ⋮ The residue of vector sets with applications to decidability problems in Petri nets ⋮ Dynamic storage allocation with limited compaction - complexity and some practical implications ⋮ Nets, sequential components and concurrency relations ⋮ Advantages for solving linear systems in an asynchronous environment ⋮ Policies for data archival in hierarchical storage management ⋮ A cost-based buffer replacement algorithm for object-oriented database systems ⋮ Discrete system simulation in Ada ⋮ Global serializability of concurrent programs ⋮ Fault-tolerant and flexible interconnection of multiple processors ⋮ A structural operational semantics for an Edison-like language
This page was built for publication:
