Name
Abstract | ||
|---|---|---|
A clock synchronization service ensures that spatially dispersed and heterogeneous processors in a distributed system share a common notion of time. In order to behave as a single, unified computing resource, distributed systems have need for a fault-tolerant, clock synchronization service. One approach employs the interactive convergence (ICV) method, which is both fully distributed and inherently fault-tolerant. However, this approach suffers from limits in terms of system scalability due to resource overhead. In this paper, a new layered form of ICV is introduced, compared with basic ICV and other simpler alternatives via experimental analysis on a distributed system testbed, and shown to improve synchronization tightness, resource utilization, and scalability. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0141-9331(02)00066-2 | Microprocessors and Microsystems |
Keywords | Field | DocType |
Cluster computing,Interactive convergence,Clock synchronization,Convergence,Fault-tolerance | Convergence (routing),Synchronization,Computer science,Parallel computing,Testbed,Computer network,Real-time computing,Clock synchronization,Fault tolerance,Computer cluster,Scalability,Distributed computing | Journal |
Volume | Issue | ISSN |
26 | 9 | 0141-9331 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raghukul Tilak | 1 | 0 | 0.34 |
| Alan George | 2 | 109 | 24.60 |
| Robert W. Todd | 3 | 34 | 3.52 |