close this section of the libraryftp://ftp.think.com (13)
open this document and view contentsftp://ftp.think.com/think/trs/tmc-242.ps, 19920814
Communication Primitives for Unstructured Finite Element Simulations on Data Parallel Architectures Kapil K. Mathur and S. Lennart Johnsson1 Thinking Machines Corp. 245 First Street Cambridge, MA 02142 To be presented at the Symposium on High Performance Computing for Flight Vehicles, December 7-9,
open this document and view contentsftp://ftp.think.com/think/trs/tmc-216.ps, 19920814
Multiplication of Matrices of Arbitrary Shape on a Data Parallel Computer Kapil K. Mathur and S. Lennart Johnsson1 Thinking Machines Corp. 245 First Street Cambridge, MA 02142
open this document and view contentsftp://ftp.think.com/think/trs/tmc-256.300dpi.ps, 19930813
An Efficient Communication Strategy for Finite Element Methods on the Connection Machine CM-5 System Zden<=ek Johan, Kapil K. Mathur, S. Lennart Johnsson Thinking Machines Corporation 245 First Street, Cambridge, MA 02142, USA Thomas J.R. Hughes Division of Applied Mechanics, Stanford University Durand
open this document and view contentsftp://ftp.think.com/think/trs/tmc-256.600dpi.ps, 19930813
An Efficient Communication Strategy for Finite Element Methods on the Connection Machine CM-5 System Zden<=ek Johan, Kapil K. Mathur, S. Lennart Johnsson Thinking Machines Corporation 245 First Street, Cambridge, MA 02142, USA Thomas J.R. Hughes Division of Applied Mechanics, Stanford University Durand
open this document and view contentsftp://ftp.think.com/think/trs/tmc-239.ps, 19930816
Operator Splitting Methods for Monotone Linear Complementarity Problems Jonathan Ecksteiny Michael C. Ferrisz August 16, 1993
open this document and view contentsftp://ftp.think.com/think/trs/tmc-234-fig2a.ps, 19930816
a) RS Message Passing Memory to Memory Visitors Own Verlet Table xyz Fig 2 (a)
open this document and view contentsftp://ftp.think.com/think/trs/tmc-37.ps, 19930816
On the use of randomized address maps in unstructured three dimensional finite element simulations Kapil K. Mathur Thinking Machines Corporation Cambridge, MA 02142 Thinking Machines Corporation Technical Report CS90-4
open this document and view contentsftp://ftp.think.com/think/trs/tmc-222.ps, 19930816
1 A Comparison of Sorting Algorithms for the Connection Machine CM-2 Guy E. Blelloch Carnegie Mellon University Pittsburgh, PA 15213 C. Greg Plaxton University of Texas Austin, TX 78712 Charles E. Leiserson MIT Cambridge, MA 02139 Stephen J. Smith Thinking Machines Corp. Cambridge, MA 02142 Bruce M.
open this document and view contentsftp://ftp.think.com/think/trs/tmc-234-fig1.ps, 19930816
Proper cell size : Extended size : RS R d+= L L 2RS Fig 1
open this document and view contentsftp://ftp.think.com/think/trs/tmc-234.ps, 19930816
A Parallel Scalable Approach to Short-Range Molecular Dynamics on the CM-5 Roscoe Giles Pablo Tamayo Department of Electrical, Computer, Thinking Machines Corp. and Systems Engineering Cambridge, MA 02142. and Center for Computational Science Boston University, Boston, MA 02215.
open this document and view contentsftp://ftp.think.com/think/trs/tmc-29.ps, 19930819
Protein Sequence Comparison on the Connection Machine CM-2 A Selection of Results Robert Jones Thinking Machines Corporation Connection Machine is a registered trademark of Thinking Machines Corporation Introduction This report describes a number of novel protein sequence similarities that have been
open this document and view contentsftp://ftp.think.com/think/trs/tmc-260.ps, 19941004
Analytical resolvent matrix elements and approximation of pseudospectra Jean-Philippe Brunet 1 (June 1994)
open this document and view contentsftp://ftp.think.com/think/trs/tmc-261.ps, 19950322
High Performance Fortran: history, overview and current developments Harvey Richardson (hjr@think.com) Thinking Machines Corporation 245 First Street, Cambridge, MA 02142-1264, USA. Version: 1.1 March 20, 1995 Contents 1 Introduction 3 2 An Historical View 3 2.1 Data Parallel Developments : : : : : : :