Items related to The Parallel Complexity of Deadlock Detection (Classic...
Synopsis
This book investigates the parallel complexity of deadlock detection in systems where multiple shared resources are accessed by several processes, each controlling exclusive resource units. The author examines the possibility of creating parallel algorithms to detect deadlocks in such systems, despite similar graph problems having efficient parallel solutions. Through a series of theorems and proofs, the author demonstrates that the general deadlock detection problem is complete in polynomial time under log-space reductions. However, the author also finds that when the problem is restricted (e.g., single-unit requests or single-unit resources), it can be solved efficiently in parallel. The book concludes that while general deadlock detection may not be efficiently parallelizable, restricted versions are, providing valuable insights for designing parallel operating systems.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.05
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speeds
Search results for The Parallel Complexity of Deadlock Detection (Classic...
Seller Image
The Parallel Complexity of Deadlock Detection (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book investigates the parallel complexity of deadlock detection in systems where multiple shared resources are accessed by several processes, each controlling exclusive resource units. The author examines the possibility of creating parallel algorithms to detect deadlocks in such systems, despite similar graph problems having efficient parallel solutions. Through a series of theorems and proofs, the author demonstrates that the general deadlock detection problem is complete in polynomial time under log-space reductions. However, the author also finds that when the problem is restricted (e.g., single-unit requests or single-unit resources), it can be solved efficiently in parallel. The book concludes that while general deadlock detection may not be efficiently parallelizable, restricted versions are, providing valuable insights for designing parallel operating systems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781334017872_0
Quantity: Over 20 available
Stock Image
The Parallel Complexity of Deadlock Detection Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334017872
Quantity: 15 available
Stock Image
The Parallel Complexity of Deadlock Detection Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334017872
Quantity: 15 available