Efficient in-place sorting algorithms using feasible parallel machine models

We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sor...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) pp. 15 - 21
Main Authors: Zheng, S.Q., Calidas, B., Yanjung Zhang
Format: Conference Proceeding
Language:English
Published: IEEE 1996
Subjects:
Application software
Computer science
Concurrent computing
Data communication
Memory management
Parallel machines
Parallel processing
Power engineering and energy
Power engineering computing
Sorting
ISBN:0818674601, 9780818674600
ISSN:1087-4089
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sort by experimental results obtained on a MasPar parallel computer. Our experiments indicate that ZZ-sort can be incorporated into a distributed memory parallel computer system as a standard routine, and this routine is useful for space critical situations. Finally, we show that ZZ-sort can be used to convert a non-adaptive parallel sorting algorithm into an in-place and adaptive one by considering the problem of sorting an arbitrarily large input on fixed-size reconfigurable meshes.
AbstractList We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We also demonstrate the average performance of ZZ-sort by experimental results obtained on a MasPar parallel computer. Our experiments indicate that ZZ-sort can be incorporated into a distributed memory parallel computer system as a standard routine, and this routine is useful for space critical situations. Finally, we show that ZZ-sort can be used to convert a non-adaptive parallel sorting algorithm into an in-place and adaptive one by considering the problem of sorting an arbitrarily large input on fixed-size reconfigurable meshes.
Author Calidas, B.
Zheng, S.Q.
Yanjung Zhang
Author_xml – sequence: 1
  givenname: S.Q.
  surname: Zheng
  fullname: Zheng, S.Q.
  organization: Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
– sequence: 2
  givenname: B.
  surname: Calidas
  fullname: Calidas, B.
– sequence: 3
  surname: Yanjung Zhang
  fullname: Yanjung Zhang
BookMark eNotj1FLwzAUhQNOcJv7AfqUP9B5Y9s0eRxjukFRwb2P2-Rmi6RpaeqD_97KPC_n8B04cBZsFrtIjD0IWAsB-unw-bF5Wwut5boEpcvyhi1ACSWrQoKYsbkAVWXFVN2xVUpfMKkslSz0nNU757zxFEfuY9YHNMRTN4w-njmGczf48dIm_p3-gCNMvgnEexwwBAq8RXPxkXjbWQrpnt06DIlW_75kx5fdcbvP6vfXw3ZTZ15AMWZNCVY3xhWQG-U0kq2Uc8rKHIU10KA1U25UTlAYA2gbUM7k8Ewkq4ryJXu8znoiOvWDb3H4OV2v579GiFGK
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISPAN.1996.508955
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 21
ExternalDocumentID 508955
GroupedDBID 23M
29O
6IE
6IF
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i104t-b50d9bcf403c8f9aed78ff8d63a1dc0badcd63b83e04cc0adb08fc302ee677e3
IEDL.DBID RIE
ISBN 0818674601
9780818674600
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=508955&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1087-4089
IngestDate Tue Aug 26 17:11:53 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-b50d9bcf403c8f9aed78ff8d63a1dc0badcd63b83e04cc0adb08fc302ee677e3
PageCount 7
ParticipantIDs ieee_primary_508955
PublicationCentury 1900
PublicationDate 19960000
PublicationDateYYYYMMDD 1996-01-01
PublicationDate_xml – year: 1996
  text: 19960000
PublicationDecade 1990
PublicationTitle Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96)
PublicationTitleAbbrev ISPAN
PublicationYear 1996
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558649
ssj0020396
Score 1.3663114
Snippet We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic...
SourceID ieee
SourceType Publisher
StartPage 15
SubjectTerms Application software
Computer science
Concurrent computing
Data communication
Memory management
Parallel machines
Parallel processing
Power engineering and energy
Power engineering computing
Sorting
Title Efficient in-place sorting algorithms using feasible parallel machine models
URI https://ieeexplore.ieee.org/document/508955
WOSCitedRecordID wos508955&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/eLvHCXMwlV1LS8NAEF5s8eCpWiu-2YPXtJtu9pGjSEWhlIJFeiv7rIE0kSb197u7SSuCF2-zgWzChuHLzHzzDQAPDnGco2kVpQ58o0QwFHErkbPSsXT4LppkzvuUzWZ8uUznrc526IUxxgTymRl6M9Tydal2PlU2cj8TKSEd0GGMNq1ah3QKIoRTH0m0sRbCYTRXjJwPJe62IP3oxdsSF4G0wjv79b7aGaN09Po2f5z5Fj46bJ72a-pKAJ3n3r9e9xQMfpr34PwAS2fgyBR90NtPb4CtM5-D6SSoR7gtYFZEgZsFq9KLCqyhyNflNqs_NhX0xPg1tEY438kN9FLheW5yuAksTAPDKJ1qABbPk8XTS9TOVogyF4DVkSRIp1LZBGHFbSqMZtxarikWsVZICq2cLTk2KFEKCS0RtwqjsTGUMYMvQLcoC3MJIKVEEMmQpeM4UTQRwpcaJWYxsZxhdQX6_mhWn416xqo5les_r96Ak4YV7VMct6Bbb3fmDhyrrzqrtvfhi38DA4SmNg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA46BT1N58Tf5uC1W7o0TXoUmWxYy8Ahu40kTWahW2Xt_PtN0m4iePH2UmhaUh6v3_vxfQA8mIhjHC2VXmSCrxdwijymBTJWNBAmvvM6mfMe0yRhs1k0aXi23SyMUso1n6meNV0tPy3kxqbK-uZnIiJkHxyQwMCeelhrl1BBhLDQYokGbSHsxLl8ZLwoMDc68kdL3xYYDNJQ72zX23qnj6L--G3ymNghvrBXP--X7ooLO8_tf73wCej-jO_ByS4wnYI9teqA9la_ATbufAbioeOPMFvAbOW57ixYFpZWYAF5vijWWfWxLKFtjV9ArbjxnlxBSxae5yqHS9eHqaAT0ym7YPo8nD6NvEZdwcsMBKs8QVAaCakDhCXTEVcpZVqzNMTcTyUSPJXGFgwrFEiJeCoQ0xKjgVIhpQqfg9aqWKkLAMOQcCIo0uHAD2QYcG6LjQJTn2hGsbwEHXs088-aP2Nen8rVn1fvwdFo-hrP43Hycg2O6x5pm_C4Aa1qvVG34FB-VVm5vnNf_xva9ql9
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+Second+International+Symposium+on+Parallel+Architectures%2C+Algorithms%2C+and+Networks+%28I-SPAN%2796%29&rft.atitle=Efficient+in-place+sorting+algorithms+using+feasible+parallel+machine+models&rft.au=Zheng%2C+S.Q.&rft.au=Calidas%2C+B.&rft.au=Yanjung+Zhang&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780818674600&rft.issn=1087-4089&rft.spage=15&rft.epage=21&rft_id=info:doi/10.1109%2FISPAN.1996.508955&rft.externalDocID=508955
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1087-4089&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1087-4089&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1087-4089&client=summon