Approximate parallel scheduling. Part I

The basic technique with applications to optimal parallel list ranking in logarithmic time

Richard Cole, Uzi Vishkin

Research output: Contribution to journalArticle

Abstract

We 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.

Original languageEnglish (US)
Pages (from-to)128-142
Number of pages15
JournalSIAM Journal on Computing
Volume17
Issue number1
StatePublished - Feb 1988

Fingerprint

Ranking
Logarithmic
Scheduling
Rescheduling
Euler
Scheduling Problem
Connectivity
Upper bound
Graph in graph theory

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

@article{821472811d104016ad5a7fb828208d78,
title = "Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time",
abstract = "We 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.",
author = "Richard Cole and Uzi Vishkin",
year = "1988",
month = "2",
language = "English (US)",
volume = "17",
pages = "128--142",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

T1 - Approximate parallel scheduling. Part I

T2 - The basic technique with applications to optimal parallel list ranking in logarithmic time

AU - Cole, Richard

AU - Vishkin, Uzi

PY - 1988/2

Y1 - 1988/2

N2 - We 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.

AB - We 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.

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

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

M3 - Article

VL - 17

SP - 128

EP - 142

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 1

ER -