Beta Operations: Efficient Implementation of a Primitive Parallel Operation.

Abstract

The ever decreasing cost of computer processors has created a great interest in multi-processor computers. However, along with the increased power that this parallelism brings, comes increased complexity in programming. One approach to lessening this complexity is to provide the programmer with general purpose parallel primitives that shield him from the structure of the underlying maching. In The Connection Machine Hillis suggests the Beta Operation as a parallel primitive for his hypercube-based machine. This paper explores efficient ways to perform this operator on several different well known architectures including the hypercube. It presents some lower bounds associated with the problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1986
Accession Number
ADA174281

Entities

People

  • Evan R. Cohn
  • Ramsey W. Haddad

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Numbers
  • Permutations
  • Procedures (Computers)
  • Security
  • Sequences
  • Square Roots
  • Standards
  • Theorems
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design