Dynamic load balance in parallel merge sorting over homogeneous clusters

Sorting is one of the most usual and important operations carried out in a computer. The time required by the sequential sorting algorithms is an important problem when working with large sized sequences. As solution, we can consider parallelization and attaining a near optimal performance achieving...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) Jg. 2; S. 219 - 222 vol.2
Hauptverfasser: Armando, D.G., Marcelo, N., Franco, C., Laura, D.G.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2005
Schlagworte:
Algorithm Parallelization
Computer architecture
Computer science
Concurrent computing
Dynamic Redistribution
Hardware
Load Balancing
Load management
Parallel algorithms
Parallel processing
Performance Prediction
Prediction algorithms
Sorting
ISBN:9780769522494, 0769522491
ISSN:1550-445X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Sorting is one of the most usual and important operations carried out in a computer. The time required by the sequential sorting algorithms is an important problem when working with large sized sequences. As solution, we can consider parallelization and attaining a near optimal performance achieving a balance in the work to be done by processors. Notice that the work does not depend only on the amount of data but also on the sequence disordering, and on the relative computer power of processors. This paper develops a technique of redistributing dynamically the data load from the prediction of work to be carried out by each processor, balancing the load among the different processes. The method is proved to reach the theoretical optimum for the parallel algorithm performance.
AbstractList Sorting is one of the most usual and important operations carried out in a computer. The time required by the sequential sorting algorithms is an important problem when working with large sized sequences. As solution, we can consider parallelization and attaining a near optimal performance achieving a balance in the work to be done by processors. Notice that the work does not depend only on the amount of data but also on the sequence disordering, and on the relative computer power of processors. This paper develops a technique of redistributing dynamically the data load from the prediction of work to be carried out by each processor, balancing the load among the different processes. The method is proved to reach the theoretical optimum for the parallel algorithm performance.
Author Franco, C.
Marcelo, N.
Armando, D.G.
Laura, D.G.
Author_xml – sequence: 1
  givenname: D.G.
  surname: Armando
  fullname: Armando, D.G.
  organization: Sch. of Comput. Sci., La Plata Nat. Univ., Argentina
– sequence: 2
  givenname: N.
  surname: Marcelo
  fullname: Marcelo, N.
  organization: Sch. of Comput. Sci., La Plata Nat. Univ., Argentina
– sequence: 3
  givenname: C.
  surname: Franco
  fullname: Franco, C.
  organization: Sch. of Comput. Sci., La Plata Nat. Univ., Argentina
– sequence: 4
  givenname: D.G.
  surname: Laura
  fullname: Laura, D.G.
  organization: Sch. of Comput. Sci., La Plata Nat. Univ., Argentina
BookMark eNotzk9LwzAYgPGAE9zmjp685Au0Jm3-NMcydRsMvSh4G2_St7WSJiPZhH17BT09tx_PgsxCDEjIHWcl58w8tLuXtqwYkyVXzRVZGd0wrYysKmHEjMy5lKwQQn7ckEXOX4zVSmg5J9vHS4BpdNRH6KgFD8EhHQM9QgLv0dMJ04A0x3Qaw0DjNyb6Gac4YMB4ztT5cz5hyrfkugefcfXfJXl_fnpbb4v962a3bvfFyLU8Fb2ExirssDFG91ZopawUPYCrOi6M639_rZSoa9UrK0A64WzTgXLOYuVMvST3f-6IiIdjGidIlwMXVa0aXv8APKJPSQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/AINA.2005.168
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
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 Engineering
Computer Science
EndPage 222 vol.2
ExternalDocumentID 1423681
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-f5a8b6ede8997fb4766b54faac2d149cf249b55e736f6b4a5c4cb8da6ccbe2c93
IEDL.DBID RIE
ISBN 9780769522494
0769522491
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000229285400048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1550-445X
IngestDate Wed Aug 27 02:16:28 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-f5a8b6ede8997fb4766b54faac2d149cf249b55e736f6b4a5c4cb8da6ccbe2c93
ParticipantIDs ieee_primary_1423681
PublicationCentury 2000
PublicationDate 20050000
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – year: 2005
  text: 20050000
PublicationDecade 2000
PublicationTitle 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)
PublicationTitleAbbrev AINA
PublicationYear 2005
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0036475
ssj0000451511
Score 1.5714103
Snippet Sorting is one of the most usual and important operations carried out in a computer. The time required by the sequential sorting algorithms is an important...
SourceID ieee
SourceType Publisher
StartPage 219
SubjectTerms Algorithm Parallelization
Computer architecture
Computer science
Concurrent computing
Dynamic Redistribution
Hardware
Load Balancing
Load management
Parallel algorithms
Parallel processing
Performance Prediction
Prediction algorithms
Sorting
Title Dynamic load balance in parallel merge sorting over homogeneous clusters
URI https://ieeexplore.ieee.org/document/1423681
Volume 2
WOSCitedRecordID wos000229285400048&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/eLvHCXMwlZ27T8MwEMatUjHAUmiLeMsDI6Ek8SMZK6AqS9UBpG6Vfb5ApdCgpuHvx3bSx8DClmSIosvjfJf7fh8hdyg4KBOpIEJbojANSaA104ERGMcCZBaltdmEnEyS2Sydtsj9VguDiH74DB_cpv-XbwqoXKtsENrcL5zO-kBKUWu1tv0Ux0nxqK36K-yw6NyzUvljwBif1SV7apcbLA0b8s5mn-3gm4Ph62RYt1pCh1_ds1zxGWfU-d-1npD-TrpHp9ukdEpauOySzsa7gTavcpcc74EIe2T8XBvT07xQhmo37mjPs1hSRwbPc8ypV2nSsnDQgQ_q5j7pZ_FV2McPi6qkkFeOuFD2yfvo5e1pHDQeC8HCLhzWQcZVogUatHWXzDSTQmjOMqUgMrZ4gsyGR3OOMhaZ0ExxYKATowSAxgjS-Iy0l8USzwmVoQLDmYHUpjxgRmVRjM4B0IQqDGV2QXouTPPvGqMxbyJ0-ffhK3LkKam-23FN2utVhTfkEH7Wi3J16-_9L3Bkqus
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1NT4NAEIY3TTVRL9W2xm_34FFsgd0Fjo3atLGSHmrSW7MfgzZBMKX4-91dsO3BizfgQMhkYXaGeZ8XoTtgVHLlcccDXaIQIUNHCCIcxcD3mQwSL6rMJoI4DufzaNpA9xstDADY4TN4MIf2X77KZWlaZT1X535mdNZ7lBCvX6m1Nh0VQ0qxsK3qO2zA6NTSUmnfIYTOq6I90hsOErk1e-f3nGzxm73BOB5UzRbXAFh3TFdszhm2_ve0x6i7Fe_h6SYtnaAGZG3U-nVvwPXL3EZHOyjCDho9Vdb0OM25wsIMPOr7LDNs2OBpCim2Ok1c5AY78I7N5Cf-yD9zvQAhLwss09IwF4ouehs-zx5HTu2y4Cz11mHtJJSHgoECXXkFiSABY4KShHPpKV0-yUSHR1AKgc8SJginkkgRKs6kFODJyD9FzSzP4AzhwOVSUaJkpJOeJIonng_GA1C53HWD5Bx1TJgWXxVIY1FH6OLvy7foYDR7nSwm4_jlEh1aZqrtfVyh5npVwjXal9_rZbG6sevgB4gBrjI
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=19th+International+Conference+on+Advanced+Information+Networking+and+Applications+%28AINA%2705%29+Volume+1+%28AINA+papers%29&rft.atitle=Dynamic+load+balance+in+parallel+merge+sorting+over+homogeneous+clusters&rft.au=Armando%2C+D.G.&rft.au=Marcelo%2C+N.&rft.au=Franco%2C+C.&rft.au=Laura%2C+D.G.&rft.date=2005-01-01&rft.pub=IEEE&rft.isbn=9780769522494&rft.issn=1550-445X&rft.volume=2&rft.spage=219&rft.epage=222+vol.2&rft_id=info:doi/10.1109%2FAINA.2005.168&rft.externalDocID=1423681
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1550-445X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1550-445X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1550-445X&client=summon