{"title":"Concurrent message passing in communicating sequential processes","authors":"M. Ahuja, K. Varadhan, Amitabh Sinha","doi":"10.1109/PARBSE.1990.77119","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77119","url":null,"abstract":"The authors examine a model of concurrency among concurrent sequential processes with asynchronous message sending done using ordinary and FLUSH message passing primitives. Using two paradigms, the authors show that FLUSH primitives permit more accurate modeling of problem situations than synchronous message passing. They also show that FLUSH message passing primitives allow for a greater concurrency in message passing than synchronous message passing primitives. An implementation of the primitives using counters is outlined.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115628568","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 view based near optimal design of pointer access structures in relational databases","authors":"T. Gundem, E. Ecklund","doi":"10.1109/PARBSE.1990.77205","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77205","url":null,"abstract":"A methodology for choosing pointer access structures for a relational database is proposed. The methodology is based on the usage patterns of the database that are represented as views. The pointer access structures can be simple access structures, such as circular chains, pointer indexes, chains, and tree indexes, as well as compound access structures, such as a tree index pointing to a set of pointer indexes.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115892479","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 machine-independent approach to parallel programming","authors":"G. Riccardi, B. Traversat, U. Chandra","doi":"10.1109/PARBSE.1990.77165","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77165","url":null,"abstract":"A multitasking model for specifying parallelism in a machine-independent fashion is described. Parallel programs are decomposed into a set of concurrent tasks which work on local or shared data. The computation of a task is described as the computation of atomic actions or activities. Software tools translate multitasking specifications into a parallel representation of the program. A master-slaves execution model is used to provide machine independence, reliability, and load-balanced execution on a variety of parallel architectures. This model has been implemented on a heterogeneous network of workstations, a shared-memory multiprocessor, and a supercomputer. An example of the use of this methodology for a multiple-Doppler radar meteorology program is presented.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116022860","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":"An efficient, reference weight-based garbage collection method for distributed systems","authors":"Henk Corporaal, T. Veldman, A. J. V. D. Goor","doi":"10.1109/PARBSE.1990.77179","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77179","url":null,"abstract":"A method of distributed garbage collection using reference counting has been developed previously by D.I. Bevan (1987). This method is correct but has one severe drawback: the time overhead caused by the use of indirection cells. The authors describe an alternative: the reference weight table method. It is shown that this method does not suffer from as much time overhead and offers general improvements.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128185882","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":"Algorithm choice for multiple-query evaluation","authors":"M. Kang, H. Dietz","doi":"10.1109/PARBSE.1990.77202","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77202","url":null,"abstract":"It is pointed out that traditional query optimization concentrates on the optimization of the execution of each individual query. More recently, it has been observed that by considering a sequence of multiple queries some additional high-level optimizations can be performed. Once these optimizations have been performed, each operation is translated into executable code. It is shown that significant improvements can be gained by careful choice of the algorithm to be used for each operation. This choice is not merely based on efficiency of algorithms for individual operations, but primarily on the efficiency of the algorithm choices for the entire multiple-query evaluation. An efficient procedure for automatically optimizing these algorithm choices is given.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130234102","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 Entity System: distribution and persistence","authors":"S. Crawley","doi":"10.1109/PARBSE.1990.77188","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77188","url":null,"abstract":"The Entity System, a model for large-scale storage and manipulation of data using object-based programming techniques, is described. The model uses persistence to store arbitrarily complex objects with minimal programming effort and supports smooth evolution of object types and representations. The design and implementation of a distributed Entity System that allows location-independent access to objects by client programs on a network are described. The architecture of the system is designed to scale to networks and object bases of global proportions.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832126","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":"Parallelism: using the right tool for the right job-examples from database","authors":"O. Frieder","doi":"10.1109/PARBSE.1990.77204","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77204","url":null,"abstract":"Some considerations regarding the proper use of parallelism are presented. It is suggested that parallelism, if used efficiently, can significantly reduce the total required processing time. However, to best benefit from parallelism, a detailed understanding of when, what, and how to parallelize the problem is required. Otherwise, like all other misused tools, parallelism may actually be a detriment to its user.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126393462","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":"Design and analysis of multiple-bus arbiters with different priority schemes","authors":"Qing Yang, R. Raja","doi":"10.1109/PARBSE.1990.77148","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77148","url":null,"abstract":"The authors present four multiple-user and multiple-server arbiter designs of multiple-bus multiprocessors. All designs are based on decentralized control, which has the advantage of good reliability and potentially high throughput. The priority protocols considered are fixed priority, rotating priority, round-robin priority, and equal priority. For the first two priority protocols, lookahead techniques are used to speed up the arbitration process. The round-robin protocol is based on the decentralized daisy-chain idea and is operated in an asynchronous fashion. Analytical models are developed for the four different priority protocols to evaluate the performance of the different designs. The analyses are based on a probabilistic model for the synchronous case and simple queuing analysis for the asynchronous system. Numerical results obtained from the proposed model show that the equal priority protocol performs better than the others in the system with a few buses. The performance difference is not significant when the number of buses is relatively large.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121742140","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":"Time-space optimal parallel set operations","authors":"Xiaojun Guan, M. A. Langston","doi":"10.1109/PARBSE.1990.77137","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77137","url":null,"abstract":"The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of k<or=n/(log n). Moreover, the methods are completely general in that they are stable (records with identical keys retain their original relative order), they do not modify records (even temporarily) as they execute, and they require no information other than a record's key.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133495924","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":"Structured evaluation of database management systems","authors":"G.L. Schaps, N. Rishe","doi":"10.1109/PARBSE.1990.77174","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77174","url":null,"abstract":"An analytical framework for evaluating database management systems is presented. Four RDBMSs (relational database management systems) are chosen for design review: Sybase, Oracle, Ingres, and informix. Five categories of design characteristics are considered: (1) query processing, (2) query optimization, (3) distributed query, (4) concurrency control, and (5) crash recovery. On the basis of the material considered here, Sybase appears to have the best distributed architecture and the most advanced transaction control, integrity checks, and crash recovery features.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712589","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}