Thomas J. LeBlanc, Sanjay Jain

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

2 Scopus citations


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
Number of pages4
ISBN (Print)0271006080
StatePublished - Dec 1 1987
EventProc Int Conf Parallel Process 1987 - Universal Park, PA, USA
Duration: Aug 17 1987Aug 21 1987

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918


OtherProc Int Conf Parallel Process 1987
CityUniversal Park, PA, USA

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'CROWD CONTROL: COORDINATING PROCESSES IN PARALLEL.'. Together they form a unique fingerprint.

Cite this