Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per The Parallel Complexity of Deadlock Detection (Classic...
Immagini fornite dal venditore
The Parallel Complexity of Deadlock Detection (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781334017872_0
Compra nuovo
EUR 15,25
Spese di spedizione:
GRATIS
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
The Parallel Complexity of Deadlock Detection Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781334017872
Compra nuovo
EUR 17,22
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: 15 disponibili
Foto dell'editore
The Parallel Complexity of Deadlock Detection Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781334017872
Compra nuovo
EUR 16,22
Spese di spedizione:
EUR 3,74
Da: Regno Unito a: U.S.A.
Quantità: 15 disponibili