Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel merge sort with load balancing

From MaRDI portal
Publication:1394776
Jump to:navigation, search

DOI10.1023/A:1021734202931zbMath1026.68160OpenAlexW1581876533MaRDI QIDQ1394776

Minsoo Jeon, Dongseung Kim

Publication date: 25 June 2003

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021734202931


zbMATH Keywords

parallel algorithmload balancingsplittermerge sort


Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)


Related Items (2)

AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT ⋮ Fast sort of floating-point data for data engineering







This page was built for publication: Parallel merge sort with load balancing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1394776&oldid=13554417"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki