Distributed algorithms for global structuring

Raphael A. Finkel, Marvin Solomon, Michael L. Horowitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the search for speed and computing power, many researchers in computer science have turned to networks of computers as a possible solution. 1 , 5 , 8 , 14 , 9 These networks consist of minicomputers connected by links across which communication between processors occurs. In homogeneous networks, the computer at each node is identical to the others, with the possible exception of peripherals. Each processor has its own local memory, does not share memory with any other processor, and communicates with other processors via message passing. In order to fully utilize the speed and power inherent in a network, emphasis must be placed on the development of parallel (as opposed to sequential) algorithms.

Original languageEnglish
Title of host publication1979 International Workshop on Managing Requirements Knowledge, MARK 1979
Pages455-460
Number of pages6
ISBN (Electronic)9781509031818
DOIs
StatePublished - Jun 1979
Event1979 International Workshop on Managing Requirements Knowledge, MARK 1979 - New York, United States
Duration: Jun 4 1979Jun 7 1979

Publication series

Name1979 International Workshop on Managing Requirements Knowledge, MARK 1979

Conference

Conference1979 International Workshop on Managing Requirements Knowledge, MARK 1979
Country/TerritoryUnited States
CityNew York
Period6/4/796/7/79

Bibliographical note

Publisher Copyright:
© 1979 IEEE.

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Distributed algorithms for global structuring'. Together they form a unique fingerprint.

Cite this