Eugene Miya <eugene%ames-nas.arpa@CSNET-RELAY> (03/25/86)
As promised several months ago, here is a surveyed list of ten required for any student in parallel processing. There are some fairly obvious biases: hardware over software, numeric over symbolic, and so forth. I think this is indicative of the work done so far. Democracy may not be the best to poll this work. I polled many people for their opinions including Satya himself, Jack Dennis, and many others over the past two years. But first a word from our sponsors. Probably the nicest bibliography you can find on this subject in print: %A M. Satyanarayanan %T Multiprocessing: an annotated bibliography %J Computer %V 13 %N 5 %D May 1980 %P 101-116 %X Excellent reference source, but dated. Text reproduced with the permission of Prentice-Hall \(co 1980. $Revision: 1.2 $ $Date: 84/07/05 16:58:56 $ A plug for my work which is machine readable: %A E. N. Miya %T Multiprocessor/Distributed Processing Bibliography %J Computer Architecture News %I ACM SIGARCH %V 13 %N 1 %D March 1985 %P 27-29 %K Annotated bibliography, computer system architecture, multicomputers, multiprocessor software, networks, operating systems, parallel processing, parallel algorithms, programming languages, supercomputers, vector processing, cellular automata, fault-tolerant computers %X Notice of this work. Itself. Quality: no comment. $Revision$ $Date$ THE suggested ten (actually 11) required readings are (for 1986): %A G. J. Lipovski %A A. Tripathi %T A reconfigurable varistructure array processor %J Proc. 1977 Int. Conf. on Parallel Processing %D August 1977 %P 165-174 %K Required, U Texas, TRAC %A W. A. Wulf %A C. G. Bell %T C.mmp \(em A multi-mini processor %J Proc. Fall Joint Computer Conference %V 41, part II %I AFIPS Press %C Montvale, New Jersey %D December 1972 %P 765-777 %K multiprocessor architecture and operating systems Required, parallel processing, %A George H. Barnes %A Richard M. Brown %A Maso Kato %A David J. Kuck %A Daniel L. Slotnick %A Richard A. Stokes %T The ILLIAC IV Computer %J IEEE Transactions on Computers %V C-17 %N 8 %D August 1968 %P 746-757 %K Recommended, array, computer structures, look-ahead, machine language, parallel processing, speed, thin-film memory, multiprocessors, %X This was the original paper on the ILLIAC IV when it was proposed as a 256 processing element machine, a follow on to the SOLOMON. It was a very ambitious design. %A William A. Wulf %A Roy Levin %A Samuel P. Harbison %T HYDRA/C.mmp: An Experimental Computer System %I McGraw-Hill %D 1981 %K Required, CMU, C.mmp, HYDRA OS, multiprocessor architecture and operating systems %X * Describes the architecture of C.mmp, and details the goals, design, and performance of HYDRA, its capability based OS. %A K. E. Batcher %T STARAN Parallel Processor System Hardware %J Proceedings AFIPS National Computer Conference %D 1974 %P 405-410 %K Required %X This paper is reproduced in Kuhn and Padua's (1981, IEEE) survey "Tutorial on Parallel Processing." %A Richard J. Swan %A S. H. Fuller %A Daniel P. Siewiorek %T Cm* \(em A Modular, Multi-Microprocessor %J Proceedings AFIPS National Computer Conference %I AFIPS Press %V 46 %D 1977 %P 637-644 %K CMU, required %X This paper is reproduced in Kuhn and Padua's (1981, IEEE) survey "Tutorial on Parallel Processing." %A W. J. Bouknight %A S. A. Denenberg %A D. E. McIntyre %A J. M. Randall %A A. H. Sameh %A D. L. Slotnick %T The ILLIAC IV System %J Proceedings of the IEEE %V 60 %N 4 %D April 1972 %P 369-388 %K Recommended, multiprocessors, parallel processing, %A Utrpal Banerjee %A Shyh-Ching Chen %A David J. Kuck %A Ross A. Towle %T Time and Parallel Processor Bounds for FORTRAN-like Loops %J IEEE Transactions on Computers %V C-28 %N 9 %P 660-670 %D September 1979 %K Recommended, Analysis of programs, data dependence, Fortran-like loops, parallel computation, processor bounds, program speedup, recurrence relations, time bounds, Parallel processing %A R. M. Russell %T The Cray-1 Computer System %J Comm. ACM %V 21 %P 63-72 %D 1978 %K Recommended, %X The original paper describing the Cray-1. This paper is reproduced in Kuhn and Padua's (1981, IEEE) survey "Tutorial on Parallel Processing." %A Robert H. Kuhn %A David A. Padua, eds. %T Tutorial on Parallel Processing %I IEEE %D August 1981 %K Required %X This is a collection of noted papers on the subject, collected for the tutorial given at the 10th conference (1981) on Parallel Processing. It eases the search problem for many of the obscure papers. Some of these papers might not be considered academic, others are applications oriented. Data flow is given short coverage. Still, a quick source for someone getting into the field. Where ever possible, paper in this bibliography are noted as being in this text. %A Philip C. Treleaven %A David R. Brownbridge %A Richard P. Hopkins %T Data-Driven and Demand-Driven Computer Architecture %J Computing Surveys %V 14 %N 1 %D March 1982 %P 93-143 %K Required, CR Categories and Subject Descriptors: C.0 [Computer System Organization]: General - hardware/software interfaces; system archiectures; C.1.2 [Processor Architecture]: Multiple Data Stream Architectures (Multiprocessors); C.1.3 [Processor Architecture]: Other Architecture Styles - data flow architectures; high level language architectures; D.3.2 [Programming Languages]: Language Classifications - data-flow languages; macro and assembly languages; very high-level languages General Terms: Design Additional Key Words and Phrases: Demand = driven architecture, data = driven architecture %X * The aim of this paper is to identify the concepts and relationships that exist both within and between the two areas of research of data-driven and demand-driven architectures. By way of final comment: the work in parallel symbolic computing is so sparse that I am reminded of an incident in the 1984 Natl. ACM meeting. At this meeting Feigenbaum, McCordunk (sp?), the Director of LCS at MIT and others said that parallel computing is the wave of the future. Then Gordon Bell got up and said, "Where were all you guys in the 1970s? We built three and it was hard. You all underestimate the work." I have recorded quite a number of symbolic computing reports, but it appears none have made an impression in the field. Sorry for the delay and the verbosity. --eugene miya NASA Ames Research Center eugene@ames-nas.ARPA UUCP: ames!eugene