Technical Reports (CIS)

Document Type

Technical Report

Date of this Version

November 1990

Comments

University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-90-26.

Abstract

We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(n/P) with high probability, provided each node can process all the incident edges in one unit of time (this model is called the parallel model and has been assumed by previous researchers (e.g.,[17])). This result is important in view of a lower bound of Plaxton that implies selection takes Ω((N/P)loglog P+log P) time on a P-node hypercube if each node can process only one edge at a time (this model is referred to as the sequential model).

Share

COinS
 

Date Posted: 21 August 2007