Abstract
Parallel list ranking is a hard problem due to its extreme degree of irregularity. Also, because of its linear sequential complexity, it requires considerable effort just to reach speed-up one (break even). In this paper, we address the question of how to solve the list-ranking problem for lists of length up to 2×108in practice: we consider implementations on the Intel Paragon, whose PUs are laid out as a grid. It turns out that pointer jumping, independent-set removal, and sparse ruling sets all have practical importance for current systems. For the sparse- ruling-set algorithm the speed-up strongly increases with the numberkof nodes per PU, finally reaching 27 with 100 PUs, fork=2×106.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
