Name
Abstract | ||
|---|---|---|
In this paper, we consider arbitrary tree networks where every processor, exceptone, called the root, executes the same program. We show that, to design a depth- rsttoken circulation protocol in such networks, it is necessary to have at least ( 1 + 1) Q ni=2( i + 2) con gurations, where n is the number of processors in the network and i is the degree of processor p i .We then propose a depth- rst token circulation algorithm which matches the aboveminimal number of con gurations.... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1142/S0129626499000293 | Parallel Processing Letters |
Keywords | Field | DocType |
distributed systems,mutual exclusion,self stabilization | Tree (graph theory),Upper and lower bounds,Computer science,Token ring,Algorithm,Self-stabilization,Token circulation,Tree structure,Connectivity,Mutual exclusion | Journal |
Volume | Issue | Citations |
10 | 1 | 8 |
PageRank | References | Authors |
0.51 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franck Petit | 1 | 736 | 60.02 |
| Vincent Villain | 2 | 544 | 45.77 |