Browse

ftp://ftp.cs.caltech.edu (51)

	ftp://ftp.cs.caltech.edu/tr/cs-tr-88-01.ps.Z, 19930211 HCETLA 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-05.ps.Z, 19930224 HCETLA 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-04.ps.Z, 19930224 HCETLA 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-06.ps.Z, 19930224 HCETLA 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-02.ps.Z, 19930225 JAN 166b -34 c.golink:= golink; c.gilink:= gilink; c.dolink:= dolink; c.dilink:= dilink; fork guard_connection(c) : eternal end; {$X8} var north, south, east, west: connection; procedure init_connections; begin init_connection(north, dxdy(0, +1), 0, 1, 2, 3); init_connection(south, dxdy(0, -1), 1, 0, 3,
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-04.ps.Z, 19930225 JAN 167b - 5 program and we have therefore not tried to explain the general case. Finally, we observe that our second solution is more efficient than the first solution only if determining the first element of a fringe is essentially less work then constructing the entire fringe. An example where this
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-07.ps.Z, 19930225 JAN 171a - 3 space for constructing the tree from its traversals. This is also true of the iterative algorithms (cf. ) in which the stack is explicit. Acknowledgement Dong Lin is gratefully acknowledged for seeing" the recursive algorithm instantaneously in class, forcing me to produce a
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-13.ps.Z, 19930312 Compositional C++: Compositional Parallel Programming K. Mani Chandy Carl Kesselman California Institute of Technology Keywords: Parallel processing, Object-oriented programming, C++, Compositional programming.
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-02.ps.Z, 19930312 The Compositional C++ Language Definition Peter Carlin Mani Chandy Carl Kesselman March 12, 1993 Revision 0.95 3/12/93, Comments welcome.
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-08.ps.Z, 19930416 Affinity: A Concurrent Programming System for Multicomputers Thesis by Craig S. Steele In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1992 (Submitted May 27, 1992) Caltech -CS -TR-92 - 8 ii Copyright c 1992 by
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-12.ps.Z, 19930430 System Tools for the J-Machine Daniel Maskit, Yair Zadik and Stephen Taylor Scalable Concurrent Programming Laboratory California Institute of Technology April 30, 1993 1 Introduction This document contains a description of the system tools we have developed to support programming the J-Machine. The
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-11.ps.Z, 19930430 Experiences in Programming the J-Machine Daniel Maskit and Stephen Taylor Scalable Concurrent Programming Laboratory California Institute of Technology April 30, 1993 1 Introduction This document summarizes experiences gained in programming the J-Machine. It is intended to provide feedback on the
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-05.ps.Z, 19930504 A Collection of Declarative Ada Example Programs John Thornley Computer Science Department California Institute of Technology Pasadena, California 91125, USA john-t@cs.caltech.edu April 24, 1993 Contents 1 Introduction 1 2 Lists, Trees, and Recursion 2 2.1 Sorting Problem Specification : : : : : : : : :
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-04.ps.Z, 19930504 The Programming Language Declarative Ada Reference Manual John Thornley Computer Science Department California Institute of Technology Pasadena, California 91125, USA john-t@cs.caltech.edu April 24, 1993 Contents 1 Introduction 1 1.1 Language Outline : : : : : : : : : : : : : : : : : : : : : : : : : 1
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-20.ps.Z, 19930609 Distributed Diners: From UNITY Specification to CC++ Implementation Ulla Binau Department of Computer Science California Institute of Technology ulla@cs.caltech.edu Caltech-CS-TR-93-20 June 3, 1993
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-08.ps.Z, 19930611 Accurate and Precise Computation using Analog VLSI, with Applications to Computer Graphics and Neural Networks Thesis by David B. Kirk In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1993 (Defended March 16, 1993)
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-24.ps.Z, 19930624 Properties of Concurrent Programs K. Mani Chandy California Institute of Technology 256-80, Pasadena, California 91125 mani@vlsi.caltech.edu June 15, 1993
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-08.ps.Z, 19930712 Asynchronous Datapaths and the Design of an Asynchronous Adder Alain J. Martin Department of Computer Science California Institute of Technology Pasadena CA 91125, USA June 1991/October 1991
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-10.ps.Z, 19930720 Runtime Systems for Fine-Grain Multicomputers Thesis by Nanette Jackson Boden In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California USA 1993 (Submitted January 20, 1993) Caltech-CS-TR-92-10 ii c 1993 Nanette Jackson
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-21.ps.Z, 19930723 A Verified Integration of Imperative Parallel Programming Paradigms in an Object-Oriented Language Thesis by Paul Sivilotti In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Pasadena, California 1993 (submitted 30 June 1993) Caltech
	ftp://ftp.cs.caltech.edu/tr/cs-tr-90-05.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology Caltech-CS-TR-90-05 15 March 1990 Reporting Period: 1 November 1989 { 15 March 1990 Principal Investigator: Charles L. Seitz Faculty Investigators: K. Mani Chandy Alain J. Martin
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-10.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology Caltech-CS-TR-91-10 1 November 1991 Reporting Period: 1 March 1991 \| 31 October 1991 Principal Investigator: Charles L. Seitz Faculty Investigators: Alain J. Martin Charles L.
	ftp://ftp.cs.caltech.edu/tr/cs-tr-90-14.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology Caltech-CS-TR-90-14 1 October 1990 Reporting Period: 16 March 1990 { 30 September 1990 Principal Investigator: Charles L. Seitz Faculty Investigators: K. Mani Chandy Alain J.
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-03.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology Caltech-CS-TR-91-03 1 March 1991 Reporting Period: 1 October 1990 \| 28 February 1991 Principal Investigator: Charles L. Seitz Faculty Investigators: Alain J. Martin Charles L.
	ftp://ftp.cs.caltech.edu/tr/5178:tr:85.ps.Z, 19930727 Submicron Systems Architecture Semiannual Technical Report Computer Science California Institute of Technology 5178:TR:85 March 1985 Reporting Period: 16 October 1984 to 15 March 1985 Principal Investigator: Charles L Seitz Faculty Investigators: James T Kajiya Alain J Martin Robert J McEliece Martin
	ftp://ftp.cs.caltech.edu/tr/cs-tr-92-17.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology Caltech-CS-TR-92-17 1 July 1992 Reporting Period: 1 November 1991 \| 30 June 1992 (8 months) Principal Investigator: Charles L. Seitz Faculty Investigators: Alain J. Martin Charles
	ftp://ftp.cs.caltech.edu/tr/5202:tr:85.ps.Z, 19930727 Submicron Systems Architecture Semiannual Technical Report Department of Computer Science California Institute of Technology 5202:TR:85 September 1985 Reporting Period: 16 March 1985 to 15 September 1985 Principal Investigator: Charles L Seitz Faculty Investigators: James T Kajiya Alain J Martin Robert
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-32.ps.Z, 19930830 BIBLIOGRAPHY 65 Alan V. Oppenheim and Ronald W. Schafer. Digital Signal Processing, pp. 29499, Prentice-Hall, 1975. Charles L. Seitz. The Cosmic Cube. CACM, 28(1): 223, January 1985. Charles L. Seitz. Multicomputers. Chapter five in Developments in Concurrency and Communication,
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-36.ps.Z, 19931029 A Multimedia Interactive Environment Using Program Archetypes: Divide-and-Conquer Paul Ainsworth Svetlana Kryukova Mail Stop 256-80 Department of Computer Science California Institute of Technology Pasadena, CA 91125 email: ainswrth@csvax.caltech.edu kryukova@cco.caltech.edu
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-38.ps.Z, 19931110 An Asynchronous Microprocessor in Gallium Arsenide Jos e A. Tierno Alain J. Martin Drazen Borkovic Tak Kwan Lee Department of Computer Science California Institute of Technology Pasadena, CA 91125 November 9, 1993
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-13.ps.Z, 19931110 Russ Miller. The status of parallel processing education: 1993. Technical Report available through anonymous ftp, Computer Science Department, State University of New York at Buffalo, August 1993. Bernard M.E. Moret and Henry D. Shapiro. Algorithms from P to NP - Volume I: Design and
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-37.ps.Z, 19931117 Caltech Computer Science Technical Reports CS-TR-88-14 $8.00 Syntax-directed Translation of Concurrent Programs into Self-timed Circuits Burns, Steven M; Martin, Alain J CS-TR-88-13 $4.00 Message-Passing Model for Highly Concurrent Computation Martin, Alain J CS-TR-88-11 $10.00 Study of Fine-Grain
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-26.ps.Z, 19940201 1 Tomorrow's Digital Hardware will be Asynchronous and Verified1 Alain J. Martin Department of Computer Science, California Institute of Technology, Pasadena CA 91125, USA
	ftp://ftp.cs.caltech.edu/tr/cs-tr-93-18.ps.Z, 19940402 BIBLIOGRAPHY 133 Thinking Machines Corporation. The Connection Machine CM-5 Technical Summary. Thinking Machines Corporation, January 1992. Clark D. Thompson. Area-Time Complexity for VLSI. in Caltech Conference on Very Large Scale Integration, edited by Charles L. Seitz, pp. 49508, 1979.
	ftp://ftp.cs.caltech.edu/tr/cs-tr-94-08.ps.Z, 19940615 Integrating Task and Data Parallelism with the Collective Communication Archetype K. Mani Chandy, Rajit Manohar, Berna L. Massingill, Daniel I. Meiron California Institute of Technology Pasadena, CA 91125
	ftp://ftp.cs.caltech.edu/tr/cs-tr-94-07.ps.Z, 19940616 Classification of Material Mixtures in Volume Data for Visualization and Modeling David H. Laidlaw, Kurt W. Fleischer, Alan H. Barr California Institute of Technology, Pasadena, CA 91125
	ftp://ftp.cs.caltech.edu/tr/cs-tr-94-10.ps.Z, 19940713 KRML 29 -0 Computing permutation encodings K. Rustan M. Leino0 27 May 1994 Computer Science, Mail code 256-80, California Institute of Technology, Pasadena, CA 91125, U.S.A. in out ppppppppppppppppppppppppppppppppppppppppppppppp rustan@cs.caltech.edu
	ftp://ftp.cs.caltech.edu/tr/cs-tr-94-15.ps.Z, 19940801 Mach-Based Channel Library 1 12 12 12 12 12 12 12312 12 12123 123 1 1 12 12 12 12 12 121111 1111 1 1 111112111 1112121212 121211212121 111 1 1 1 1 112 12 11 1111
	ftp://ftp.cs.caltech.edu/tr/cs-tr-94-14.ps.Z, 19940912 Distributed Linear Algebra on Networks of Workstations Thesis by Peter Carlin Advisor: K. Mani Chandy In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Computer Science Department Pasadena, California 91125 July 17, 1994 Caltech CS-TR-94-14
	ftp://ftp.cs.caltech.edu/tr/cs-tr-95-03.ps.Z, 19950221 Toward Reliable Modular Programs Thesis by K. Rustan M. Leino In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy 1891CALIFORNIAINSTITUTEOFTECHNOLOGY California Institute of Technology Pasadena, California 1995 (Submitted 5 January 1995) c 1995 K.R.M. Leino All rights
	ftp://ftp.cs.caltech.edu/tr/cs-tr-95-02.ps.Z, 19950525 An Energy-Complexity Model for VLSI Computations Thesis by Jos e Andr es Tierno In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1995 (Submitted January 11) ii c 1995 Jos e Andr es Tierno All Rights Reserved iii Mam
	ftp://ftp.cs.caltech.edu/tr/cs-tr-94-21.ps.Z, 19950525 Low-Energy Asynchronous Memory Design Jos e A. Tierno Alain J. Martin California Institute of Technology Pasadena, CA 91125
	ftp://ftp.cs.caltech.edu/tr/cs-tr-95-05.ps.Z, 19950721 Geometric Model Extraction from Magnetic Resonance Volume Data Thesis by David H. Laidlaw In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1995 (Defended May 23, 1995) ii Copyright c 1995 David H. Laidlaw All Rights
	ftp://ftp.cs.caltech.edu/tr/cs-tr-91-12.ps.Z, 19951117 Polygon Scan Conversion Derivations Caltech-CS-TR-91-12 Kurt Fleischer y October 27, 1995 This report is a supplement to Accurate Polygon Scan Conversion Using Half-Open Intervals . It is assumed that the reader is familiar with that Graphics Gems III article, and the code included
	ftp://ftp.cs.caltech.edu/tr/cs-tr-95-13.ps.Z, 19960213 A Practical Approach to Dynamic Load Balancing Jerrell Watts Scalable Concurrent Programming Laboratory California Institute of Technology Pasadena, California 91125 In Partial Fulfillment of the Requirements for the Degree of Master of Science October 4, 1995 ii iii Acknowledgments This work was
	ftp://ftp.cs.caltech.edu/tr/cs-tr-95-12.ps.Z, 19960228 Concurrent Simulations of Plasma Reactors for VLSI Manufacturing Marc A. Rieffel Scalable Concurrent Programming Laboratory Department of Computer Science California Institute of Technology October 23, 1995 In partial fulfillment of the requirements of the Master's Degree in Computer Science. 2
	ftp://ftp.cs.caltech.edu/tr/cs-tr-95-10.ps.Z, 19960229 Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms John Thornley Computer Science Department California Institute of Technology Pasadena, California 91125, U.S.A. john-t@cs.caltech.edu http://www.cs.caltech.edu/ john-t/ October 1, 1995
	ftp://ftp.cs.caltech.edu/tr/cs-tr-96-14.ps.Z, 19960523 An Algorithm for Distributed Location Management in Networks of Mobile Computers Svetlana Kryukovay, Berna Massingillz, and Beverly Sandersx
	ftp://ftp.cs.caltech.edu/tr/cs-tr-96-13.ps.Z, 19960606 The Message Driven File System: a Network Accessible File System for Fine-Grain Message Passing Multicomputers 1 Yair Zadik yair@scp.caltech.edu Scalable Concurrent Programming Laboratory California Institute of Technology In Partial Fulfillment of the Requirements for the Degree of Master of Science 1
	ftp://ftp.cs.caltech.edu/tr/cs-tr-96-11.ps.Z, 19960624 Reliable Synchronization Primitives for Java Threads Paolo A.G. Sivilotti, K. Mani Chandy California Institute of Technology Pasadena CA, 91125 fmani,paolog@cs.caltech.edu June 1, 1996
	ftp://ftp.cs.caltech.edu/tr/cs-tr-96-16.ps.Z, 19960701 Collision Models in the Hawk DSMC Implementation July 1, 1996 Sergey Gimelshein, Gennady Markelov, Institute for Theoretical and Applied Mechanics, Novosibirsk, Russia Marc Rieffel1, Scalable Concurrent Programming Laboratory, California Institute of Technology