Routing on triangles, tori and honeycombs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 529-541

  Sibeyn, Jop E ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AVERAGE CASE; COST EFFECTIVE; DYNAMIC ROUTING; LOWER BOUNDS; NODE DEGREE;

COST EFFECTIVENESS;

EID: 84947924968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_176     Document Type: Conference Paper

References (12)

1. Kaufmann, M., S. Rajasekaran, J.F. Sibeyn, ‘Matching the Bisection Bound for Routing and Sorting on the Mesh’, Proc. 4th Symposium on Parallel Algorithms and Architectures, pp. 31-40, ACM, 1992.
2. Kaufmann, M., J.F. Sibeyn, ‘Optimal Multi-Packet Routing on the Torus’, Proc. 3rd Scandinavian Workshop on Algorithm Theory, LNCS 621, pp. 118-129, SpringerVerlag, 1992.
3. Kaufmann, M., J.F. Sibeyn, T. Suel, ‘Derandomizing Routing and Sorting Algorithms for Meshes’, Proc. 5th Symposium on Discrete Algorithms, pp. 669-679, ACM-SIAM, 1994.
4. Kunde, M., ‘Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound’, Proc. European Symp. on Algorithms, LNCS 726, pp. 272-283, 1993.
5. Kunde, M., R. Niedermeier, P. Rossmanith, ‘Faster Sorting and Routing on Grids with Diagonals’, Proc. 11th Symposium on Theoretical Aspects of Computer Science, LNCS 775, pp. 225-236, Springer Verlag, 1994.
6. Kunde, M., T. Tensi, ‘Multi-Packet Routing on Mesh Connected Processor Arrays’, Proc. Symposium on Parallel Algorithms and Architectures, pp. 336-343, ACM, 1989.
7. Rajasekaran, S., M. Raghavachari, ‘Optimal Randomized Algorithms for Multipacket and Cut Through Routing on the Mesh ', Journal of Parallel and Distributed Computing, 26(2), pp. 257-260, 1995.
8. Reif, J., L.G. Valiant, ‘A logarithmic time sort for linear size networks’, Journal of the ACM, 34(1), pp. 68-76, 1987.
9. Reischuk, R., ‘Probabilistic Parallel Algorithms for Sorting and Selection’, SIAM Journal of Computing, 14, pp. 396-411, 1985.
10. Sibeyn, J.F., ‘Sample Sort on Meshes’, Proc. Computing Science in the Netherlands, SION, Amsterdam, 1995. Full version in Techn. Rep. MPI-I-95-112, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1995.
11. Valiant, L.G., ‘A Bridging Model for Parallel Computation’, Communications of the ACM, 33(8), pp. 103-111, 1990.
12. Valiant, L.G., G.J. Brebner, ‘Universal Schemes for Parallel Communication’, Proc. 13th Symposium on Theory of Computing, pp. 263-277, ACM, 1981.