Back to Results
First PageMeta Content
Data management / Sorting algorithms / Priority queue / D-ary heap / Heap / B-tree / Lock / Skew heap / Pile / Graph theory / Abstract data types / Computing


Tech. Rep[removed]An Ecient Algorithm for Concurrent Priority Queue Heaps Galen C. Hunt Maged M. Michael Srinivasan Parthasarathy Michael L. Scott Department of Computer Science, University of Rochester, Rochester, NY 14
Add to Reading List

Document Date: 2011-03-27 21:03:46

Open Document

File Size: 158,37 KB

Share Result on Facebook

City

Cambridge / /

Company

MIT Press / Silicon Graphics / /

/

Facility

University of Rochester / /

IndustryTerm

graph search / e.g. heuristic search algorithms / concurrent priority queue heap algorithm / multi-lock algorithms / insertion algorithm / lock algorithm / serialized single-lock algorithm / concurrent priority queue algorithm / multi-lock algorithm / erent algorithms / /

Organization

Concurrent Priority Queue Heaps Galen C. Hunt Maged M. Michael Srinivasan Parthasarathy Michael L. Scott Department of Computer Science / National Science Foundation / MIT / University of Rochester / Rochester / /

Person

Michael L. Scott / Galen C. Hunt / M. Michael Srinivasan Parthasarathy Michael / /

Position

mp / Salesman / /

ProgrammingLanguage

C / /

ProvinceOrState

Massachusetts / /

PublishedMedium

Communications of the ACM / IEEE Transactions on Computers / /

Technology

previous algorithm / dedicated processor / e.g. heuristic search algorithms / concurrent priority queue heap algorithm / erent algorithms / multi-lock algorithms / concurrent priority queue algorithm / multi-lock algorithm / simulation / 2 1 1 2 3 4 5 6 7 Processors / shared memory / Parallel Graph Algorithms / insertion algorithm / Parallel Processing / cient Algorithm / two algorithms / lock algorithm / /

SocialTag