Efficient weighted multiselection in parallel architectures

We study parallel solutions to the problem of weighted multiselection to select r elements on given weighted-ranks from a set S of n weighted elements, where an element is on weighted rank k if it is the smallest element such that the aggregated weight of all elements not greater than it in S is not...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms and Architectures For Parallel Processing (ICA3PP 2002): 5th International Conference s. 2 - 8
Hlavní autor: Hong Shen
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.01.2002
Témata:
Computational modeling
Computer networks
Cost function
Graph theory
Hypercubes
Parallel architectures
Phase change random access memory
Set theory
Sorting
Statistics
ISBN:0769515126, 9780769515120
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We study parallel solutions to the problem of weighted multiselection to select r elements on given weighted-ranks from a set S of n weighted elements, where an element is on weighted rank k if it is the smallest element such that the aggregated weight of all elements not greater than it in S is not smaller than k. We propose efficient algorithms on two of the most popular parallel architectures, hypercube and mesh. For a hypercube with p < n processors, we present a parallel algorithm running in 0(n/sup /spl isin// min{r, log p}) time for p = n/sup 1-/spl isin//, 0 < /spl isin/ < 1, which is cost optimal when r /spl ges/ p. Our algorithm on /spl radic/p /spl times/ /spl radic/p- mesh runs in O(/spl radic/p + /sub p/-/sup n/ log/sup 3/ p) time which is the same as multiselection on mesh when r /spl ges/ logp, and thus has the same optimality as multiselection in this case.
AbstractList We study parallel solutions to the problem of weighted multiselection to select r elements on given weighted-ranks from a set S of n weighted elements, where an element is on weighted rank k if it is the smallest element such that the aggregated weight of all elements not greater than it in S is not smaller than k. We propose efficient algorithms on two of the most popular parallel architectures, hypercube and mesh. For a hypercube with p < n processors, we present a parallel algorithm running in 0(n/sup /spl isin// min{r, log p}) time for p = n/sup 1-/spl isin//, 0 < /spl isin/ < 1, which is cost optimal when r /spl ges/ p. Our algorithm on /spl radic/p /spl times/ /spl radic/p- mesh runs in O(/spl radic/p + /sub p/-/sup n/ log/sup 3/ p) time which is the same as multiselection on mesh when r /spl ges/ logp, and thus has the same optimality as multiselection in this case.
Author Hong Shen
Author_xml – sequence: 1
  surname: Hong Shen
  fullname: Hong Shen
  organization: Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan
BookMark eNotj91KAzEUhAMqaGtfQG_2BbYm2SRng1dS6g8U7IVelzR7Yo-kaUlSxLd3wc7NMAwM30zYZTokZOxO8LkQ3D68LZ7W67nkXI4ZOq3UBZtwMFYLLaS5ZrNSvvkorcF2_Q17XIZAnjDV5gfpa1dxaPanWKlgRF_pkBpKzdFlFyPGxmW_ozoWp4zlll0FFwvOzj5ln8_Lj8Vru3p_GUFWLUngtVUepRkkKlBWha3yYgC0RvkAvg8jxwBBCmMR-q3RIH0PvXGms-i0D853U3b_v0uIuDlm2rv8uzn_6_4A0mxI8w
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICAPP.2002.1173544
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Statistics
Computer Science
EndPage 8
ExternalDocumentID 1173544
Genre orig-research
GroupedDBID 6IE
6IK
6IL
AAJGR
AAVQY
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i270t-4ce26d2e47494fb4c1d7e964cf7c8f579d7f2169e78b6572c8786a639ea5cfac3
IEDL.DBID RIE
ISBN 0769515126
9780769515120
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000179289800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 18:29:02 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i270t-4ce26d2e47494fb4c1d7e964cf7c8f579d7f2169e78b6572c8786a639ea5cfac3
OpenAccessLink https://cir.nii.ac.jp/crid/1873961342828819968
PageCount 7
ParticipantIDs ieee_primary_1173544
PublicationCentury 2000
PublicationDate 2002-01-01
PublicationDateYYYYMMDD 2002-01-01
PublicationDate_xml – month: 01
  year: 2002
  text: 2002-01-01
  day: 01
PublicationDecade 2000
PublicationTitle Algorithms and Architectures For Parallel Processing (ICA3PP 2002): 5th International Conference
PublicationTitleAbbrev ICAPP
PublicationYear 2002
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000557938
Score 1.3029295
Snippet We study parallel solutions to the problem of weighted multiselection to select r elements on given weighted-ranks from a set S of n weighted elements, where...
SourceID ieee
SourceType Publisher
StartPage 2
SubjectTerms Computational modeling
Computer networks
Cost function
Graph theory
Hypercubes
Parallel architectures
Phase change random access memory
Set theory
Sorting
Statistics
Title Efficient weighted multiselection in parallel architectures
URI https://ieeexplore.ieee.org/document/1173544
WOSCitedRecordID wos000179289800001&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07a8MwED6S0CFT2iSlbzR0rBM_FJ1MpxIS2iV4aCFbsKUTBIJT8mj_fiXZSVvo0k0W6LDvMPfQ3fcB3I_iIjS5piBOkiTgNgcJXFoQRJqEkkVhg1LjySZwNpPzeZo14OE4C0NEvvmMBm7p7_L1Wu1dqWwYRZiMOG9CE1FUs1rHeorDkkoTWWXmNmywjkzUADuH5_AwNBOmw5fxU5b5DoVBLfUXvYr3LtPO_97rFPrfY3osOzqgM2hQ2YXOgaeB1b9tF9ouoqwAmXvwOPGgEVYg-_RlUdLMdxVuPSOONRNblswhgq9WtGI_Lxq2fXibTl7Hz0HNoBAsYwx3AVcUCx0TR55yU3AVaaRUcGVQSWMVptHEkUgJZSFGGCuJUuQ2aKF8pEyuknNoleuSLoBp69VcdugQA62cXDoGPOPOYGSwwEvoOcUs3iuQjEWtk6u_t6-h7WlVfC3jBlq7zZ5u4UR92K_d3HnLfgGVIJ-7
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_MKbjTdJv4bQ4e7damaZPiSWRjwzl2mLDbaJMXGIxO9qH_vknaTQUvXkJS6CN9obyPvPf7AdxHNPN1qtCjYRh6zMQgng0LvEBhLEWWGadUO7IJPhqJ6TQZV-Bh3wuDiK74DNt26u7y1VJubaqsEwQ8jBg7gEMzUr_o1tpnVCyaVBKKIjY3joMxZXEJsbNb-7u2GT_pDJ6fxmNXo9Au5f4iWHH2pVf_385OoPXdqEfGexN0ChXMG1DfMTWQ8sdtQM36lAUkcxMeuw42wggkny4xioq4usK148QxB0XmObGY4IsFLsjPq4Z1C9563clz3ys5FLw55f7GYxJprCgyzhKmMyYDxTGJmdRcCm0UprimQZwgF1kccSoFF3Fq3BZMI6lTGZ5BNV_meA5EGbtm40OLGWjkpMJy4Gn7Dg80z_gFNK1iZu8FTMas1Mnl34_v4Lg_eR3OhoPRyxXUHMmKy2xcQ3Wz2uINHMkP8-WrW3fKXxi5owI
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%3Abook&rft.genre=proceeding&rft.title=Algorithms+and+Architectures+For+Parallel+Processing+%28ICA3PP+2002%29%3A+5th+International+Conference&rft.atitle=Efficient+weighted+multiselection+in+parallel+architectures&rft.au=Hong+Shen&rft.date=2002-01-01&rft.pub=IEEE&rft.isbn=9780769515120&rft.spage=2&rft.epage=8&rft_id=info:doi/10.1109%2FICAPP.2002.1173544&rft.externalDocID=1173544
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769515120/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769515120/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769515120/sc.gif&client=summon&freeimage=true