Complete index of the Internet Parallel Computing Archive /parallel at unix.hensa.ac.uk run by Dave Beckett . This is /parallel/info/FullIndex.txt made at Wed Jul 28 00:01:08 BST 1999 /parallel/ Top of Internet Parallel Computing Archive /parallel/AFA-LARCHIVE (706 bytes) AFA-LARCHIVE /parallel/Changes (161 bytes) "Changes to the archive in the last month" /parallel/FullIndex.txt (2271194 bytes) "Full text index" /parallel/FullIndex.txt.gz (455842 bytes) FullIndex.txt.gz /parallel/README (3585 bytes) "READ ME FIRST - information for new users" /parallel/acronyms/ "Acronyms (pointers to actual entries)" /parallel/acronyms/comp-architecture-taxonomy (21858 bytes) "Computer Architecture Taxonimy FAQ" by Andy D Ben-Dyke Bulk Synchronous Parallel (processing) [Valiant] /parallel/acronyms/cnaps/ Co-Processing Node Architecture for Parallel Systems This directory provides a list of Adaptive Solutions, Inc. contributions to the CNAPS User Contributed Library. The CNAPS User Contributed Library contains code and other material useful to developers creating applications for CNAPS products. CNAPS is a registered trademark of Adaptive Solutions, Inc. Copyright (C) 1994 Adaptive Solutions, Inc. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice and this permission notice appear in supporting documentation, and that the name of Adaptive Solutions, Inc. not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. Adaptive Solutions, Inc. makes no representations about the suitability of this software for any purpose. It is provided ``as is'' without express or implied warranty. /parallel/acronyms/cnaps/getarg.tar.Z (5813 bytes) Header files named getargb07.h and getargb815.h, defining functions which make it possible for CNAPS-C code to to reference "arguments" even though the rules of CNAPS-C are that you have to declare the entry points in the general style entry void main (void) instead of including the "argc" and "argv" parameters which are typically available in ANSI standard and K&R C languages. These functions create assembly-level runtime constants named "CNARG0", "CNARG1", etc., and then make it possible to copy the argument values to an array created in the CNAPS-C code (the arguments should just be integer or character values, not string pointers). For details about which .h file to use and how to call the functions, refer to README.doc in the getarg directory. /parallel/acronyms/cnaps/if_xflag.tar.Z (2975 bytes) CPL modules that allow implementation of run time conditional branching on the basis of the xflag on _any_ processor being set. /parallel/acronyms/cnaps/mat16vec8.tar.Z (4901 bytes) an extension to quicklib, supplying a function asiMat16MulVec8 which multiplies a 16-bit matrix by an 8-bit vector, producing a standard 24-bit result vector which is stored like the 32-bit result vector generated by asiMat16MulVec16 (the leftmost 8 bits are just a sign bit extension of the 24-bit element). Although this code may eventually get inserted into matveclib.h and matveclib.sl, at present to access it you just need to #include in your CNAPS-C code, and this header file will issue a CPL command to INDLUDE mat16mulvec8.sl The function asiMat16MulVec8 is called just like asiMat16MulVec16( ... , mat_addr, vec_addr, res_addr) except that, obviously, vec_addr is a "poly char *" pointer instead of a "poly int *" pointer. At present, this is only one of two functions available in the relevant directories, although in the future more functions comparable to the matrix-vector multiplies in quicklib, may also be generated -- e.g., asiMat8MulVec16{,File}, and asiMat16MulVec8U to regard the 8-bit vector as an array of unsigned 8-bit integers, in contrast to asiMat16MulVec8 which treats the vector elements as signed 8-bit integers. /parallel/acronyms/cnaps/mat16vec8file.tar.Z (4156 bytes) a function similar to asiMat16MulVec8, but this one reads the currently open input file as the source of the vector used to multiply the matrix. The relevant #include file for this is called m16v8f.h, and the generated CPL code will contain a line INCLUDE m16v8f.sl The function call is basically identical to asiMat16MulVec16File except that the "file" contains 1-byte objects rather than 16-bit objects to represent the vector elements. /parallel/acronyms/cnaps/profile.tar.Z (5658 bytes) CPL code for profiling CPL code. /parallel/acronyms/cnaps/random.tar.Z (4745 bytes) CPL code for parallel pseudo-random number generator. /parallel/acronyms/cnaps/seek_input.tar.Z (2686 bytes) CPL code for a SEEK_INPUT command, which is functionally the same as the assembler's SEEK command except that it does not require a filename argument (it just defaults to run SEEK on the /parallel/acronyms/cnaps/som.tar.Z (74441 bytes) CPL code for self-organizing map. Communicating Sequential Processes [Hoare] Distributed Memory, Message Processing [Flynn] Distributed Memory, Shared Variables [Johnson] Global Memory, Message Passing [Johnson] Global Memory, Shared Variables [Johnson] Global Shared Memory Global Virtual Time Multiple Instructions Multiple Data [Flynn] Multiple Instructions Single Data [Flynn] Massively Parallel (Processing) Single Instruction Multiple Data [Flynn] Single Instruction Single Data [Flynn] Symmetrical Multi-Processing Virtual Shared Memory /parallel/algorithms/ "Parallel Algorithms" /parallel/algorithms/fft/ "Fast Fourier Transform" (FFT) "FFTW Library" by Steven G. Johnson and Matteo Frigo. A C library for performing FFTs in one or more dimensions. Included in FFTW are multi-dimensional parallel transforms using either MPI or shared-memory on machines that have it. "ARC Parallel FFT Home page" by Paul Bennett A site devoted to parallel Fast Fourier Transforms at the Albuquerque Resource Center, part of HPCERC, administered by UNM and Phillips Laboratory as part of the Maui Project. /parallel/algorithms/genetic/ "Genetic Algorithms" /parallel/algorithms/genetic/pgapack/ "PGAPack" A general-purpose, data-structure-neutral, parallel genetic algorithm library being developed at Argonne National Laboratory. PGAPack is a general-purpose, data-structure-neutral, parallel genetic algorithm library. It is intended to provide most capabilities desired in a genetic algorithm library, in an integrated, seamless, and portable manner. See also /parallel/algorithms/genetic/pgapack/.nams-info/ .nams-info /parallel/algorithms/genetic/pgapack/.nams-info/status (188 bytes) status /parallel/algorithms/genetic/pgapack/.nams-info/status.new-14628 (0 bytes) status.new-14628 /parallel/algorithms/genetic/pgapack/Announcement (1427 bytes) Announcement of PGAPack /parallel/algorithms/genetic/pgapack/README (9893 bytes) Top level README for PGAPack V1.0 /parallel/algorithms/genetic/pgapack/pgapack-1.0-tar.Z (557193 bytes) PGAPack 1.0 distribution including the source code, examples, user guide and manual pages. Written in ANSI C using the MPI message passing interface. It has been used with MPICH, a freely available implementation of MPI. /parallel/algorithms/genetic/pgapack/user_guide.ps (472641 bytes) user_guide.ps "SEL-HPC Article Archive about Other Parallel Models and Libraries at" "SEL-HPC Article Archive about Algorithmic Skeletons (non functional)" /parallel/algorithms/n-body/ "N-Body Methods" "N-Body Methods Resources" by Mario Antonioletti Resources for (astrophysical and other) N-body parallel methods, papers, software, books, WWW sites, etc. /parallel/algorithms/numerical/ "Parallel Numerical algorithms" /parallel/algorithms/numerical/strassen (1151 bytes) "A High Performance Parallel Strassen Implementation" by Brian Grayson; Ajay Shah and Robert van de Geijn . Department of Computer Sciences, University of Texas, USA. See also ABSTRACT: In this paper, we give what we believe to be the first high performance parallel implementation of Strassen's algorithm for matrix multiplication. We show how under restricted conditions, this algorithm can be implemented plug compatible with standard parallel matrix multiplication algorithms. Results obtained on a large Intel Paragon system show a 10-20% reduction in execution time compared to what we believe to be the fastest standard parallel matrix multiplication implementation available at this time. /parallel/algorithms/numerical/summa (1132 bytes) "SUMMA: Scalable Universal Matrix Multiplication Algorithm" by Robert van de Geijn, and Jerrell Watts . Department of Computer Sciences, University of Texas, USA. TR-95-13, Department of Computer Sciences, University of Texas, USA, April 1995. Available from as link TR-95-13. Also at as a LAPACK working note. /parallel/algorithms/others/ "Other Parallel algorithms" /parallel/algorithms/others/dynamic-data-redist (2997 bytes) "Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection" by David Bader and Joseph Ja'Ja'. Institute for Advanced Computer Studies (UMIACS), and the Department of Electrical Engineering, University of Maryland, College Park, USA. Technical Report Number: CS-TR-3494 and UMIACS-TR-95-74, July 1995. Available from and ABSTRACT: A common statistical problem is that of finding the median element in a set of data. This paper presents a fast and portable parallel algorithm for finding the median given a set of elements distributed across a parallel machine. In fact, our algorithm solves the general selection problem that requires the determination of the element of rank $i$, for an arbitrarily given integer $i$. Practical algorithms needed by our selection algorithm for the dynamic redistribution of data are also discussed. Our general framework is a single-address space, distributed memory programming model that is enhanced by a set of communication primitives. We use efficient techniques for distributing, coalescing, and load balancing data as well as efficient combinations of task and data parallelism. The algorithms have been coded in Split-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results illustrate the scalability and efficiency of our algorithms across different platforms and improve upon all the related experimental results known to the authors. In particular, our portable selection code beats the reported machine-specific NAS IS benchmarks on the CM-5, SP-2, and T3D. More efficient implementations of the communication primitives will likely result in even faster execution times. "Random numbers in parallel" /parallel/applications/ "Applications using HPC." /parallel/applications/genetic-algorithms/ "Parallel Genetic Algorithms" /parallel/applications/genetic-algorithms/stanford-report (4933 bytes) "Parallel Genetic Programming on a Network of Transputers" by John R. Koza, Stanford University and David Andre , Stanford University. See ABSTRACT: This report describes the parallel implementation of genetic programming in the C programming language using a PC 486 type computer (running Windows) acting as a host and a network of transputers acting as processing nodes. Using this approach, researchers of genetic algorithms and genetic programming can acquire computing power that is intermediate between the power of currently available workstations and that of supercomputers at a cost that is intermediate between the two. A comparison is made of the computational effort required to solve the problem of symbolic regression of the Boolean even-5-parity function with different migration rates. Genetic programming required the least computational effort with an 8% migration rate. Moreover, this computational effort was less than that required for solving the problem with a serial computer and a panmictic population of the same size. That is, apart from the nearly linear speed-up in executing a fixed amount of code inherent in the parallel implementation of genetic programming, parallelization delivered more than linear speed-up in solving the problem using genetic programming. /parallel/applications/image-processing/ "Image Processing" /parallel/applications/image-processing/image-histogramming (2446 bytes) "Parallel Algorithms For Image Histogramming and Connected Components With an Experimental Study" by David Bader Details of technical report available from and ABSTRACT: This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and connected components. Our general framework is a single-address space, distributed memory programming model. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. Our connected components algorithm uses a novel approach for parallel merging which performs drastically limited updating during iterative steps, and concludes with a total consistency update at the final step. The algorithms have been coded in Split-C and run on a variety of platforms. Our experimental results are consistent with the theoretical analysis and provide the best known execution times for these two primitives, even when compared with machine specific implementations. More efficient implementations of Split-C will likely result in even faster execution times. /parallel/applications/neural-networks/ "Neural Networks" See also the articles on the SEL-HPC Article Archive about Neural Networks at "Neural Network API proposal" by Frantz Epineuse An Application Programming Interface (API) to built neural networks (NN) is proposed. The API tries to be enough general and enough powerful to allow a programmer to built any type of NN. This takes into account parameters like the topological organisation of the nodes composing the network (NN architecture), the connections between those nodes (connectivity), how those nodes process data (transition functions), and the learning methods of the networks. /parallel/applications/numerical/ "Numerical Methods" See also the Numerical Recipes Home Page at /parallel/applications/numerical/aztec (3300 bytes) "Aztec: A parallel iterative package for the solving linear systems arising in Newton-Krylov Methods" by Ray S. Tuminaro ; Tel: +1 505 845-7298; John N. Shadid ; Tel: +1 505 845-7876 and Scott A. Hutchinson , ; Tel: +1 505 845-7996; FAX: +1 505 845-7442. Sandia National Laboratories, Department 9221, Parallel Computational Sciences, MS 1111 P.O. Box 5800, Albuquerque, NM 87185-1111, USA. Announcement of iterative library that greatly simplifies the parallelization process when solving a sparse linear system of equations Ax = b where A is a user supplied nxn sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. Available publicaly through a research license from the authors. See also for more details including Postscript papers. /parallel/applications/numerical/peigs/ PeIGS parallel eigensolver from Pacific Northwest Laboratories (PNL), USA. PeIGS is a public domain collection of parallel routines for solving the general and standard symmetric eigenproblem. It is being developed at the Department of Energy's Pacific Northwest Laboratory operated by Battelle Memorial Institute. The authors are David Elwood, George Fann, and Richard Littlefield. PeIGS runs on Intel Paragon, Intel DELTA, Intel IPSC/860 using native NX calls. PeIGS also runs on IBM SP-1. IBM SP-2, Cray T3D, SGI-PowerChallenge, and clusters of workstations using TCGMSG. TCGMSG is available as part of the Global Array distribution available at . A Global Array-PeIGS interface is available in the Global Array distribution. /parallel/applications/numerical/peigs/.nams-info/ .nams-info /parallel/applications/numerical/peigs/.nams-info/status (107 bytes) status /parallel/applications/numerical/peigs/.nams-info/status.new-14702 (0 bytes) status.new-14702 /parallel/applications/numerical/peigs/peigs2.1.tar.Z (1921891 bytes) peigs2.1.tar.Z /parallel/applications/numerical/pipsolver (2166 bytes) "Anatomy of a Parallel Out-of-Core Dense Linear Solver" by Robert van de Geijn and Kenneth Klimkowski . Texas Institute for Computational and Applied Mathematics and Department of Computer Sciences, University of Texas, Austin, TX 78712, USA. Paper at ABSTRACT: In this paper, we describe the design and implementation of the Platform Independent Parallel Solver (PIPSolver) package for the out-of-core (OOC) solution of complex dense linear systems. Our approach is unique in that it allows essentially all of RAM to be filled with the current portion of the matrix (slab) to be updated and factored, thereby greatly improving the computation to I/O ratio over previous approaches. This work could be viewed in part as an exercise in maximal code reuse: By formulating the OOC LU factorization just right, we managed to reuse essentially all of a very robust and efficient incore solver, leading directly to a very robust and efficient OOC solver. Experiences and performance are reported for the Cray T3D system. /parallel/applications/vision/ "Vision Work" "SEL-HPC Article Archive about Vision and Image Processing" /parallel/applications/vision/par-interpret-tree (3948 bytes) "Investigating Parallel Interpretation-Tree Model Matching Algorithms with ProSet-Linda" by Wilhelm Hasselbring and R.B. Fisher. Available from and ABSTRACT: This paper discusses the development of algorithms for parallel interpretation-tree model matching for 3-D computer vision applications such as object recognition. The algorithms are developed with a prototyping approach using ProSet-Linda. ProSet is a procedural prototyping language based on the theory of finite sets. The coordination language Linda provides a distributed shared memory model, called tuple space, together with some atomic operations on this shared data space. The combination of both languages, viz. ProSet-Linda, is designed for prototyping parallel algorithms. The classical control algorithm for symbolic data/model matching in computer vision is the Interpretation Tree search algorithm. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines parallel variations of this algorithm. Parallel execution can increase the execution performance of model matching, but also make feasible entirely new ways of solving matching problems. In the present paper, we emphasize the development of parallel algorithms with a prototyping approach, not the presentation of performance figures displaying increased performance through parallel execution. The expected improvements attained by the parallel algorithmic variations for interpretation-tree search are analyzed. The implementation of ProSet-Linda is briefly discussed. /parallel/applications/vision/purdue-papers (1910 bytes) "Image Compression Papers at Purdue" by Edward J Delp , Computer Vision and Image Processing Laboratory, Purdue University See for details on the group and for the papers /parallel/applications/visualisation/ "Data Visualisation" See also the articles on the SEL-HPC Article Archive about Scientific Visualisation at "Parallel Volume Visualization toolkit" (PVV) by Marcus Lucchese , ; Tel: 55 11 818-5676 /parallel/architecture/ "Architectures - communications, memory and processing." See also the articles on the SEL-HPC Article Archive about HPC Architecture at /parallel/architecture/communications/ "Communications" /parallel/architecture/communications/collective/ "Collective Communications" /parallel/architecture/communications/collective/fast-collective-comms (2900 bytes) "Fast Collective Communication Libraries, Please" by Prasenjit Mitra; David Payne; Lance Shuler; Robert van de Geijn , ; Tel: +1 (512) 471-9720; FAX: +1 (512) 471-8885 and Jerrell Watts. To appear in the Proceedings of the Intel Supercomputing Users' Group Meeting 1995. Also: Department of Computer Sciences, The Unversity of Texas, TR-95-??, June 1995. See also ABSTRACT: It has been recognized that many parallel numerical algorithms can be effectively implemented by formulating the required communication as collective communications. Nonetheless, the efficiency of such communications has been suboptimal in many communication library implementations. In this paper, we give a brief overview of techniques that can be used to implement a high performance collective communication library, the iCC library, developed for the Intel family of parallel supercomputers as part of the InterCom project at the University of Texas at Austin. We compare the achieved performance on the Intel Paragon to those of three widely available libraries: Intel's NX collective communication library, the MPICH Message Passing Interface (MPI) implementation developed at Argonne and Mississippi State University and a Basic Linear Algebra Communication Subprograms (BLACS) implementation, developed at the University of Tennessee. "Distributed Inter-Process Communication" (DIPC) DIPC enables the programmers to write distributed programs by modifying UNIX System V IPC mechanisms (messages, semaphores, and shared memory segments) to function on a network. It is currently available for x86 Linux sysems. /parallel/architecture/communications/io/ "Parallel I/O" "The Scalable I/O Initiative" "PASSION: Parallel And Scalable Software for I/O" by Rajesh Bordawekar , A compiler and runtime support system. PASSION software support is targeted for I/O intensive out-of-core loosely synchronous problems. The PASSION Runtime Library provides routines to efficiently perform the I/O required in out-of-core programs. The goal of the PASSION compiler is to translate out-of-core programs written in a data-parallel language like High Performance Fortran (HPF) to node programs with calls to the PASSION Runtime Library for I/O. Other components of the PASSION project include a Portable Parallel File System (VIP-FS), integrating task and data parallelizm using parallel I/O and file servers for multimedia applications. /parallel/architecture/communications/io/mailinglist-pario (2017 bytes) Details of mailing list for parallel I/O research. This new list is intended for individuals interested in research about parallel-I/O systems and algorithms, including file systems, architectures, out-of-core algorithms, compiler techniques, language extensions, run-time support, APIs, application requirements and workload characterization, disk arrays, tape striping, and perhaps graphics and networking. Creator: David Kotz /parallel/architecture/communications/io/pario/ "Dartmouth Parallel IO Archive" by David Kotz Mirror of archive. Has emphasis on multiprocessor file systems. See also for additional information. /parallel/architecture/communications/io/pario/.nams-info/ .nams-info /parallel/architecture/communications/io/pario/.nams-info/status (751 bytes) status /parallel/architecture/communications/io/pario/.nams-info/status.new-14805 (0 bytes) status.new-14805 /parallel/architecture/communications/io/pario/DAGS-conference/ Information about the DAGS'93 conference on parallel IO /parallel/architecture/communications/io/pario/DAGS-conference/.nams-info/ .nams-info /parallel/architecture/communications/io/pario/DAGS-conference/.nams-info/status (190 bytes) status /parallel/architecture/communications/io/pario/DAGS-conference/.nams-info/status.new-14805 (0 bytes) status.new-14805 /parallel/architecture/communications/io/pario/DAGS-conference/DAGS93.bib (16005 bytes) Bibtex-format database of papers in the 1993 DAGS conference /parallel/architecture/communications/io/pario/DAGS-conference/OrderForm (1687 bytes) Order Form /parallel/architecture/communications/io/pario/DAGS-conference/cormen:integrate.ps.Z (58271 bytes) "Integrating Theory and Practice in Parallel File Systems" by Thomas H. Cormen and David Kotz from DAGS93. ABSTRACT: Several algorithms for parallel disk systems have appeared in the literature recently, and they are asymptotically optimal in terms of the number of disk accesses. Scalable systems with parallel disks must be able to run these algorithms. We present for the first time a list of capabilities that must be provided by the system to support these optimal algorithms: control over declustering, querying about the configuration, independent I/O, and turning off parity, file caching, and prefetching. We summarize recent theoretical and empirical work that justifies the need for these capabilities. In addition, we sketch an organization for a parallel file interface with low-level primitives and higher-level operations /parallel/architecture/communications/io/pario/EUROPE (306 bytes) Reference to unix.hensa.ac.uk copy of archive /parallel/architecture/communications/io/pario/RAID-papers (97 bytes) See for all of the RAID papers and a bilbiography. /parallel/architecture/communications/io/pario/README (1141 bytes) Short intro to the Parallel I/O archive /parallel/architecture/communications/io/pario/STARFISH/ STARFISH Parallel file-system simulator by David Kotz of Dartmouth College, USA. This was used in the kotz:diskdir and related papers, for simulations involving disk-directed I/O. See for the papers. /parallel/architecture/communications/io/pario/STARFISH/.nams-info/ .nams-info /parallel/architecture/communications/io/pario/STARFISH/.nams-info/status (271 bytes) status /parallel/architecture/communications/io/pario/STARFISH/.nams-info/status.new-14805 (0 bytes) status.new-14805 /parallel/architecture/communications/io/pario/STARFISH/README (4095 bytes) "STARFISH Parallel file-system simulator." Based on Eric Brewer's Proteus simulator (binary only included) and runs only on (MIPS-based) DECstations. Proteus source is at See also /parallel/architecture/communications/io/pario/STARFISH/papers.html (23549 bytes) "Starfish Bibliography" [HTML] /parallel/architecture/communications/io/pario/STARFISH/papers.bib (22391 bytes) "Starfish Bibliography" [BibTeX] /parallel/architecture/communications/io/pario/STARFISH/starfish3.0.tar.gz (2116571 bytes) "STARFISH Parallel file-system simulator V3.0" Source code for parallel file-system simulator and associated stuff. /parallel/architecture/communications/io/pario/berdahl:transport.ps.Z (771213 bytes) "Parallel Transport Protocol Proposal" Published by Lawrence Livermore National Lab, January 3, 1995. An update of berdahl:woodenman, close to the final draft. ABSTRACT: This document defines a Parallel Transport Protocol (PTP) that permits parallel data flow between a wide variety of interconnected equipment configurations. The intent of the protocol is to provide bandwidth improvements for large transfers which scale implicitly with increasing physical parallelism (e.g. with increasing numbers of devices or increasing network parallel interconnectivity). Parallel transport will be defined as a connection mode transport application which will use standard transport providers for data movement, and standard transport interfaces for implementation. /parallel/architecture/communications/io/pario/examples/ Real sample programs that use parallel IO /parallel/architecture/communications/io/pario/examples/.nams-info/ .nams-info /parallel/architecture/communications/io/pario/examples/.nams-info/status (290 bytes) status /parallel/architecture/communications/io/pario/examples/.nams-info/status.new-14805 (0 bytes) status.new-14805 /parallel/architecture/communications/io/pario/examples/CFS3D.INFO (2637 bytes) A FORTRAN version of ARC3D with output (only) of 3-d matrix by Steve Ryan at NASA Ames. Runs on iPSC/x with CFS file system. See CFS3D.INFO for more details. [text] /parallel/architecture/communications/io/pario/examples/CFS3D.tar.Z (12969 bytes) A FORTRAN version of ARC3D with output (only) of 3-d matrix by Steve Ryan at NASA Ames. Runs on iPSC/x with CFS file system. See CFS3D.INFO for more details. [compressed tar] /parallel/architecture/communications/io/pario/examples/LUP.INFO (806 bytes) Does an external LUP factorization; lots of reads & writes. Written in C and runs on nCUBE/2 See LUP.INFO for more details. [text] /parallel/architecture/communications/io/pario/examples/LUP.tar.Z (23693 bytes) Does an external LUP factorization; lots of reads & writes. Written in C and runs on nCUBE/2 See LUP.INFO for more details. [compressed tar] /parallel/architecture/communications/io/pario/examples/NHT-1.INFO (1631 bytes) A pointer to the NASA Ames parallel I/O benchmarks - one is based on the NAS BT benchmark code. /parallel/architecture/communications/io/pario/examples/README (1057 bytes) General Information "Parallel-I/O Archive and Parallel I/O Bibliography" The archive is also available on the Web at Dartmouth and contains a lot more additional information not available here. /parallel/architecture/communications/io/pario/new-in-ninth.bib (127134 bytes) new-in-ninth.bib /parallel/architecture/communications/io/pario/pario.bib (914591 bytes) "Parallel I/O bibliography (8th Edition)" /parallel/architecture/communications/io/pario/pario8.bib (588397 bytes) pario8.bib /parallel/architecture/communications/io/pario/pario9.bib (731985 bytes) pario9.bib /parallel/architecture/communications/io/pario/rapid.README (15809 bytes) All the source code for the RAPID-Transit simulator used in kotz:thesis and related papers. [text] /parallel/architecture/communications/io/pario/rapid.tar.gz (2198158 bytes) All the source code for the RAPID-Transit simulator used in kotz:thesis and related papers. [gzipped tar] /parallel/architecture/communications/io/pario/vesta-galley.tar.Z (103651 bytes) "Vesta Library" /parallel/architecture/memory/ "Memory" /parallel/architecture/memory/shared/ shared /parallel/architecture/processing/ "Processing" MPP SMP /parallel/architecture/processing/process-migration/ process-migration /parallel/architecture/processing/process-migration/CoCheck/ "CoCheck - Consistent Checkpoints" CoCheck is an environment that allows both process migration and creating checkpoints of parallel applications. Currently, only PVM applications are supported, but support for MPI is under construction. CoCheck is an environment that allows both process migration and creating checkpoints of parallel applications. Currently, only PVM applications are supported, but support for MPI is under construction. See also /parallel/architecture/processing/process-migration/CoCheck/CoCheck-V1.0/ "CoCheck V1.0 distribution" /parallel/architecture/processing/process-migration/CoCheck/CoCheck-V1.0/CkptLib-ALPHA-V1.0.tgz (80450 bytes) Condor V1.0 binary library (DEC Alpha) /parallel/architecture/processing/process-migration/CoCheck/CoCheck-V1.0/CkptLib-SUN4-V1.0.tgz (46843 bytes) Condor V1.0 binary library (Sun Sparc + SunOS 4) /parallel/architecture/processing/process-migration/CoCheck/CoCheck-V1.0/CoCheck-V1.0.tgz (38722 bytes) "CoCheck - Consistent Checkpoints V1.0" by Prof. Dr. A. Bode ; Georg Stellner , and J. Pruyne. Lehrstuhl f"ur Rechnertechnik und Rechnerorganisation, Institut f"ur Informatik, Technische Universit"at M"unchen, 80290 M"unchen, Germany. CoCheck distribution. This package is under the GNU Library General Public License and the GNU General Public License. CoCheck was tested to run on SunOs 4.1.x and DEC OSF/1. It requires at least PVM Version 3.3.7 or higher. See also /parallel/architecture/processing/process-migration/CoCheck/CoCheck-V1.0/Problems (11435 bytes) "Problems, known bugs and fixes" /parallel/architecture/processing/process-migration/CoCheck/CoCheck-V1.0/Ug-V1.0.ps.gz (70661 bytes) "CoCheck Users' Guide V1.0 (PVM Version)" by Georg Stellner , and Jim Pruyne , . /parallel/architecture/processing/process-migration/faq (27786 bytes) Summary of references and papers to a query on process migration. Creator: Cronk David /parallel/bibliographies/ "Bibliographies of conferences and subjects" /parallel/bibliographies/archindependent.bib (105615 bytes) BibTeX bibliography by David Skillicorn on aspects of parallelism relating to: architecture independence, programming models, categorical approaches to parallelism, general purpose parallelism, and theoretical and foundational results relating to these. Creator: David Skillicorn [BibTeX] /parallel/bibliographies/archindependent.txt (866 bytes) BibTeX bibliography by David Skillicorn on aspects of parallelism relating to: architecture independence, programming models, categorical approaches to parallelism, general purpose parallelism, and theoretical and foundational results relating to these. Creator: David Skillicorn [text] /parallel/bibliographies/atoug/ Proceedings of the Australian occam and Transputer User Group (ATOUG) conferences 3-4. /parallel/bibliographies/atoug/atoug3.bib (7279 bytes) The Transputer in Australasia, Proceedings of ATOUG 3, ed. T. Bossomaier, T. Hintz, and J, Hulskamp. IOS Press, Amsterdam, 1990. /parallel/bibliographies/atoug/atoug4.bib (11878 bytes) The Transputer in Australasia 2, Proceedings of ATOUG 4, ed. J. Hulskamp, T. Bossomaier, and T. Hintz. IOS Press, Amsterdam, 1991. /parallel/bibliographies/cm5-dbader.bib (2969 bytes) Bibliography of the CM-5 and fat-trees by David Bader Creator: David Bader /parallel/bibliographies/computer-science-bibs (3636 bytes) Announcement of the Computer Science Bibliography Collection, a large collection of bibliographies in various fields of computer science is available via anonymous ftp and the World Wide Web from University of Karlsruhe, Germany and other sites. Includes ~22000 articles under parallel processing. See Creator: LIIN Webmaster /parallel/bibliographies/icpp93-bib.ref (53865 bytes) Draft bibliography of 1993 International Conference on Parallel Processing (ICPP 93) by Eugene Miya in refer format. Creator: Eugene Miya /parallel/bibliographies/natug/ Proceedings of North American Transputer User Group (NATUG) conferences 1-6. /parallel/bibliographies/natug/natug1.bib (6807 bytes) Transputer Research and Applications 1, Proceedings of NATUG 1, ed. G. S. Stiles, IOS Press, Amsterdam, 1989. /parallel/bibliographies/natug/natug2.bib (10258 bytes) Transputer Research and Applications 2, Proceedings of NATUG 2, ed. J. A. Board, IOS Press, Amsterdam, 1989. /parallel/bibliographies/natug/natug3.bib (11013 bytes) Transputer Research and Applications 3, Proceedings of NATUG 3, ed. A. S. Wagner, IOS Press, Amsterdam, 1990. /parallel/bibliographies/natug/natug4.bib (8294 bytes) Transputer Research and Applications 4, Proceedings of NATUG 4, ed. D. L. Fielding, IOS Press, Amsterdam, 1990. /parallel/bibliographies/natug/natug5.bib (10809 bytes) Transputer Research and Applications 5, Proceedings of NATUG 5, ed. A. M. Veronis and Y. Paker, IOS Press, Amsterdam, 1990. /parallel/bibliographies/natug/natug6.bib (9201 bytes) Transputer Research and Applications 6, Proceedings of NATUG 5, ed. S. Atkins and A. S> Wagner, IOS Press, Amsterdam, 1990. Proceedings of occam User Group (OUG) and World occam and Transputer User Group (WoTUG) conferences 7-16. [directory] /parallel/bibliographies/wotug/ Proceedings of occam User Group (OUG) and World occam and Transputer User Group (WoTUG) conferences 7-16. [directory] /parallel/bibliographies/wotug/oug10.bib (8890 bytes) Applying Transputer Based Parallel Machines, Proceedings of OUG 10, ed. Andre Bakkers, IOS Press, Amsterdam, 1989. /parallel/bibliographies/wotug/oug11.bib (5799 bytes) Developing Transputer Applications, Proceedings of OUG 11, ed. J. Wexler,IOS Press, Amsterdam, 1989; ISBN 90 5199 020. /parallel/bibliographies/wotug/oug12.bib (8582 bytes) Tools and Techniques for Transputer Applications, Proceedings of OUG 12, ed. Stephen J. Turner, IOS Press, Amsterdam, 1990. /parallel/bibliographies/wotug/oug13.bib (9788 bytes) Real-Time Systems with Transputers, Proceedings of OUG 13, ed. H. S. M. Zedan, IOS Press, Amsterdam, 1990. /parallel/bibliographies/wotug/oug7.bib (13400 bytes) Parallel Programming of Transputer Based Machines, Proc. 7th occam User Group Tech. Meeting, 14-16 Sept. 1987, ed. T. Muntean, IOS Press, Amsterdam, 1988. /parallel/bibliographies/wotug/oug8.bib (6121 bytes) Developments Using occam, Proceedings of OUG 8, ed. Jon Kerridge, IOS Press, Amsterdam, 1988. /parallel/bibliographies/wotug/oug9.bib (6319 bytes) occam and the Transputer - Research and Applications, Proceedings of OUG 9, ed. Charlie Askew, IOS Press, Amsterdam, 1988. /parallel/bibliographies/wotug/wotug14.bib (7479 bytes) occam and the Transputer - Current Developments, Proceedings of WoTUG 14, ed. Janet Edwards, IOS Press, Amsterdam, 1991. /parallel/bibliographies/wotug/wotug15.bib (7196 bytes) Transputer Systems - Ongoing Research, Proceedings of WoTUG 15, ed. A. Allen. IOS Press, Amsterdam, 1992. /parallel/bibliographies/wotug/wotug16.bib (6954 bytes) Transputer and Occam Research: New Directions, Proceedings of WoTUG 16, ed. J. Kerridge. IOS Press, Amsterdam, 1993; ISBN 90 5199 121 5. /parallel/bibliographies/wotug/wotug17.bib (8176 bytes) Progess in Transputer and occam research, Proceedings of WoTUG 17, ed Roger Miles and Alan Chalmers. IOS Press, Amsterdam, 1994; ISBN 90 5199 163 0. /parallel/bibliographies/wotug/wotug18.bib (8352 bytes) Transputer and occam Developments, Proceedings of WoTUG 18, ed Patrick Nixon, Manchester Metropolitan University, IOS Press, Amsterdam, 1995. ISBN 90 5199 222 x (IOS Press) / ISBN 4-274-90047-9 C3000 (Ohmsha). /parallel/bibliographies/wotug/wotug20.bib (34818 bytes) Parallel Programming and Java, Proceedings of WoTUG 20, ed A. Bakkers. IOS Press, Amsterdam, 1997; ISBN 90 5199 336 6. /parallel/bibliographies/par-functional/ Annotated bibliography on parallel functional programming (including BibTeX sources) listing more than 350 publications mostly including their full abstracts by Wolfgang Schreiner /parallel/bibliographies/par-functional/fpcna.bib (32901 bytes) BibTeX sources for the bibliography. [BibTeX] /parallel/bibliographies/par-functional/fpcnew.bib (63159 bytes) BibTeX sources for the bibliography. [BibTeX] /parallel/bibliographies/par-functional/fpcnew2.bib (32199 bytes) BibTeX sources for the bibliography. [BibTeX] /parallel/bibliographies/par-functional/fpcown.bib (9614 bytes) BibTeX sources for the bibliography. [BibTeX] /parallel/bibliographies/par-functional/fpcparla.bib (160665 bytes) BibTeX sources for the bibliography. [BibTeX] /parallel/bibliographies/par-functional/fpcrisc.bib (110861 bytes) BibTeX sources for the bibliography. [BibTeX] /parallel/bibliographies/par-functional/pfpbib2.announce (1607 bytes) Announcement of 2nd edition of an annotated bibliography on parallel functional programming by Wolfgang Schreiner listing more than 350 publications mostly including their full abstracts. Creator: Wolfgang Schreiner /parallel/bibliographies/par-functional/pfpbib2.ps.Z (387955 bytes) PostScript version of the above paper. /parallel/bibliographies/par-functional/pfpsty.tar.Z (14218 bytes) Style files and skeleton document for the above paper. /parallel/bibliographies/par-genetic-algorithms/ Bibliographies on parallel Genetic Algorithms /parallel/bibliographies/par-genetic-algorithms/par-gen-alg.bib (29068 bytes) BibTeX responses to enquiry on comp.ai.genetic and comp.parallel about parallel genetic algorithms by Andreas Uhl From /parallel/bibliographies/par-genetic-algorithms/par-gen-alg.faq (46983 bytes) Summary of responses about parallel/distributed genetic algorithms by Sanjay Kumar Creator: Sanjay Kumar /parallel/bibliographies/par-genetic-algorithms/par-gen-alg.ps.gz (56755 bytes) PostScript bibliography of parallel genetic algorithms by Jarmo T. Alander From /parallel/bibliographies/par-prog-models.bib (1401 bytes) A small bibliography of surveys of parallel programming models by David Skillicorn /parallel/bibliographies/parallel-debugging (3495 bytes) Details of Bibliography on Parallel and Distributed Debuggers available in BiBTeX format and PostScript via anonymous ftp from Rob Netzer and Cherri M. Pancake Creator: Robert H.B. Netzer /parallel/bibliographies/parallelism-biblos-FAQ (10574 bytes) Frequently Asked Questions (FAQ) about the bibliography on parallelism maintained by Eugene N. Miya for the last ten+ years. Written by the maintainer. Creator: Eugene N. Miya /parallel/bibliographies/parlib/ Bibliographies from PARLIB. /parallel/bibliographies/parlib/compilers (34253 bytes) Parallelization and other things /parallel/bibliographies/parlib/debug (3564 bytes) Debugging Creator: Robert H.B. Netzer /parallel/bibliographies/parlib/disclaimer (231 bytes) Disclaimer by PARLIB administrator /parallel/bibliographies/parlib/hloadbalance (70794 bytes) Hierarchical load balancing /parallel/bibliographies/parlib/load-balance (48979 bytes) Load balancing bibliograpy /parallel/bibliographies/parlib/optimization (35737 bytes) Optimization oriented towards branch and bound /parallel/bibliographies/parlib/parallelio (172856 bytes) 4th Ed. Parallel IO bib. by David Kotz /parallel/bibliographies/parlib/reqreading (60524 bytes) Eugene Miya's must read list /parallel/bibliographies/parlib/task-generation (3729 bytes) Scheduling and Task Generation /parallel/bibliographies/transputer/ Bibliographies of proceedings of various transputer conferences and other transputer publications. Original ASCII version by Dyke Stiles Converted to BibTeX and cleaned up by Dave Beckett /parallel/bibliographies/transputer/1984.bib (16447 bytes) Transputer/occam Bibliography for 1984, from WoTUG database /parallel/bibliographies/transputer/1985.bib (22448 bytes) Transputer/occam Bibliography for 1985, from WoTUG database /parallel/bibliographies/transputer/1986.bib (31082 bytes) Transputer/occam Bibliography for 1986, from WoTUG database /parallel/bibliographies/transputer/1987.bib (44874 bytes) Transputer/occam Bibliography for 1987, from WoTUG database /parallel/bibliographies/transputer/1988.bib (26461 bytes) Transputer/occam Bibliography for 1988, from WoTUG database /parallel/bibliographies/transputer/1989.bib (44053 bytes) Transputer/occam Bibliography for 1989, from WoTUG database /parallel/bibliographies/transputer/1990.bib (19950 bytes) Transputer/occam Bibliography for 1990, from WoTUG database /parallel/bibliographies/transputer/1991.bib (4548 bytes) Transputer/occam Bibliography for 1991, from WoTUG database /parallel/bibliographies/transputer/aisig1.bib (5061 bytes) Bibliography of proceedings of WoTUG AI SIG 1 "Parallel Processing and Artificial Intelligence" edited by M. Reeve and S. Ericsson Zenith published 1989 by Wiley, ISBN 0-471-92497-0 /parallel/bibliographies/transputer/aisig2.bib (2692 bytes) Bibliography of proceedings of OUG AI SIG 2, 1990 (may not be published) /parallel/bibliographies/transputer/aot1.bib (9551 bytes) Applications of Transputers 1, Proc. First Int'l. Conf. Appl. Transputers, 23-25 Aug. 1989, ed. L. Freeman and C. Phillips, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/aot2.bib (27157 bytes) Applications of Transputers 2, Proc. Second Int'l. Conf. Appl. Transputers, 11-13 Jul. 1990, ed. D. J. Pritchard and C. J. Scott, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/aot3.bib (53710 bytes) Applications of Transputers 3, Proc. First Int'l. Conf. Appl. Transputers, 28-30 Aug. 1991, ed. T. S. Durrani, W. A. Sandham, J. J. Soraghan, and S. M. Forbes, IOS Press, Amsterdam, 1991. /parallel/bibliographies/transputer/atoug3.bib (7279 bytes) The Transputer in Australasia, Proceedings of ATOUG 3, ed. T. Bossomaier, T. Hintz, and J, Hulskamp. IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/atoug4.bib (11878 bytes) The Transputer in Australasia 2, Proceedings of ATOUG 4, ed. J. Hulskamp, T. Bossomaier, and T. Hintz. IOS Press, Amsterdam, 1991. /parallel/bibliographies/transputer/books.bib (8067 bytes) Transputer/occam books Bibliography up to 1990, from WoTUG database /parallel/bibliographies/transputer/extraart.bib (6527 bytes) Transputer/occam Bibliography other articles, from WoTUG database /parallel/bibliographies/transputer/image.bib (2851 bytes) Image Processing and Transputers, ed. Hugh C. Webber, IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/inmospubs.bib (7039 bytes) Transputer/occam Bibliography for INMOS publications (to 1990) from WoTUG database /parallel/bibliographies/transputer/japan3.bib (7039 bytes) Transputer/occam, Proceedings of Japan 3, ed. T. L. Kunii and D. May, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/natug1.bib (6807 bytes) Transputer Research and Applications 1, Proceedings of NATUG 1, ed. G. S. Stiles, IOS Press, Amsterdam, 1989. /parallel/bibliographies/transputer/natug2.bib (10258 bytes) Transputer Research and Applications 2, Proceedings of NATUG 2, ed. J. A. Board, IOS Press, Amsterdam, 1989. /parallel/bibliographies/transputer/natug3.bib (11013 bytes) Transputer Research and Applications 3, Proceedings of NATUG 3, ed. A. S. Wagner, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/natug4.bib (8294 bytes) Transputer Research and Applications 4, Proceedings of NATUG 4, ed. D. L. Fielding, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/natug5.bib (10809 bytes) Transputer Research and Applications 5, Proceedings of NATUG 5, ed. A. M. Veronis and Y. Paker, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/natug6.bib (9201 bytes) Transputer Research and Applications 6, Proceedings of NATUG 5, ed. S. Atkins and A. S> Wagner, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/nordic12.bib (6546 bytes) Nordic Transputer Applications, Proceedings of the 1st and 2nd Nordic Transputer Seminars, ed. Lars Annell and Martin Tormgren, IOS Press, Amsterdam, 1991. /parallel/bibliographies/transputer/nrat.bib (5179 bytes) Networks, Routers, & Transputers, ed. M. D. May, P. W. Thompson, and P. H. Welch, IOS Press, Amsterdam, 1993. /parallel/bibliographies/transputer/oug10.bib (8890 bytes) Applying Transputer Based Parallel Machines, Proceedings of OUG 10, ed. Andre Bakkers, IOS Press, Amsterdam, 1989. /parallel/bibliographies/transputer/oug11.bib (5799 bytes) Developing Transputer Applications, Proceedings of OUG 11, ed. J. Wexler,IOS Press, Amsterdam, 1989; ISBN 90 5199 020. /parallel/bibliographies/transputer/oug12.bib (8582 bytes) Tools and Techniques for Transputer Applications, Proceedings of OUG 12, ed. Stephen J. Turner, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/oug13.bib (9788 bytes) Real-Time Systems with Transputers, Proceedings of OUG 13, ed. H. S. M. Zedan, IOS Press, Amsterdam, 1990. /parallel/bibliographies/transputer/oug7.bib (13400 bytes) Parallel Programming of Transputer Based Machines, Proc. 7th occam User Group Tech. Meeting, 14-16 Sept. 1987, ed. T. Muntean, IOS Press, Amsterdam, 1988. /parallel/bibliographies/transputer/oug8.bib (6121 bytes) Developments Using occam, Proceedings of OUG 8, ed. Jon Kerridge, IOS Press, Amsterdam, 1988. /parallel/bibliographies/transputer/oug9.bib (6319 bytes) occam and the Transputer - Research and Applications, Proceedings of OUG 9, ed. Charlie Askew, IOS Press, Amsterdam, 1988. /parallel/bibliographies/transputer/pacta92.bib (62089 bytes) Parallel Computing and Transputer Applications, ed. M. Valero, E. Onate, M. Jane, J. L. Larriba, B. Suarez, IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/pre1984.bib (9854 bytes) Transputer/occam Bibliography before 1984, from WoTUG database /parallel/bibliographies/transputer/sa88.bib (5214 bytes) "Parallel processing: technology and applications" : Proceedings of the international symposium 26-28 October 1988 Johannesburg South Africa. /parallel/bibliographies/transputer/serc.bib (20963 bytes) Transputer Bibliography of SERC related items, from WoTUG database /parallel/bibliographies/transputer/t1991.bib (22815 bytes) Transputing '91, Proceedings of the World Transputer User Group Conf., ed. P. H. Welch, D. Stiles, T. L. Kunii, and A. Bakkers, IOS Press, Amsterdam, 1991. /parallel/bibliographies/transputer/tapa92.bib (10649 bytes) Transputers and Parallel Applications (TAPA-92), Proceedings of the 5th Australian Transputer User Group Conference, ed. J. Hulskamp and D. Jones, IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/tnnna.bib (6794 bytes) Transputing in Numerical and Neural Network Applications, ed. G. L Reijns and Jian Luo, IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/tranap92.bib (4893 bytes) Transputer Applications - Progress and Prospects, Proceedings of the Closing Symposium of the SERC/DTI Initiative in the Engineering Application of Transputers, ed. M. R. Jane, R. J. Fawcett, and T. P. Mawby, IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/trans92.bib (10314 bytes) Transputers '92: Advanced Research and Applications, Proceedings of the International Conference, ed. M. Becker, L. Litzler, and M. Trehel. May, IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/wotug14.bib (7479 bytes) occam and the Transputer - Current Developments, Proceedings of WoTUG 14, ed. Janet Edwards, IOS Press, Amsterdam, 1991. /parallel/bibliographies/transputer/wotug15.bib (7196 bytes) Transputer Systems - Ongoing Research, Proceedings of WoTUG 15, ed. A. Allen. IOS Press, Amsterdam, 1992. /parallel/bibliographies/transputer/wotug16.bib (6954 bytes) Transputer and Occam Research: New Directions, Proceedings of WoTUG 16, ed. J. Kerridge. IOS Press, Amsterdam, 1993; ISBN 90 5199 121 5. /parallel/bibliographies/transputer/wotug17.bib (8176 bytes) Progess in Transputer and occam research, Proceedings of WoTUG 17, ed Roger Miles and Alan Chalmers. IOS Press, Amsterdam, 1994; ISBN 90 5199 163 0. /parallel/bibliographies/transputer/wotug18.bib (8352 bytes) Transputer and occam Developments, Proceedings of WoTUG 18, ed Patrick Nixon, Manchester Metropolitan University, IOS Press, Amsterdam, 1995. ISBN 90 5199 222 x (IOS Press) / ISBN 4-274-90047-9 C3000 (Ohmsha). /parallel/bibliographies/transputer/wotug20.bib (34818 bytes) Parallel Programming and Java, Proceedings of WoTUG 20, ed A. Bakkers. IOS Press, Amsterdam, 1997; ISBN 90 5199 336 6. /parallel/books/ "Books, book lists and publisher details" /parallel/books/acs/ "ACS" /parallel/books/acs/par-comp-chem (2718 bytes) "Parallel Computing in Computational Chemistry" by Timothy G. Mattson This book explores the state of the art in parallel computing as applied to computational chemistry. The papers in the book range from tutorials to discussions of the latest advanced algorithms. While the seasoned parallel programmer will gain a great deal from this book, an introduction to parallel computing is included so novices will be able to read the book as well. /parallel/books/addison-wesley/ "Addison-Wesley" "Designing and Building Parallel Programs" by Ian Foster The entire book is available here for free in hypertext form and also at other mirror sites (see below). DBPP is a practitioner's guide to parallel program design, performance analysis, and program construction. It provides tutorial introductions to four parallel languages and libraries---Compositional C++, Fortran M, High Performance Fortran, and the Message Passing Interface---and also reviews parallel performance tools. There are numerous examples, exercises, and references. It is intended for both professional and academic use. Addison Wesley, 1995. ISBN: 0-201-57594-9 /parallel/books/benjamin-cummings/ "Benjamin Cummings" /parallel/books/benjamin-cummings/high-par-comp-2nded (1448 bytes) Details of "Highly Parallel Computing", Second edition by George S. Almasi and Allan Gottlieb. Creator: B/C Parallel Computing /parallel/books/benjamin-cummings/intro-par-extra (1358 bytes) Announcement of supplementary material for book:"Introduction To Parallel Computing: Design And Analysis Of Algorithms" by Kumar, Grama, Gupta and Karypis available by anonymous ftp. Creator: Vipin Kumar /parallel/books/cup/ "Cambridge University Press" /parallel/books/cup/foundations-of-parallel-programming.html (860 bytes) "Foundations of Parallel Programming" by David Skillicorn This book summarises the application of initiality, using the categorical data type approach, to general-purpose parallel computation. There is also an extensive survey of models of parallel computation. Published by Cambridge University Press. /parallel/books/cup/numerical-recipies-in-fortran90 (3282 bytes) "Numerical Recipes in Fortran 90: The Art of Parallel Scientific Computing / Numerical Recipes Code CDROM" by William Press; Saul Teukolsky; William Vetterling and Brian Flannery. This book is intended for use with the existing book (now renamed Numerical Recipes in Fortran 77), and reworks all the Numerical Recipes routines to use F90. There are three new F90 chapters and an new introduction. The CDROM contains all the code in all many languages (C, F77, F90, ...) and megabytes of other source code with an HTML interface. See also the Numerical Recipies Home Page at for some earlier books on-line (in Acrobat and PostScript) as well as further book and CDROM details. Published by Cambridge University Press. /parallel/books/ieee/ "IEEE Computer Society Press" /parallel/books/ieee/programming-langs-for-parallel-programming.html (2286 bytes) Programming Languages for Parallel Processing, edited by David B. Skillicorn and Domenico Talia, and published by the IEEE Computer Society Press. /parallel/books/inmos/ "INMOS Ltd books" /parallel/books/inmos/manual3.ps.Z (552734 bytes) Occam 3 reference manual (March 31 1992 draft) by Geoff Barrett of INMOS. (1.4M uncompressed, 203 pages) /parallel/books/introductory-parallel-books (1892 bytes) "A summary of responses to a query about introductory books for parallel programming/algorithms. Replies by David Bader and Jason Moore " by David Bader /parallel/books/ios/ "IOS Press" /parallel/books/ios/IOS-details (721 bytes) Contact details for IOS Press. /parallel/books/ios/nrat/ "Networks, Routers & Transputers" book as compressed PostScript edited by M.D. May, P.W. Thompson and P.H. Welch. /parallel/books/ios/nrat/Appendices.ps.gz (259907 bytes) App: Appendices A to D /parallel/books/ios/nrat/Chapter1.ps.gz (59827 bytes) 1 : Transputers and Routers: Components for Concurrent Machines /parallel/books/ios/nrat/Chapter10a.ps.gz (278722 bytes) 10a: A Generic Architecture for ATM Systems Part 1 of 4 /parallel/books/ios/nrat/Chapter10b.ps.gz (332173 bytes) 10b: A Generic Architecture for ATM Systems Part 2 of 4 /parallel/books/ios/nrat/Chapter10c.ps.gz (358222 bytes) 10c: A Generic Architecture for ATM Systems Part 3 of 4 /parallel/books/ios/nrat/Chapter10d.ps.gz (77635 bytes) 10d: A Generic Architecture for ATM Systems Part 4 of 4 /parallel/books/ios/nrat/Chapter11.ps.gz (204203 bytes) 11 : An Enabling Infr. for a Distributed Multimedia Industry /parallel/books/ios/nrat/Chapter2.ps.gz (69203 bytes) 2 : The T9000 Communications Architecture /parallel/books/ios/nrat/Chapter3.ps.gz (63346 bytes) 3 : DS-Links and C104 Routers /parallel/books/ios/nrat/Chapter4.ps.gz (107423 bytes) 4 : Connecting DS-Links /parallel/books/ios/nrat/Chapter5.ps.gz (116817 bytes) 5 : Using Links for System Control /parallel/books/ios/nrat/Chapter6a.ps.gz (276623 bytes) 6a : Models of DS-Link Performance Part 1 of 2 /parallel/books/ios/nrat/Chapter6b.ps.gz (226220 bytes) 6b : Models of DS-Link Performance Part 2 of 2 /parallel/books/ios/nrat/Chapter7.ps.gz (93252 bytes) 7 : Performance of C104 Networks /parallel/books/ios/nrat/Chapter8.ps.gz (75048 bytes) 8 : General Purpose Parallel Computers /parallel/books/ios/nrat/Chapter9.ps.gz (156438 bytes) 9 : The Impl. of Large Par. Dbase Machines on T9000 and C104 Nets /parallel/books/ios/nrat/Introduction.ps.gz (65657 bytes) 0 : Introduction /parallel/books/ios/nrat/Overview (27007 bytes) --- Overview of the book - READ THIS FIRST and pick a chapter --- /parallel/books/ios/nrat.bib (5179 bytes) BibTex bibliograph for the above book. Original ASCII version by Dyke Stiles Converted to BibTeX and cleaned up by Dave Beckett /parallel/books/jones+bartlett/ "Jones and Bartlett of Boston" /parallel/books/jones+bartlett/labs-for-par-comp (11941 bytes) Details and table of contents of book: "Laboratories for Parallel Computing" by Chris Nevison et al. published by Jones and Bartlett of Boston. This book is the combined result of work from the UParCC (Undergraduate Parallel Computing Curriculum) workshops conducted by Chris Nevison and others under the NSF UFE (Undergraduate Faculty Enhancement) and UCCD (Undergraduate Course and Curriculum Development) grant programs. The workshop participants developed modules for teaching parallel computing and continued to develop the course materials through follow-on workshops. All laboratories were tested in the classroom, in fact, the draft set of laboratories was distributed for use and feedback to more than 100 colleges and universities world wide. An instructors guide is available by ftp. Creator: Chris Nevison /parallel/books/kluwer/ "Kluwer Academic Publishers" /parallel/books/kluwer/automatic-perf-pred-par-progs (8030 bytes) "Automatic Performance Prediction of Parallel Programs" by Thomas Fahringer , , Institute for Software Technology and Parallel Systems, University of Vienna, Austria; Tel: +43 1 310 56 08 - 86; FAX: +43 1 310 56 08 - 88 This book describes a unified approach to the problem of automatically estimating the performance of parallel computer programs primarily focussing on DMM systems. Published by Kluwer Academic Publishers, Boston, USA /parallel/books/kluwer/symbolic-analysis-par-compilers (4497 bytes) "Symbolic Analysis for Parallelizing Compilers" by Mohammad Reza Haghighat Overview and table of contents. /parallel/books/manning/ "Manning Publications" /parallel/books/manning/dist-par-comp (2699 bytes) "Distributed and Parallel Computing" by Hesham El-Rwini, University of Nebraska at Omaha, USA and Ted G. Lewis, Naval Postgraduate School, Monterey, CA, USA. This is a comprehensive survey of the state-of-the-art in concurrent computing. It covers four major aspects: - Architecture and performance; - Theory and complexity analysis of parallel algorithms; - Programming languages and systems for writing parallel and distributed programs; - Scheduling of parallel and distributed tasks. Hardbound, 469 pages, $60, Manning ISBN 1884777511 See also /parallel/books/mcgraw-hill/ "McGraw-Hill Inc." /parallel/books/mcgraw-hill/par-dist-comp-handbook (9564 bytes) "Parallel and Distributed Computing Handbook (1996)" by Albert Y. Zomaya , The University of Western Australia, Australia Featuring contributions from more than sixty of the world's top experts in the field, this state-of-the-art handbook offers engineers and scientists the most comprehensive treatment available of the theory and applications of parallel and distributed computing. Readers will find forty-one well-organized chapters covering the full range of key issues relating to systems design and operation, including models and algorithms....architectures and technologies....development tools....and current and future uses of this exciting technology in science and industry. See also 1232 pages. 600 illustrations. ISBN 0-07-073020-2. $99.50. /parallel/books/mit/ "MIT Press" /parallel/books/mit/concurrent-oo.announce (2876 bytes) "Research Directions in Concurrent OOP" by Teresa A. Ehling Edited by Gul Agha, Peter Wegner and Aki Yonezawa. /parallel/books/mit/f95-handbook (1947 bytes) "Fortran 95 Handbook" by Jeanne C. Adams; Walter S. Brainerd; Jeanne T. Martin; Brian T. Smith and Jerrold L. Wagener. Scientific and Engineering Computation series, February 1998 711 pp. ISBN 0-262-51096-0, MIT Press. See also /parallel/books/mit/pvm (3885 bytes) "PVM: Parallel Virtual Machine A Users' Guide and Tutorial for Network Parallel Computing" by Bob Manchek By Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy S. Sunderam. See for more information. The book is also available online in HTML form at and in Postscript at /parallel/books/mit/using-mpi (1143 bytes) "Using MPI: Portable Programming with the Message-Passing Interface" by Rusty Lusk By William Gropp, Ewing Lusk and Anthony Skjellum. See also and . Local copies of latter at /parallel/books/morgan-kaufmann/ "Morgan Kaufmann" /parallel/books/morgan-kaufmann/distributed-algorithms (539 bytes) "Distributed Algorithms" by Nancy Lynch See for details. Published by Morgan Kaufmann. /parallel/books/morgan-kaufmann/par-prog-with-mpi (1223 bytes) "Parallel Programming with MPI" by Peter Pacheco , Department of Mathematics, University of San Francisco, San Francisco, CA 94117, USA; Tel: +1 (415) 666-6630 An elementary introduction to programming parallel systems useing MPI 1.1 library for C and Fortran. The intended audience is students and professionals with some knowledge of programming for conventional, single-processor systems, but who have little or no experience programming multiprocessor systems. See also and . Published by Morgan Kaufmann, ISBN is 1-55860-339-5. /parallel/books/morgan-kaufmann/parallel-computing-works (2949 bytes) "Parallel Computing Works!" by Geoffrey C. Fox,; Roy D. Williams and Paul C. Messina. This book shows how parallel computers can be successfully applied to large-scale scientific computations. It demonstrates how a variety of applications in physics, biology, mathematics, and other sciences were implemented on real parallel computers to prove new scientific results. Published by Morgan Kaufmann. /parallel/books/morgan-kaufmann/parallel-processing-from-applications-to-systems (9881 bytes) "Parallel Processing from Applications to Systems" by Morgan Kaufmann Publishers , University of Southern California Published by Morgan Kaufmann and details of contents and costs. /parallel/books/occam-books (2695 bytes) "books about the occam language" /parallel/books/oup/ "Oxford University Press" /parallel/books/oup/design-and-analysis-of-parallel-algorithms (12783 bytes) "The Design and Analysis of Parallel Algorithms" by Justin Smith Published by Oxford University Press, ISBN 0-19-507881-0 table of contents and description by the author Justin R. Smith , Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA, USA. /parallel/books/oup/design-and-analysis-of-parallel-algorithms.demo-progs (2259 bytes) Details of how to obtain the sources to the demonstration programs for the above book via anonymous ftp. Creator: Justin Smith /parallel/books/oup/the-f-programming-language (4539 bytes) "The F programming Language" by Michael Metcalf and John Reid. Published by Oxford University Press, Oxford and New York, 1996, ISBN 0-19-850026-2. (about $US30 or 16.95 pounds sterling). /parallel/books/prentice-hall/ "Prentice Hall" /parallel/books/prentice-hall/in-search-of-clusters (2878 bytes) "In Search of Clusters" by Gregory F. Pfister Topics covered include: how clusters are an invisible, multi-billion dollar segment of the computer industry; why clusters are growing in importance and visibility hardware and software elements of clusters, including the first serious discussion of "single system image"; key incompabilities in programming clusters and symmetric multiprocessors; comparison between clusters and symmetric multiprocessors; how popular benchmarks mislead users and designers of clusters ISBN 0-13-437625-0 published by Prentice-Hall, 415 pages, $42. See also or the book at /parallel/books/prentice-hall/ooos (2735 bytes) "The Logical Design of Parallel Operating Systems" by Wolfgang Schroeder-Preikschat Published by Prentice Hall. ABSTRACT: Forthcoming massively parallel systems will have distributed-memory architectures. They consist of several hundreds to thousands of autonomous processing nodes interconnected by a high-speed network. A major challenge in operating-system design for these architectures is to design a structure that reduces system bootstrap time, avoids bottlenecks in serving system calls, promotes fault tolerance, and is dynamically alterable and application-oriented. This work describes the logical design of state-of-the-art parallel operating systems that have to meet the needs of both massively parallel computer architectures and massively parallel applications. The focus is on how to organize and structure these operating systems; this is not a discussion of algorithms that implement specific system features. Thus, it is a software engineering course explaining operating-system structuring rather than implementation. By starting on an abstract level, the ``big picture'' of a parallel operating system is stepwise refined. The refinement is carried out top-down to the implementation level, to give an impression of the message startup time overhead implied by a hierarchically composed system. The design approach followed is to understand a parallel operating system as a 'program family' and to use 'object orientation' as the fundamental implementation discipline. The former concept (program family) helps prevent the design of a monolithic system organization, while object orientation enables the efficient implementation of a highly modular system structure. An in-depth presentation is given rather than a broad overview. Instead of discussing several designs more or less superficially, a single, elaborate case study is made on the basis of 'Peace'. The object-oriented design of the 'Peace' family of parallel operating systems is thoroughly discussed. /parallel/books/prentice-hall/par-alg-vlsi-cad (9105 bytes) "Parallel Algorithms For VLSI Computer-Aided Design" by Prithviraj Banerjee ISBN 0-13-015835-6 /parallel/books/prentice-hall/prentice-hall-transputer-books (5385 bytes) Prentice Hall books on Transputer Technology /parallel/books/springer-verlag/ "Springer Verlag" /parallel/books/springer-verlag/concurrent-scientific-computing (9209 bytes) Details of and Table of contents for "Concurrent Scientific Computing" by Eric F. Van de Velde published by Springer-Verlag, New York, 1994. See also: http://www.ama.caltech.edu/~evdv Creator: Eric van de Velde /parallel/books/thomson/ "International Thomson Computer Press" /parallel/books/thomson/par-computing-paradigms-apps (6277 bytes) "Parallel Computing: Paradigms and Applications" by Albert Y. Zomaya Published by: International Thomson Computer Press, 570 pages, ISBN 1-85032188-4, 49.95 pounds sterling. /parallel/books/unknown/ "Unknown publisher" /parallel/books/unknown/hetero-process-migration-deutsch (1028 bytes) "Heterogeneous Process Migration / Prozessverlagerung in heterogenen Rechnernetzen basierend auf einer speziellen Uebersetzungstechnik" by Christoph Pleier , Department of Computer Science, Technische Universitaet Muenchen, Deutschland See also "Scientific Supercomputing: Architecture and Use of Shared and Distributed Memory Parallel Computers " by Prof. Dr. Willi Schoenauer , Universitaet Karlsruhe, Rechenzentrum, Zirkel 2, 76128 Karlsruhe, Germany; Tel: +49 721-6083754; FAX: +49 721-32550 A handwritten (and then scanned) Internet book on Scientific Supercomputing. Table of Contents: Introduction; Prototypes with their Bottlenecks; Arithmetic Operations and Memory Bandwidth; The CRAY T90; The Fujitsu VPP300 (and VPP700); The IBM RS/6000 SP ; The CRAY T3E and DEC Alpha Processors; Performance Analysis; Basic Considerations Concerning Data Structures; Fortran, Autovectorization and Autoparallelization, Progamming Models; Recurrences; Matrix Operations; Systems of Linear Equations on Vector Processors; Remarks to the Parallelization of the Gauss Algorithm; Tridiagonal Linear Systems; Iterative Solution of Linear Systems of Equations; Explaining the Gap Between Theoretical Peak Performance and Real Performance for Supercomputer Architectures; References. In the Addendum further architectures and algorithms will be presented (open-ended). /parallel/books/unknown/par-dist-computing (6433 bytes) "Parallel and Distributed Computing Handbook" by Albert Zomaya Edited by Albert Y. Zomaya, The University of Western Australia, Australia. Featuring contributions from more than sixty of the world's top experts in the field, this state-of-the-art handbook offers engineers and scientists the most comprehensive treatment available of the theory and applications of parallel and distributed computing. Readers will find forty-one well-organized chapters covering the full range of key issues relating to systems design and operation, including models and algorithms; architectures and technologies; development tools and current and future uses of this exciting technology in science and industry. 1200 pages. 600 illustrations. ISBN 0-07-073020-2 /parallel/books/vieweg/ "Vieweg Publishing" /parallel/books/vieweg/load-dist-for-mach (19299 bytes) Details of book "Load Distribution, Implementation for the Mach Microkernel" by Dejan Milojicic published by Verlag Publishing from the thesis. Includes four reviews of work. Creator: Dejan Milojicic /parallel/books/westminister/ "University of Westminister Press" /parallel/books/westminister/transim-parallel-design-tool (2019 bytes) "Transim: Prototyping Parallel Algorithms" by Ed Hart Published by University of Westminister press. The book includes the Transim parallel design tool on disk which simulates an application program as it runs on a network of Inmos transputers. /parallel/books/wsp/ "World Scientific Publications" /parallel/books/wsp/par-backprop-nn-transputers (8481 bytes) "Parallel Implementations of Backpropagation Neural Networks on Transputers - A Study of Training Set Parallelism" by P Saratchandran; N Sundararajan and Shou King Foo. School of Electrical & Electronic Engg, Nanyang Technological University, Singapore. This book presents a systematic approach to parallel implementation of feedforward neural networks on an array of transputers with the emphasis on backpropagation learning and training set parallelism. Published by World Scientific Publications Co., Inc. ISBN: 981-02-2654-3. 250 pages (approx.). See also or /parallel/consultants/ "Parallel and High Performance Computing consultants" /parallel/consultants/4links (1597 bytes) "4links for technical help" Consultancy in areas including the hardware of computers, communications and electronics, and particularly of transputer links and modular design. /parallel/consultants/geli (303 bytes) "Geli Engineering" Provides sales, installation, support and distributed computing consulting services for Pentium workstation clusters. See WWW site at for more information. "Liebrock-Hicks Research" Research and consulting in parallel and high-performance computing. /parallel/consultants/trivision (2710 bytes) "Trivision (Switzerland) AG" Technical consultants and system integrators specialising in MPP systems based in Switzerland and southern Germany. /parallel/consultants/wzi (677 bytes) "W.Z.I Consulting" Parallel Processing and Transputer Consulting. See home page /parallel/documents/ "Miscellaneous documents (depreciated)" This area is *Depreciated* i.e. the things in this tree are being moved to be in the correct place by content. /parallel/documents/announcements/ Announcements /parallel/documents/announcements/intel-paragon-study-guide (1524 bytes) Announcement of a self-teaching guide for the Intel Paragon available by anonymous ftp from the Parallel Processing Laboratory, University of Bergen, Norway. Guides for the MasPar/DECmpp and Intel iPSC computers are also available. Creator: Jeremy Cook /parallel/documents/announcements/ksr-par-guide-in-german (1030 bytes) Announcement of a Parallelization Guide for the KSR1 in german: "Optimierung und Parallelisierung auf dem Parallelrechner SNI-KSR1" from Leibniz-Rechenzentrum, Muenchen, Deutschland. Creator: Christian Schaller HIPPI (High Performance Parallel Interface) documents High Performance Fortran /parallel/documents/humour/ Humo(u)r /parallel/documents/humour/building-par-prog-systems (5433 bytes) "Building parallel programming systems" by Brent Gorda, Paul Lu, Greg Wilson. March 1994. /parallel/documents/misc/ Miscellaneous documents (many about and from USENET) /parallel/documents/misc/DIMACS-implementation-challenge-III (3376 bytes) Call for participation in the Third DIMACS Internations Algorithm Implementation Challenge. This will take place between November 1993 and September 1994 by carrying out research projects related to the problem areas specified to present research papers at a DIMACS workshop in October 1994. Creator: Sandeep Bhatt /parallel/documents/misc/MPE-forth (647 bytes) MPE Forth - a commercial forth for T2,T4,T8 and T9000s [May be out of date information - 2 years old] Creator: Stephen Pelc /parallel/documents/misc/booting-link-adaptor.asm (8910 bytes) Replies to a query about booting a transputer network via a link adaptor. The first reply gives a transputer assembler version and the second a C program to do the same. Answers from (respectively): Andy Rabagliati and Roger Butenuth Creator: Roger Butenuth [text] /parallel/documents/misc/booting-link-adaptor.c (3329 bytes) Replies to a query about booting a transputer network via a link adaptor. The first reply gives a transputer assembler version and the second a C program to do the same. Answers from (respectively): Andy Rabagliati and Roger Butenuth Creator: Roger Butenuth [C] /parallel/documents/misc/csa-logical-systems-c-ftp-site (681 bytes) Announcement of CSA and Logical Systems's C ftp site. Creator: CSA /parallel/documents/misc/dslinks-paul-walker (5179 bytes) Article by Paul Walker explaining the relationship between DS-Links and the IEEE P1394 prototype standard. Creator: Paul Walker /parallel/documents/misc/dslinks-paul-walker-2 (2091 bytes) Article by Paul Walker describing the maximum DS-Link transfer rates. Creator: Paul Walker /parallel/documents/misc/dslinks-paul-walker-routing-switches (7020 bytes) Article by Paul Walker describing two new DS-Link routing switches for T9000s from Nottingham Trent University and INMOS respectively. Creator: Paul Walker /parallel/documents/misc/ecco-contest (9499 bytes) IBM European Parallel Computing Consortium (ECCO) Sponsors $5,000 Contest for Parallel Computing Software in three categories: Best Parallel Software Development Tool, Best Parallel Application and Best Student Parallel Program. Deadline: 30th June 1994. Software must run on IBM Power system or IBM RISC cluster. /parallel/documents/misc/faster-messaging-shmem-multiprocs-video (2439 bytes) Details of Video tape on "Faster Messaging in Shared-Memory Multiprocessors", Optimizing Memory-Based Messaging for Scalable Shared Memory Multiprocessor Architectures, 8th September 1993, 71 minutes by Bob Kutter and David Cheriton. Creator: David Schachter /parallel/documents/misc/gordon-bell-finalists-1993 (4060 bytes) Announcement of Gordon Bell Award Finalists for 1993. Creator: Nan C Schaller /parallel/documents/misc/inmos-C-alloca (4800 bytes) An attempt to provide an alloca() (stack based malloc) for INMOS C for transputers by Adam Back Creator: A.Back /parallel/documents/misc/msdos-occam (614 bytes) Occam system for MSDOS /parallel/documents/misc/munin-info (1224 bytes) How to get information on the Munin project and the following projects - Memo/Treadmarks DSM at Rice University. Creator: John Carter /parallel/documents/misc/parallel-AI (6181 bytes) Details of parallel AI, prolog, AND- and OR- parallelism work at the Parallel Programming Laboratory, Department of Computer Science, University of Illinois, USA from Sanjay Kale /parallel/documents/misc/parallel-design-notations (1067 bytes) Some books containing notations for designing parallel programs by David Bader . Creator: David Bader /parallel/documents/misc/processor-powers (3921 bytes) A digest of a few articles describing the power outputs of various 'hot' processors including benchmarks "per watt". Articles by Edward Vielmetti and Gunes Aybay /parallel/documents/misc/sisal-initiative (3146 bytes) Announcement of Sisal Scientific Computing Initiative: Proposals are solicited by the Computing Research Group at Lawrence Livermore National Laboratory (LLNL), USA with the award being free Cray C90 time and support to researchers willing to work in the Sisal language. Creator: Tom DeBoni /parallel/documents/misc/timeline/ Directory containing a LaTeX document of a timeline history of parallel computing and supercomputing by Greg Wilson /parallel/documents/misc/timeline/BANNER (1871 bytes) Headers from news articles by Greg explaining documents below Creator: Greg Wilson (EXP 31 dec 93) /parallel/documents/misc/timeline/bigtabular.sty (4883 bytes) Style file (required for above document) /parallel/documents/misc/timeline/history-of-par-computing.txt (58598 bytes) History of Parallel Computing and Supercomputing (25th July 1994) by Gregory Wilson ; available for distribution on the understanding that it may be printed for personal use, but may not be referenced, quoted or cited in published material, or modified without prior permission of the author. Creator: Wilson GV /parallel/documents/misc/timeline/timeline-final.txt (66344 bytes) 7th Sept 1993 version of timeline history (ASCII) Creator: Greg Wilson (EXP 31 dec 93) /parallel/documents/misc/timeline/timeline.tex (48291 bytes) 21st July 1993 version of timeline history (LaTex) /parallel/documents/misc/timeline/timeline.txt (51443 bytes) 20th Aug 1993 version of timeline history (ASCII) Creator: Greg Wilson (EXP 31 dec 93) /parallel/documents/misc/vr-object-survey (2451 bytes) Announcement of survey of research groups in area of development of (distributed) object hit detection algorithms in virtual reality environments by Knut Menzel Creator: Knut Menzel Message Passing Initiative documents occam language documents Parallel IO documents /parallel/environments/ "Parallel computing environments" /parallel/environments/charm/ Charm / Charm++ portable object-orientated parallel programming system from Department of Computer Science, University of Illinois, USA. It supports concurrent objects with inheritance plus a performance analysis tool and other tools. Charm/Charm++ portable object-oriented parallel programming system. This contains: See also for a lot of on-line information. /parallel/environments/charm/.nams-info/ .nams-info /parallel/environments/charm/.nams-info/status (488 bytes) status /parallel/environments/charm/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/CHARM.4.8/ CHARM.4.8 /parallel/environments/charm/CHARM.4.8/.nams-info/ .nams-info /parallel/environments/charm/CHARM.4.8/.nams-info/status (415 bytes) status /parallel/environments/charm/CHARM.4.8/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/CHARM.4.8/converse.manual.ps.gz (129203 bytes) converse.manual.ps.gz /parallel/environments/charm/CHARM.4.8/converse.overview.ps.gz (28657 bytes) converse.overview.ps.gz /parallel/environments/charm/CHARM.4.8/convext.manual.ps.gz (137401 bytes) convext.manual.ps.gz /parallel/environments/charm/CHARM.4.8/install.manual.ps.gz (102856 bytes) install.manual.ps.gz /parallel/environments/charm/CHARM.4.8/itc++.manual.ps.gz (92935 bytes) itc++.manual.ps.gz /parallel/environments/charm/CHARM.4.8/itc++.quickref.ps.gz (63570 bytes) itc++.quickref.ps.gz /parallel/environments/charm/CHARM.4.8/net-sol-cc.tar.gz (1005286 bytes) net-sol-cc.tar.gz /parallel/environments/charm/Converse.4.7/ "Converse 4.7" /parallel/environments/charm/Converse.4.7/.nams-info/ .nams-info /parallel/environments/charm/Converse.4.7/.nams-info/status (2170 bytes) status /parallel/environments/charm/Converse.4.7/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/Converse.4.7/COPYRIGHT (2002 bytes) COPYRIGHT /parallel/environments/charm/Converse.4.7/CREDITS (519 bytes) CREDITS /parallel/environments/charm/Converse.4.7/README (1385 bytes) README /parallel/environments/charm/Converse.4.7/aboutCharm.ps.gz (14664 bytes) aboutCharm.ps.gz /parallel/environments/charm/Converse.4.7/charm++.manual.ps.gz (78008 bytes) charm++.manual.ps.gz /parallel/environments/charm/Converse.4.7/charm.manual.ps.gz (104848 bytes) charm.manual.ps.gz /parallel/environments/charm/Converse.4.7/charm.tutorial.ps.gz (61077 bytes) charm.tutorial.ps.gz /parallel/environments/charm/Converse.4.7/converse.manual.ps.gz (52394 bytes) converse.manual.ps.gz /parallel/environments/charm/Converse.4.7/convext.manual.ps.gz (46514 bytes) convext.manual.ps.gz /parallel/environments/charm/Converse.4.7/dagger.tutorial.ps.gz (30565 bytes) dagger.tutorial.ps.gz /parallel/environments/charm/Converse.4.7/dagtool.manual.ps.gz (27982 bytes) dagtool.manual.ps.gz /parallel/environments/charm/Converse.4.7/exemplar.tar.gz (999193 bytes) exemplar.tar.gz /parallel/environments/charm/Converse.4.7/install.manual.ps.gz (41160 bytes) install.manual.ps.gz /parallel/environments/charm/Converse.4.7/itc++.manual.ps.gz (28931 bytes) itc++.manual.ps.gz /parallel/environments/charm/Converse.4.7/net-hp-cc.tar.gz (1042923 bytes) net-hp-cc.tar.gz /parallel/environments/charm/Converse.4.7/net-hp.tar.gz (1660526 bytes) net-hp.tar.gz /parallel/environments/charm/Converse.4.7/net-irix-64.tar.gz (1203881 bytes) net-irix-64.tar.gz /parallel/environments/charm/Converse.4.7/net-irix.tar.gz (1528334 bytes) net-irix.tar.gz /parallel/environments/charm/Converse.4.7/net-linux.tar.gz (897260 bytes) net-linux.tar.gz /parallel/environments/charm/Converse.4.7/net-rs6k.tar.gz (753185 bytes) net-rs6k.tar.gz /parallel/environments/charm/Converse.4.7/net-sol-cc.tar.gz (1006144 bytes) net-sol-cc.tar.gz /parallel/environments/charm/Converse.4.7/net-sol-smp.tar.gz (1031860 bytes) net-sol-smp.tar.gz /parallel/environments/charm/Converse.4.7/net-sol.tar.gz (1001773 bytes) net-sol.tar.gz /parallel/environments/charm/Converse.4.7/net-sun.tar.gz (1017887 bytes) net-sun.tar.gz /parallel/environments/charm/Converse.4.7/origin2000.tar.gz (1190379 bytes) origin2000.tar.gz /parallel/environments/charm/Converse.4.7/projections.manual.ps.gz (64363 bytes) projections.manual.ps.gz /parallel/environments/charm/Converse.4.7/projections.tar.gz (74842 bytes) projections.tar.gz /parallel/environments/charm/Converse.4.7/sim-irix-64.tar.gz (1179505 bytes) sim-irix-64.tar.gz /parallel/environments/charm/Converse.4.7/sim-irix.tar.gz (1092874 bytes) sim-irix.tar.gz /parallel/environments/charm/Converse.4.7/sim-linux.tar.gz (859906 bytes) sim-linux.tar.gz /parallel/environments/charm/Converse.4.7/sim-rs6k.tar.gz (644767 bytes) sim-rs6k.tar.gz /parallel/environments/charm/Converse.4.7/sim-sol.tar.gz (952793 bytes) sim-sol.tar.gz /parallel/environments/charm/Converse.4.7/sim-sun.tar.gz (967963 bytes) sim-sun.tar.gz /parallel/environments/charm/Converse.4.7/sp3.tar.gz (1060417 bytes) sp3.tar.gz /parallel/environments/charm/Converse.4.7/summary.manual.ps.gz (18527 bytes) summary.manual.ps.gz /parallel/environments/charm/Converse.4.7/t3e.tar.gz (1897524 bytes) t3e.tar.gz /parallel/environments/charm/Converse.4.7/uth-hp-cc.tar.gz (1076285 bytes) uth-hp-cc.tar.gz /parallel/environments/charm/Converse.4.7/uth-hp.tar.gz (1053412 bytes) uth-hp.tar.gz /parallel/environments/charm/Converse.4.7/uth-irix-64.tar.gz (1198757 bytes) uth-irix-64.tar.gz /parallel/environments/charm/Converse.4.7/uth-irix.tar.gz (1060682 bytes) uth-irix.tar.gz /parallel/environments/charm/Converse.4.7/uth-linux.tar.gz (854494 bytes) uth-linux.tar.gz /parallel/environments/charm/Converse.4.7/uth-rs6k.tar.gz (661488 bytes) uth-rs6k.tar.gz /parallel/environments/charm/Converse.4.7/uth-sol-cc.tar.gz (932924 bytes) uth-sol-cc.tar.gz /parallel/environments/charm/Converse.4.7/uth-sol.tar.gz (947046 bytes) uth-sol.tar.gz /parallel/environments/charm/Converse.4.7/uth-sun.tar.gz (960982 bytes) uth-sun.tar.gz /parallel/environments/charm/README (457 bytes) README /parallel/environments/charm/abcpp/ abcpp /parallel/environments/charm/abcpp/.nams-info/ .nams-info /parallel/environments/charm/abcpp/.nams-info/status (102 bytes) status /parallel/environments/charm/abcpp/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/abcpp/abcpp.tar.Z (10468 bytes) abcpp.tar.Z /parallel/environments/charm/europar/ europar /parallel/environments/charm/europar/.nams-info/ .nams-info /parallel/environments/charm/europar/.nams-info/status (177 bytes) status /parallel/environments/charm/europar/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/europar/notes.ps (116553 bytes) notes.ps /parallel/environments/charm/europar/paper.ps (87514 bytes) paper.ps /parallel/environments/charm/europar/slides.ps (63116 bytes) slides.ps /parallel/environments/charm/old/ old /parallel/environments/charm/old/.nams-info/ .nams-info /parallel/environments/charm/old/.nams-info/status (465 bytes) status /parallel/environments/charm/old/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/ABOUT_CHARM.ps (47071 bytes) ABOUT_CHARM.ps /parallel/environments/charm/old/Eric.SP.Charm/ Eric.SP.Charm /parallel/environments/charm/old/Eric.SP.Charm/.nams-info/ .nams-info /parallel/environments/charm/old/Eric.SP.Charm/.nams-info/status (144 bytes) status /parallel/environments/charm/old/Eric.SP.Charm/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/Eric.SP.Charm/Charm.tar.gz (9145659 bytes) Charm.tar.gz /parallel/environments/charm/old/Eric.SP.Charm/Eric.Readme (500 bytes) Eric.Readme /parallel/environments/charm/old/LU.tar.gz (12073 bytes) LU.tar.gz /parallel/environments/charm/old/doc/ doc /parallel/environments/charm/old/doc/.nams-info/ .nams-info /parallel/environments/charm/old/doc/.nams-info/status (263 bytes) status /parallel/environments/charm/old/doc/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/doc/CharmManual.ps.Z (161861 bytes) CharmManual.ps.Z /parallel/environments/charm/old/doc/CharmPlusManual.ps.Z (117499 bytes) CharmPlusManual.ps.Z /parallel/environments/charm/old/doc/ProjectionsManual.ps.Z (98543 bytes) ProjectionsManual.ps.Z /parallel/environments/charm/old/doc/SummaryToolManual.ps.Z (28393 bytes) SummaryToolManual.ps.Z /parallel/environments/charm/old/ljp/ ljp /parallel/environments/charm/old/ljp/.nams-info/ .nams-info /parallel/environments/charm/old/ljp/.nams-info/status (122 bytes) status /parallel/environments/charm/old/ljp/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/ljp/max/ max /parallel/environments/charm/old/ljp/max/.nams-info/ .nams-info /parallel/environments/charm/old/ljp/max/.nams-info/status (145 bytes) status /parallel/environments/charm/old/ljp/max/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/ljp/max/max.tar.Z (359509 bytes) max.tar.Z /parallel/environments/charm/old/ljp/max/sources.tar.Z (526944 bytes) sources.tar.Z /parallel/environments/charm/old/papers/ papers /parallel/environments/charm/old/papers/.nams-info/ .nams-info /parallel/environments/charm/old/papers/.nams-info/status (126 bytes) status /parallel/environments/charm/old/papers/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/papers/interop/ interop /parallel/environments/charm/old/papers/interop/.nams-info/ .nams-info /parallel/environments/charm/old/papers/interop/.nams-info/status (149 bytes) status /parallel/environments/charm/old/papers/interop/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/papers/interop/converse1.ps.Z (62947 bytes) converse1.ps.Z /parallel/environments/charm/old/papers/interop/converse2.ps.Z (37082 bytes) converse2.ps.Z /parallel/environments/charm/old/tools/ tools /parallel/environments/charm/old/tools/.nams-info/ .nams-info /parallel/environments/charm/old/tools/.nams-info/status (467 bytes) status /parallel/environments/charm/old/tools/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/old/tools/Makefile.projections (847 bytes) Makefile.projections /parallel/environments/charm/old/tools/Makefile.summarytool (606 bytes) Makefile.summarytool /parallel/environments/charm/old/tools/README (992 bytes) README /parallel/environments/charm/old/tools/projections.hp.o (180224 bytes) projections.hp.o /parallel/environments/charm/old/tools/projections.solaris.o (229056 bytes) projections.solaris.o /parallel/environments/charm/old/tools/projections.sunos.o (244069 bytes) projections.sunos.o /parallel/environments/charm/old/tools/resource (96 bytes) resource /parallel/environments/charm/old/tools/summary.solaris.o (17532 bytes) summary.solaris.o /parallel/environments/charm/old/tools/summary.sunos.o (16843 bytes) summary.sunos.o /parallel/environments/charm/www/ www /parallel/environments/charm/www/.nams-info/ .nams-info /parallel/environments/charm/www/.nams-info/status (132 bytes) status /parallel/environments/charm/www/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/www/distrib.4.7/ distrib.4.7 /parallel/environments/charm/www/distrib.4.7/.nams-info/ .nams-info /parallel/environments/charm/www/distrib.4.7/.nams-info/status (1809 bytes) status /parallel/environments/charm/www/distrib.4.7/.nams-info/status.new-14662 (0 bytes) status.new-14662 /parallel/environments/charm/www/distrib.4.7/aboutCharm.ps.gz (14664 bytes) aboutCharm.ps.gz /parallel/environments/charm/www/distrib.4.7/charm.tutorial.ps.gz (60975 bytes) charm.tutorial.ps.gz /parallel/environments/charm/www/distrib.4.7/commercialUse.txt (461 bytes) commercialUse.txt /parallel/environments/charm/www/distrib.4.7/dagger.tutorial.ps.gz (30565 bytes) dagger.tutorial.ps.gz /parallel/environments/charm/www/distrib.4.7/dagtool.manual.ps.gz (27982 bytes) dagtool.manual.ps.gz /parallel/environments/charm/www/distrib.4.7/exemplar.tar.gz (999193 bytes) exemplar.tar.gz /parallel/environments/charm/www/distrib.4.7/net-hp-cc.tar.gz (1042923 bytes) net-hp-cc.tar.gz /parallel/environments/charm/www/distrib.4.7/net-hp.tar.gz (1660526 bytes) net-hp.tar.gz /parallel/environments/charm/www/distrib.4.7/net-irix-64.tar.gz (1203881 bytes) net-irix-64.tar.gz /parallel/environments/charm/www/distrib.4.7/net-irix.tar.gz (1528334 bytes) net-irix.tar.gz /parallel/environments/charm/www/distrib.4.7/net-linux.tar.gz (897260 bytes) net-linux.tar.gz /parallel/environments/charm/www/distrib.4.7/net-rs6k.tar.gz (753185 bytes) net-rs6k.tar.gz /parallel/environments/charm/www/distrib.4.7/net-sol-cc.tar.gz (1006144 bytes) net-sol-cc.tar.gz /parallel/environments/charm/www/distrib.4.7/net-sol-smp.tar.gz (1031860 bytes) net-sol-smp.tar.gz /parallel/environments/charm/www/distrib.4.7/net-sol.tar.gz (1001773 bytes) net-sol.tar.gz /parallel/environments/charm/www/distrib.4.7/net-sun.tar.gz (1017887 bytes) net-sun.tar.gz /parallel/environments/charm/www/distrib.4.7/origin2000.tar.gz (1190379 bytes) origin2000.tar.gz /parallel/environments/charm/www/distrib.4.7/projections.manual.ps.gz (64363 bytes) projections.manual.ps.gz /parallel/environments/charm/www/distrib.4.7/projections.tar.gz (74842 bytes) projections.tar.gz /parallel/environments/charm/www/distrib.4.7/sim-irix-64.tar.gz (1179505 bytes) sim-irix-64.tar.gz /parallel/environments/charm/www/distrib.4.7/sim-irix.tar.gz (1092874 bytes) sim-irix.tar.gz /parallel/environments/charm/www/distrib.4.7/sim-linux.tar.gz (859906 bytes) sim-linux.tar.gz /parallel/environments/charm/www/distrib.4.7/sim-rs6k.tar.gz (644767 bytes) sim-rs6k.tar.gz /parallel/environments/charm/www/distrib.4.7/sim-sol.tar.gz (952793 bytes) sim-sol.tar.gz /parallel/environments/charm/www/distrib.4.7/sim-sun.tar.gz (967963 bytes) sim-sun.tar.gz /parallel/environments/charm/www/distrib.4.7/sp3.tar.gz (1060417 bytes) sp3.tar.gz /parallel/environments/charm/www/distrib.4.7/summary.manual.ps.gz (18527 bytes) summary.manual.ps.gz /parallel/environments/charm/www/distrib.4.7/t3e.tar.gz (1897524 bytes) t3e.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-hp-cc.tar.gz (1076285 bytes) uth-hp-cc.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-hp.tar.gz (1053412 bytes) uth-hp.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-irix-64.tar.gz (1198757 bytes) uth-irix-64.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-irix.tar.gz (1060682 bytes) uth-irix.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-linux.tar.gz (854494 bytes) uth-linux.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-rs6k.tar.gz (661488 bytes) uth-rs6k.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-sol-cc.tar.gz (932924 bytes) uth-sol-cc.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-sol.tar.gz (947046 bytes) uth-sol.tar.gz /parallel/environments/charm/www/distrib.4.7/uth-sun.tar.gz (960982 bytes) uth-sun.tar.gz /parallel/environments/concert (7132 bytes) "Illinois Concert System V4.0" by Julian Dolby Concert is a parallel programming system for fine-grained object-oriented programming on parallel systems. Our goal is to enable portable and efficient programming using concurrent object-oriented programming (COOP) through compiler analysis and tranformation and runtime techniques. These techniques are particularly helpful for problems with irregular parallelism or complex data structures. See for more details. /parallel/environments/enterprise/ The Enterprise parallel programming system - an interactive graphical programming environment for designing, coding, debugging, testing and executing programs in a distributed hardware environment. Enterprise code looks like familiar sequential code because the parallelism is expressed graphically and independently of the code. The system automatically inserts the code necessary to correctly handle communication and synchronization, allowing the rapid construction of distributed programs. Uses either NMP or PVM as communications systems and contains binaries for SUN4, SGI and RS6K. The Enterprise parallel programming system - an interactive graphical programming environment for designing, coding, debugging, testing and executing programs in a distributed hardware environment. Enterprise code looks like familiar sequential code because the parallelism is expressed graphically and independently of the code. The system automatically inserts the code necessary to correctly handle communication and synchronization, allowing the rapid construction of distributed programs. Uses either NMP or PVM as communications systems and contains binaries for SUN4 and RS6K. /parallel/environments/enterprise/.nams-info/ .nams-info /parallel/environments/enterprise/.nams-info/status (556 bytes) status /parallel/environments/enterprise/.nams-info/status.new-14605 (0 bytes) status.new-14605 /parallel/environments/enterprise/00-INDEX (892 bytes) Index of files /parallel/environments/enterprise/00-README (7870 bytes) Installation instructions for Enterprise /parallel/environments/enterprise/Enterprise2.4.2-RS6K.tar.Z (2001109 bytes) Binaries for IBM RS6000 running AIX 3.2 /parallel/environments/enterprise/Enterprise2.4.2-SUN4.tar.Z (1898113 bytes) Binaries for SUN 4 running SunOS 4.1.3 /parallel/environments/enterprise/Enterprise2.4.2-common.tar.Z (131986 bytes) Shell scripts and include files common to all architectures /parallel/environments/enterprise/Enterprise2.4.2-smalltalk-src.tar.Z (214607 bytes) Enterprise Smalltalk source for user interface - runs under ParcPlace Systems Inc, VisualWorks Release 2.0 (not for SGIs). /parallel/environments/enterprise/Papers/ Papers by the Enterprise team /parallel/environments/enterprise/Papers/.nams-info/ .nams-info /parallel/environments/enterprise/Papers/.nams-info/status (198 bytes) status /parallel/environments/enterprise/Papers/.nams-info/status.new-14605 (0 bytes) status.new-14605 /parallel/environments/enterprise/Papers/enterprise.ps.Z (87169 bytes) ABSTRACT: Although a network of workstations represents a large amount of aggregate computing power, there is a need for software that can harness this power for single, distributed applications. Enterprise is an interactive graphical programming environment for designing, coding, debugging, testing, monitoring, profiling and executing programs in a distributed hardware environment. Enterprise code looks like familiar sequential code because the parallelism is expressed graphically and independently of the code. The system automatically inserts the code necessary to correctly handle communication and synchronization, allowing the rapid construction of distributed programs. The system supports load balancing and dynamic distribution of work in environments with changing resource utilization. This paper focuses on the Enterprise programming model and some experiences using it. /parallel/environments/enterprise/Papers/experiment.ps.Z (40173 bytes) ABSTRACT: This paper discusses an experiment to compare the usability of two parallel programming systems (PPS). In this experiment, (half of the students in a graduate parallel and distributed computing course solved a problem using the Enterprise PPS while the other half solved the same problem using a PVM-like library of message-passing routines. The feedback fromsuchexperiments is necessary to help narrow the gap between what parallel programmers want, and what current PPSs provide. /parallel/environments/enterprise/Papers/performance.ps.Z (110635 bytes) ABSTRACT: Selecting a distributed communication system is a balancing act. Ease of use, efficiency of the final product, and future needs are not mutually exclusive considerations. Several questions spring to mind immediately. Whatare the requirements of the communication system? What is available to use? What are the requirements of the user? Software engineers desire software to have clean interfaces and to make any internal details inaccessible to the other components. Performance users want the software to be scalable, efficient, and easy to use, read, and debug. This paper examines four communication systems (ISIS, NMP, PVM, Concert C from these two points of view. Several programs designed to test the performance of the communication system are used as examples for comparing features. These programs are neither definitive test programs nor do they have complicated communication structures. Rather, they are used to highlight potential problem areas and implementation differences. All four of these communication systems are being evaluated for the Enterprise project. Enterprise is a programming environment for developing and running distributed parallel programs on a network of workstations. Enterprise, using templates and a precompiler, constructs a software layer around the application. The user is shielded from the tiresome low-level details of hand crafting the distributed communication portion of the application. Other software tools within Enterprise manage and monitor the distributed program. For two of the comm unication systems (ISIS and NMP) the code was created using Enterprise. The other two systems (PVM and Concert/C) are compared using handcrafted code. A comparision between the Enterprise code and handcrafted code is done using NMP. /parallel/environments/enterprise/UserManualTR95-02.ps.Z (511941 bytes) Enterprise v2.4.2 user manual /parallel/environments/enterprise/enterprise-patch-SUN4SOL2.tar.Z (2382425 bytes) Binaries for SUN 4 running Solaris 2.x "LAM / MPI" Developed by Ohio Supercomputer Center, Now maintained at Notre Dame University, and the relevant files can be found at "PARDI" by Jon Powell , The Maltings, Charlton Rd, Shepton Mallet, Somerset, BA4 5QE, UK; Tel: +44 1749 344345; FAX: +44 1749 344977 The PARDI software enables mixed networks of Windows and UNIX computers to work in parallel. Standard toolkits such as PVM run on top of PARDI's high performance message passing and resource control software. PARDI message latency is approximately half that of public domain PVM. The software can be downloaded free of charge from the Perihelion web site. /parallel/environments/mpi/ MPI (Message Passing Initiative) software "Introduction to Message Passing with MPI" by hpc-staff@mcc.ac.uk The Manchester and North High Performance Computing Training & Education Centre (MAN-T&EC) has developed this course for students to use the MPI message passing system, building on the introductory course with code examples and case studies. This course is freely available to academics and has been developed for lecturers to pick up and use in their own lectures. The development of this course was funded under the JISC New Technologies Initiative. Materials available include: course syllabus and overhead masters. "MPI Implementations list" by Greg Burns A list of publically available MPI Implementations maintained by OSC. Contains additional MPI information, bibliographies and materials. /parallel/environments/mpi/mpi-io.announce (973 bytes) "MPI-IO: A Parallel File I/O Interface for MPI" by Bill Nitzberg Announcement of MPI-IO, a proposed standard interface for parallel I/O (reading and writing files from parallel applications) which provides a high-level interface to describe the partitioning of file data among processes, a collective interface describing complete transfers of global data structures between process memories and files, full support for asynchronous I/O operations, and a hints interface for supporting machine dependent optimizations. See also /parallel/environments/mpi/nec-mpi-tests (2930 bytes) "NEC simple MPI test programs" by Hiroyuki ARAKI A collection of simple test programs for MPI NEC have been using to test out their MPI implementation. /parallel/environments/mpi/oompi.announce (1467 bytes) "Object Oriented MPI" (OOMPI) by Jeff Squyres A full-featured class library for MPI (1.1) from Laboratory for Scientific Computing of the Department of Computer Science and Engineering at the University of Notre Dame. Provides full MPI-1.1 functionality; implemented as a thin layer on top of the C MPI bindings; offers convienent and intuitive object-oriented abstractions for message passing and uses many of the powerful semantic features of the C++ language, such as data typing, polymorphism, etc. See /parallel/environments/mpi/para++.announce (1407 bytes) "Para++: C++ Bindings for Message Passing Libraries" by Eric Dillon The aim of Para++ is to provide C++ bindings to use any message passing library. With it, the use of Message Passing libraries is simplified and more attractive, without significant performances lost. Para++ is implemented with MPI. See also "MPI Standard materials" /parallel/environments/mpi/unify/ "UNIFY" patches to PVM 3.2+ to provide a subset of MPI under PVM /parallel/environments/mpi/unify/distribution/ UNIFY Distribution area /parallel/environments/mpi/unify/distribution/.nams-info/ .nams-info /parallel/environments/mpi/unify/distribution/.nams-info/status (746 bytes) status /parallel/environments/mpi/unify/distribution/.nams-info/status.new-14630 (0 bytes) status.new-14630 /parallel/environments/mpi/unify/distribution/FAQ (420 bytes) UNIFY Frequently asked questions /parallel/environments/mpi/unify/distribution/LOG (373 bytes) Change log /parallel/environments/mpi/unify/distribution/PATCH (550 bytes) Information on patching earlier Unify version /parallel/environments/mpi/unify/distribution/README (2262 bytes) File and contact information /parallel/environments/mpi/unify/distribution/patpvm3.2.0.tar.Z (1254571 bytes) Four versions of PVM, patched for use with Unify [compressed tar] /parallel/environments/mpi/unify/distribution/patpvm3.2.6.tar.Z (1640203 bytes) Four versions of PVM, patched for use with Unify [compressed tar] /parallel/environments/mpi/unify/distribution/patpvm3.3.0.tar.Z (1091725 bytes) Four versions of PVM, patched for use with Unify [compressed tar] /parallel/environments/mpi/unify/distribution/patpvm3.3.2.tar.Z (1344849 bytes) Four versions of PVM, patched for use with Unify [compressed tar] /parallel/environments/mpi/unify/distribution/unify.0.9.1.2.tar.Z (99553 bytes) Old Unify system tar files /parallel/environments/mpi/unify/distribution/unify.0.9.1.ps (611777 bytes) unify.0.9.1.ps /parallel/environments/mpi/unify/distribution/unify.ps (601097 bytes) unify.ps /parallel/environments/mpi/unify/distribution/unify.tar.Z (167619 bytes) UNIFY distribution (compressed tar file) /parallel/environments/mpi/unify/distribution/unipat3.2.0.tar.Z (4057 bytes) Four versions of patch files for patching PVM to work with Unify. [compressed tar] /parallel/environments/mpi/unify/distribution/unipat3.2.6.tar.Z (4163 bytes) Four versions of patch files for patching PVM to work with Unify. [compressed tar] /parallel/environments/mpi/unify/distribution/unipat3.3.0.tar.Z (4279 bytes) Four versions of patch files for patching PVM to work with Unify. [compressed tar] /parallel/environments/mpi/unify/distribution/unipat3.3.2.tar.Z (4318 bytes) Four versions of patch files for patching PVM to work with Unify. [compressed tar] /parallel/environments/mpi/unify/reports/ Mississippi State University reports /parallel/environments/mpi/unify/reports/Applications/ Applied parallel processing /parallel/environments/mpi/unify/reports/Applications/early_apps_mpi.ps.Z (76431 bytes) "Early Applications in the Message-Passing Interface (MPI)" by Anthony Skjellum, MS-State University; Ewing Lusk, ANL and William Gropp, ANL. ABSTRACT: In this paper, we describe a number of early efforts to make use of the Message Passing Interface (MPI) standard in real applications. An informal survey, described herein, was posted by the authors on common USENet groups as well as to common MPI mailing lists. The responses contained here represent all but one the responses received; it is not exhaustive, but rather represents those researchers who were willing to respond during a limited period of time (about two weeks). Rather than a definitive statement of MPI development work, this paper restricts itself to describing the initial successes, progress, and impressions of application developers have with MPI, according to the responses received (many other projects, not described here, are also evidently on-going). An understanding of message-passing, and access to the MPI standard are prerequisites for appreciating this paper. We summarize the important aspects of each response, and draw conclusions about the spread of MPI into applications. Clearly, studying the state of MPI application development is on-going: here, we demonstrate that it is well underway, and that it has breadth in the type of applications, and the target architectures. /parallel/environments/mpi/unify/reports/Message-Passing/ Zipcode, MPI, PVM, and their uses /parallel/environments/mpi/unify/reports/Message-Passing/Elros_paper1_26mar94.ps.Z (92873 bytes) "Collective Operations Using ELROS and Sockets" by Kishore Viswanathan and Anthony Skjellum. ABSTRACT: ELROS, an acronym for Embedded Language for Remote Operation Services, was developed at LLNL for programming distributed applications. ELROS statements can be embedded in a conventional language such as C. This makes it easier to develop distributed applications. ELROC supports both synchronous and asynchronous operations. ELROC also provides a good exception handling facility. Although ELROS provides a good programming interface, it does not provide primitives for collective operations. In this paper we present some of the collective operations that were writting using ELROS. We also present programs to demonstrate how these operations can be implemented using sockets. Advantages and disadvantages of using ELROS over sockets are also discussed. /parallel/environments/mpi/unify/reports/Message-Passing/PVM-v-MPI-round1.ps.Z (22671 bytes) "Message Passing in the 1990's: Performance, Safety, Correctness" by Anthony Skjellum, Mississippi State University, USA and Brian K. Grant, U. Washington. Contains: Origins of Message Passing, Evolution and comparison of PVM with MPI. /parallel/environments/mpi/unify/reports/Message-Passing/extendmpi.ps.Z (211341 bytes) "Extending the Message Passing Interface (MPI)" by Anthony Skjellum; Nathan E. Doss; Kishore Viswanathan and Aswini Chowdappa. Bangalore Computer Science Department and NSF Engineering Research Center Mississippi State University, USA. ABSTRACT: MPI is the de facto message passing standard for multicomputers and networks of workstations, established by the MPI Forum, a group of universities, research centers, and national laboratories (from both the United States and Europe), as well as multinational vendors in the area of high performance computing. MPI has been implemented already by several groups. Worldwide acceptance of MPI has been quite rapid. This paper overviews several areas in which MPI can be extended, discusses the merits of making such extensions, and begins to demonstrate how some of these extensions can be made. In some areas, such as intercommunicator extensions, significant progress has been made by us already. In other areas (such as remote memory access), we are merely proposing extensions to MPI that we have not yet reduced to practice. Furthermore, we point out that other researchers are evidently working in parallel with us on their own extension concepts for MPI. /parallel/environments/mpi/unify/reports/Message-Passing/mpix-rev1.ps.Z (185927 bytes) "Inter-communicator Extensions to MPI in the MPIX (MPI eXtension) Library" by Anthony Skjellum; Nathan E. Doss and Kishore Viswanathan. Bangalore Computer Science Department and NSF Engineering Research Center Mississippi State University, USA. ABSTRACT: MPI is the new standard for multicomputer and cluster message passing introduced by the Message-Passing Interface Forum (MPIF) in April 1994. This paper describes the current inter-communicator interface found in MPI and the reasons for its current design. We also motivate the need for additional inter-communicator operations and introduce the extensions we have included in MPIX (MPI eXtension Library), a library of extensions to MPI that we are currently developing. Inter-communicators may be used for a variety of purposes such as in client/server applications (i.e., I/O and graphics servers) and for process management in dynamic process environments and multi-protocol implementations; MPI's definitions are unnecessarily restrictive, so we extend them here. We discuss the inter-communicator collective operations defined in MPIX and illustrate their use. We also discuss additional inter-communicator construction routines not in the original MPI interface, but that are provided in MPIX. Our final contribution is a strategy for extending virtual topologies to support inter-communicators with the MPIX inter-communicator library. /parallel/environments/mpi/unify/reports/Message-Passing/oon-ski94.ps.Z (71223 bytes) oon-ski94.ps.Z /parallel/environments/mpi/unify/reports/Message-Passing/p4-mpi-pthreads.ps.Z (93307 bytes) "Thread-Safe Message Passing With P4 and MPI" by Aswini K. Chowdappa; Anthony Skjellum and Nathan E. Dossy. Computer Science and NSF Engineering Research Center for Computational Field Simulationy, Mississippi State University, USA. ABSTRACT: P4 (Portable Programs for Parallel Processors) is a popular message passing system. The Pthreads library is a POSIX-standard implementation that supports multiple flows of control, called `threads' within a process. MPI(Message Passing Interface) is the emerging message passing system which will soon be the industry standard system. This paper illustrates using multiple threads within the P4 processes and thread-safe message passing. It also describes the various issues that have to be looked into when dealing with the two packages (P4 and Pthreads). We demonstrate thread-safe message passing by means of some test programs. Finally we identify areas where MPI is potentially unsafe in a multithreaded environment. We delve into the details of these issues and discuss introducing multi-threaded message passing into the MPICH implementation in the near feature. /parallel/environments/mpi/unify/reports/Message-Passing/pvm_short.ps.Z (146091 bytes) pvm_short.ps.Z /parallel/environments/mpi/unify/reports/Message-Passing/unify_frontiers95.ps.Z (84497 bytes) "Migrating from PVM to MPI I.: The Unify System" by Vaughan; Skjellum ; Reese and Cheng. Mississippi State University, NSF Engineering Research Center for Computational Field Simulation & Department of Computer Science. ABSTRACT: This paper presents a new kind of portability system, Unify, which modifies the PVM message passing system to provide (currrently a subset of) the Message Passing Interface (MPI) standard notation for message passing. Unify is designed to reduce the effort of learning MPI while providing a sensible means to make use of MPI libraries and MPI calls while applications continue to run in the PVM environment. We are convinced that this strategy will reduce the costs of porting completely to MPI, while providing a gradual environment within which to evolve. Furthermore, it will permit immediate use of MPI-based parallel libraries in applications, even those that use PVM for user code. We describe several paradigms for supporting MPI and PVM message passing notations in a single environment, and note related work on MPI and PVM implementations. We show the design options that existed within our chosen paradigm (which is an MPI interface added to the base PVM system), and why we chose that particular approach. We indicate the total evolution path of porting a PVM application to MPI with the help of porting libraries. Finally, we indicate our current directions and planned future work. /parallel/environments/mpi/unify/reports/Message-Passing/unify_frontiers95_short.ps.Z (16384 bytes) A shorter version of the above paper (?). /parallel/environments/mpi/unify/reports/Message-Passing/zipcode_parcomp.ps.Z (215547 bytes) "The Design and Evolution of Zipcode" by Anthony Skjellum, Chemical Engineering, California Institute of Technology, USA; Steven G. Smith, NSF Engineering Research Center for Computational Field Simulation, Mississippi State University, USA; Nathan E. Doss; Alvin P. Leung, Northeast Parallel Architectures Center, Syracuse University, USA and Manfred Morari. ABSTRACT: Zipcode is a message-passing and process-management system that was designed for multicomputers and homogeneous networks of computers in order to support libraries and large-scale multicomputer software. The system has evolved significantly over the last five years, based on our experiences and identified needs. Features of Zipcode that were originally unique to it, were its simultaneous support of static process groups, communication contexts, and virtual topologies, forming the "mailer" data structure. Point-to-point and collective operations reference the underlying group, and use contexts to avoid mixing up messages. Recently, we have added "gather-send" and "receive-scatter" semantics, based on persistent Zipcode "invoices," both as a means to simplify message passing, and as a means to reveal more potential runtime optimizations. Key features in Zipcode appear in the forthcoming MPI standard. /parallel/environments/mpi/unify/reports/Message-Passing/zipcode_pvm.ps.Z (67013 bytes) "Integrating Zipcode and PVM: Towards a Higher-Level Message-Passing Environment" by Li-wei H. Lehman, NSF Engineering Research Center for Computational Field Simulation, Mississippi State University, Mississippi State, Mississippi, 39762, USA. 1993 ABSTRACT: This paper describes the architecture and implementation of an integrated message-passing environment consisting of Zipcode and PVM. Zipcode is a highlevel message-passing system for multicomputers and homogeneous networks of computers. PVM is a relatively low-level message-passing system designed for multicomputers and heterogeneous networks of computers. Although PVM provides a workable and easyto-use message-passing system, it does not have some of the high-level constructs, such as communication contexts, required to develop reliable and scalable parallel libraries and large-scale distributed software. By porting Zipcode's high-level constructs on top of PVM, the integrated environment facilitates existing PVM applications to gradually migrate from a low-level to a high-level message-passing paradigm. In the integrated environment described here, Zipcode is ported on top of PVM via an intermediate layer, the emulated Cosmic Environment/Reactive Kernel (CE/RK) layer. Such an integrated environment allows programmers to utilize high-level Zipcode constructs as well as low-level PVM calls. Implementation details of the CE/RK primitives are presented. Planned future enhancements include performance improvement of the integrated system as well as adding heterogeneous environment support. /parallel/environments/mpi/unify/reports/OO/ All things object-oriented and object-based /parallel/environments/mpi/unify/reports/OO/pooma_issues_paper.ps.Z (31455 bytes) "POOMA 94 : Issues and Views" by Aswini K. Chowdappa, Department of Computer Science & NSF Engineering Research Center for Computational Field Simulation, Mississippi State University, USA and Anthony Skjellum. ABSTRACT: This paper summarizes and organizes the views expressed and the issues discussed by a broad cross section of the participants at the workshop on Parallel Object-Oriented Methods and Applications (POOMA) held in Santa Fe, New Mexico between Dec 5-7, 1994 [11]. About 6 years after the first C++ conference, object-oriented programming (OOP) and its relevance to large-scale applications was discussed at this workshop. The special focus was on the effectiveness of OOP methodology in terms of performance when coupled with the parallel programming paradigm. /parallel/environments/mpi/unify/reports/OO/ppuc_mpi++.ps.Z (236551 bytes) "Explicit Parallel Programming in C++ based on the Message-Passing Interface (MPI)" by Anthony Skjellum; Ziyang Lu; Purushotham V. Bangalore and Nathan Doss. Department of Computer Science and NSF Engineering Research Center for Computational Field Simulation, Mississippi State, MS 39762, USA. ABSTRACT: Explicit parallel programming using the Message Passing Interface (MPI), a de facto standard created by the MPI Forum, is quickly becoming the strategy of choice for performance-portable parallel application programming on multicomputers and networks of workstations, so it is inevitably of interest to C++ programmers who use such systems. MPI programming is currently undertaken in C and/or Fortran-77, via the language bindings defined by the MPI Forum. While the committee deferred the job of defining a C++ binding for MPI to MPI-2, it is already possible to develop parallel programs in C++ using MPI, with the added help of one of several support libraries. These systems all strive to enable immediate C++ programming based on MPI. The first such enabling system, MPI++, is the focus of this chapter. MPI++ was an early effort on our part to let us leverage MPI while programming in C++. Here this system is, to a large extent, our vehicle to illustrate the value added of C++ in a message passing environment and, conversely, the value of MPI towards parallel programming with C++. We will be describing a performance-conscious alternative to exploit parallelism with C++ without the benefit of a portable, mature compiler environment suitable for a network of workstations or massively parallel computer. We emphasize performance, portability, good performance and good portability at the same time, and good design issues throughout, and that will put constraints on how eagerly we exploit certain features of C++ when creating our parallel environment on top of MPI. /parallel/environments/mpi/unify/reports/README (374 bytes) Overview /parallel/environments/mpi/unify/reports/Toolbox/ Parallel libraries /parallel/environments/mpi/unify/reports/Toolbox/fsss93_01sep93.ps.Z (133948 bytes) fsss93_01sep93.ps.Z /parallel/environments/mpi/unify/reports/Toolbox/hicss27_01aug93.ps.Z (85991 bytes) hicss27_01aug93.ps.Z /parallel/environments/mpi/unify/reports/Toolbox/hicss27_short.ps.Z (72969 bytes) hicss27_short.ps.Z /parallel/environments/mpi/unify/reports/Toolbox/hpdc2.ps.Z (56972 bytes) hpdc2.ps.Z /parallel/environments/mpi/unify/reports/Toolbox/mpi_libraries.ps.Z (86981 bytes) mpi_libraries.ps.Z /parallel/environments/mpi/unify/reports/Toolbox