Advances in the dataflow computational model

Parallel Computing

Volumn 25, Issue 13, 1999, Pages 1907-1929

  Najjar, Walid A ^a   Lee, Edward A ^b   Gao, Guang R ^b  

^a Colorado State University   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; MULTIPROCESSING PROGRAMS;

DATAFLOW COMPUTATIONAL MODELS; MULTITHREADED COMPUTER ARCHITECTURES; VON NEUMANN EXECUTION MODELS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033285339     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00070-8     Document Type: Article

References (121)

1. Annapolis Micro Systems, Wildforce Board Web Page, http://www.annapmicro.com.
2. B.S. Ang, Arvind, D. Chiou, StarT the next generation: integrating global caches and dataflow architecture, in: G.R. Gao, L. Bic, J.-L. Gaudiot (Eds.), Advanced Topics in Dataflow Computing and Multithreading, IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 19-54.
3. B.S. Ang, D. Chiou, D. Rosenband, M. Ehrlich, L. Rudolph, Arvind, Start-voyager: a flexible platform for exploring scalable snip issues, CSG Memo 415, Computation Structures Group, MIT Lab. for Comput. Sci., December 1998.
4. Arvind, R.S. Nikhil, Executing a program on the MIT tagged-token dataflow architecture, IEEE Trans. Comput. 39 (3) (1990) 300-318.
5. Arvind, K.P. Gostelow, The U-interpreter, Computer 15 (2) (1982) 42-49.
6. Arvind, R. Iannucci, A critique of multiprocessing von Neumann style, in: International Symposium on Computer Architecture, Stokholm, Sweden, 1983.
7. Arvind, R.S. Nikhil, K.K. Pingali, I-structures: data structures for parallel computing, ACM Trans. on Program. Languages Syst. 11 (4) (1989) 598-632.
8. P.M. Athanas, H.F. Silverman, Processor reconfiguration through instruction set metamorphosis, Computer 26 (1993) 11-18.
9. P.S. Barth, R.S. Nikhil, Arvind, M-structures: extending a parallel, non-strict, functional language with state, CSG Memo 327, Computation Structures Group, MIT Lab. for Comput. Sci., March 1991.
10. M.J. Beckerle, Overview of the START(*T) multithreaded computer, in: Digest of Papers, COMPCON Spring '93, San Francisco, CA, February 1993, pp. 148-156.
11. A. Benedetti, P. Perona, Feature detection on a reconfigurable computer, in: Conference on Computer Vision and Pattern Recognition, Santa Barbara, CA, 1998.
12. A. Benveniste, G. Berry, The synchronous approach to reactive and real-time systems, in: Proceedings of the IEEE, vol. 79 (9), 1991, pp. 1270-1282.
13. A. Benveniste, P. Caspi, P. Le Guernic, N. Halbwachs, Data-flow synchronous languages, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), A Decade of Concurrency - Reflections and Perspectives, Lecture Notes in Computer Science, vol. 803, Springer, Berlin, 1994, pp. 1-45.
14. P. Bertin, D. Roncin, J. Vuillemin, Programmable active memories: a performance assesment, in: G. Borriello, C. Ebeling (Eds.), Research on Integrated Systems, MIT Press, Cambridge, MA, 1993, pp. 88-102.
15. P. Bertin, H. Touati, PAM programming environments: practice and experience, in: Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, IEEE Computer Soc. Press, Los Alamitos, CA, 1994, pp. 133-139.
16. G. Bilsen, M. Engels, R. Lauwereins, J.A. Peperstraete, Static scheduling of multi-rate and cyclostatic DSP applications, in: Proceedings of the 1994 Workshop on VLSI Signal Processing, IEEE Press, New York, 1994.
17. M. Bolotski, A. DeHon, T.F. Knight, Unifying FPGAs and SIMD arrays, in: Proceedings of the FPGA Workshop, 1994.
18. J.T. Buck, E.A. Lee, Scheduling dynamic dataflow graphs with bounded memory using the token flow model, in: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. I, Minneapolis, MN, April 1993, pp. 429-132.
19. J.T. Buck, Scheduling dynamic dataflow draphs with bounded memory using the token flow model, Technical Report UCB/ERL 93/69, Ph.D. Dissertation, Department of EECS, University of California, Berkeley, CA 94720, 1993.
20. J.T. Buck, S. Ha, E.A. Lee, D.G. Messerschmitt, Ptolemy: a framework for simulating and prototyping heterogeneous systems (special issue on Simulation Software Development) Int. J. Comput. Simulation, 4 (1994) 155-182 (http://ptolemy.eecs.berkeley.edu/papers/JEurSim).
21. J.T. Buck, Static scheduling and code generation from dynamic dataflow graphs with integer-valued control systems, Invited Paper, in: Proceedings of the IEEE Asilomar Conference on Signals, Systems, and Computers, 31 October-2 November, Pacific Grove, CA, 1994.
22. D.A. Buell, J.M. Arnold, W.J. Kleinfelder, Splash 2: FPGAs in a Custom Computing Machine, IEEE CS Press, Silver Spring, MD, 1996.
23. S. Cadambi, J. Weener, S.C. Goldstein, H. Schmit, D.E. Thomas, Managing pipeline-reconfigurable FPGAs, in: Sixth International Symposium on Field Programmable Gate Arrays, 1998.
24. R. Carley, S.C. Goldstein, T. Mukherjee, R. Rutenbar, H. Schmit, D. Thomas, PipeRench Web Page, Carnegie-Mellon University, http://www.ece.cmu.edu/research/piperench/.
25. D. Chiou, B.S. Ang, Arvind, M.J. Beckerle, A. Boughton, R. Greiner, J.E. Hicks, J.C. Hoe, StarT-NG: delivering seamless parallel computing, CSG Memo 371, Computation Structures Group, MIT Lab. for Comput. Sci., February 1995.
26. C.E. Cox, W. Ekkehard Blanz, Ganglion - a fast hardware implementation of a connectionist classifier, in: Proceedings of the IEEE Custom Integrated Circuits Conference, IEEE Press, New York, 1991, pp. 6.5.1-6.5.4.
27. S.A. Cuccaro, C.F. Reese, The CM-2X: a hybrid CM-2/Xilinx prototype, in: Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, IEEE Computer Soc. Press, Los Alamitos, CA, 1993, pp. 121-131.
28. A.L. Davis, R.M. Keller, Data flow program graphs, Computer 15 (2) (1982) 26-41.
29. A. DeHon, Comparing computing machines, in: Configurable Computing: Technology and Applications, Proceedings of SPIE 3526, November 1998, p. 124.
30. J.B. Dennis, First version of a data-flow procedure language, in: Proceedings of the Colloque sur la Programmation, Lecture Notes in Computer Science, vol. 19, Paris, France, April 9-11, Springer, Berlin, 1974, pp. 362-376.
31. J.B. Dennis, Data flow ideas for supercomputers, in: Digest of Papers, COMPCON Spring '84, San Francisco, CA, February-March 1984, pp. 15-19.
32. J.B. Dennis, G.R. Gao, An efficient pipelined dataflow processor architecture, in: Proceedings of the Supercomputing '88, Orlando, FL, November 1988, pp. 368-373.
33. J.B. Dennis, G.R. Gao, Multithreaded architectures: principles, projects, and issues, ACAPS Technical Memo 29, School of Computer Science, McGill University, Montréal, Qué., February 1994, in: ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos.
34. J.B. Dennis, G.R. Gao, Multithreaded architectures: principles, projects, and issues, in: R.A. Iannucci, G.R. Gao, R.H. Halstead Jr., B. Smith (Eds.), Multithreaded Computer Architecture: A Summary of the State of the Art, chapter 1, Kluwer Academic Publishers, Norwel 1, Massachusetts, 1994.
35. J.B. Dennis, G.R. Gao, On memory models and cache management for shared-memory multiprocessors, ACAPS Technical Memo 90, School of Computer Science, McGill University, Montréal, Qué., December. 1994, in: ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos.
36. J.B. Dennis, Streams data types for signal processing, in: J-L. Gaudiot, L. Bic (Eds.), Advanced Topics in Dataflow Computing and Multithreading, Prentice-Hall, Englewood Cliffs, NJ, 1995.
37. J.B. Dennis, G.R. Gao, On memory models and cache management for shared-memory multiprocessors, in: Parallel and Distributed Processing, IEEE Computer Soc., 1995.
38. J.B. Dennis, A parallel program execution model supporting modular software construction, in: Proceedings of the Massively Parallel Programming Models (MPPM-97), IEEE Computer Soc., 1997, pp 50-60.
39. J.B. Dennis, General parallel computation can be performed with a cycle-free heap, in: Proceedings of the International Conference on Parallel Architectures and Compiler Technology, Paris, France, October 1996, pp. 96-103.
40. C. Ebeling, D.C. Cronquist, P. Franklin, RaPiD - reconfigurable pipelined datapath, in Proceedings of the Field Programmable Logic, 1996.
41. G. Estrin, Parallel processing in a restructurable computer system, IEEE Trans. Elect. Comput. (1963).
42. G.R. Gao, A Code Mapping Scheme for Dataflow Software Pipelining, Kluwer Academic Publishers, Boston, Massachusetts, 1990.
43. G.R. Gao, H.H.J. Hum, J.-M. Monti, Towards an efficient hybrid dataflow architecture model, in: Proceedings of the PARLE '91, vol. I, Lecture Notes in Computer Science, vol. 505, Eindhoven, The Netherlands, June 1991, Springer, Berlin, pp. 355-371.
44. G.R. Gao, H.H.J. Hum, J.-M. Monti, Towards an efficient hybrid dataflow architecture model, in: Proceedings of the PARLE '91, vol. I, Lecture Notes in Computer Science, vol. 505, Eindhoven, The Netherlands, June 1991, Springer, Berlin, pp. 355-371.
45. G.R. Gao, R. Govindarajan, P. Panangaden, Well-behaved dataflow for DSP computation, in: Proceedings of the ICASSP-92, San Francisco, March 1992.
46. G.R. Gao, An efficient hybrid dataflow architecture model, J. Parallel Distrib. Comput. 19 (4) (1993) 293-307.
47. G.R. Gao, V. Sarkar, Location consistency: stepping beyond the barriers of memory coherence and serializability, ACAPS Technical Memo 78, School of Computer Science, McGill University, Montréal, Qué., December 1994, in: ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos.
48. G.R. Gao, L. Bic, J-L. Gaudiot (Eds.), Advanced Topics in Dataflow Computing and Multithreading, IEEE Computer Soc. Press, New York, 1995, book contains papers presented at the Second International Workshop on Dataflow Computers, Hamilton Island, Australia, May 1992.
49. G.R. Gao, V. Sarkar, On the importance of an end-to-end view of memory consistency in future computer systems, in: Proceedings of the International Symposium on High Performance Computing, Fukuoka, Japan, 1997, pp. 30-41.
50. G.R. Gao, V. Sarkar, Location consistency - a new memory model and cache consistency protocol, CAPSL Technical Memo 16, Department of Elec. and Computer Engineering, University of Delaware, Newark, Delaware, February 1998, in: ftp://ftp.capsl.udel.edu/pub/doc/memos.
51. K. Gharachorloo, A. Gupta, J. Hennessy, Revision to 'memory consistency and event ordering in scalable shared-memory multiprocessors', Technical Report No. CSL-TR-93-568, Computer Systems Lab., Stanford University, Stanford, CA, April 1993.
52. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, J. Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, in: Proceedings of the ISCA-17, Seattle, Washington, May 1990, pp. 15-26.
53. A. Girault, B. Lee, E.A. Lee, Hierarchical finite state machines with multiple concurrency models, IEEE Trans, on CAD, 1999, 18 (6) (1999). (Revised from Memorandum UCB/ERL M97/57, Electronics Research Laboratory, University of California, Berkeley, CA 94720, August 1997) (http://ptolemy.eecs.berkeley.edu/papers/98/starcharts).
54. M. Gokhale, W. Holmes, A. Kopser, S. Lucas, R. Minnich, D. Sweely, D. Lopresti, Building and using a highly parallel programmable logic array, IEEE Comput. 24 (1991) 81-89.
55. R. Hartenstein et al., A reconfigurable machine for applications in image and video compression, in: Conference on Compression Technologies and Standards for Image and Video Compression, Amesterdam, Netherlands, 1995.
56. J.R. Hauser, J. Wawrzynek, Garp: a MIPS processor with a reconfigurable co-processor, in: Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines, April 1997.
57. L.J. Hendren, G.R. Gao, X. Tang, Y. Zhu, X. Xue, H. Cai, P. Ouellet, Compiling C for the EARTH multithreaded architecture, ACAPS Technical Memo 101, School of Computer Science, McGill University, Montréal, Qué., March 1996, in: ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos.
58. M.D. Hill, Multiprocessors should support simple memory-consistency models, Computer 31 (1998) 28-34.
59. J. Horstmannshoff, T. Grötker, H. Meyr, Mapping multirate dataflow to complex RT level hardware models, in: 11th International Conference on Application-specific Systems, Architectures and Processors, 1997, (ASAP'97).
60. H.H.-J. Hum, The super-actor machine: a hybrid dataflow/von Neumann architecture, Ph.D. Thesis, McGill University, Montréal, Qué., May 1992.
61. H.H.J. Hum, G.R. Gao, A high-speed memory organization for hybrid dataflow/von Neumann computing, Future Generation Comput. Syst. 8 (4) (1992) 287-301.
62. H.H.J. Hum, O. Maquelin, K.B. Theobald, X. Tian, G.R. Gao, L.J. Hendren, A study of the earth-manna multithreaded system, Int. J. Parallel Programming 24 (4) (1996) 319-347.
63. R.A. Iannucci, Toward a dataflow/von Neumann hybrid architecture, in: Proceedings of the ISCA-15, Honolulu, Haw., May-June 1988, pp. 131-140.
64. R.A. Iannucci, G.R. Gao, R.H. Halstead Jr., B. Smith (Eds.), Multithreaded Computer Architecture: A Summary of the State of the Art, Kluwer Academic Publishers, Norwell, Massachusetts, 1994, book contains papers presented at the Workshop on Multithreaded Computers, Albuquerque, New Mexico, November 1991.
65. S. Jenks, J.-L. Gaudiot, Exploiting locality and tolerating remote memory access latency using thread migration, Int. J. Parallel Programming, 1996, in press.
66. S. Jenks, J.-L. Gaudiot, Nomadic threads - a migrating multithreaded approach to remote memory accesses in multiprocessors, in: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT '96), Boston, Massachusetts, October 1996.
67. S. Jenks, J.-L. Gaudiot, Nomadic threads: A migrating multithreaded approach to remote memory accesses in multiprocessors, in: Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, Boston, Massachusetts, October 1996.
68. N. Halbwachs, Synchronous Programming of Reactive Systems, Kluwer Academic Publishers, Dordrecht, 1993.
69. N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud, The synchronous data flow programming language LUSTRE, in: Proceedings of the IEEE, vol. 79 (9), pp. 1305-1319.
70. D. Harel, Statecharts: a visual formalism for complex systems, Sci. Comput. Programming 8 (1987) 31-274.
71. G. Kahn, The semantics of a simple language for parallel programming, in: Proceedings of the IFIP Congress 74, North-Holland, Amsterdam, 1974.
72. C. Kim, J.-L. Gaudiot, Data-flow and multithreaded architectures, in: Encyclopedia of Electrical and Electronics Engineering, Wiley, New York, 1997.
73. I. Koren, B. Mendelson, I. Peled, G.M. Silberman, A data-driven VLSI array for arbitrary algorithms, Computer 21 (10) (1988) 30-43.
74. J.-L. Gaudiot, L. Bic (Eds.), Advanced Topics in Data-Flow Computing, Prentice-Hall, New york, 1991.
75. Y. Kodama, S. Sakai, Y. Yamaguchi, A prototype of a highly parallel dataflow machine EM-4 and its preliminary evaluation, in: Proceedings of the InfoJapan 90, October 1990, pp. 291-298.
76. Y. Kodama, H. Sakane, M. Sato, H. Yamana, S. Sakai, Y. Yamaguchi, The EM-X parallel computer: architecture and basic performance, in: Proceedings of the ISCA-22, Santa Margher ita Ligure, Italy, June 1995, pp. 14-23.
77. KRI, Khoral Research Inc. Web Page, http://www.kri.com.
78. F. Kurdahi, N. Bagherzadeh, The Morphosys Project, University of California, Irvine, 1998, http:// www.eng.uci.edu/morphosys.
79. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Comput. 28 (9) (1979) 690-691.
80. P. Lapsley, J. Bier, A. Shoham, E.A. Lee, DSP Processor Fundamentals Architectures and Features, IEEE Press, New York, 1997.
81. P. Le Guernic, T. Gauthier, M. Le Borgne, C. Le Maire, Programming real-time applications with SIGNAL, Proc. IEEE 79 (9) (1991).
82. E.A. Lee, D.G. Messerschmitt, Static scheduling of synchronous data flow programs for digital signal processing, IEEE Trans. Comput. (1987).
83. E.A. Lee, Consistency in dataflow graphs, IEEE Trans. Parallel Distributed Syst. 2 (2) (1991).
84. E.A. Lee, T.M. Parks, Dataflow process networks, Proc. IEEE 83 (5) (1995) 773-801.
85. E.A. Lee, A denotational semantics for dataflow with firing, Memorandum UCB/ERL M97/3, Electronics Research Laboratory, UC Berkeley, January 1997.
86. D. Lenoski, J. Laudon, T. Joe, D. Nakahira, L. Stevens, A. Gupta, J. Hennessy. The DASH prototype: implementation and performance, in: Proceedings of the ISCA-19, Gold Coast, Australia, May 1992, pp. 92-103.
87. W.-Y. Lin, J.-L. Gaudiot, I-structure software cache: a split-phase transaction runtime cache system, in: Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, Boston, Massachusetts, October 1996, pp. 122-126.
88. W.H. Mangione-Smith, Seeking solutions in configurable computing, IEEE Comput. 30 (1997) 38-43.
89. W.H. Mangione-Smith, Application design for configurable computing, Computer 30 (1997) 115-117.
90. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer, Berlin, 1991.
91. O.C. Maquelin, H.H.J. Hum, G.R. Gao, Costs and benefits of multithreading with off-the-shelf RISC processors, in: Proceedings of the EURO-PAR '95, no. 966 in Lecture Notes in Computer Science, Stockholm, Sweden, Springer, August 1995, pp. 117-128.
92. A. Marquez, K.B. Theobald, X. Tang, T. Sterling, G.R. Gao, A superstrand architecture and its compilation, CAPSL Technical Memo 18, Department of Elec. and Computer Engineering, University of Delaware, Newark, Delaware, March 1998.
93. A. Marquez, K.B. Theobald, X. Tang, G.R. Gao, A superstrand architecture and its compilation, in: Proceedings of the MTEAC99 Workshop held in conjunction with HPCA-5, Orlando, FL, January 1999.
94. B. Mendelson, B. Patel, I. Koren, Designing special purpose co-processors using the data-flow paradigm, in: J.-L. Gaudiot, L. Bic (Eds.), Advanced Topics in Data-Flow Computing, Prentice-Hall, Englewood Cliffs, NJ, 1991, pp. 547-570.
95. B. Mendelson, G.M. Silberman, Mapping data flow programs on a VLSI array of processors, in: Proceedings of the International Symposium on Computer Architecture, Pittsburgh, Pennsylvania, June 1987, pp. 72-80.
96. W.A. Najjar, W.M. Miller, A.P.W. Böhm, An analysis of loop latency in dataflow execution, in: Proceedings of the ISCA-19, Gold Coast, Australia, May 1992, pp. 352-360.
97. W. Najjar, J.-L. Gaudiot, Multi-level execution in data-flow architectures, in: Proceedings of the ICPP '87, St. Charles, Ill., August 1987, pp. 32-39.
98. W. Najjar, A.P.W. Bohm, B. Draper, R. Beveridge, The Cameron Project, Colorado State University, Fort Collins, CO 1998, http://www.cs.colostate.edu/cameron.
99. S.S. Nemawarkar, Performance modeling and analysis of multithreaded architectures, Ph.D. Thesis, Montréal, Qué., August 1996.
100. R.S. Nikhil, Arvind, Can dataflow subsume von Neumann computing? in: Proceedings of the ISCA-16, Jerusalem, Israel, May-June 1989, pp. 262-272.
101. K. Okamoto, S. Sakai, H. Matsuoka, T. Yokota, H. Hirono, Multithread execution mechanisms on RICA-1 for massi vely parallel computation, in: Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, Boston, Massachusetts, October 1996, pp. 116-121.
102. Oxford Hardware Compilation Group, The Handel Language, 1997.
103. E.K. Pauer, C.S. Myers, P.D. Fiore, J.M. Smith, C.M. Crawford, E.A. Lee, J. Lundblad, C.X. Hylands, Algorithm analysis and mapping environment for adaptive computing systems, Second Annual Workshop on High Performance Embedded Computing, MIT Lincoln Labs, Lexington, MA, September 1998 (http://ptolemy.eecs.berkeley.edu/papers/98/ACSmapping/).
104. J. Rasure, S. Kubica, The KHOROS application development environment, in: J.L. Crowley (Ed.), Experimental Environments for Computer Vision and Image Processing, HICa, New Jersey, 1994.
105. S.K. Reinhardt, J.R. Larus, D.A. Wood, Tempest and typhoon: user-level shared memory, in: Proceedings of the ISCA-21, Chicago, III, April 1994, pp. 325-336.
106. X. Tang. Compiling for multithreaded architectures, Ph.D. Thesis, University of Delaware, Newark, DE, April 1999.
107. S. Sakai, K. Okamoto, H. Matsuoka, H. Hirono, Y. Kodama, M. Sato, Super-threading: architectural and software mechanisms for optimizing parallel computation, in: Conference Proceedings of the 1993 International Conference on Supercomputing, Tokyo, Japan, July 1993, pp. 251-260.
108. H. Schmit, Incremental reconfiguration for pipelined applications, IEEE Symposium on FPGAs for Custom Computing Machines, 1997.
109. J.P. Singh, J.L. Hennessy, A. Gupta, Scaling parallel programs for multiprocessors: methodology and examples, IEEE Computer 6 (26) (1993) 42-50.
110. A. Sohn, M. Sato, N. Yoo, J.-L. Gaudiot, Data and workload distribution in a multithreaded architecture, J. Parallel Distributed Process. 1997, pp. 256-264.
111. X. Tang, J. Wang, K.B. Theobald, G.R. Gao, Thread partitioning and scheduling based on cost model, in: Proceedings of the SPAA '97, Newport, R hode Island, June 1997, pp. 272-281.
112. X. Tang, G.R. Gao, How hard is thread partitioning and how bad is a list scheduling based partitioning algorithm? in: Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, June 1998.
113. K.B. Theobald. EARTH: an efficient architecture for running threads, Ph.D. Thesis, Montréal, Qué., January 1999.
114. T. von Eicken, D.E. Culler, S.C. Goldstein, K.E. Schauser, Active messages: a mechanism for integrated communication and computation, in: Proceedings of the ISCA-19, Gold Coast, Australia, May 1992, pp. 256-266.
115. J. Vuillemin et al., Programmable active memories: reconfigurable systems come of age, IEEE Trans. on VLSI Syst. (1996).
116. E. Waingold, M. Taylor, D. Srikrishna, V. Srakar, W. Lee, V. Lee, J. Kim, M. Frank, P. Finch, R. Barua, J. Babb, S. Amarsinghe, A. Agrawal, Baring it all to software: raw machines, IEEE Comput. 30 (1997) 86-93.
117. M. Warren, J.K. Salmon, A parallel hashed oct-tree n-body algorithm, in: Proceedings of the Supercomputing '93, Portland, Oregon, November 1993, pp. 12-21.
118. S. Weiss, I. Spillinger, G.M. Silberman, Architectural improvements for a data-driven vlsi processing array, J. Parallel Distributed Comput. 19 (4) (1993) 308-322.
119. N. Wirth, The Hardware Description Language Lola, June 1995.
120. M.J. Wirthlin, B.L. Hutchings, DISC : the dynamic instruction set computer, in: J. Schewel (Ed.), Field Programmable Gate Arrays for Fast Board Development and Reconfigurable Computing, vol. SPIE 2607, 1995, pp. 92-103.
121. M.J. Wirthlin, B.L. Hutchings, Improving functional density through run time constant propogation, in: International Symposium on Field Programmable Gate Arrays, April 1997, pp. 86-92.