skip to content
Very fast optimal parallel algorithms for heap construction Preview this item
ClosePreview this item
Checking...

Very fast optimal parallel algorithms for heap construction

Author: Paul Frederick Dietz; Rajeev Raman
Publisher: College Park, Md. : University of Maryland, [1994]
Series: Computer science technical report series (University of Maryland at College Park), CS-TR-3332.
Edition/Format:   Print book : English
Database:WorldCat
Summary:
Abstract: "We give two algorithms for permuting n items in an array into heap order on a CRCW PRAM. The first is deterministic and runs in O(loglogn) time and performs O(n) operations. This run-time is the best possible for any comparison-based algorithm using n processors. The second is randomized and runs in O(logloglog n) time with high probability, performing O(n) operations. No PRAM algorithm with o(log n)  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Paul Frederick Dietz; Rajeev Raman
OCLC Number: 31961352
Notes: "UMIACS-TR-94-98"--Cover.
"July 19, 1994."
Description: 15 pages ; 28 cm.
Series Title: Computer science technical report series (University of Maryland at College Park), CS-TR-3332.
Responsibility: Paul F. Dietz, Rajeev Raman.

Abstract:

Abstract: "We give two algorithms for permuting n items in an array into heap order on a CRCW PRAM. The first is deterministic and runs in O(loglogn) time and performs O(n) operations. This run-time is the best possible for any comparison-based algorithm using n processors. The second is randomized and runs in O(logloglog n) time with high probability, performing O(n) operations. No PRAM algorithm with o(log n) run-time was previously known for this problem. In order to obtain the deterministic result we study the parallel complexity of selecting the kth smallest of n elements on the CRCW PRAM, a problem that is of independent interest. We give an algorithm that is superior to existing ones when k is small compared to n. Consequently, we show that this problem can be solved in O(loglog n + log k/loglog n) time and O(n) operations for all 1 [<or =] k [<or =] n/2. A matching time lower bound is shown for all algorithms that use n or fewer processors to solve this problem."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/31961352> # Very fast optimal parallel algorithms for heap construction
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "31961352" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mdu> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/33818038#Place/college_park_md> ; # College Park, Md.
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/33818038#Person/raman_rajeev> ; # Rajeev Raman
   schema:creator <http://viaf.org/viaf/43413417> ; # Paul Frederick Dietz
   schema:datePublished "1994" ;
   schema:description "Abstract: "We give two algorithms for permuting n items in an array into heap order on a CRCW PRAM. The first is deterministic and runs in O(loglogn) time and performs O(n) operations. This run-time is the best possible for any comparison-based algorithm using n processors. The second is randomized and runs in O(logloglog n) time with high probability, performing O(n) operations. No PRAM algorithm with o(log n) run-time was previously known for this problem. In order to obtain the deterministic result we study the parallel complexity of selecting the kth smallest of n elements on the CRCW PRAM, a problem that is of independent interest. We give an algorithm that is superior to existing ones when k is small compared to n. Consequently, we show that this problem can be solved in O(loglog n + log k/loglog n) time and O(n) operations for all 1 ["@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/33818038> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/33818038#Series/computer_science_technical_report_series_university_of_maryland_at_college_park> ; # Computer science technical report series (University of Maryland at College Park) ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/33818038#Series/computer_science_technical_report_series_university_of_maryland> ; # Computer science technical report series / University of Maryland ;
   schema:name "Very fast optimal parallel algorithms for heap construction"@en ;
   schema:productID "31961352" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/31961352#PublicationEvent/college_park_md_university_of_maryland_1994> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/33818038#Agent/university_of_maryland> ; # University of Maryland
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/31961352> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/33818038#Agent/university_of_maryland> # University of Maryland
    a bgn:Agent ;
   schema:name "University of Maryland" ;
    .

<http://experiment.worldcat.org/entity/work/data/33818038#Person/raman_rajeev> # Rajeev Raman
    a schema:Person ;
   schema:familyName "Raman" ;
   schema:givenName "Rajeev" ;
   schema:name "Rajeev Raman" ;
    .

<http://experiment.worldcat.org/entity/work/data/33818038#Place/college_park_md> # College Park, Md.
    a schema:Place ;
   schema:name "College Park, Md." ;
    .

<http://experiment.worldcat.org/entity/work/data/33818038#Series/computer_science_technical_report_series_university_of_maryland> # Computer science technical report series / University of Maryland ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/31961352> ; # Very fast optimal parallel algorithms for heap construction
   schema:name "Computer science technical report series / University of Maryland ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/33818038#Series/computer_science_technical_report_series_university_of_maryland_at_college_park> # Computer science technical report series (University of Maryland at College Park) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/31961352> ; # Very fast optimal parallel algorithms for heap construction
   schema:name "Computer science technical report series (University of Maryland at College Park) ;" ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://viaf.org/viaf/43413417> # Paul Frederick Dietz
    a schema:Person ;
   schema:birthDate "1959" ;
   schema:familyName "Dietz" ;
   schema:givenName "Paul Frederick" ;
   schema:name "Paul Frederick Dietz" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.