### Abstract

The authors study two parallel scheduling problems and their use in designing parallel algorithms. First they define a novel scheduling problem that they solve by repeated approximate reschedulings. This leads to an optimal PRAM (parallel random access machine) algorithm for list ranking that runs in logarithmic time. The second scheduling result is for computing prefix sums of log n bit numbers. An optimal parallel algorithm for the problem which runs in sublogarithmic time is given. These two scheduling results together lead to logarithmic-time PRAM algorithms for the connectivity, bioconnectivity and minimum spanning-tree problems. The connectivity and biconnectivity algorithms are optimal unless m equals O(n log n, in graphs of n vertices and m edges.

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

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | IEEE |

Pages | 478-490 |

Number of pages | 13 |

ISBN (Print) | 0818607408 |

State | Published - 1986 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 478-490). IEEE.

**APPROXIMATE AND EXACT PARALLEL SCHEDULING WITH APPLICATIONS TO LIST, TREE AND GRAPH PROBLEMS.** / Cole, Richard; Vishkin, Uzi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Annual Symposium on Foundations of Computer Science (Proceedings).*IEEE, pp. 478-490.

}

TY - GEN

T1 - APPROXIMATE AND EXACT PARALLEL SCHEDULING WITH APPLICATIONS TO LIST, TREE AND GRAPH PROBLEMS.

AU - Cole, Richard

AU - Vishkin, Uzi

PY - 1986

Y1 - 1986

N2 - The authors study two parallel scheduling problems and their use in designing parallel algorithms. First they define a novel scheduling problem that they solve by repeated approximate reschedulings. This leads to an optimal PRAM (parallel random access machine) algorithm for list ranking that runs in logarithmic time. The second scheduling result is for computing prefix sums of log n bit numbers. An optimal parallel algorithm for the problem which runs in sublogarithmic time is given. These two scheduling results together lead to logarithmic-time PRAM algorithms for the connectivity, bioconnectivity and minimum spanning-tree problems. The connectivity and biconnectivity algorithms are optimal unless m equals O(n log n, in graphs of n vertices and m edges.

AB - The authors study two parallel scheduling problems and their use in designing parallel algorithms. First they define a novel scheduling problem that they solve by repeated approximate reschedulings. This leads to an optimal PRAM (parallel random access machine) algorithm for list ranking that runs in logarithmic time. The second scheduling result is for computing prefix sums of log n bit numbers. An optimal parallel algorithm for the problem which runs in sublogarithmic time is given. These two scheduling results together lead to logarithmic-time PRAM algorithms for the connectivity, bioconnectivity and minimum spanning-tree problems. The connectivity and biconnectivity algorithms are optimal unless m equals O(n log n, in graphs of n vertices and m edges.

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

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

M3 - Conference contribution

AN - SCOPUS:0022875301

SN - 0818607408

SP - 478

EP - 490

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -