P. Hipes, T. Mattson, Mark Y.-S. Wu, A. Kuppermann
{"title":"Chemical reaction dynamics: integration of coupled sets of ordinary differential equations on the Caltech hypercube","authors":"P. Hipes, T. Mattson, Mark Y.-S. Wu, A. Kuppermann","doi":"10.1145/63047.63059","DOIUrl":"https://doi.org/10.1145/63047.63059","url":null,"abstract":"Use of the Caltech/JPL hypercube multicomputer to solve problems in chemical dynamics is the subject of this paper. The specific application is quantum mechanical atom diatomic molecule reactive scattering. One methodology for solving this dynamics problem on a sequential computer is based on symmetrized hyperspherical coordinates. We will discuss our strategy for implementing the hyperspherical coordinate methodology on the hypercube. In particular, the performance of a parallel integrator for the special system of ordinary differential equations which arises in this application is discussed.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125011572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Collective steropsis on the hypercube","authors":"R. Battiti","doi":"10.1145/63047.63053","DOIUrl":"https://doi.org/10.1145/63047.63053","url":null,"abstract":"A cooperative algorithm for extracting disparity information from stereo image pairs has been implemented on the NCUBE hypercube computer.\u0000Software is written in C-langauge, using communication routines of the “Crystalline Operating System” CrOSIII designed at Caltech within the Caltech Concurrent Computation Program. Some tests have been done using Julesz's random-dot stereograms.\u0000Although the software is reasonably versatile and can be easily adapted for different flavors of stereo algorithms, the method used is that presented by Marr and Poggio [REF.1].\u0000As a preliminary stage for the stereo matching problem, a “filtering” program to extract physically meaningful primitives from images of a given scene has been written and tested on various types of images.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122485081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of Ray tracing on the hypercube","authors":"D. Orcutt","doi":"10.1145/63047.63074","DOIUrl":"https://doi.org/10.1145/63047.63074","url":null,"abstract":"This preliminary report presents one implementation of a ray tracing system. The ray tracing system was divided and distributed onto the hypercube based on the data to be processed. The implementation which includes a dynamic load balancing scheme will be shown to be very efficient for large scenes.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121269749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic computational geometry on parallel computers","authors":"L. Boxer, Russ Miller","doi":"10.1145/63047.63075","DOIUrl":"https://doi.org/10.1145/63047.63075","url":null,"abstract":"This paper surveys our parallel algorithms for determining geometric properties of systems of moving objects. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. The models of computation include the CREW PRAM, mesh, and hypercube.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117262146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Andrew Witkowski, Kumar Chandrakumar, Greg Macchio
{"title":"Concurrent I/O system for the hypercube multiprocessor","authors":"Andrew Witkowski, Kumar Chandrakumar, Greg Macchio","doi":"10.1145/63047.63096","DOIUrl":"https://doi.org/10.1145/63047.63096","url":null,"abstract":"This paper describes the Concurrent I/O (CIO) system for the Hypercube Multiprocessor. Our system has three components: Architecture, User Interface, and Programming Paradigm. The architecture of the system is based on clusters. Each cluster has a hypercube topology and contains either computing nodes or I/O nodes. This architecture scales well, provides a convenient naming convention and offers independent connectivity between the I/O nodes. The routing algorithm confines the I/O traffic within the I/O clusters. Clusters can be connected in a variety of ways suitable for such diverse applications as graphics and database systems. The system provides a programming paradigm where several nodes of a multiprocessor can cooperate on creating a file.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127499296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of the conjugate gradient algorithm on a vector hypercube multiprocessor","authors":"C. Aykanat, F. Özgüner, D. Scott","doi":"10.1145/63047.63127","DOIUrl":"https://doi.org/10.1145/63047.63127","url":null,"abstract":"In this paper, parallel implementation and vectorization of the Scaled Conjugate Gradient (SCG) algorithm for the solution of large sparse linear system of equations, on a vector hypercube multiprocessor (iPSC- VX), is described. Computations in the SCG algorithm consist mainly of matrix operations that can be vectorized and are implemented on the Vector Processor on each node of the hypercube. The implementation described here achieves efficient parallelization by overlapping vectorized computations with inter-node communication. A speed-up of 58 over a µVax II is obtained for large finite element meshes.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The fast Hartley transform on the hypercube multiprocessors","authors":"Xinming Lin, Tony F. Chart, W. Karplus","doi":"10.1145/63047.63101","DOIUrl":"https://doi.org/10.1145/63047.63101","url":null,"abstract":"The Fast Hartley Transform is a promising alternative to the Fast Fourier Transform when the processed data are real numbers. The hypercube implementation of the FHT is largely dependent on the way the computation is partitioned. A partitioning algorithm is presented which generates evenly-loaded tasks on each node and demands only a regular communication topology — the Hartley graph. Mapping from the Hartley graph to the Gray graph (binary n-cube) is straightforward, since the Hartley graph has a similar structure as the Gray graph. However, the communication is not always between the nearest neighbors and thus may take some extra time. Moreover, the slowness of the communication in the presently available architectures imposes a limitation on the speedup when a large number of processors are used.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"20 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129102297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ADAMS interface language","authors":"J. Pfaltz, S. Son, J. French","doi":"10.1145/63047.63094","DOIUrl":"https://doi.org/10.1145/63047.63094","url":null,"abstract":"Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specfic permission.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127737909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluation of a vector hypercube for seismic modelling","authors":"R. Renaut, J. Petersen","doi":"10.1145/63047.63072","DOIUrl":"https://doi.org/10.1145/63047.63072","url":null,"abstract":"Seismic modelling to produce realistic seismic traces is a computationally intensive problem. A 2D synthetic wave propagation code using explicit finite differences with absorbing boundary conditions has been implemented on an Intel Hypercube with 32 processors. The algorithm is highly parallel with good load balancing between processors and speed up proportional to the number of processors being used. A vectorised version of the code has been used to evaluate the performance of the Intel IPSC-VX 5d vector hypercube. Mflop rates up to 71 are achieved.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131438459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Polymer simulation on the hypercube","authors":"H. Ding","doi":"10.1145/63047.63058","DOIUrl":"https://doi.org/10.1145/63047.63058","url":null,"abstract":"The Monte Carlo simulation of a model polymer is implemented on the Mark III Hypercube computer under the CROS operating system. The polymer model and the simulation method are discussed. The key features of the implementation are given. The results show that hypercube computers are well suited for the polymer simulations.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132985225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}