TAM - A compiler controlled threaded abstract machine

Journal of Parallel and Distributed Computing

Volumn 18, Issue 3, 1993, Pages 347-370

  Culler, David E ^a   Goldstein, Seth Copen ^a   Schauser, Klaus Erik ^a   von Eicken, Thorsten ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001197768     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1993.1070     Document Type: Article

References (44)

1. Arvind, A., and Ekanadham, K. Future scientific programming on parallel machines. J. Parallel Dislrib, Comput. 5, 5 (Oct. 1988), 460-493.
2. Arvind, A., Heller, S. K., and Nikhil, R. S. Programming generality and parallel computers. Proc. of the Fourth International Symposium on Biological and Artificial Intelligence Systems. Trento, Italy. Sept. 1988, pp. 255-286.
3. Arvind, A., Nikhil, R. S. and Pingali, K. K. 1-Structures: Data structures for parallel computing. Technical Report CSG Memo 269, MIT Lab for Comp. Science. Cambridge, MA. February 1987. Also in Proc. of the Graph Reduction Workshop. Santa Fe. NM, Oct. 1986.
4. Buehrer, R., and Ekanadham, K. Incorporating dataflow ideas into von Neumann processors for parallel execution. IEEE Trans. Comput. C-36, 12 (Dec. 1987). 1515-1522.
5. Burns, P. J., Christon, M., Schweitzer, R., Lubeck, O. M., Was-serman, H. J., Simmons, M. L., and Pryor, D. V. Vectorization of Monte-Carlo particle transport: An architectural study using the LANL benchmark "Gamteb." Proc. Supercomputing '89. IEEE Computer Society and ACM S1GARCH, New York, NY, Nov. 1989.
6. Chien, A. A. Concurrent aggregates (CA): An object-oriented language for fine-grained message-passing machines. Technical Report AI-TR 1248, MIT Artificial Intelligence Laboratory, Cambridge, MA, 1990.
7. Crowley, W. P., Hendrickson, C. P., and Rudy, T. E. The SIMPLE code. Technical Report UCID 17715. Lawrence Livermore Laboratory, Feb. 1978.
8. Culler, D. E. Managing parallelism and resources in scientific dataflow programs. Technical Report 446, MIT Lab for Comp. Science, Mar. 1990. Ph.D. Thesis, Dept, of Electrical Engineering and Computer Science, MIT.
9. Culler, D. E. Multithreading: Fundamental limits, potential gains, and alternatives. Proc. of the Supercomputing ’91, Workshop on Multithreading. To appear.
10. Culler, D. E., and Arvind, A. Resource requirements of dataflow programs. Proc. of the 15th Annual International Symposium on Com puter Architecture. Hawaii, May 1988, pp. 141-150.
11. Culler, D. E., and Papadopoulos, G. M. The explicit token store. J Parallel Distrih. Comput. 10, 4 (Dec. 1990), 289-308.
12. Culler, D. E., Schauser, K. E., and von Eicken, T. Twofundamen lal limits on dataflow multiprocessing. Proceedings of the IFIP W(10.3 Working Conference on Architectures and Compilation Tech niqaes for Fine and Medium Grain Parallelism. Orlando, FL, Jan 1993. Also available as Technical Report UCB/CSD 92/716, C Div., University of California at Berkeley.
13. Dally, W. J. The J-machine system. In Winston, P., and Shellard, S. A. (Eds.). Artificial Intelligence at MIT: Expanding Frontiers Chap. 21, pp. 536-569. MIT Press, 1990.
14. Dennis, J. B. First version of a data flow procedure language. I Goos, G., and Hartmanis, J. (Eds.). Proc. Programming Sympo sium. Paris. Lecture Notes in Computer Science, Vol. 19 Springer-Verlag, New York, 1974.
15. Grafe, V. G., and Hoch, J. E. The Epsilon-2 hybrid dataflow archi tecture. Proc. of Compcon90. Mar. 1990, pp. 88-93.
16. Gupta, A., et al. Comparative evaluation of latency reducing ani tolerating techniques. Proceedings of the 19th Annual Symposiur, on Computer Architecture. Gold Coast, Australia, May 1992, pp 254-263.
17. Gurd, J., Kirkham, C. C., and Watson, I. The Manchester proto type dataflow computer. Comm. Assoc. Comput. Much. 28, 1 (Jan 1985), pp. 34-52.
18. Heller, S. K. Efficient lazy data-structures on a dataflow machine Technical Report, MIT Lab for Computer Science. Feb. 1989.
19. Hiraki, K., Sekiguchi, S., and Shimada, T. System architecture of; dataflow supercomputer. Technical Report, Computer Systems Di vision, Electrotechnical Laboratory, Japan, 1987.
20. Horwat, W. Concurrent Smalltalk on the message-driven proces sor. Master's thesis, Massachusetts Institute of Technology. Cam bridge, MA, May 1989.
21. lannucci, R. A. A dataflow/von Neumann hybrid architecture Technical Report TR-418, MIT Lab for Computer Science, Cam bridge, MA, May 1988; Ph.D. thesis, Department of Electrical En gineering and Computer Science, MIT.
22. lannucci, R. A. Toward a dataflow/von Neumann hybrid architecture. Proc. 15th International Symposium on Computer Architec ture. Hawaii, May 1988, pp. 131-140.
23. Halstead, R. H., Jr. Multilisp: A language for concurrent symbolic computation. ACM Trans. Programming Languages Systems 7, ‘ (Oct. 1985), 501-538.
24. Landin, P. J. The mechanical evaluation of languages. Comput. J 6, 4 (Jan. 1964), 308-320.
25. Lonergan, W., and King, P. Design of the B5000 system. Datamation (May 1961).
26. Nikhil, R. S. ID language reference manual version 90.1. Technica Report CSG Memo 284-2, MIT Lab for Comp. Science, Cambridge MA, 1991.
27. Nikhil, R. S., and Arvind, A. Can dataflow subsume von Neumanr computing? Proc. of the I6th Annual International Symposium or. Computer Architecture. Jerusalem. Israel, May 1989.
28. Nikhil, R. S., Papadopoulos, G. M. and Arvind, T: A killer micrc for a brave new world. Technical Report CSG Memo 325, MIT Lab. for Comp. Science, Cambridge, MA, Jan. 1991.
29. Oldehoeft, R. R., Cann, D. C., Bohmn, A. P. W., Feo, J. T., and Grit, D. H. SISAL Reference Manual Language Version 2.0. Technical Report UCRL-JC-104008, Lawrence Livermore National Laboratory, Livermore, CA, Dec. 1988.
30. Papadopoulos, G. M., and Culler, D. E. Monsoon: An explicit token-store architecture. Proc. of the 17th Annual International Symposium on Computer Architecture. Seattle, May 1990.
31. Polychronopoulos, C. D. Toward auto-scheduling compilers. J. Stt-percomputing 2 (1988), 297-330.
32. Randell, B., and Russell, L. J. Algol 60 implementation. Academic Press, New York, 1964.
33. Ruggiero, C. A. Throttle mechanisms for the Manchester dataflow machine. Ph.D. thesis, University of Manchester, Manchester M13 9PL, England, July 1987.
34. Saavedra-Barrerra, R., Culler, D. E., and von Eicken, T. Analysis of multithreaded architectures for parallel computing. Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architecture, July 1990.
35. Sakai, S., Yamaguchi, Y., Hiraki, K., Kodama, Y., and Yuba, T. An architecture of a dataflow single chip processor. Proc. of the 16th Annual International Symposium on Computer Architecture. Jerusalem, Israel, June 1989, pp. 46-53.
36. Sarkar, V., and Hennessy, J. Partitioning parallel programs for macro-dataflow. Proceedings of the 1986 ACM Conference on Lisp and Functional Programming. Cambridge, MA. Aug. 4-6, 1986. pp. 202-211.
37. Schauser, K. E., Culler, D., and von Eicken, T. Compiler-con-trolled multithreading for lenient parallel languages. Proceedings of the 1991 Conference on Functional Programming Languages and Computer Architecture. Cambridge, MA, Aug. 1991. Also available as Technical Report UCB/CSD 91/640, Computer Science Div., University of California at Berkeley.
38. Spertus, E., Goldstein, S. C., Schauser, K. E., von Eicken, T., Culler, D. E., and Dally, W. J. Evaluation of mechanisms for finegrained parallel programs in the J-machine and the CM-5. Proc. of the 20th International Symposium on Computer Architecture. San Diego, CA, May 1993.
39. Thinking Machines Corporation. The Connection Machine CM-5 Technical Summary. Thinking Machines Corp., Cambridge, MA, Jan. 1992.
40. Traub, K. R. A compiler for the MIT tagged-token dataflow architecture. Technical Report TR-370, MIT Lab for Computer Science. Cambridge, MA, Aug. 1986; M.S. thesis. Dept, of Electrical Engineering and Computer Science, MIT.
41. Traub, K. R. Compilation as partitioning: A new approach to compiling non-strict functional languages. Proc. of the Apenas Workshop on the Implementation of Lazy Functional Languages. Chalmers Univ., Goteborg, Sweden, Sept. 1988.
42. Traub, K. R. Sequential implementation of lenient programming languages. Technical Report TR-417, MIT Lab for Comp. Science, Cambridge, MA, September 1988. (PhD Thesis, Dept, of EECS, MIT).
43. Traub, K. R., Culler, D. E., and Schauser, K. E. Global analysis for partitioning non-strict programs into sequential threads. Proc. of the ACM Conference on LISP and Functional Programming. San Francisco, CA, June 1992.
44. von Eicken, T., Culler, D. E., Goldstein, S. C., and Schauser, K. E. Active messages: A mechanism for integrated communication and computation. Proc. of the 19th International Symposium on Computer Architecture. Gold Coast, Australia, May 1992. Also available as Technical Report UCB/CSD 92/675, CS Div., University of California, at Berkeley.