Accession Number:

ADA106189

Title:

Merging on Parallel Models of Computation.

Descriptive Note:

Technical rept.,

Corporate Author:

CORNELL UNIV ITHACA NY DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Hopcroft,John E.
• Borodin,Allan

Report Date:

1981-10-01

Pagination or Media Count:

19.0

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

Descriptors:

• *MATHEMATICAL MODELS
• *PARALLEL PROCESSORS
• OPTIMIZATION
• COMPUTATIONS
• HIGH RATE
• COMPUTER COMMUNICATIONS
• ARRAYS
• MEMORY DEVICES
• COMMUNICATIONS NETWORKS
• SYNCHRONIZATION(ELECTRONICS)
• ROUTING
• DATA RATE
• EXPONENTIAL FUNCTIONS
• ASYMPTOTIC NORMALITY
• NETWORK FLOWS

Subject Categories:

• Numerical Mathematics
• Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE