English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Practical Parallel List Ranking

Sibeyn, J. F., Guillaume, F., & Seidel, T. (1997). Practical Parallel List Ranking. In G. Bilardi, A. Ferreira, R. Lüling, & J. Rolim (Eds.), Solving Irregularly Structured Problems in Parallel (pp. 25-36). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3972-0 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-432A-8
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://rdcu.be/dwp2l (Publisher version)
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Sibeyn, Jop F.1, Author
Guillaume, Frank2, Author           
Seidel, Tillmann2, 3, Author           
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
3Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 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 to just 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 \cdot 10^8$
in 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 number $k$ of nodes per PU, to finally reach
$27$ with 100 PUs, for $k = 2 \cdot 10^6$.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517901
Other: Local-ID: C1256428004B93B8-1DAC8C00FFA6BEAFC12565CB004F29CF-SibeynGuillaumeSeidel1997
DOI: 10.1007/3-540-63138-0_3
BibTex Citekey: Sibeyn-et-al_IRREGULAR97
 Degree: -

Event

show
hide
Title: 4th International Symposium on Solving Irregularly Structured Problems in Parallel
Place of Event: Paderborn, Germany
Start-/End Date: 1997-06-12 - 1997-06-13

Legal Case

show

Project information

show

Source 1

show
hide
Title: Solving Irregularly Structured Problems in Parallel
  Abbreviation : IRREGULAR 1997
  Subtitle : 4th International Symposium, IRREGULAR'97
Source Genre: Proceedings
 Creator(s):
Bilardi, G.1, Editor
Ferreira, Afonso1, Editor
Lüling, R.1, Editor
Rolim, J.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 25 - 36 Identifier: ISBN: 978-3-540-63138-5

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1253 Sequence Number: - Start / End Page: - Identifier: -