I-Structures: Data Structures for Parallel Computing

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 11, Issue 4, 1989, Pages 598-632

  Arvind, ^a   Nikhil, Rishiyur S ^a   Pingali, Keshav K ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Functional languages; parallelism

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING;

I-STRUCTURES; OPERATIONAL SEMANTICS;

DATA PROCESSING;

EID: 0024751383     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/69558.69562     Document Type: Article

References (28)

1. Ackerman, W. B. A structure memory for data flow computers. Master's thesis and Tech. Rep. TR-186, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, 1978.
2. Allen, J., and Kennedy, K. PFC: A program to convert FORTRAN to parallel form. Tech. Rep. MASC-TR82–6, Rice University, Houston, Tex., March 1982.
3. Ariola, Z., and Arvind. P-TAC: A parallel intermediate language. Tech. Rep. CSG Memo 295, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, Jan. 1989.
4. Arvind, and Culler, D. E. Dataflow architectures. In Annual Reviews in Computer Science, vol. 1. Annual Reviews Inc., Palo Alto, Calif., 1986, pp. 225–253.
5. Arvind, and Nikhil, R. S. Executing a program on the MIT tagged-token dataflow architecture. IEEE Trans. Comput, 1989. To be published. An earlier version appeared in Proceedings of the PARLE Conference (Eindhoven, The Netherlands, June 15–19,1987). Springer-Verlag LNCS 259, New York, 1987.
6. Arvind, Nikhil, R. S., and Pingali, K. K. Id nouveau reference manual, part II: Semantics. Tech. Rep., Computation Structures Group, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, 1987.
7. Arvind, and Thomas, R. E. I-Structures: An efficient data structure for functional languages. Tech. Rep. MIT/LCS/TM-178, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, 1981.
8. Barendregt, H., and van Leeuwen, M. Functional programming and the language TALE. Tech. Rep. TR 412, Mathematical Institute, Utrecht, The Netherlands, 1985.
9. Culler, D. E. Effective dataflow execution of scientific applications. Ph.D. dissertation, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge. To appear.
10. Culler, D. E. Resource management for the tagged token dataflow architecture. Tech. Rep. TR-332, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, 1985.
11. Culler, D. E., and Arvind. Resource requirements of dataflow programs. In Proceedings of the 15th Annual International Symposium on Computer Architecture (Honolulu, Hawaii, May 1988).
12. Driscoll, J., Sarnak, N., Sleator, D., and Tarjan, R. Making data structures persistent. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (Berkeley, Calif., May 1986), pp. 109–121.
13. Gostelow, K. P., and Thomas, R. E. A view of dataflow. In AFIPS Conference Proceedings, vol. 48, 1979, pp. 629–636.
14. Hudak, P. A semantic model of reference counting and its abstraction. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming (Cambridge, Mass., Aug. 1986), pp. 351–363.
15. Jagadeesan, R., Panangaden, P., and Pingali, K. K. A fully abstract semantics for a functional language with logic variables. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science (Asilomar, Calif., June 5–8, 1989).
16. Johnsson, T. Lambda lifting: transforming programs to recursive equations. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (Nancy, France, Sept. 1985). Springer-Verlag LNCS 201, New York, 1985.
17. Keller, R. M. FEL (function equation language) programmer's guide. Tech. Rep., AMPS Tech. Memo. 7, Dept. of Computer Science, University of Utah, Salt Lake City, April 1983.
18. Kuck, D. J., Kuhn, R., Padua, D., Leasure, B., and Wolfe, M. Dependence graphs and compiler optimizations. In Proceedings of the 8th Annual ACM Symosium on Principles of Programming Languages. ACM, New York, 1981, pp. 207–218.
19. Lindstrom, G. Functional programming and the logic variable. In Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 1985, pp. 266–280.
20. Nikhil, R. S. Id (version 88.1) reference manual. Tech. Rep. CSG Memo 284, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, Aug. 1988.
21. Nikhil, R. S., Pingali, K., and Arvind. Id nouveau. Tech. Rep. CSG Memo 265, Computation Structures Group, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, July 1986.
22. Padua, D. A., and Wolfe, M. J. Advanced compiler optimizations for supercomputers. Commun. ACM 29, 12 (Dec. 1986), 1184–1201.
23. Peyton Jones, S. L. The Implementation of Functional Programming Languages. Prentice Hall, Englewood Cliffs, N.J., 1987.
24. Pingali, K. K., and Ekanadham, K. Accumulators: New logic variable abstractions for functional languages. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag LNCS 338, New York, 1988, pp. 377–399.
25. Traub, K. R. A compiler for the MIT tagged token dataflow architecture. M.S. thesis, Tech. Rep. TR-370, MIT Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, Aug. 1986.
26. Traub, K. R. Sequential implementation of lenient programming languages. Ph.D. dissertation, Tech. Rep. TR-417, MIT Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, May 1988.
27. Wadler, P. A new array operation for functional languages. In Proceedings of the Workshop on Graph Reduction (Santa Fe, N. Mex. Sept. 1986). Springer-Verlag LNCS 279, New York, 1986, pp. 328–335.
28. Wadler, P. Listlessness is better than laziness: Lazy evaluation and garbage collection at compile time. In Proceedings of the 1984 ACM Conference on Lisp and Functional Programming (Austin, Tex., Aug. 1984), pp. 45–52.