Name
Abstract | ||
|---|---|---|
Parallel distributed algorithms are presented for adding and deleting edges in a directed graph without creating a cycle. Such algorithms are useful for a variety of problems in distributed systems such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are numerous possible interactions among overlapping instances of the algorithms. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1109/TSE.1987.233199 | Software Engineering, IEEE Transactions |
Keywords | Field | DocType |
numerous possible interaction,deleting edge,overlapping instance,realistic asynchronous computer network,dynamic cycle prevention,message passing,computer science,distributed algorithm,distributed algorithms,computer network,computational modeling,directed graph,distributed system,data structures,distributed computing,concurrent programming,computer networks,concurrency control,distributed systems | Asynchronous communication,Computer science,Parallel algorithm,Deadlock,Directed graph,Theoretical computer science,Real-time computing,Distributed algorithm,Deadlock prevention algorithms,Concurrent computing,Distributed computing | Journal |
Volume | Issue | ISSN |
13 | 5 | 0098-5589 |
Citations | PageRank | References |
11 | 7.47 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katz, S. | 1 | 11 | 7.47 |
| Oded Shmueli | 2 | 47 | 41.84 |