Parallel algorithms for personalized communication and sorting with an experimental study

David R. Helman; David A. Bader; Joseph Jaja

Parallel algorithms for personalized communication and sorting with an experimental study

David R. Helman
, David A. Bader
, Joseph Jaja

Research output: Contribution to conference › Paper › peer-review

Abstract

Two novel variations on sample sort, one using only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead and another using regular sampling for choosing splitters, were studied. The two were coded in Split-C and were run on a variety of platforms. Results were consistent with theoretical analysis and illustrated the scalability and efficiency of the algorithms.

Original language	English (US)
Pages	211-222
Number of pages	12
State	Published - 1996
Externally published	Yes
Event	Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy Duration: Jun 24 1996 → Jun 26 1996

Other

Other	Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures
City	Padua, Italy
Period	6/24/96 → 6/26/96

All Science Journal Classification (ASJC) codes

Software
Safety, Risk, Reliability and Quality

Cite this

@conference{f58d519212804bc4974039259cbeccee,

title = "Parallel algorithms for personalized communication and sorting with an experimental study",

abstract = "Two novel variations on sample sort, one using only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead and another using regular sampling for choosing splitters, were studied. The two were coded in Split-C and were run on a variety of platforms. Results were consistent with theoretical analysis and illustrated the scalability and efficiency of the algorithms.",

author = "Helman, \{David R.\} and Bader, \{David A.\} and Joseph Jaja",

year = "1996",

language = "English (US)",

pages = "211--222",

note = "Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures ; Conference date: 24-06-1996 Through 26-06-1996",

}

TY - CONF

T1 - Parallel algorithms for personalized communication and sorting with an experimental study

AU - Helman, David R.

AU - Bader, David A.

AU - Jaja, Joseph

PY - 1996

Y1 - 1996

N2 - Two novel variations on sample sort, one using only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead and another using regular sampling for choosing splitters, were studied. The two were coded in Split-C and were run on a variety of platforms. Results were consistent with theoretical analysis and illustrated the scalability and efficiency of the algorithms.

AB - Two novel variations on sample sort, one using only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead and another using regular sampling for choosing splitters, were studied. The two were coded in Split-C and were run on a variety of platforms. Results were consistent with theoretical analysis and illustrated the scalability and efficiency of the algorithms.

UR - https://www.scopus.com/pages/publications/0030410596

UR - https://www.scopus.com/pages/publications/0030410596#tab=citedBy

M3 - Paper

AN - SCOPUS:0030410596

SP - 211

EP - 222

T2 - Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures

Y2 - 24 June 1996 through 26 June 1996

ER -

Parallel algorithms for personalized communication and sorting with an experimental study

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this