Sorting on the SGI Origin 2000: comparing MPI and shared memory implementations

Analyses the C/sup 3/-Radix (Communication- and Cache-Conscious Radix) sort algorithm, using the distributed and the shared memory parallel programming models. C/sup 3/-Radix was originally proposed based on the idea of the classic Radix sort to exploit the memory hierarchy locality and to reduce th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society s. 209 - 215
Hlavní autoři: Jimenez-Gonzalez, D., Guinovart, E., Larriba-Pey, J.-L., Navarro, J.J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1999
Témata:
Computer architecture
Contracts
Graphics
Memory architecture
Message passing
Multiprocessor interconnection networks
Postal services
Programming profession
Silicon
Sorting
ISBN:0769502962, 9780769502960
ISSN:1522-4902
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 Analyses the C/sup 3/-Radix (Communication- and Cache-Conscious Radix) sort algorithm, using the distributed and the shared memory parallel programming models. C/sup 3/-Radix was originally proposed based on the idea of the classic Radix sort to exploit the memory hierarchy locality and to reduce the amount of communication for distributed memory computers. We implement C/sup 3/-Radix on the SGI Origin 2000 NUMA multiprocessor and make use of the Message Passing Interface (MPI) and the native shared memory directives of that computer to implement the two programming models that we want to analyse. We give results for up to 16 processors and 64 million 32-bit keys. The results show that for data sets that are small compared to the number of processors, the MPI implementation is faster, while for data sets that are large, the shared memory implementation is faster. In this paper, we explain the reasons for the different behaviours depending on the size of the data sets.
AbstractList Analyses the C/sup 3/-Radix (Communication- and Cache-Conscious Radix) sort algorithm, using the distributed and the shared memory parallel programming models. C/sup 3/-Radix was originally proposed based on the idea of the classic Radix sort to exploit the memory hierarchy locality and to reduce the amount of communication for distributed memory computers. We implement C/sup 3/-Radix on the SGI Origin 2000 NUMA multiprocessor and make use of the Message Passing Interface (MPI) and the native shared memory directives of that computer to implement the two programming models that we want to analyse. We give results for up to 16 processors and 64 million 32-bit keys. The results show that for data sets that are small compared to the number of processors, the MPI implementation is faster, while for data sets that are large, the shared memory implementation is faster. In this paper, we explain the reasons for the different behaviours depending on the size of the data sets.
Author Guinovart, E.
Navarro, J.J.
Jimenez-Gonzalez, D.
Larriba-Pey, J.-L.
Author_xml – sequence: 1
  givenname: D.
  surname: Jimenez-Gonzalez
  fullname: Jimenez-Gonzalez, D.
  organization: Dept. d'Arquitectura de Comput., Univ. Politecnica de Catalunya, Barcelona, Spain
– sequence: 2
  givenname: E.
  surname: Guinovart
  fullname: Guinovart, E.
– sequence: 3
  givenname: J.-L.
  surname: Larriba-Pey
  fullname: Larriba-Pey, J.-L.
– sequence: 4
  givenname: J.J.
  surname: Navarro
  fullname: Navarro, J.J.
BookMark eNotj0FLwzAYhgNOcJ3exVP-QOuXtGnyeZOiszCp0N1H23zdImta0l7271Xm6T08Dw-8EVv50RNjjwISIQCf66IoEoGIiREgEG5YBDpHBRJzuWJroaSMMwR5x6J5_gaQv0SsWVWPYXH-yEfPlxPxelvyKrij81wCwAvvxmFqwp_x-VXyxls-n5pAlg80jOHC3TCdaSC_NIsb_XzPbvvmPNPD_27Y_v1tX3zEu2pbFq-72BlcYqWktag6CZhRpowxrbSdxUxrkirV1Btt807qHiyQ6KzQqW7bLhW9zrBN0w17umYdER2m4IYmXA7X6-kPNKZNyA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SCCC.1999.810190
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 Computer Science
EndPage 215
ExternalDocumentID 810190
GroupedDBID 23M
29O
29R
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i89t-552dd95c2094e45888b2dcd9477e2537ef87d6c27f0d0e1cd1737bbc31f749b33
IEDL.DBID RIE
ISBN 0769502962
9780769502960
ISSN 1522-4902
IngestDate Tue Aug 26 16:57:22 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-552dd95c2094e45888b2dcd9477e2537ef87d6c27f0d0e1cd1737bbc31f749b33
PageCount 7
ParticipantIDs ieee_primary_810190
PublicationCentury 1900
PublicationDate 19990000
PublicationDateYYYYMMDD 1999-01-01
PublicationDate_xml – year: 1999
  text: 19990000
PublicationDecade 1990
PublicationTitle Proceedings. SCCC'99 XIX International Conference of the Chilean Computer Science Society
PublicationTitleAbbrev SCCC
PublicationYear 1999
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020291
ssj0000443293
Score 1.4193794
Snippet Analyses the C/sup 3/-Radix (Communication- and Cache-Conscious Radix) sort algorithm, using the distributed and the shared memory parallel programming models....
SourceID ieee
SourceType Publisher
StartPage 209
SubjectTerms Computer architecture
Contracts
Graphics
Memory architecture
Message passing
Multiprocessor interconnection networks
Postal services
Programming profession
Silicon
Sorting
Title Sorting on the SGI Origin 2000: comparing MPI and shared memory implementations
URI https://ieeexplore.ieee.org/document/810190
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFLWgYmACShFveWANdfyoY9aIQgfaSu3QrfITOjRBfSDx99hO0gqJhS22IjmyHfme63vOAeDBRwmOaaITSQhNqE5topgyiUmdM0ZoRrSLZhN8OMxmMzGudbYjF8ZaG4vP7GN4jHf5ptTbkCrrBjEq4fH5Iee8omrt0imIUoL3lEgP6UUlleqxFhWoRuyC-f4eroV3mjZqri-R6E7yPA8MPr-D4mC_TFfimdM_-dfXnoLOnrsHx7tT6Qwc2KINThrzBlj_y-dgNCmDgMA7LAvog0A4eRnAUXTJgoFX8wSr6vTwxtt4AGVh4PojVKvDZSjO_YaLZVN6HrduB0z7z9P8NandFZJFJjYJY9ivBdPY4zsb6KqZwkYbQTm3mBFuXcZNT2PukEE21SblhCulSeo4FYqQC9AqysJeAihTKntZCLyopE5jmTmKtJVWCK6Yo1egHWZn_lnpZ8yribn-s_cGHFfCCCHJcQtam9XW3oEj_bVZrFf3cc1_ABPzpWI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwGLVQQYKpUIq48cAamvioY9aI0opeUjt0q-ILOjRBPZD499hO0gqJhS22IjmyHfl7n7_3HgCPNkowVGIZpBiTgMhIB4IKFajIGKW4pFgabzbBhsN4NuPjUmfbc2G01r74TD-5R3-Xr3K5damylhOj4hafH1JCUFSQtXYJlZAQjPakSAvqeSGWatEW4WGJ2Tm1_W1USu9U7bC6wAx5a5IkiePw2T3kh_tlu-JPnU79X997Cpp79h4c786lM3CgswaoV_YNsPybz8FokjsJgXeYZ9CGgXDy2oMj75MFHbPmGRb16e6NwbgH00zB9YerV4dLV577DRfLqvjcb94mmHZepkk3KP0VgkXMNwGlyK4GlcgiPO0Iq7FASipOGNOIYqZNzFRbImZCFepIqohhJoTEkWGEC4wvQC3LM30JYBqRtB270IukxEiUxoaEUqeacyaoIVeg4WZn_lkoaMyLibn-s_cBHHeng_683xu-3YCTQibBpTxuQW2z2uo7cCS_Nov16t6v_w_lbaip
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=Proceedings.+SCCC%2799+XIX+International+Conference+of+the+Chilean+Computer+Science+Society&rft.atitle=Sorting+on+the+SGI+Origin+2000%3A+comparing+MPI+and+shared+memory+implementations&rft.au=Jimenez-Gonzalez%2C+D.&rft.au=Guinovart%2C+E.&rft.au=Larriba-Pey%2C+J.-L.&rft.au=Navarro%2C+J.J.&rft.date=1999-01-01&rft.pub=IEEE&rft.isbn=9780769502960&rft.issn=1522-4902&rft.spage=209&rft.epage=215&rft_id=info:doi/10.1109%2FSCCC.1999.810190&rft.externalDocID=810190
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1522-4902&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1522-4902&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1522-4902&client=summon