# Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time

## Abstract

The authors define a novel scheduling problem; it is solved in parallel by repeated, rapid, approximate reschedulings. This leads to the first optimal logarithmic time PRAM algorithm for list ranking. Companion papers show how to apply these results to obtain improved PRAM upper bounds for a variety of problems on graphs, including the following: connectivity, biconnectivity, Euler tour and st-numbering, and a number of problems on trees.

- Authors:

- Publication Date:

- Research Org.:
- Courant Institute of Mathematical Sciences, New York Univ., New York, NY (US)

- OSTI Identifier:
- 7020008

- Resource Type:
- Journal Article

- Journal Name:
- SIAM J. Comput.; (United States)

- Additional Journal Information:
- Journal Volume: 17:1

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; P CODES; PARALLEL PROCESSING; ALGORITHMS; CLASSIFICATION; COMPUTER GRAPHICS; MATHEMATICS; PLANNING; SCHEDULES; COMPUTER CODES; MATHEMATICAL LOGIC; PROGRAMMING; 990210* - Supercomputers- (1987-1989); 990300 - Information Handling

### Citation Formats

```
Cole, R, and Vishkin, U.
```*Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time*. United States: N. p., 1988.
Web. doi:10.1137/0217009.

```
Cole, R, & Vishkin, U.
```*Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time*. United States. https://doi.org/10.1137/0217009

```
Cole, R, and Vishkin, U. Mon .
"Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time". United States. https://doi.org/10.1137/0217009.
```

```
@article{osti_7020008,
```

title = {Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time},

author = {Cole, R and Vishkin, U},

abstractNote = {The authors define a novel scheduling problem; it is solved in parallel by repeated, rapid, approximate reschedulings. This leads to the first optimal logarithmic time PRAM algorithm for list ranking. Companion papers show how to apply these results to obtain improved PRAM upper bounds for a variety of problems on graphs, including the following: connectivity, biconnectivity, Euler tour and st-numbering, and a number of problems on trees.},

doi = {10.1137/0217009},

url = {https://www.osti.gov/biblio/7020008},
journal = {SIAM J. Comput.; (United States)},

number = ,

volume = 17:1,

place = {United States},

year = {1988},

month = {2}

}

Other availability

Save to My Library

You must Sign In or Create an Account in order to save documents to your library.