article

Free access

Data-Driven and Demand-Driven Computer Architecture

Authors:

Philip C. Treleaven,

David R. Brownbridge,

Richard P. HopkinsAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 14, Issue 1

Pages 93 - 143

https://doi.org/10.1145/356869.356873

Published: 01 March 1982 Publication History

PDF eReader

References

[1]

ACKERMAN, W. B. "Data flow languages," in Proc. 1979 Nat. Computer Conf. (New York, N.Y., June 4-7), vol. 48, AFIPS Press, Arlington, Va, 1979, pp. 1087-1095.

Google Scholar

[2]

ACKERMAN, W B., AND DENNIS, J. B. "VAL--A value oriented algorithmic language, preliminary reference manual," Tech. Rep. TR-218, Lab. for Computer Scmnce, Massachusetts Institute of Technology, June 1979.

Crossref

Google Scholar

[3]

AMAMIYA, M., HASEGAWA, S., AND MI- KAMI, H. "List processing and data flow machine," Lecture Note Series, No. 436, Research Institute for Mathematical Sciences, Kyoto Umv., Sept 1980.

Google Scholar

[4]

ARVIND AND GOSTELOW, K.P. "A new interpreter for dataflow and its implications for computer architecture," Tech. Rep. 72, Dep Information and Computer Science, Univ. of Cahfornia, Irvme, Oct. 1975.

Google Scholar

[5]

ARVIND AND GOSTELOW, K. P. "A computer capable of exchanging processors for time," m Proc IFIP Congress (1977), 849-854.

Google Scholar

[6]

ARVIND AND GOSTELOW, K P. "Some relationships between asynchronous interpreters of a dataflow language," in Proc. IFIP Working Conf. Formal Description of Programming Languages (Aug. 1977), E. J. Neuhold, Ed., Elsevier North-Holland, New York, 1977.

Google Scholar

[7]

ARVIND, GOSTELOW, K. P., AND PLOUFFE, W. "An asynchronous programming language and computing machine," Tech. Rep. 114a, Dep. Information and Computer Scmnce, Univ. of California, irvme, Dec. 1978.

Google Scholar

[8]

ARVIND, KATHAIL, V., AND PINGALI, K. "A processing element for a large multiprocessor dataflow machine," in Proc. Int. Conf Cwcmts and Computers (New York, Oct. 1980), IEEE, New York, 1980.

Google Scholar

[9]

ARVIND AND THOMAS, R E. "I-structures: An efficient data type for functional languages," Rep. LCS/TM-178, Lab. for Computer Science, Massachusetts Institute of Technology, June 1980.

Google Scholar

[10]

ASHCROFT, E. A, AND WADGE, W. W "LUCID, a nonprocedural language with iteration," Commun. A CM 20, 7 (July 1977), 519-526

Crossref

Google Scholar

[11]

BACKUS, J. "Reduction languages and variable free programming," Rep. RJ 1010, IBM Thomas J Watson Research Center, Yorktown Heights, N Y., Apr. 1972.

Google Scholar

[12]

BACKUS, J. "Programming languages and closed applicative languages," m Proc. A CM Symp Pnnciples of Programmlng Languages, ACM, New York, 1973, pp 71-86.

Crossref

Google Scholar

[13]

BACKUS, J. "Can programming be liberated from the von Neumann style~ A functional style and its algebra of programs," Commun. ACM 21, 8 (Aug. 1978), 613-641.

Crossref

Google Scholar

[14]

BERKLING, K. J. "A computing machine based on tree structures," IEEE Trans. Comput. C-20, 4 (Jan 1971), 404- 418.

Google Scholar

[15]

BERKLING, K. "Reductmn languages for reduction machines," in Proc. 2rid Int. Syrup Computer Architecture (Houston, Tex., Jan. 1975), IEEE, New York, 1975, pp. 133-140.

Crossref

Google Scholar

[16]

CHAMBERLIN, D. D. "The single assignment approach to parallel processnag," in Proc Nat. Computer Conf. (Las Vegas, Nev., Nov. 16-18), vol. 39, AFIPS Press, Arlington, Va., 1971, pp. 263-269.

Google Scholar

[17]

CLARKE, T. J. W., GLADSTONE, P. J S, MACLEAN, C. D., AND NORMAN, A. C. "SKIM--The S, K, I reduction machine," in Proc. LISP-80 Conf. (Stanford, Calif., Aug. 1980), pp. 128-135

Crossref

Google Scholar

[18]

COMTE, D., DURRIEU, A., GELLY, O., PLAS, A., AND SYRE, J C. "TEAU 9/7: SYSTEME LAU--Summary m English," CERT Tech. Rep. #1/3059, Centre d'l~tudes et de Recherches de Toulouse, Oct. 1976.

Google Scholar

[19]

COMTE, D., AND HIFDI, N. "LAU Multiprocessor. Microfunctional description and technological choices," in Proc. 1st European Conf. Parallel and D~str~buted Processing (Toulouse, France, Feb. 1979), pp. 8-15.

Google Scholar

[20]

CORNISH, M. "The TI data flow architectures: The power of concurrency for avionics," in Proc. 3rd Conf. Digital Awon~cs Systems (Fort Worth, Tex., Nov. 1979), IEEE, New York, 1979, pp. 19-25

Google Scholar

[21]

DARLINGTON, J., AND REEVE, M. "ALICE" A multiprocessor reduction machine for the parallel evaluatmn of applicative languages," in Proc Int. Symp Functmnal Programmmg Languages and Computer Architecture (Goteborg, Sweden, June 1981), pp. 32-- 62.

Crossref

Google Scholar

[22]

DAVIS, A. L. "The architecture and system method of DDMI: A recursively structured data driven machine," in Proc. 5th Annu. Symp. Computer Architecture (Palo Alto, Calif., Apr. 3-5), ACM, New York, 1978, pp. 210-215.

Crossref

Google Scholar

[23]

DAVIS, A.L. "DDN's--A low level program schema for fully distributed systems," m Proc. 1st European Conf. Parallel and D~stributed Processing (Toulouse, France, Feb. 1979), pp. 1-7.

Google Scholar

[24]

DAVIS, A. L. "A data flow evaluation system based on the concept of recursive locality," in Proc. 1979 Nat. Computer Conf (New York, N.Y., June 4-7), vol. 48, AFIPS Press, Arlington, Va., 1979, pp. 1079-1086

Google Scholar

[25]

DENNIS, J.B. "On the design and specification of a common base language," in Proc. Symp Computers and Automata, Polytechnic Institute of Brooklyn, Brooklyn, N.Y, 1971.

Google Scholar

[26]

DENNIS, J. B., FOSSEEN, J. B., AND LIN- DERMAN, J.P. "Data flow schemas," m Int. Symp. on Theoretical Programming, A. Ershov and V. A. Nepomniascuy, Eds., Lecture notes ~n computer science, vol. 5, 1972, Sprmger-Verlag, New York, pp. 187-216.

Crossref

Google Scholar

[27]

DENNIS, J.B. "Ftrst version of a data flow procedure language," in Programmmg Syrup.: Proc. Colloque sur la Programmation (Paris, France, Apr. 1974), B Robinet, Ed., Lecture notes zn computer science, vol. 19, Sprmger-Verlag, New York, 1974, pp. 362-376.

Crossref

Google Scholar

[28]

DENNIS, J. B., AND MISUNAS, D.P. "A computer architecture for highly parallel signal processing," m Proc. 1974 Nat. Computer Conf., AFIPS Press, Arhngton, Va, 1974, pp. 402-409.

Google Scholar

[29]

DENNIS, J. B., AND MISUNAS, D. P "A prelnninary architecture for a basic data flow processor," in Proc. 2nd Int Syrup. Computer Archttecture (Houston, Tex, Jan. 20-22), IEEE, New York, 1975, pp 126-132.

Crossref

Google Scholar

[30]

DENNIS, J. B., LEUNG, C. K. C., AND MISUNAS, D P. "A highly parallel processor using a data flow machine language," Tech. Rep. CSG Memo 134-1, Lab. for Computer Science, Massachusetts Institute of Technology, June 1979

Google Scholar

[31]

DENNIS, j B. "The varieties of data flow computers," m Proc 1st Int. Conf Dtstrtbuted Computtng Systems (Toulouse, France, Oct. 1979), pp. 430-439.

Google Scholar

[32]

EGAN, G. K. "FLO: A decentrahsed data-flow system," Dep. Computer Science, Univ. of Manchester, England, Oct. 1979

Google Scholar

[33]

ERIKIO, L., HEIMONEN, J HIETALA, P., AND KURKI-SUONIO, R. "PLEXUS II--A data flow system," Tech. Rep. A43, Dep. Mathematical Scmnces, Univ. of Tarnpere, Finland, Apr. 1980.

Google Scholar

[34]

FARRELL, E. P., GHANI, N., AND TRE- LEAVEN, P. C ~A concurrent computer architecture and a ring based Implementation," In Proc. 6th Int. Syrup. Computer Architecture (April 23-25), IEEE, New York, 1979, pp. 1-11.

Crossref

Google Scholar

[35]

FRIEDMAN, D. P., AND WISE, D. S. "CONS should not evaluate its arguments." in Automata, languages and programming, S. Michaelson and R. Mflner, Eds., Edinburgh Univ. Press, Edinburgh, U. K., 1976, pp. 257-284.

Google Scholar

[36]

GELLY, O, et al. "LAU software system. A high level data driven language for parallel programming," m Proc. 1976 Int. Conf. Parallel Processtng (Aug 1976), p. 255

Google Scholar

[37]

GOSTELOW, K P., AND THOMAS, R. E. "A vmw of dataflow," m Proc. Nat Computer Conf (New York, N.Y., June 4-7), vol 48, AFIPS Press, Arhngton, Va., 1979, pp. 629-636.

Google Scholar

[38]

GOSTELOW, K. P., AND THOMAS, R E "Performance of a dataflow computer," Tech. Rep. 127a, Dep Information and Computer Science, Univ. of California, Irvme, Oct. 1979

Google Scholar

[39]

GOTO, E., AND IDA, T. "Parallel hashmg algorithms" Inf Process Lett. 6, 1 (Feb. 1977), pp 8-13.

Google Scholar

[40]

HENDERSON, P., AND MORRIS, J M. "A lazy evaluator," in Proc 3rd Symp Pnnc~ples of Programming Languages (Atlanta, Ga., Jan. 19-21), ACM, New York, 1976, pp. 95-103.

Crossref

Google Scholar

[41]

HOMMES, F., AND SCHLUTTER, H "Reduction machine system User's guide," Tech. Rep. ISF--Rep. 79, Gesellschaft fur Mathematlk und Datenverarbeltung MBH Bonn, Dec. 1979.

Google Scholar

[42]

HOPKINS, R. P., RAUTENBACH, P. W., AND TRELEAVEN, P C "A computer supporting data flow, control flow and updateable memory," Tech. Rep. 156, Computing Lab., Univ. Newcastle upon Tyne, Sept. 1979.

Google Scholar

[43]

JIPDC. "Prelnmnary report on study and research on fifth-generation computers 1970-1980," Japan Information Processing Development Center, Tokyo, Japan, 1981.

Google Scholar

[44]

JIPDC. "Research reports in Japan," Japan Information Processing Development Center, Tokyo, Japan, Fall 1981

Google Scholar

[45]

JIPDC. in Proc. Int. Conf. F~fth Generatmn Computer Systems, Japan Information Processing Development Center, 1981

Google Scholar

[46]

JOHNSON, D., et al "Automatic partitmmng of programs m multiprocessor systems," in Proc. IEEE COMPCON 80 (Feb. 1980), IEEE, New York, pp 175- 178

Google Scholar

[47]

KELLER, R. M., PATIL, S, AND LIND- STROM, G. "An architecture for a loosely coupled parallel processor," Tech. Rep. UUCS-78-105, Dep. Computer Science, Univ. of Utah, Oct. 1978.

Google Scholar

[48]

KELLER, R. M, et al. "A loosely coupled applicative multlprocessing system," in Proc. Nat Computer Conf., AFIPS Press, Arlington, Va., 1978, pp. 861-870.

Google Scholar

[49]

KLUGE, W.E. "The architecture of a reduction language machine hardware model," Tech. Rep. ISF--Rep 79.03, GeseUschaft fur Mathematik und Datenverarbeltung MBH Bonn, Aug. 1979.

Google Scholar

[50]

KLUGE, W. E., AND SCHLUTTER, H "An architecture for the direct execution of reduction languages," in Proc. Int Workshop Hzgh-Level Language Computer Architecture (Fort Lauderdale, Fla., May 1980), Univ of Maryland and Office of Naval Research, pp. 174-180.

Google Scholar

[51]

LANDIN, P. J "The mechanical evaluation of expressmns," Comput J. 6 (Jan. 1964), 308-320.

Google Scholar

[52]

LECOUFFE, M.P. "MAUD. A dynamic single-assignment system," IEE Cornput D~g~tal Tech. 2, 2 (Apr 1979), 75- 79.

Google Scholar

[53]

MA(~b, G. A. "A network of microprocessors to execute reduction languages," int. J Comput. Inform. Sc~. 8, 5 (1979), 349-385, 8, 6 (1979), 435-471.

Google Scholar

[54]

MAG6, G. A "A cellular computer architecture for functional programming," in Proc. IEEE COMPCON 80 (Feb. 1980), IEEE, New York, pp 179-187.

Google Scholar

[55]

MCCARTHY, J., et al. LISP 1 5 programmers manual M.I.T. Press, Cambridge, Mass., 1962

Crossref

Google Scholar

[56]

MEAD, C A, AND CONWAY, L. A Introductmn to VLSI systems, Addmon- Wesley, Reading, Mass., 1980.

Crossref

Google Scholar

[57]

MIRANKER, G. S "Implementation of procedures on a class of data flow processors," in Proc. 1977 Int. Conf. Parallel Processing (Aug. 1977), J. L. Baer, Ed., IEEE, New York, pp 77-86

Google Scholar

[58]

ORGANICS, E. I. "New d~rectlons m computer system architecture," Eurom~cro J 5, 4 (July 1979), 190-202.

Google Scholar

[59]

PLAS, A., et al "LAU system architecture" A parallel data driven processor based on single assignment," in Proc. 1976 Int. Conf. Parallel Processing (Aug. 1976), pp. 293-302.

Google Scholar

[60]

RODRIGUEZ, J.E. "A graph model for parallel computation," Tech. Rep. ESL- R-398, MAC-TR-64, Lab for Computer Scmnce, Massachusetts Institute of Technology, Sept 1969.

Crossref

Google Scholar

[61]

RUMBAUGH, J. E "A data flow mulhprocessor," IEEE Trans. Comput. C-26, 2 (Feb 1977), 138-146.

Google Scholar

[62]

SCHONFINKEL, M. "Uber die Bausteine der Mathematmchen Log}k," Math. Ann 92, 305 (1924).

Google Scholar

[63]

SEITZ, C. (Ed) Proc. Conf Very Large Scale integratmn (Pasadena, Calif., Jan. 1979).

Google Scholar

[64]

SHROEDER, M. A., AND MEYER, R. A "A distributed computer system using a data flow approach," Proc. 1977 Int. Conf Parallel Processing (Aug. 1977), p. 93.

Google Scholar

[65]

SLEEP, M R "Apphcatlve languages, dataflow and pure combmatory code," Proc IEEE COMPCON 80 (Feb. 1980), IEEE, New York, pp. 112-115.

Google Scholar

[66]

SLEEP, M. R, AND BURTON, F. W. "Towards a zero assignment parallel processor," m Proc. 2nd int Conf. D~str~buted Computing (Apr. 1981)

Google Scholar

[67]

SYRE, J. C, et al. "Parallelism, control and synchronization expression in a single assignment language" (abstract), m Proc. 4th Annu. A CM Computer Science Conf. (Feb 1976), ACM, New York.

Google Scholar

[68]

SYRE, J. C., COMTE, D., AND HIFDI, N. "Plpehnmg, parallelism and asynchromsm m the LAU system," m Proc 1977 Int Conf Parallel Processing (Aug. 1977), pp. 87-92.

Google Scholar

[69]

TESLER, L. G., AND ENEA, H. J. "A language design for concurrent processes," m Proc. Nat. Computer Conf (Atlantic City, N.J., April 30-May 2), vol 32, AFIPS Press, Arhngton, Va, 1968, 403-408.

Google Scholar

[70]

TRELEAVEN, P. C "Principle components of a data flow computer," Proc 1978 Euromlcro Syrup. (Munich, W. Germany, Oct I978), pp. 366-374.

Google Scholar

[71]

TRELEAVEN, P. C. "Exploiting program concurrency m computing systems," Computer 12, 1 (Jan. 1979), 42- 49

Google Scholar

[72]

TRELEAVEN, P C, AND MOLE, G. F. "A multi-processor reduction machine for user-defined reduction languages," in Proc. 7th Int. Syrup. Computer Architecture (May 6-8), IEEE, New York, 1980, pp. 121-130.

Crossref

Google Scholar

[73]

TRELEAVEN, P. C (Ed) "VLSI: Machine architecture and very high level languages," Tech. Rep. 156, Computing Lab, Umv. of Newcastle upon Tyne, Dec. 1980 (summary in SIGARCH Cornput. Arch~t News 8, 7, 1980).

Crossref

Google Scholar

[74]

TRELEAVEN, P. C., AND HOPKINS, R. P. "A recurslve (VLSI) computer architecture," Tech. Rep. 161, Computing Lab., Univ. of Newcastle upon Tyne, Mar. 1981.

Google Scholar

[75]

TRELEAVEN, P. C., AND HOPKINS, R. P. "Decentralised computation," in Proc. 8th Int. Syrup. Computer Architecture (Minneapolis, Minn., May 12-14), ACM, New York, 1981, pp. 279-290.

Crossref

Google Scholar

[76]

TRELEAVEN, P. C., HOPKINS, R. P., AND RAUTENBACH, P W. "Combining data flow and control flow computing," Cornput. J. 25, 1 (Feb 1982).

Google Scholar

[77]

TURNER, D. A. "A new Implementation technique for applicative languages," Soft. Pract. Exper. 9 (Sept, 1979), 31-49.

Google Scholar

[78]

TURNER, D.A. "Another algorithm for bracket abstraction," J. Symbol Logic 44, 2 (June 1979), 267-270.

Google Scholar

[79]

VEEN, A. H. "Reconciling data flow machines and conventional languages," Tech. Rep lW 146/80, Mathematical Center, Amsterdam, Sept 1980.

Google Scholar

[80]

WATSON, I., AND GURD, J "A prototype data flow computer with token labehng," m Proc Nat Computer Conf. (New York, N.Y., June 4-7), vol. 48, AFIPS Press, Arlington, Va., 1979, pp. 623-628.

Google Scholar

[81]

WENG, K. S. "Stream-oriented computation m recursive data flow schemas," Tech. Rep TM-68, Lab. for Computer Science, Massachusetts Institute of Technology, Oct 1975

Google Scholar

[82]

WILNER, W "Recursive machines," Intern. Rep., Xerox PARC, Palo Alto, Calif., 1980.

Google Scholar

[83]

ADAMS, D.A. "A computation model with data flow sequencing," Tech. Rep. CS 117, Computer Science Dep., Stanford Unlv, Stanford, Cahf., December 1968

Google Scholar

[84]

ARVIND, GOSTELOW, K. P., AND PLOUFFE, W. "Indeterminacy, monitors and dataflow," in Proc. 6th A CM Symp Operating Systems Principles (Nov. 1977), ACM, New York, pp. 159-169.

Crossref

Google Scholar

[85]

BAHRS, A. "Operational patterns: An extensible model of an extensible language," in Lecture notes in computer science, vol. 5, Springer-Verlag, New York, 1972, pp. 217-246.

Crossref

Google Scholar

[86]

BANATRE, J. P., ROUTEAU, J. P., AND TRILLING, L. "An event-driven compiling technique," Commun. A CM 22, 1 (Jan. 1979), 34-42.

Crossref

Google Scholar

[87]

BOLEY, H. "A preliminary survey of artificial intelligence machines," Rundbrief der Fachgruppe Kunstliche Intelligenz in der Gesellschaft fur Informatik, UniversitAt Hamburg, 1980.

Google Scholar

[88]

BURGE, W. H. Recursive programming techniques, Addison-Wesley, Reading, Mass., 1975.

Google Scholar

[89]

CHURCH, A. "The calcuh of lambdaconversion," Princeton Univ. Press, Princeton, N.J, 1941.

Google Scholar

[90]

DARLINGTON, J., HENDERSON, P., AND TURNER, A., EDS. Functional programming and its applicaaons, Cambridge Univ. Press, in preparation.

Crossref

Google Scholar

[91]

DAVIS, A. L, AND DRONGOWSKI, P. J. "Dataflow computers: A tutorial and survey," Tech. Rep. UUCS-80-109, Dep. Computer Science, Univ. of Utah, July 1980.

Google Scholar

[92]

DAVIS, A. L., AND LOWER, S. A. "A sample management application program in a graphical data-driven programming language," in Proc. IEEE COMPCON 81 (Feb. 1981), IEEE, New York, pp. 162-165.

Google Scholar

[93]

DENNIS, J.B. "Packet communication architecture," m Proc. 1975 Computer Conf. Parallel Processing, 1975, pp. 224- 229.

Google Scholar

[94]

DENNIS, j B., AND WENG, K.- S. "Application of data flow computation to the weather problem." in Proc. Syrup. H~gh Speed Computer and Algorithm Organzsation, 1977, pp 143-157.

Google Scholar

[95]

DENNIS, J. B. "Data-flow supercomputers," Computer 13, 11 (Nov. 1980), 48-56.

Google Scholar

[96]

DOMAN, A. "PARADOCS: A highly parallel dataflow computer and its dataflow language," Euromicro J. 7 (1981), 20-31

Google Scholar

[97]

FRIEDMAN, D. P., AND WISE, D. S. "Aspects of applicative programming for file systems," ACM SIGPLAN Not. 12, 3 (Mar. 1977), 41-55.

Crossref

Google Scholar

[98]

FRIEDMAN, D. P., AND WISE, D. S. "Aspects of applicative programming for parallel processing," IEEE Trans. Comput. C-27, 4 (Apr. 1978), 289- 296.

Google Scholar

[99]

GAJSKI, D. D., et al. "Dependence driven computation," in Proc. IEEE COMPCON 81 (Feb. 1981), IEEE, New York, pp. 156-161.

Google Scholar

[100]

GURD, J., AND WATSON, i. "A multilayered data flow architecture," in Proc. 1977 Int. Conf Parallel Processing (Aug. 1977), p. 94.

Google Scholar

[101]

HEWITT, C. E., AND BAKER, H. "Actors and continuous functionals," in Proc. IFIP Working Conf Formal Description of Programming Concepts (St. Andrews, N. B., Canada, Aug 1977), E J. Neuhold, Ed., Elsevier North-Holland, New York, 1977, pp. 16.1-16.21.

Google Scholar

[102]

KARP, R. M., AND MILLER, R. E. "Properties of a model for parallel computations: Determinacy, termination and queuing," SIAM J. Appl. Math. 11, 6 (Nov. 1966), 1390-1411.

Google Scholar

[103]

KARP, R. M., AND MILLER, R. E. "Parallel program schemata," J. Comput. Syst. Sc~. 3, 4 (May 1969), 147- 195.

Google Scholar

[104]

KOSINSKI, P.R. "A data flow programming language," Tech. Rep. RC 4264, IBM T. J. Watson Research Center, Yorktown Heights, N.Y., Mar. 1973.

Google Scholar

[105]

KOSlNSKI, P.R. "A data flow language for operating system programming," ACM SIGPLAN Not 8, 9 (Sept. 1973), 89-94.

Crossref

Google Scholar

[106]

KOTOV, V. E. "On basic parallel language," in Proc. IFIP 80 Congr. (Tokyo, Japan and Melbourne, Australia), Elsevier North-Holland, New York, 1980.

Google Scholar

[107]

KOWALSKI, R. "Algorithms ffi logic + control," Commun. A CM 22, 7 (July 1979), 424-436

Crossref

Google Scholar

[108]

MAGG, G A. "A cellular, language directed computer architecture," in Proc. Conf. Very Large Scale Integration (Pasadena, Calif., Jan. 1979), pp. 447- 452.

Google Scholar

[109]

MAG0, G. A., STANAT, D. E., AND KOS- TER, A. "Program execution on a cellular computer Some matrix algorithms," Tech. Rep., Dep. Computer Science, Univ. of North Carolina, Chapel Hill, May 1981.

Google Scholar

[110]

MANNA, Z. Mathematwal theory of computatton, McGraw-Hill, New York, 1974.

Crossref

Google Scholar

[111]

MEYER, S.C. "An analytic approach to performance analysis for a class of data flow processors," m Proc 1976 Int. Conf. Parallel Processing (Aug. 1976), pp. 106-115.

Google Scholar

[112]

MILLER, R. E., AND COCKE, J. "Configurable computers' A new class of general purpose machines," in Lecture notes m computer scwnce, vol. 5, Springer-Verlag, New York, 1972, pp. 285-298.

Crossref

Google Scholar

[113]

MISUNAS, D.P. "Deadlock avoidance in a data-flow architecture," in Proc. Symp. Automatw Computation and Control (Milwaukee, Wis., Apr. 1975).

Google Scholar

[114]

MISUNAS, D. P "Structure processing in a data flow computer," in Proc. 1975 Int. Conf Parallel Processing (Aug. 1975), pp. 230-234.

Google Scholar

[115]

MISUNAS, D. P. "Error detection and recovery in a data-flow computer," in Proc. 1976 Int. Conf. Parallel Process- ~ng (Aug. 1976), pp. 117-122.

Google Scholar

[116]

SHARP, J.A. "Some thoughts on data flow architectures." SIGARCH Comput Arch~t News (ACM) 8, 4 (June 1980), 11-21

Crossref

Google Scholar

[117]

SHRIVER, B. D., AND LANDRY, S. P. "An overview of dataflow related research," Tech. Rep. Dep. Computer Science, Univ of Southwestern Louisiana, 1978

Google Scholar

[118]

WENG, K.S. "An abstract nnplemenration for a generalized data flow language," Tech. Rep. TR-228, Lab. for Computer Science, Massachusetts Inshtute of Technology, May 1979

Crossref

Google Scholar

Cited By

View all

Yang HZhang HGuo LYang WWu YWang JLi XDu HPeng BLiu QWang FXue DXu X(2024) Template Selection Strategy for Synthesis of One-Dimensional CrSbSe 3 Ferromagnetic Semiconductor Nanoribbons Nano Letters10.1021/acs.nanolett.4c0253324:34(10519-10526)Online publication date: 16-Aug-2024
https://doi.org/10.1021/acs.nanolett.4c02533
Shi CChen HLiu RLi G(2023)Data-Flow-Based Normalization Generation Algorithm of R1CS for Zero-Knowledge Proof2023 IEEE 28th Pacific Rim International Symposium on Dependable Computing (PRDC)10.1109/PRDC59308.2023.00031(191-197)Online publication date: 24-Oct-2023
https://doi.org/10.1109/PRDC59308.2023.00031
Bayliss J(2022)Developing games with data-oriented designProceedings of the 6th International ICSE Workshop on Games and Software Engineering: Engineering Fun, Inspiration, and Motivation10.1145/3524494.3527626(30-36)Online publication date: 20-May-2022
https://dl.acm.org/doi/10.1145/3524494.3527626
Show More Cited By

Recommendations

Demand-driven pointer analysis

Known algorithms for pointer analysis are “global” in the sense that they perform an exhaustive analysis of a program or program component. In this paper we introduce a demand-driven approach for pointer analysis. Specifically, we describe a demand-...
Demand-driven pointer analysis
PLDI '01: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation

Known algorithms for pointer analysis are “global” in the sense that they perform an exhaustive analysis of a program or program component. In this paper we introduce a demand-driven approach for pointer analysis. Specifically, we describe a demand-...
Demand-driven alias analysis for C
POPL '08

This paper presents a demand-driven, flow-insensitive analysisalgorithm for answering may-alias queries. We formulate thecomputation of alias queries as a CFL-reachability problem, and use this formulation to derive a demand-driven analysis algorithm. ...

Comments

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 14, Issue 1

March 1982

146 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/356869

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1982

Published in CSUR Volume 14, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

262
Total Citations
View Citations
4,993
Total Downloads

Downloads (Last 12 months)776
Downloads (Last 6 weeks)56

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yang HZhang HGuo LYang WWu YWang JLi XDu HPeng BLiu QWang FXue DXu X(2024) Template Selection Strategy for Synthesis of One-Dimensional CrSbSe 3 Ferromagnetic Semiconductor Nanoribbons Nano Letters10.1021/acs.nanolett.4c0253324:34(10519-10526)Online publication date: 16-Aug-2024
https://doi.org/10.1021/acs.nanolett.4c02533
Shi CChen HLiu RLi G(2023)Data-Flow-Based Normalization Generation Algorithm of R1CS for Zero-Knowledge Proof2023 IEEE 28th Pacific Rim International Symposium on Dependable Computing (PRDC)10.1109/PRDC59308.2023.00031(191-197)Online publication date: 24-Oct-2023
https://doi.org/10.1109/PRDC59308.2023.00031
Bayliss J(2022)Developing games with data-oriented designProceedings of the 6th International ICSE Workshop on Games and Software Engineering: Engineering Fun, Inspiration, and Motivation10.1145/3524494.3527626(30-36)Online publication date: 20-May-2022
https://dl.acm.org/doi/10.1145/3524494.3527626
Bayliss J(2022)The Data-Oriented Design Process for Game DevelopmentComputer10.1109/MC.2022.315510855:5(31-38)Online publication date: 1-May-2022
https://dl.acm.org/doi/10.1109/MC.2022.3155108
America P(2022)Issues in the design of a parallel object-oriented languageFormal Aspects of Computing10.1007/BF018872141:1(366-411)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1007/BF01887214
Darche P(2020)ReferencesMicroprocessor 110.1002/9781119779667.refs(153-171)Online publication date: 6-Nov-2020
https://doi.org/10.1002/9781119779667.refs
Pardo-Guerra J(2019)Automating Finance10.1017/9781108677585Online publication date: 3-May-2019
https://doi.org/10.1017/9781108677585
Chau TBurovskiy PFlynn MLuk W(2017)Advances in Dataflow Systems10.1016/bs.adcom.2017.04.002(21-62)Online publication date: 2017
https://doi.org/10.1016/bs.adcom.2017.04.002
Verdoscia LVaccaro RGiorgi R(2014)A Clockless Computing System Based on the Static Dataflow ParadigmProceedings of the 2014 Fourth Workshop on Data-Flow Execution Models for Extreme Scale Computing10.1109/DFM.2014.10(30-37)Online publication date: 24-Aug-2014
https://dl.acm.org/doi/10.1109/DFM.2014.10
Loghin DTudor BTeo Y(2013)An Approach for Direct Dataflow Execution on Contemporary Multicore SystemsProceedings of the 2013 Data-Flow Execution Models for Extreme Scale Computing10.1109/DFM.2013.9(1-8)Online publication date: 8-Sep-2013
https://dl.acm.org/doi/10.1109/DFM.2013.9
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Demand-driven pointer analysis

Demand-driven pointer analysis

Demand-driven alias analysis for C

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations