Check nearby libraries
Buy this book
In this paper we investigate the robustness of several deadlock detection algorithms for distributed computing systems. We analyze the behavior of each algorithm in the presence of two classes of failures - lost messages and single site failures. In the case of single site failure we consider six different types of sites depending on how they can participate in deadlock and deadlock detection. The observation and conclusions made in this paper are intended to show how robust the present algorithms are and to provide an insight and better understanding of distributed algorithms robustness. (Author)
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
On robustness of deadlock detection algorithms for distributed computing systems
1982, Naval Postgraduate School
in English
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Published in
Monterey, California
Edition Notes
"NPS-52-82-001"--Cover.
Cover title.
"February 1982"--Cover.
"Prepared for: Naval Postgraduate School, Monterey, California 93940."
Includes bibliographical references (p. 29).
"Approved for public release; distribution is unlimited"--Cover.
Technical report; 1982.
ck/ 4/15/09.
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created July 25, 2014
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
May 16, 2020 | Edited by CoverBot | Added new cover |
July 25, 2014 | Created by ImportBot | Imported from Internet Archive item record. |