Show simple item record

dc.contributor.authorShen, Hong
dc.date.accessioned2019-11-26T04:01:30Z
dc.date.available2019-11-26T04:01:30Z
dc.date.issued1997
dc.identifier.issn01678191
dc.identifier.doi10.1016/S0167-8191(97)00100-2
dc.identifier.urihttp://hdl.handle.net/10072/121204
dc.description.abstractMultiselection requires to select r elements at specified ranks in a given set of n elements, r ≤ n. This paper proposes a paradigm for parallel multiselection to achieve the optimal cost. Following this paradigm and employing a cost-optimal algorithm for single-element selection, a cost-optimal parallel algorithm for multiselection is presented. Our algorithm runs in O(nϵ log r) time on an EREW PRAM with n1−ϵ processors for any 0 < ϵ < 1. In the special case when ϵ =log(lognlog*n)logn, our algorithm requires O(lognlog*nlogr) time and O(n log r) cost.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherNorth-Holland
dc.publisher.placeNetherlands
dc.relation.ispartofpagefrom1987
dc.relation.ispartofpageto1992
dc.relation.ispartofissue13
dc.relation.ispartofjournalParallel Computing
dc.relation.ispartofvolume23
dc.subject.fieldofresearchDistributed Computing
dc.subject.fieldofresearchCognitive Sciences
dc.subject.fieldofresearchcode0805
dc.subject.fieldofresearchcode1702
dc.titleOptimal parallel multiselection on EREW PRAM
dc.typeJournal article
dc.type.descriptionC1 - Peer Reviewed (HERDC)
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorShen, Hong


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record