Efficient sorting algorithms for memory hierarchies
| Thesis title in Czech: | Efektivní třídící algoritmy pro paměťovou hierarchii |
|---|---|
| Thesis title in English: | Efficient sorting algorithms for memory hierarchies |
| Key words: | třídění|paměťové hierarchie |
| English key words: | sorting|memory hierarchy |
| Academic year of topic announcement: | 2024/2025 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| Department: | Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: | prof. Mgr. Michal Koucký, Ph.D. |
| Author: | Mgr. Josef Matějka - assigned and confirmed by the Study Dept. |
| Date of registration: | 16.07.2024 |
| Date of assignment: | 16.07.2024 |
| Confirmed by Study dept. on: | 16.07.2024 |
| Date and time of defence: | 10.09.2024 09:00 |
| Date of electronic submission: | 17.07.2024 |
| Date of submission of printed version: | 18.07.2024 |
| Date of proceeded defence: | 10.09.2024 |
| Opponents: | Mgr. Martin Mareš, Ph.D. |
| Guidelines |
| Cílem práce je nalézt nové efektivní algoritmy pro třídění čísel s ohledem na paměťovou hiererchii. |
| References |
| [1] Yijie Han and M. Thorup, Integer sorting in O(n sqrt(log log n)) expected time and linear space. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. pp. 135-144.
[2] M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache Oblivious Algorithms. ACM Transactions on Algorithms, Vol. 8, No. 1, January 2012, pp. 4:1–4:22. [3] H. Prokop. Cache-oblivious algorithms. M.S. thesis, Massachusetts Institute of Technology, 1999. |