Performance modeling of distributed memory architectures

Journal of Parallel and Distributed Computing

Volumn 12, Issue 4, 1991, Pages 300-312

  Lennart Johnsson, S ^a,b  

^a HARVARD UNIVERSITY   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS - PROGRAM PROCESSORS; DATA STORAGE, DIGITAL - CELLULAR ARRAYS; MATHEMATICAL TECHNIQUES - MATRIX ALGEBRA; MATHEMATICAL TRANSFORMATIONS - FAST FOURIER TRANSFORMS;

BUTTERFLY NETWORKS;

COMPUTER METATHEORY;

EID: 0026202142     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(91)90002-Q     Document Type: Article

References (46)

1. Optimal communication algorithms for hypercubes
2. A synthetic benchmark
3. Deadlock free message routing in multiprocessor interconnection networks
4. Performance of various computers using standard linear equations software
5. A unified approach to a class of data movements on an array processor
6. Optimal communication algorithms on hypercube
7. Array permutations by index-digit permutation
8. On the problem of optimizing data transfers for complex memory systems
9. Impact of hierarchical memory systems on linear algebra algorithm design
10. Optimal algorithms for stable dimension permutations on Boolean cubes
11. Stable dimension permutations on Boolean cubes
12. Embedding meshes into small Boolean cubes
13. I/O complexity: The red-blue pebble game
14. Band matrix systems solvers on ensemble architectures
15. Communication efficient basic linear algebra computations on hypercube architectures
16. Solving tridiagonal systems on ensemble architectures
17. Algorithms for multiplying matrices of arbitrary shapes using shared memory primitives on a Boolean cube
18. Shuffle permutations on Boolean cubes
19. Multiplication of arbitrarily shaped matrices using the full communications bandwidth on Boolean cubes
20. Spanning graphs for optimum broadcasting and personalized communication in hypercubes
21. Boolean cube emulation of butterfly networks encoded by Gray code
22. The complexity of reshaping arrays on Boolean cubes
23. Optimizing tridiagonal solvers for alternating direction methods on Boolean cube multiprocessors
24. Generalized shuffle permutations on Boolean cubes
25. Optimal communication channel utilization for matrix transposition and related permutations on Boolean cubes
26. Systolic FFT algorithms on Boolean cubes
27. Cooley-Tukey FFT on the Connection Machine
28. A radix2 FFT on the Connection Machine
29. Optimal BPC permutations on a cube connected SIMD computer
30. A framework for adaptive routing in multicomputer networks
31. How to emulate shared memory
32. Fluent parallel computation
33. The Fluent abstract machine
34. Intensive hypercube communication. 1. Prearranged communication in link-bound machines
35. Multiprocessor FFTs
36. Ordered fast fourier transforms on a massively parallel hypercube multiprocessor
37. A scheme for fast parallel communication
38. Universal schemes for parallel communication
39. Dhrystone: A synthetic systems programming benchmark
40. The separability of gray code