{"title":"HyperC: portable parallel programming in C","authors":"P. Clermont, N. Paris","doi":"10.1109/IPPS.1994.288230","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288230","url":null,"abstract":"We introduce the HyperC language, a data parallel extension of C intended for portability over a wide range of architectures. We present the main topics of the language: the explicit parallelism through the data, the synchronous semantics and the parallel flow control that allows asynchronous execution, new function qualifiers to emphasize locality properties code and, finally, new communication techniques to allow overlap of communications and computations even for irregular computations. All these features are discussed with respect to portability and code reusability issues.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124460863","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 Oracle media server for nCUBE massively parallel systems","authors":"R. Buck","doi":"10.1109/IPPS.1994.288232","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288232","url":null,"abstract":"Information users today are hampered by inadequate access to the information they want and need broadcast and cable TV offer inflexible scheduling, while dial-up services are still fairly primitive, offering poor visual quality and arcane user interfaces. Videotape rental is time consuming and frustrating, and on-line shopping is in its infancy. The network infrastructure now exists to deliver vastly improved versions of these services. What has been lacking is a server system sophisticated enough to cost effectively pump information to the delivery networks. Together, Oracle and nCUBE provide a high-performance, cost-effective solution that enables information providers and users to realize the benefits of interactive multimedia services.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045657","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 MasPar scalable Unix I/O system","authors":"J. Nickolls","doi":"10.1109/IPPS.1994.288272","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288272","url":null,"abstract":"Scalable parallel computers require I/O balanced with computational power to solve data-intensive problems. Distributed memory architectures call for I/O hardware and software beyond those of conventional scalar systems. This paper introduces the MasPar I/O system, designed to provide balanced and scalable data-parallel Unix I/O. The architecture and implementation of the I/O hardware and software are described. Key elements include parallel access to conventional Unix file descriptors and a self-routing multistage network coupled with a buffer memory for flexible parallel I/O transfers. Performance measurements are presented for parallel Unix I/O with a scalable RAID disk array, a RAM disk, and a HIPPI interconnect.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"247 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133969732","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":"High performance Fortran on workstation farms","authors":"M. Annaratone, Carl D. Offner, D. Loveman","doi":"10.1109/IPPS.1994.288233","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288233","url":null,"abstract":"Workstation farms are primarily used in single-threaded batch jobs, but there is a growing community of users interested in using farms as \"degenerate\" MPP systems. The lack of stable system software has stalled the growth of the MPP market, and \"parallel\" farms may potentially follow the same fate. We believe that high performance Fortran is the right answer to the needs of the parallel programming community. The paper discusses workstation farms and focuses on the HPF language and compiler.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126604736","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":"Panel: program portability across parallel architectures SIMD/MIMD/SPMD/shared/distributedspl hellip/","authors":"M. Wolfe","doi":"10.1109/IPPS.1994.288234","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288234","url":null,"abstract":"How can a user write a program to be portable and efficient across widely different parallel architectures, such as SIMD, MIMD, shared-memory, distributed memory, workstation clusters, etc.? The following issues are considered: what language should be used; how appropriate is one language for different applications; how efficient can a portable program be; and how will efficiency be achieved.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116360289","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":"Synchronous bus arbitration with constant logic per module","authors":"H. Alnuweiri","doi":"10.1109/IPPS.1994.288321","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288321","url":null,"abstract":"A novel technique for distributed synchronous bus arbitration is presented. The proposed scheme is based on two orthogonal arbitration functions, one that employs bounded-weight binary codes, and another that employs unitary codes. This scheme trades off bus-width with arbitration-time and arbitration logic per device, such that both arbitration time and arbitration logic (per device) can be reduce by increasing bus width. Alternatively, this method allows the number of devices connected to a bus to be increased without changing the arbitration logic of each device (or the number of arbitration steps), only the width of the arbitration bus must be increased in this case.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115309893","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":"Accommodating polymorphic data decompositions in explicitly parallel programs","authors":"Calvin Lin, L. Snyder","doi":"10.1109/IPPS.1994.288317","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288317","url":null,"abstract":"Explicitly parallel programs have the potential for greater performance than their implicitly parallel counterparts. However, this benefit can be accompanied by additional programming difficulties. We address one particular problem that has implications for both scalability and portability: the need for programs do accommodate diverse data decompositions. We explain why programs with explicit communication have difficulties in handling changes in data decomposition, and we present a solution to this problem which involves the notions of derivative functions and configuration parameters. We illustrate the technique by using three different data decompositions to solve the Modified Gram-Schmidt method on four parallel machines.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415942","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":"A parallel algorithm for computing polygon set operations","authors":"R. Karinthi, K. Srinivas, G. Almási","doi":"10.1109/IPPS.1994.288312","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288312","url":null,"abstract":"We present a parallel algorithm for performing Boolean set operations on generalized polygons that have holes in them. The intersection algorithm has a processor complexity of O(m/sup 2/n/sup 2/) processors and a time complexity of O(max(2logm, log/sup 2/n)), where m is the maximum number of vertices in any loop of a polygon, and n is the maximum number of loops per polygon. The union and difference algorithms have a processor complexity of O(m/sup 2/n/sup 2/) and time complexity of O(logm) and O(2logm, logn) respectively. The algorithm is based on the EREW PRAM model. The algorithm tries to minimize the intersection point computations by intersecting only a subset of loops of the polygons based on of their topological relationships.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114909071","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":"Estimation of nested loops execution time by integer arithmetic in convex polyhedra","authors":"N. Tawbi","doi":"10.1109/IPPS.1994.288298","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288298","url":null,"abstract":"Estimating the execution time of nested loops or the volume of data transferred between processors is necessary to make appropriate processor or data allocation. To achieve this goal one need to estimate the execution time of the body and thus the number of nested loop iterations. This work could be a preprocessing step in an automatic parallelizing compilers to enhance the performance of the resulting parallel program. A bounded convex polyhedron can be associated with each loop nest. The number of its integer points corresponds to the iteration space size. In this paper, we present an algorithm that approximates this number. The algorithm is not restricted to a fixed dimension. The worst case complexity of the algorithm is infrequently reached in our context where the nesting level is rather small and the loop bound expressions are not very complex.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114054919","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":"Massively parallel algorithms for solution of the Schrodinger equation","authors":"A. Fijany, J. Barhen, N. Toomarian","doi":"10.1109/IPPS.1994.288254","DOIUrl":"https://doi.org/10.1109/IPPS.1994.288254","url":null,"abstract":"Time-parallel algorithms for solution of the Schrodinger equation are developed. By using the Crank-Nicolson method, it is shown that the solution of the problem can be fully parallelized in time, leading to a massive temporal parallelism in the computation with a minimum of communication and synchronization requirements. Our results clearly indicate that the Crank-Nicolson method, in addition to its excellent numerical properties, is also highly suitable for massively parallel computation.<<ETX>>","PeriodicalId":258702,"journal":{"name":"Proceedings of 8th International Parallel Processing Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116843565","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}