Efficient Computation on Sparse Interconnection Networks.

Abstract

This thesis presents fast hypercube and shuffle-exchange algorithms for certain load balancing, selection and sorting problems. Non-trivial lower bounds are established for load balancing and selection. In addition, efficient network implementations of the parallel prefix operation and of the elementary Boolean matrix multiplication algorithm are described.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 08, 1989
Accession Number
ADA326070

Entities

People

  • C. G. Plaxton

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Bibliographies
  • Classification
  • Communication Channels
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Consistency
  • Construction
  • Embedding
  • Notation
  • Parallel Computing
  • Parallel Processing
  • Probability
  • Trees (Data Structures)
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Computer Programming and Software Development.
  • Parallel and Distributed Computing.