Prevention of deadlocks in parallel programs of multiprocessor machines
From MaRDI portal
Recommendations
Cited in
(18)- Deadlock prevention with collectively occupied resources
- Deadlock avoidance for systolic communication
- Rendezvous deadlocks in interacting parallel processes
- Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
- A minimal property for characterizing deadlock-free programs
- Interlock avoidance in transparent and dynamic parallel program instrumentation using logical clocks.
- Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors
- Two logical methods of deadlock analysis
- scientific article; zbMATH DE number 1693546 (Why is no real title available?)
- An automatic technique for static deadlock prevention
- A Transformation to Provide Deadlock-Free Programs
- Deadlock free specification based on local process properties
- Generic locking and deadlock-prevention with C++
- scientific article; zbMATH DE number 3949689 (Why is no real title available?)
- Deadlock Prevention in Process Control Computer Systems
- scientific article; zbMATH DE number 510703 (Why is no real title available?)
- Deadlock detection in MPI programs
- The theory of deadlock avoidance via discrete control
This page was built for publication: Prevention of deadlocks in parallel programs of multiprocessor machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079013)
