BSP-like external-memory computation

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

Volumn 1203, Issue , 1997, Pages 229-240

  Sibeyn, Jop F ^a   Kaufmann, Michael ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE PORTABILITY;

EXTERNAL MEMORY; LIST RANKINGS; MATRIX MULTIPLICATION; OPTIMALITY; PERFORMANCE MEASURE; PREDICTED PERFORMANCE; TOTAL WORK;

ALGORITHMS;

EID: 84957610791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62592-5_75     Document Type: Conference Paper

References (15)

1. Aggarwal, A., J.S. Vitter, 'The Input/Output Complexity of Sorting and Related Problems,' Communications of the ACM, 31(9), pp. 1116-1127, 1988.
2. Bilardi, G., F.R Preparata, 'Horizons of Parallel Computation,' Journal of Parallel and Distributed Computing, 27, pp. 172-182, 1995.
3. Chiang, Y-J, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter, 'External-Memory Graph Algorithms,' Proc. 6th Symposium on Discrete Algorithms, pp. 139-149, ACM-SIAM, 1995.
4. Cormen, T.H., Virtual Memory for Data Parallel Computing, Ph. D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.
5. Cole, C., 'Parallel Merge Sort,' SIAM Journal of Computing, 17(4), pp. 770-785, 1988.
6. JáJá, J., An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
7. Leighton, F.T., 'Tight Bounds on the Complexity of Parallel Sorting,' IEEE Transactions on Computers, C-34(4), pp. 344-354, 1985.
8. McColl, W.F., 'Scalable Computing,' Computer Science Today: Recent Trends and Developments, J. van Leeuwen (Ed.), LNCS 1000, pp. 46-61, Springer-Verlag, 1995.
9. McColl, W.F., 'Universal Computing,' Proc. 2nd Euro-Par Conference, LNCS 1123, pp. 25-36, Springer-Verlag, 1996.
10. Patt, Y.N., 'The I/O Subsystem-A Candidate for Improvement,' IEEE Computer, 27(3), pp. 15-16, 1994.
11. Sibeyn, J.F., 'Deterministic Routing and Sorting on Rings,' Proc. 8th International Parallel Processing Symposium, pp. 406-410, IEEE, 1994.
12. Sibeyn, J.F., 'Better Trade-offs for Parallel List Ranking,' submitted to Algorithmica, 1996.
13. Sibeyn, J.F., T. Harris, 'Exploiting Locality in LT-RAM Computation,' Proc. 4th Scandinavian Workshop on Algorithm Theory, LNCS 824, pp. 338-349, Springer-Verlag, 1994.
14. Tishkin, A., 'The Bulk-Synchronous Parallel Random Access Machine,' Proc. 2nd Euro-Par Conference, LNCS 1124, pp. 327-338, Springer-Verlag, 1996.
15. Valiant, L.G., 'A Bridging Model for Parallel Computation,' Communications of the ACM, 33(8), pp. 103-111, 1990.