Name
Abstract | ||
|---|---|---|
In a synchronous, conservative simulationprotocol, the logical processes (LP's) execute insuper-steps. The number of super-steps is a sourceof overheads in such a protocol, and depends onthe progression of the LPs" safetimes. It is thereforedesirable that every LP's safetime progress asfar as possible during each super-step. This paperdescribes how to further relax the safetime computationof an existing synchronous protocol. It discussesthe correctness of the modified protocol, andits ... |
Year | Venue | Field |
|---|---|---|
1999 | PDPTA | Computer science,Parallel computing,Distributed computing |
DocType | Citations | PageRank |
Conference | 1 | 0.36 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chu-Cheow Lim | 1 | 168 | 14.45 |
| Boon-Ping Gan | 2 | 68 | 9.08 |
| Yoke-Hean Low | 3 | 54 | 7.74 |