Verwandte Artikel zu The Parallel Complexity of Deadlock Detection (Classic...
Inhaltsangabe
Excerpt from The Parallel Complexity of Deadlock Detection
All reduction sequences of a given reusable resource multigraph D lead to the same irreducible multigraph. Theorem Theorem)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,38
EUR 0,53 für den Versand von USA nach Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für The Parallel Complexity of Deadlock Detection (Classic...
Beispielbild für diese ISBN
The Parallel Complexity of Deadlock Detection Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781334017872
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
The Parallel Complexity of Deadlock Detection Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781334017872
Anzahl: 15 verfügbar
Foto des Verkäufers
The Parallel Complexity of Deadlock Detection (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781334017872_0
Anzahl: Mehr als 20 verfügbar