{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:09Z","timestamp":1725663069394},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184201"},{"type":"electronic","value":"9783540479635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18420-1_56","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:29Z","timestamp":1330198469000},"page":"203-214","source":"Crossref","is-referenced-by-count":2,"title":["Overview of Rediflow II development"],"prefix":"10.1007","author":[{"given":"Robert M.","family":"Keller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon W.","family":"Slater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin T.","family":"Likes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-15975-4_31","volume":"201","author":"S. Abramsky","year":"1985","unstructured":"S. Abramsky and R. Sykes. Secd-m: a virtual machine for applicative programming. in J.-P. Jouannaud (ed.), Functional programming languages and computer architecture, Lecture Notes in Computer Science, 201, 81\u201398 (Sept. 1985).","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR2","unstructured":"D. Friedman and D. Wise. CONS should not evaluate its arguments. in S. Michaelson and R. Milner (eds.), Automata, Languages, and Programming, 257\u2013284, Edinburgh University Press (1976)."},{"key":"10_CR3","unstructured":"R. Fujimoto. VLSI communication components for multicomputer networks. PhD Thesis, UC Berkeley, California (August, 1983)."},{"key":"10_CR4","unstructured":"M. Gerla. Routing and flow control. in F.F Kuo (ed)., Protocols and techniques for data communication networks 122\u2013174, Prentice-Hall, Inc., Englewood Cliffs, New Jersey (1981)."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"R.H. Halstead. Implementation of Multilisp: Lisp on a multiprocessor. Symposium on Lisp and Functional Programming, 9\u201317, ACM (August 1984).","DOI":"10.1145\/800055.802017"},{"key":"10_CR6","unstructured":"P. Henderson. Functional programming: Application and implementation. Prentice-Hall International, Inc., London, Great Britain (1980)."},{"key":"10_CR7","unstructured":"G. Kahn. A simple language for parallel processing. Proc. IFIP '74."},{"key":"10_CR8","unstructured":"M.G.H. Katevenis. Reduced instruction set computer architectures for VLSI. MIT Press (1983)."},{"key":"10_CR9","first-page":"613","volume":"NCC","author":"R.M. Keller","year":"1979","unstructured":"R.M. Keller, G. Lindstrom, and S. Patil. A loosely-coupled applicative multiprocessing system. Proc. 1979 NCC, 613\u2013622 (June 1979).","journal-title":"Proc."},{"key":"10_CR10","unstructured":"R.M. Keller. FEL (Function Equation Language) Programmer's Guide. AMPS Technical Memorandum No. 7, University of Utah, Department of Computer Science, (1982)."},{"key":"10_CR11","unstructured":"R.M. Keller, F.C.H. Lin, and J. Tanaka. Rediflow multiprocessing. IEEE Compcon 1984, 410\u2013417 (February, 1984)."},{"issue":"7","key":"10_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/MC.1984.1659188","volume":"17","author":"R.M. Keller","year":"1984","unstructured":"R.M. Keller and F.C.H. Lin. Simulated performance of a reduction based multiprocessor. Computer 17(7):70\u201382, (July, 1984).","journal-title":"Computer"},{"issue":"4","key":"10_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/sres.3850020407","volume":"2","author":"R.M. Keller","year":"1985","unstructured":"R.M. Keller. Distributed computation by graph reduction. Systems Research 2(4):285\u2013295, (June, 1985).","journal-title":"Systems Research"},{"key":"10_CR14","unstructured":"R.M. Keller. Rediflow architecture prospectus. University of Utah, Department of Computer Science, Technical Report No. UUCS-85-105 (August, 1985)."},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0376-5075(79)90032-1","volume":"3","author":"P. Kermani","year":"1979","unstructured":"P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks 3(4):267\u2013286 (Sept., 1979).","journal-title":"Computer Networks"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"P.J. Landin. The mechanical evaluation of expressions. Computer J. (1964).","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"10_CR17","unstructured":"F.C.H. Lin. Load balancing and fault tolerance in applicative systems. PhD Thesis, University of Utah (August, 1985)."},{"key":"10_CR18","unstructured":"J.W. Slater. Redilink: An architecture for the Rediflow multiprocessor M.S. Thesis Proposal, University of Utah (June, 1986)."}],"container-title":["Lecture Notes in Computer Science","Graph Reduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18420-1_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:15:11Z","timestamp":1619558111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}