Prevention of deadlocks in parallel programs of multiprocessor machines
From MaRDI portal
Publication:1079013
zbMATH Open0596.68030MaRDI QIDQ1079013FDOQ1079013
Authors: V. V. Parshentsev 
Publication date: 1985
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
Cited In (18)
- Two logical methods of deadlock analysis
- Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors
- Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
- Title not available (Why is that?)
- A minimal property for characterizing deadlock-free programs
- Interlock avoidance in transparent and dynamic parallel program instrumentation using logical clocks.
- Title not available (Why is that?)
- Generic locking and deadlock-prevention with C++
- A Transformation to Provide Deadlock-Free Programs
- Deadlock Prevention in Process Control Computer Systems
- Rendezvous deadlocks in interacting parallel processes
- Deadlock avoidance for systolic communication
- Deadlock free specification based on local process properties
- An automatic technique for static deadlock prevention
- Title not available (Why is that?)
- The theory of deadlock avoidance via discrete control
- Deadlock detection in MPI programs
- Deadlock prevention with collectively occupied resources
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)
