Merging on Parallel Models of Computation.

Abstract

A variety of models have been proposed for the study of synchronous parallel computation. We review these models and study further some prototype problems. Within a spectrum of shared memory models, we show that loglog n is asymptotically optimal for n processors to merge two sorted lists containing n elements. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1981
Accession Number
ADA106189

Entities

People

  • Allan Borodin
  • John E. Hopcroft

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Science
  • Computers
  • Models
  • New York
  • Numbers
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Square Roots
  • Teamwork
  • Theorems
  • Theory Of Computation
  • Universities
  • Weather Forecasting

Fields of Study

  • Mathematics

Readers

  • Business Analytics
  • Parallel and Distributed Computing.
  • Statistical inference.