List ranking on processor arrays

List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays. This algorithm runs on an array of n/log 2 n processors with the expected run-time of O(log 2 n). As list...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software Vol. 55; no. 2; pp. 185 - 192
Main Author: Hasan, Cam
Format: Journal Article
Language:English
Published: New York Elsevier Inc 29.12.2000
Elsevier Sequoia S.A
Subjects:
Algorithms
Arrays
List ranking
Parallel algorithm
Processor array
Studies
Work-efficient PRAM algorithm
List ranking
Parallel algorithm
Processor array
Work-efficient PRAM algorithm
ISSN:0164-1212, 1873-1228
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays. This algorithm runs on an array of n/log 2 n processors with the expected run-time of O(log 2 n). As list ranking is highly communication intensive, the proposed algorithm is able to reduce communication cost among processors by assigning sublists, instead of arbitrary cells, of a linked list to each processor. The proposed algorithm is also capable of keeping all processors busy during the whole list-ranking process in order to utilize all processors efficiently.
AbstractList This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays.
List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays. This algorithm runs on an array of n/log sub(2) n processors with the expected run-time of O(log sub(2) n). As list ranking is highly communication intensive, the proposed algorithm is able to reduce communication cost among processors by assigning sublists, instead of arbitrary cells, of a linked list to each processor. The proposed algorithm is also capable of keeping all processors busy during the whole list-ranking process in order to utilize all processors efficiently.
List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays. This algorithm runs on an array of n/log 2 n processors with the expected run-time of O(log 2 n). As list ranking is highly communication intensive, the proposed algorithm is able to reduce communication cost among processors by assigning sublists, instead of arbitrary cells, of a linked list to each processor. The proposed algorithm is also capable of keeping all processors busy during the whole list-ranking process in order to utilize all processors efficiently.
Author Çam, Hasan
Author_xml – sequence: 1
  givenname: Cam
  surname: Hasan
  fullname: Hasan, Cam
BookMark eNqFkE9LAzEQxYNUsK1-BGHxIHpYncnuJtuTSPEfFDyo55DNZiW1TWpmK_Tbm7biwYuXGZj5zePNG7GBD94ydopwhYDi-iWVMkeO_ALgEgDEJK8P2BBrWaQxrwds-IscsRHRPEGSAx-ybOaoz6L2H86_Z8FnqxiMJQox0zHqDR2zw04vyJ789DF7u797nT7ms-eHp-ntLDcFFn2ObaO1aHDSaWHaWkwEllK0ndAcsOJSCi3LApu0qUpsTcNNZbSpeVeZsuFNMWbne91k4HNtqVdLR8YuFtrbsCbFZSUQBCbw7A84D-vokzfFeRIHAZCgag-ZGIii7dQquqWOG4WgtqGpXWhqm4gCULvQVJ3ubvZ3Nr365WxUZJz1xrYuWtOrNrh_FL4B8QZzBg
CODEN JSSODM
Cites_doi 10.1109/34.184775
10.1007/BFb0040376
10.1006/jcss.1996.0074
10.1109/71.629484
ContentType Journal Article
Copyright 2000 Elsevier Science Inc.
Copyright Elsevier Sequoia S.A. Dec 29, 2000
Copyright_xml – notice: 2000 Elsevier Science Inc.
– notice: Copyright Elsevier Sequoia S.A. Dec 29, 2000
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/S0164-1212(00)00069-8
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1873-1228
EndPage 192
ExternalDocumentID 66781222
10_1016_S0164_1212_00_00069_8
S0164121200000698
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9M8
AABNK
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
AAYOK
ABBOA
ABEFU
ABFNM
ABFRF
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADHUB
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
TAE
TN5
TWZ
UHS
UNMZH
VH1
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AGCQF
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c313t-1dbaa6b19fa6cd86961476df6a20152776a7431b869541dcb2c5cac82f5c4b2b3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000166218500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0164-1212
IngestDate Sat Sep 27 18:22:27 EDT 2025
Wed Sep 03 01:06:12 EDT 2025
Sat Nov 29 02:31:51 EST 2025
Fri Feb 23 02:34:14 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords List ranking
Parallel algorithm
Processor array
Work-efficient PRAM algorithm
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c313t-1dbaa6b19fa6cd86961476df6a20152776a7431b869541dcb2c5cac82f5c4b2b3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 229540600
PQPubID 45802
PageCount 8
ParticipantIDs proquest_miscellaneous_27561061
proquest_journals_229540600
crossref_primary_10_1016_S0164_1212_00_00069_8
elsevier_sciencedirect_doi_10_1016_S0164_1212_00_00069_8
PublicationCentury 2000
PublicationDate 2000-12-29
PublicationDateYYYYMMDD 2000-12-29
PublicationDate_xml – month: 12
  year: 2000
  text: 2000-12-29
  day: 29
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle The Journal of systems and software
PublicationYear 2000
Publisher Elsevier Inc
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier Inc
– name: Elsevier Sequoia S.A
References Cormen, Leiserson, Rivest (BIB3) 1991
Chen, Davis, Kruskal (BIB2) 1993; 15
Reid-Miller (BIB6) 1996; 53
Anderson, R., Miller, G.L., 1988. Deterministic parallel list ranking. In: Reif, J.H. (Ed.), VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC88. Lecture Notes in Computer Science, vol. 319. Springer, New York, pp. 81–90
Wyllie, J.C., 1979. The complexity of parallel computations. Technical Report TR-79-387, Department of Computer Science, Cornell University, Ithaca, NY, August 1979
Reid-Miller, Miller, Modugno (BIB5) 1993
Patel, Khokhar, Jamieson (BIB4) 1997; 8
Cormen (10.1016/S0164-1212(00)00069-8_BIB3) 1991
Reid-Miller (10.1016/S0164-1212(00)00069-8_BIB6) 1996; 53
10.1016/S0164-1212(00)00069-8_BIB7
Reid-Miller (10.1016/S0164-1212(00)00069-8_BIB5) 1993
Chen (10.1016/S0164-1212(00)00069-8_BIB2) 1993; 15
10.1016/S0164-1212(00)00069-8_BIB1
Patel (10.1016/S0164-1212(00)00069-8_BIB4) 1997; 8
References_xml – volume: 15
  start-page: 69
  year: 1993
  end-page: 81
  ident: BIB2
  article-title: Efficient parallel processing of image contours
  publication-title: IEEE Trans. Pattern Analysis and Machine Intelligence
– volume: 53
  start-page: 344
  year: 1996
  end-page: 356
  ident: BIB6
  article-title: List ranking and list scan on the CRAY C90
  publication-title: J. Comput. Syst. Sci.
– start-page: 115
  year: 1993
  end-page: 194
  ident: BIB5
  article-title: List ranking and parallel tree contraction
  publication-title: Synthesis of Parallel Algorithms
– year: 1991
  ident: BIB3
  publication-title: Introduction to Algorithms
– volume: 8
  start-page: 1006
  year: 1997
  end-page: 1017
  ident: BIB4
  article-title: Scalable parallel implementations of list ranking on fine-grained machines
  publication-title: IEEE Trans. on Parallel and Distributed Systems
– reference: Wyllie, J.C., 1979. The complexity of parallel computations. Technical Report TR-79-387, Department of Computer Science, Cornell University, Ithaca, NY, August 1979
– reference: Anderson, R., Miller, G.L., 1988. Deterministic parallel list ranking. In: Reif, J.H. (Ed.), VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC88. Lecture Notes in Computer Science, vol. 319. Springer, New York, pp. 81–90
– volume: 15
  start-page: 69
  issue: 1
  year: 1993
  ident: 10.1016/S0164-1212(00)00069-8_BIB2
  article-title: Efficient parallel processing of image contours
  publication-title: IEEE Trans. Pattern Analysis and Machine Intelligence
  doi: 10.1109/34.184775
– ident: 10.1016/S0164-1212(00)00069-8_BIB1
  doi: 10.1007/BFb0040376
– start-page: 115
  year: 1993
  ident: 10.1016/S0164-1212(00)00069-8_BIB5
  article-title: List ranking and parallel tree contraction
– volume: 53
  start-page: 344
  year: 1996
  ident: 10.1016/S0164-1212(00)00069-8_BIB6
  article-title: List ranking and list scan on the CRAY C90
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.1996.0074
– ident: 10.1016/S0164-1212(00)00069-8_BIB7
– volume: 8
  start-page: 1006
  issue: 10
  year: 1997
  ident: 10.1016/S0164-1212(00)00069-8_BIB4
  article-title: Scalable parallel implementations of list ranking on fine-grained machines
  publication-title: IEEE Trans. on Parallel and Distributed Systems
  doi: 10.1109/71.629484
– year: 1991
  ident: 10.1016/S0164-1212(00)00069-8_BIB3
SSID ssj0007202
Score 1.5741991
Snippet List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm...
This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays.
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 185
SubjectTerms Algorithms
Arrays
List ranking
Parallel algorithm
Processor array
Studies
Work-efficient PRAM algorithm
Title List ranking on processor arrays
URI https://dx.doi.org/10.1016/S0164-1212(00)00069-8
https://www.proquest.com/docview/229540600
https://www.proquest.com/docview/27561061
Volume 55
WOSCitedRecordID wos000166218500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-1228
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007202
  issn: 0164-1212
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELZ4HXopFFqx5dEcKkRVpU2cxE6OCC2CarUgdUF7s_xIpF6yy2a3hX_PTOwk21YIOHCxIudhZT5n_MUez0fIZ2m0iRTlfqES5sdaB77CRV4VMKU4L3JT5-m-GfDhMB2PsysnjVjVcgK8LNO7u2z6qlBDHYCNW2dfAHf7UKiAYwAdSoAdymcBPwDgvqIUex3PXEdg4VYADJaczeR9tUxHu41hNSW1aZ1t1uYK_PMf2YXGntqecy6bKJ5mqqAOu3DzCW72kGGSwvAv92ez5DqY6ZIvC62WjhsWQytZ95_HtT__P9tHAy9GeWnUImWZn3bDTLO0PrwUZ9eDgRj1x6Oj6a2PAmC4UO7UUFbJOuVJBg5q_eSiP_7RDquc1gGkbUPddqzvXevHQfDFtfwY0fhnyK15xGiLvHXW9k4scO_ISl5uk81GXMNzvnaHeIij53D0JqXX4uhZHN-T67P-6PTcd3IWvo7CaO6HRknJVJgVkmmTsgyYEWemYBJIWEI5ZxLpnIIzSRwarahOtNQpLRIdK6qiD2StnJT5LvGMZlQaaVjKZYwZ-HSRRVlQUK4Ui5TukW_Nu4upzVoilsL5WCzQWCLA1LBgLJH2SNpYSDjqZSmVAJyfunWvsahwn0ElUCQeqGIQ9Min9iw4LlyNkmU-WcAlHKk7Cz8-ecUeedP15n2yNp8t8gOyoX_Pf1WzQ9dPHgC-vVz4
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=List+ranking+on+processor+arrays&rft.jtitle=The+Journal+of+systems+and+software&rft.au=Cam%2C+Hasan&rft.date=2000-12-29&rft.issn=0164-1212&rft.volume=55&rft.issue=2&rft.spage=185&rft.epage=192&rft_id=info:doi/10.1016%2FS0164-1212%2800%2900069-8&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0164-1212&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0164-1212&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0164-1212&client=summon