Dror Feitelson  Home/Search
Context Related
| cs.huji.ac.il/~fei...dlock91ParCo.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.huji.ac.il/~feit/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Deadlock detection is an important service that the run-time system of a parallel environment should provide. In parallel programs deadlock can occur when the different processes are waiting for various events, as opposed to concurrent systems, where deadlock occurs when processes wait for resources held by other processes. Therefore classical deadlock detection techniques such as checking for cycles in the wait-for graph are unapplicable. An alternative algorithm that checks whether all the... (Update)
Context of citations to this paper: More
.... support gang scheduling, rather than scheduling each activity individually) 15] monitored mode [6] and deadlock detection mode [14]. Acknowledgments The ParC language was first developed by Yosi Ben Asher. Some extensions were later added by Izhar Matkevich and Dana...
Cited by: More
Run-Time Support for Parallel Language Constructs in a.. - Dror Feitelson (1993) (Correct)
Active bibliography (related documents): More All
0.3: Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (Correct)
0.2: Job Scheduling in Multiprogrammed Parallel Systems - Feitelson (1997) (Correct)
0.2: Algorithms for Scalable Synchronization on Shared-Memory.. - Mellor-Crummey, Scott (1990) (Correct)
Similar documents based on text: More All
0.4: Efficient Deadlock Detection in Distributed Systems - Chen, Deng, Orji, Sun (Correct)
0.3: Survey of Deadlock Detection in Distributed Concurrent.. - Shih, Stankovic (1990) (Correct)
0.3: Deadlock Detection in Distributed Real-Time Systems and Its.. - Shih, Stankovic (1991) (Correct)
BibTeX entry: (Update)
D. G. Feitelson, "Deadlock detection without wait-for graphs". Parallel Computing 17(12), pp. 1377--1383, Dec 1991. http://citeseer.ist.psu.edu/feitelson91deadlock.html More
@article{ feitelson91deadlock,
author = "D. G. Feitelson",
title = "Deadlock detection without wait-for graphs",
journal = "Parallel Computing",
volume = "17",
number = "12",
pages = "1377--1383",
year = "1991",
url = "citeseer.ist.psu.edu/feitelson91deadlock.html" }
Citations (may not include all citations):210 Co-operating sequential processes (context) - Dijkstra - 1968
197 The performance of spin lock alternatives for shared-memory .. (context) - Anderson - 1990
85 Operating System Concepts (context) - Peterson, Silberschatz - 1983
31 Deadlock detection in distributed systems (context) - Singhal - 1989
18 Mapping and scheduling in a shared parallel environment usin.. (context) - Feitelson, Rudolph - 1990
7 Principles of Operating Systems (context) - Krakowiak - 1988
7 Resolution of deadlocks in object-oriented distributed syste.. (context) - Roesler, Burkhard - 1989
5 designing an MIMD shared memory parallel computer (context) - Gottlieb, Grishman et al. - 1983
3 for shared memory parallel processing (context) - Ben-Asher, Feitelson et al. - 1990
1 Two-phase deadlock detection algorithm (context) - Elmagarmid, Datta - 1988
Documents on the same site (http://www.cs.huji.ac.il/~feit/pub.html): More
Communicators: Object-Based Multiparty Interactions for Parallel .. - Feitelson (1991) (Correct)
The BoW Project - Feitelson (Correct)
Limitations on Optical Free-Space Crossbar-Like.. - Feitelson, Rudolph.. (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC