|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| J.-L. Gaudiot, Y.-H. Wei, "Token Relabeling in a Tagged Token Data-Flow Architecture," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1225-1239, September, 1989. | |||
| BibTex | x | ||
| @article{ 10.1109/12.29463, author = {J.-L. Gaudiot and Y.-H. Wei}, title = {Token Relabeling in a Tagged Token Data-Flow Architecture}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {9}, issn = {0018-9340}, year = {1989}, pages = {1225-1239}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.29463}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Token Relabeling in a Tagged Token Data-Flow Architecture IS - 9 SN - 0018-9340 SP1225 EP1239 EPD - 1225-1239 A1 - J.-L. Gaudiot, A1 - Y.-H. Wei, PY - 1989 KW - tagged token data-flow architecture; direct structure access; token relabeling; array operations; graph constructs; numerical algorithms; fast Fourier transform; bitonic sort; LU decomposition; matrix multiplication; deterministic simulation; execution time; speedup; resource utilization; fast Fourier transforms; graph theory; parallel architectures. VL - 38 JA - IEEE Transactions on Computers ER - | |||
[1] Special Issue on Data-Flow Systems,IEEE Computer, Feb. 1982.
[2] S. Abe, R. Hiraoka, Y. Fukunaga, T. Bandoh, K. Hirasawa, and Y. Kawamoto, "Preliminary performance evaluation of data-flow computers," inProc. COMPCON Spring 82, 1982.
[3] Arvind and K. P. Gostelow, "Theu-interpreter,"IEEE Computer, vol. 15, Feb. 1982.
[4] Arvind and R. A. Iannucci, "Two fundamental issues in multiprocessors: The data-flow solution," Tech. Rep. LCS/TM-241, Lab. Comput. Sci., M.I.T., Sept. 1983.
[5] Arvind, V. Kathail, and K. Pingali, "A data-flow architecture with tagged tokens," Tech. Rep. TM-174, Lab. Comput. Sci., M.I.T., Sept. 1980.
[6] Arvind and R. E. Thomas, "I-structures: An efficient data type for functional languages," Tech. Rep. LCS/TM-178, Lab. Comput. Sci., M.I.T., June 1980.
[7] K. E. Batcher, "Sorting networks and their application," inProc. AFIPS 1968 SJCC. Montvale, NJ: AFIPS Press, 1968, pp. 307- 314.
[8] W. W. Carlson and K. Hwang, "Algorithmic performance of dataflow multiprocessors,"IEEE Computer, vol. 18, pp. 44-64, Dec. 1985.
[9] A. Chien, "Structuring the fast Fourier transform for data flow computation," Tech. Rep. Memo 193, Computat. Structure Group, M.I.T., June 1980.
[10] W. T Cochran et al., "'What is the fast Fourier transform?,"IEEE Trans. Audio Electroacoust., vol. AU-15, pp. 45-55, June 1967.
[11] J. B. Dennis,First Version of a Data Flow Procedure Language. New York: Springer-Verlag, Apr. 1974, pp. 362-376.
[12] M. D. Ercegovac, D. R. Patel, and T. Lang, "Functional languages and data-flow architectures," inProc. Summer Comput. Simulation Conf., 1983.
[13] D. D. Gajski, D. A. Padua, D. J. Kuck, and R. H. Kuhn, "A second opinion on data-flow machines and languages,"IEEE Computer, pp. 58-69, Feb. 1982.
[14] J. L. Gaudiot, "Methods for handling structures in data-flow systems," inProc. 12th Int. Symp. Comput. Architecture, June 1985.
[15] J.-L. Gaudiot, "Structure handling in data-flow systems,"IEEE Trans. Computers, vol. C-35, pp. 489-501, June 1986.
[16] J. L. Gaudiot, R. W. Vedder, G. K. Tucker, D. Finn, and M. L. Campbell, "A distributed VLSI architecture for efficient signal and data processing," Special Issue on Distributed Computing Systems,IEEE Trans. Comput., Dec. 1985.
[17] J. L. Gaudiot and Y. H. Wei, "Token relabeling in a tagged data-flow architecture," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986.
[18] K. P. Gostelow and R. E. Thomas, "Performance of a simulated data-flow computer,"IEEE Trans. Comput., vol. C-29, pp. 905-919, Oct. 1980.
[19] S. K. Heller and Arvind, "Design of a memory controller for the mit tagged token dataflow machine," inProc. ICCD, 1983.
[20] Y. C. Hong, T. H. Payne, and L. B. O. Ferguson, "Partitioning program graphs to enhance concurrency in static dataflow systems," inProc. 13th Int. Symp. Comput. Architecture, Tokyo, Japan, June 1986.
[21] Y. C. Hong, T. H. Payne, and L. B. O. Ferguson, "An architecture for a data-flow multiprocessor," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 349-355.
[22] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[23] K. Hwang and Y. H. Cheng, "Partitioned matrix algorithms for VLSI arithmetic systems,"IEEE Trans. Comput., pp. 1215-1224, Dec. 1982.
[24] J. R. McGraw and S. K. Skedzielewski, "SISAL: Streams and iteration in a single assignment language, language reference manual, version 1.2," Tech. Pep. M-146, Lawrence Livermore Nat. Lab., Mar. 1985.
[25] J. R. McGraw and S. K. Skedzielewski, "Streams and iteration in val-- Additions to a data-flow language," inProc. 3rd Int. Conf. Distrib. Comput. Syst., Oct. 1982.
[26] M. E. Kopache and E. P. Glinert, "C2: A mixed textual/graphical environment for C," inProc. IEEE Workshop Visual Languages. 1988, pp. 231-238.
[27] P. C. Treleaven, D. R. Brownbridge, and R. P. Hopkins, "Data-driven and demand-driven computer architecture,"ACM Comput. Surveys, vol. 14, pp. 93-143, Mar. 1982.