### Abstract

The following problem is considered: given a linked list of length n, compute the distance from each element of the linked list to the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O(log n) time parallel algorithm using n processors. We present new deterministic parallel algorithms for the problem. Our strongest results are (1) O(log n log* n) time using n/(log n log* n) processors (this algorithm achieves optimal speed-up); (2) O(log n) time using n log^{(k)}n/log n processors, for any fixed positive integer k. The algorithms apply a novel "random-like" deterministic technique. This technique provides for a fast and efficient breaking of an apparently symmetric situation in parallel and distributed computation.

Original language | English (US) |
---|---|

Pages (from-to) | 32-53 |

Number of pages | 22 |

Journal | Information and control |

Volume | 70 |

Issue number | 1 |

DOIs | |

State | Published - 1986 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Information and control*,

*70*(1), 32-53. https://doi.org/10.1016/S0019-9958(86)80023-7

**Deterministic coin tossing with applications to optimal parallel list ranking.** / Cole, Richard; Vishkin, Uzi.

Research output: Contribution to journal › Article

*Information and control*, vol. 70, no. 1, pp. 32-53. https://doi.org/10.1016/S0019-9958(86)80023-7

}

TY - JOUR

T1 - Deterministic coin tossing with applications to optimal parallel list ranking

AU - Cole, Richard

AU - Vishkin, Uzi

PY - 1986

Y1 - 1986

N2 - The following problem is considered: given a linked list of length n, compute the distance from each element of the linked list to the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O(log n) time parallel algorithm using n processors. We present new deterministic parallel algorithms for the problem. Our strongest results are (1) O(log n log* n) time using n/(log n log* n) processors (this algorithm achieves optimal speed-up); (2) O(log n) time using n log(k)n/log n processors, for any fixed positive integer k. The algorithms apply a novel "random-like" deterministic technique. This technique provides for a fast and efficient breaking of an apparently symmetric situation in parallel and distributed computation.

AB - The following problem is considered: given a linked list of length n, compute the distance from each element of the linked list to the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O(log n) time parallel algorithm using n processors. We present new deterministic parallel algorithms for the problem. Our strongest results are (1) O(log n log* n) time using n/(log n log* n) processors (this algorithm achieves optimal speed-up); (2) O(log n) time using n log(k)n/log n processors, for any fixed positive integer k. The algorithms apply a novel "random-like" deterministic technique. This technique provides for a fast and efficient breaking of an apparently symmetric situation in parallel and distributed computation.

UR - http://www.scopus.com/inward/record.url?scp=0022744154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022744154&partnerID=8YFLogxK

U2 - 10.1016/S0019-9958(86)80023-7

DO - 10.1016/S0019-9958(86)80023-7

M3 - Article

AN - SCOPUS:0022744154

VL - 70

SP - 32

EP - 53

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 1

ER -