From AAPC Algorithms to High Performance Permutation Routing and Sorting

Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures, June 1996.

Abstract: Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalized communication (AAPC) over communication networks such as meshes, hypercubes and omega switches. However, the constant factors of these algorithms are often an obscure function of system parameters such as link speed, processor clock rate, and memory access time. In this paper we investigate these architectural factors, showing the impact of the communication style, the network routing table, and most importantly, the local memory system, on AAPC performance and permutation routing on the Cray T3D.

@inproceedings{ stricker96from,
    author = "Thomas M. Stricker and Jonathan C. Hardwick",
    title = "From {AAPC} Algorithms to High Performance Permutation Routing and Sorting", 
    booktitle = "Proceedings of the 8th {ACM} Symposium on Parallel Algorithms and Architectures", 
    pages = "200--203",
    month = "June",
    year = "1996",
    url = "citeseer.nj.nec.com/stricker96from.html" }