Hultén, Rikard 2010 (English)
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudentuppsats (Examensarbete)
The special architecture of the Cell BE processor has made scientists revisit the problem of sorting. This paper implements and tests a variant of merge sort where a number of 2-to-1 mergers are connected in a pipelined tree. For large trees there are many more such mergers than processors which means they must be mapped to the processors in some way. Optimized mappings are tested and results show that changing the model used when optimizing might be beneficiary. It is also shown that the small size of the local storages on the co-processors is not limiting the performance.
Place, publisher, year, pages
2010. 47 p.
Cell BE, Merge sort
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-54577 (URN)LIU-IDA/LITH-EX-A—10/015—SE (ISRN)oai:DiVA.org:liu-54577 (OAI)
2010-03-12, Donald Knuth, Linköpings universitet 581 83, Linköping, 10:00 (Swedish)