CROWD CONTROL

COORDINATING PROCESSES IN PARALLEL.

Thomas J. LeBlanc, Sanjay Jain

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A crowd is a set of processes that, at some point in time, cooperate to execute some function. The class of functions of interest have the property that they cannot be executed completely in parallel by all of the processes; a partial order is required. By imposing a partial order based on an arbitrary embedding in a balanced binary tree, parallel solutions to these problems can be implemented. A library package for a shared-memory multiprocessor that implements crowd control is described. The package has been implemented on the BBN Butterfly, with performance results that confirm O(log P) expected execution time for crowd control functions using P less than equivalent to 128 processors and constant time functions greater than equivalent to 1 ms in duration.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsSartaj K. Sahni
PublisherPennsylvania State Univ Press
Pages81-84
Number of pages4
ISBN (Print)0271006080
StatePublished - 1987
Externally publishedYes
EventProc Int Conf Parallel Process 1987 - Universal Park, PA, USA
Duration: Aug 17 1987Aug 21 1987

Other

OtherProc Int Conf Parallel Process 1987
CityUniversal Park, PA, USA
Period8/17/878/21/87

Fingerprint

Binary trees
Data storage equipment

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

LeBlanc, T. J., & Jain, S. (1987). CROWD CONTROL: COORDINATING PROCESSES IN PARALLEL. In S. K. Sahni (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 81-84). Pennsylvania State Univ Press.

CROWD CONTROL : COORDINATING PROCESSES IN PARALLEL. / LeBlanc, Thomas J.; Jain, Sanjay.

Proceedings of the International Conference on Parallel Processing. ed. / Sartaj K. Sahni. Pennsylvania State Univ Press, 1987. p. 81-84.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

LeBlanc, TJ & Jain, S 1987, CROWD CONTROL: COORDINATING PROCESSES IN PARALLEL. in SK Sahni (ed.), Proceedings of the International Conference on Parallel Processing. Pennsylvania State Univ Press, pp. 81-84, Proc Int Conf Parallel Process 1987, Universal Park, PA, USA, 8/17/87.
LeBlanc TJ, Jain S. CROWD CONTROL: COORDINATING PROCESSES IN PARALLEL. In Sahni SK, editor, Proceedings of the International Conference on Parallel Processing. Pennsylvania State Univ Press. 1987. p. 81-84
LeBlanc, Thomas J. ; Jain, Sanjay. / CROWD CONTROL : COORDINATING PROCESSES IN PARALLEL. Proceedings of the International Conference on Parallel Processing. editor / Sartaj K. Sahni. Pennsylvania State Univ Press, 1987. pp. 81-84
@inproceedings{3159503357084b229a14c294822c2cfe,
title = "CROWD CONTROL: COORDINATING PROCESSES IN PARALLEL.",
abstract = "A crowd is a set of processes that, at some point in time, cooperate to execute some function. The class of functions of interest have the property that they cannot be executed completely in parallel by all of the processes; a partial order is required. By imposing a partial order based on an arbitrary embedding in a balanced binary tree, parallel solutions to these problems can be implemented. A library package for a shared-memory multiprocessor that implements crowd control is described. The package has been implemented on the BBN Butterfly, with performance results that confirm O(log P) expected execution time for crowd control functions using P less than equivalent to 128 processors and constant time functions greater than equivalent to 1 ms in duration.",
author = "LeBlanc, {Thomas J.} and Sanjay Jain",
year = "1987",
language = "English (US)",
isbn = "0271006080",
pages = "81--84",
editor = "Sahni, {Sartaj K.}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",

}

TY - GEN

T1 - CROWD CONTROL

T2 - COORDINATING PROCESSES IN PARALLEL.

AU - LeBlanc, Thomas J.

AU - Jain, Sanjay

PY - 1987

Y1 - 1987

N2 - A crowd is a set of processes that, at some point in time, cooperate to execute some function. The class of functions of interest have the property that they cannot be executed completely in parallel by all of the processes; a partial order is required. By imposing a partial order based on an arbitrary embedding in a balanced binary tree, parallel solutions to these problems can be implemented. A library package for a shared-memory multiprocessor that implements crowd control is described. The package has been implemented on the BBN Butterfly, with performance results that confirm O(log P) expected execution time for crowd control functions using P less than equivalent to 128 processors and constant time functions greater than equivalent to 1 ms in duration.

AB - A crowd is a set of processes that, at some point in time, cooperate to execute some function. The class of functions of interest have the property that they cannot be executed completely in parallel by all of the processes; a partial order is required. By imposing a partial order based on an arbitrary embedding in a balanced binary tree, parallel solutions to these problems can be implemented. A library package for a shared-memory multiprocessor that implements crowd control is described. The package has been implemented on the BBN Butterfly, with performance results that confirm O(log P) expected execution time for crowd control functions using P less than equivalent to 128 processors and constant time functions greater than equivalent to 1 ms in duration.

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

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

M3 - Conference contribution

SN - 0271006080

SP - 81

EP - 84

BT - Proceedings of the International Conference on Parallel Processing

A2 - Sahni, Sartaj K.

PB - Pennsylvania State Univ Press

ER -