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