أعرض تسجيلة المادة بشكل مبسط
dc.creator |
Cheng, David R. |
|
dc.creator |
Shah, Viral |
|
dc.creator |
Gilbert, John R. |
|
dc.creator |
Edelman, Alan |
|
dc.date |
2004-12-13T06:10:47Z |
|
dc.date |
2004-12-13T06:10:47Z |
|
dc.date |
2005-01 |
|
dc.date.accessioned |
2013-10-09T02:49:27Z |
|
dc.date.available |
2013-10-09T02:49:27Z |
|
dc.date.issued |
2013-10-09 |
|
dc.identifier |
http://hdl.handle.net/1721.1/7418 |
|
dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
dc.description |
We consider the often-studied problem of sorting, for a parallel computer. Given an input array distributed evenly over p processors, the task is to compute the sorted output array, also distributed over the p processors. Many existing algorithms take the approach of approximately load-balancing the output, leaving each processor with Θ(n/p) elements. However, in many cases, approximate load-balancing leads to inefficiencies in both the sorting itself and in further uses of the data after sorting. We provide a deterministic parallel sorting algorithm that uses parallel selection to produce any output distribution exactly, particularly one that is perfectly load-balanced. Furthermore, when using a comparison sort, this algorithm is 1-optimal in both computation and communication. We provide an empirical study that illustrates the efficiency of exact data splitting, and shows an improvement over two sample sort algorithms. |
|
dc.description |
Singapore-MIT Alliance (SMA) |
|
dc.format |
122908 bytes |
|
dc.format |
application/pdf |
|
dc.language |
en |
|
dc.relation |
Computer Science (CS); |
|
dc.subject |
Parallel sorting |
|
dc.subject |
distributed-memory algorithms |
|
dc.subject |
High Performance Computing |
|
dc.title |
Fast Sorting on a Distributed-Memory Architecture |
|
dc.type |
Article |
|
الملفات في هذه المادة
لا توجد أي ملفات مرتبطة بهذه المادة.
|
هذه المادة تبدو في المجموعات التالية:
أعرض تسجيلة المادة بشكل مبسط