{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:23:09Z","timestamp":1648635789534},"reference-count":30,"publisher":"Elsevier","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1016\/s0065-2458(08)60461-1","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T00:56:15Z","timestamp":1295398575000},"page":"1-33","source":"Crossref","is-referenced-by-count":3,"title":["Supercomputers and VLSI: The Effect of Large-Scale Integration on Computer Architecture"],"prefix":"10.1016","author":[{"given":"Lawrence","family":"Snyder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0065-2458(08)60461-1_bib1","doi-asserted-by":"crossref","unstructured":"J.W. Backus Can programming be liberated from the von Neumann style? A functional style and its algebra of programs Commun. ACM 21 8 1978 613 641","DOI":"10.1145\/359576.359579"},{"issue":"9","key":"10.1016\/S0065-2458(08)60461-1_bib2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TC.1980.1675684","article-title":"Design of a massively parallel processor","volume":"C-29","author":"Batcher","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0065-2458(08)60461-1_bib3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/scientificamerican0783-86","article-title":"Microelectronic packaging","volume":"249","author":"Blodgett","year":"1983","journal-title":"Sci. Am."},{"issue":"4","key":"10.1016\/S0065-2458(08)60461-1_bib4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/PROC.1972.8647","article-title":"The Illiac IV system","volume":"60","author":"Bouknight","year":"1972","journal-title":"Proc. IEEE"},{"issue":"1","key":"10.1016\/S0065-2458(08)60461-1_bib5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0020-0190(80)90034-4","article-title":"On the area of binary tree layouts","volume":"11","author":"Brent","year":"1980","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/S0065-2458(08)60461-1_bib6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/356819.356824","article-title":"From electron mobility to logical structure: A view of integrated circuits","volume":"12","author":"Clark","year":"1980","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0065-2458(08)60461-1_bib7","unstructured":"DeRuyck, D. M., Snyder, L., and Unruh, J. D. (1982). Processor displacement: An areatime trade-off method for VLSI. In \u201cProceedings of the MIT Conference on Advanced Research in VLSI\u201d (P. Penfield, ed.), pp. 182\u2013187. Artech House, Dedham, Maine."},{"issue":"4","key":"10.1016\/S0065-2458(08)60461-1_bib8","first-page":"14","article-title":"A RISCy approach to VLSI","volume":"2","author":"Fitzpatrick","year":"1981","journal-title":"VLSI Des."},{"issue":"4","key":"10.1016\/S0065-2458(08)60461-1_bib9","first-page":"27","article-title":"Running RISCs","volume":"3","author":"Foderaro","year":"1982","journal-title":"VLSI Des."},{"issue":"2","key":"10.1016\/S0065-2458(08)60461-1_bib10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU Ultra computer-designing an MIMD shared memory parallel computer","volume":"C-32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60461-1_bib11","unstructured":"Hedlund, K. S., and Snyder, L. (1982). Wafer scale integration of configurable, highly parallel processors. Proc. Int. Conf. Parallel Process., IEEE pp. 262\u2013264."},{"key":"10.1016\/S0065-2458(08)60461-1_bib12","unstructured":"Kleitman, D., Leighton, F. T., Lepley, M., and Miller, G. L. (1981). New layouts for the shuffle-exchange graph. Proc. 13th Annu. Symp. Theory Comput., Assoc. Comput. Mach. pp. 278\u2013292."},{"issue":"1","key":"10.1016\/S0065-2458(08)60461-1_bib13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures?","volume":"15","author":"Kung","year":"1982","journal-title":"IEEE Comput."},{"issue":"5","key":"10.1016\/S0065-2458(08)60461-1_bib14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MC.1983.1654378","article-title":"Supercomputers = colossal computations + enormous expectations + renowned risk","volume":"16","author":"Lincoln","year":"1983","journal-title":"IEEE Comput."},{"key":"10.1016\/S0065-2458(08)60461-1_bib15","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/S0065-2458(08)60461-1_bib16","unstructured":"Moore, G. E. (1979). Are we really ready for VLSI? Proc. Caltech Conf. Very Large Scale Integration 1979 pp. 3\u201314."},{"issue":"4","key":"10.1016\/S0065-2458(08)60461-1_bib17","first-page":"44","article-title":"Practical considerations in VLSI packaging","volume":"3","author":"Parris","year":"1982","journal-title":"VLSI Des."},{"key":"10.1016\/S0065-2458(08)60461-1_bib18","doi-asserted-by":"crossref","unstructured":"Paterson, M. S., Ruzzo, W. L., and Snyder, L. (1981). Bounds on minimax edge length for complete binary trees. Proc. 13th Annu. Symp. Theory Comput., Assoc. Comput. Mach. pp. 293\u2013299.","DOI":"10.1145\/800076.802481"},{"key":"10.1016\/S0065-2458(08)60461-1_bib19","unstructured":"Patterson, D. A., and S\u00e9quin, C. H. (1981). RISC I: A reduced instruction set VLSI computer. Proc. Int. Symp. Comput. Archit., 8th 1981"},{"key":"10.1016\/S0065-2458(08)60461-1_bib20","series-title":"Algorithm Design and VLSI Architecture","author":"Preparata","year":"1982"},{"key":"10.1016\/S0065-2458(08)60461-1_bib21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744565","article-title":"Optimal three dimensional VLSI layouts","volume":"16","author":"Preparata","year":"1983","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/S0065-2458(08)60461-1_bib22","doi-asserted-by":"crossref","unstructured":"Raffel, J. E., Naiman, M. L., Burke, R. L., Chapman, G. H., and Gottschalk, P. G. (1980). Laser programmed vias for restructurable VLSI. Proc. Int. Electron Devices Meet., IEEE pp. 132\u2013135.","DOI":"10.1109\/IEDM.1980.189772"},{"issue":"3","key":"10.1016\/S0065-2458(08)60461-1_bib23","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2402.322384","article-title":"Three-dimensional VLSI I: A case study","volume":"30","author":"Rosenberg","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"10.1016\/S0065-2458(08)60461-1_bib24","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Program. Lang."},{"key":"10.1016\/S0065-2458(08)60461-1_bib25","unstructured":"Siskind, J. M., Southard, J. R., and Couch, K. W. (1982). Generating custom high performance VLSI designs from succinct algorithmic descriptions. In \u201cProceedings of the MIT Conference on Advanced Research in VLSI\u201d (P. Penfield, ed.), pp. 28\u201340. Artech House, Dedham, Maine."},{"issue":"1","key":"10.1016\/S0065-2458(08)60461-1_bib26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.1982.1653826","article-title":"Introduction to the configurable highly parallel computer","volume":"15","author":"Snyder","year":"1982","journal-title":"IEEE Comput."},{"issue":"1","key":"10.1016\/S0065-2458(08)60461-1_bib27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-9260(83)90003-2","article-title":"VLSI physics","volume":"1","author":"Swensson","year":"1983","journal-title":"Integration"},{"key":"10.1016\/S0065-2458(08)60461-1_bib28","series-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"issue":"4","key":"10.1016\/S0065-2458(08)60461-1_bib29","first-page":"22","article-title":"Software for gate-array design: Who is really aiding whom?","volume":"2","author":"Werner","year":"1981","journal-title":"VLSI Des."},{"key":"10.1016\/S0065-2458(08)60461-1_bib30","doi-asserted-by":"crossref","unstructured":"Wise, D. S. (1981). Compact layout of Banyan\/FFT networks. In \u201cProceedings of the Carnegie-Mellon Conference on VLSI Systems and Computations\u201d (H. T. Kung, R. Sproull, and G. Steele, eds.), pp. 186\u2013195. Computer Science Press, Washington, D. C.","DOI":"10.1007\/978-3-642-68402-9_21"}],"container-title":["Advances in Computers","Advances in Computers Volume 23"],"original-title":[],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T19:43:57Z","timestamp":1559936637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0065245808604611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1016\/s0065-2458(08)60461-1","relation":{},"ISSN":["0065-2458"],"issn-type":[{"value":"0065-2458","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}