The Parallel Complexity of Deadlock Detection Classic Reprint
Paul G. Spirakis
ISBN 10: 1334017875 ISBN 13: 9781334017872
Published by Forgotten Books, 2018
New
PAP
From
PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since April 7, 2005
This specific item is no longer available.
About this Item
Description:
New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334017872
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.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: The Parallel Complexity of Deadlock ...
Publisher: Forgotten Books
Publication Date: 2018
Binding: PAP
Condition: New
Top Search Results from the AbeBooks Marketplace
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
Buy New
US$ 17.05
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 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
Buy New
US$ 23.66
US$ 4.43 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available