Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183082
Tim Connors, Waqar Hasan, Curtis P. Kolovson, Marie-Anne Neimat, Donovan A. Schneider, K. Wilkinson
Summary form only given. The authors focus on the performance of integrated specialized data managers. In particular, they focus on the customizations of parallel executions of data manager operators in a variety of computer configurations. This is done by specifying the glue that connects data manager operators in a way that is independent of the computer configuration; and then providing the ability to transparently target the execution to a variety of computer configurations. Parallelization of data manager operators built using Papyrus services is a challenging problem, but a more challenging problem is the parallelization of data manager operators that are built independently of Papyrus and are therefore black boxes to Papyrus. Papyrus is a set of modules and services that enables the parallelization and integration of specialized data managers into one execution environment. Papyrus programs can be transparently targeted to different hardware configurations and can dynamically adjust at runtime to the number of available resources. A Papyrus System consists of a number of clients interfacing to a Papyrus Server. The Server consists of several integrated data managers executing on a multiprocessor system.<>
{"title":"The papyrus integrated data server","authors":"Tim Connors, Waqar Hasan, Curtis P. Kolovson, Marie-Anne Neimat, Donovan A. Schneider, K. Wilkinson","doi":"10.1109/PDIS.1991.183082","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183082","url":null,"abstract":"Summary form only given. The authors focus on the performance of integrated specialized data managers. In particular, they focus on the customizations of parallel executions of data manager operators in a variety of computer configurations. This is done by specifying the glue that connects data manager operators in a way that is independent of the computer configuration; and then providing the ability to transparently target the execution to a variety of computer configurations. Parallelization of data manager operators built using Papyrus services is a challenging problem, but a more challenging problem is the parallelization of data manager operators that are built independently of Papyrus and are therefore black boxes to Papyrus. Papyrus is a set of modules and services that enables the parallelization and integration of specialized data managers into one execution environment. Papyrus programs can be transparently targeted to different hardware configurations and can dynamically adjust at runtime to the number of available resources. A Papyrus System consists of a number of clients interfacing to a Papyrus Server. The Server consists of several integrated data managers executing on a multiprocessor system.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132224757","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}
Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183107
B. Bergsten, M. Couprie, P. Valduriez
DBS3 is a database system with extended relational capabilities designed for a shared-memory multiprocessor. This paper presents the design choices, architecture and performance evaluation of the current DBS3 prototype. The major contributions of DBS3 are: a parallel dataflow execution model based on data declustering, the compile-time optimization of both independent and pipelined parallelism, and the exploitation of shared-memory for efficient concurrent execution. The current DBS3 prototype runs on a shared-memory, commercially available multiprocessor. The initial performance experiments for single-user queries are promising and show excellent response times and scalability.<>
{"title":"Prototyping DBS3, a shared-memory parallel database system","authors":"B. Bergsten, M. Couprie, P. Valduriez","doi":"10.1109/PDIS.1991.183107","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183107","url":null,"abstract":"DBS3 is a database system with extended relational capabilities designed for a shared-memory multiprocessor. This paper presents the design choices, architecture and performance evaluation of the current DBS3 prototype. The major contributions of DBS3 are: a parallel dataflow execution model based on data declustering, the compile-time optimization of both independent and pipelined parallelism, and the exploitation of shared-memory for efficient concurrent execution. The current DBS3 prototype runs on a shared-memory, commercially available multiprocessor. The initial performance experiments for single-user queries are promising and show excellent response times and scalability.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415243","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}
Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183060
Azer Bestavros
The paper introduces the idea of using the Information Dispersal Algorithm (IDA) of M.O. Rabin (1989) to distribute data and redundancy information uniformly among multiple disks and compares the performance and reliability characteristics of shadowing, parity, and IDA. It discusses some ways to take advantage of the uniformity of data placement and argues that IDA is the algorithm of choice for achieving reliability and performance in parallel disk systems.<>
{"title":"IDA-based redundant arrays of inexpensive disks","authors":"Azer Bestavros","doi":"10.1109/PDIS.1991.183060","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183060","url":null,"abstract":"The paper introduces the idea of using the Information Dispersal Algorithm (IDA) of M.O. Rabin (1989) to distribute data and redundancy information uniformly among multiple disks and compares the performance and reliability characteristics of shadowing, parity, and IDA. It discusses some ways to take advantage of the uniformity of data placement and argues that IDA is the algorithm of choice for achieving reliability and performance in parallel disk systems.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114589722","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}
Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183086
Gabriel Matsliach, O. Shmueli
The paper presents a method for distributing search structures which have an index in shared memory multiprocessor multi-disk systems. It is shown that in comparison with currently used distribution methods, the new method generates distributed search structures having a much lower main memory space requirement, similar parallel execution capabilities, a similar execution cost per operation, and a fairly close disk space utilization. Analyzing the disk space utilization of the resulting distributed structures is non-trivial. The paper briefly explains how it has performed such an analysis (which is partially based on a technique called fringe analysis). The result is that the benefits of the method are obtained at a very small cost in terms of reduced disk space utilization.<>
{"title":"An efficient method for distributing search structures","authors":"Gabriel Matsliach, O. Shmueli","doi":"10.1109/PDIS.1991.183086","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183086","url":null,"abstract":"The paper presents a method for distributing search structures which have an index in shared memory multiprocessor multi-disk systems. It is shown that in comparison with currently used distribution methods, the new method generates distributed search structures having a much lower main memory space requirement, similar parallel execution capabilities, a similar execution cost per operation, and a fairly close disk space utilization. Analyzing the disk space utilization of the resulting distributed structures is non-trivial. The paper briefly explains how it has performed such an analysis (which is partially based on a technique called fringe analysis). The result is that the benefits of the method are obtained at a very small cost in terms of reduced disk space utilization.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128152385","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}
Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183090
S. Hiraiwa, N. Matsuura, Y. Matsushita
The authors describe I-CEM (Intelligent-Communication System based on E-mail), a system designed for supporting computer-based communication when promoting collaborative work by multiple persons in a project team. Members in a project team often use formalized templates which imply the official information. Nevertheless these kinds of templates are suitable for storing and sharing among all the members. These templates cause a shortage of information and misunderstanding between the senders and the receivers. I-CEM provides the functions of (1) adding supplementary information to the formalized information, (2) classifying received messages and taking actions based on user-defined rules, and (3) making it easy to reuse the information. The I-CEM prototype is implemented on SPARCsation and by using XView toolkit (X.R11V4) and E-mail.<>
{"title":"I-CEM: an intelligent communication system for collaborative work","authors":"S. Hiraiwa, N. Matsuura, Y. Matsushita","doi":"10.1109/PDIS.1991.183090","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183090","url":null,"abstract":"The authors describe I-CEM (Intelligent-Communication System based on E-mail), a system designed for supporting computer-based communication when promoting collaborative work by multiple persons in a project team. Members in a project team often use formalized templates which imply the official information. Nevertheless these kinds of templates are suitable for storing and sharing among all the members. These templates cause a shortage of information and misunderstanding between the senders and the receivers. I-CEM provides the functions of (1) adding supplementary information to the formalized information, (2) classifying received messages and taking actions based on user-defined rules, and (3) making it easy to reuse the information. The I-CEM prototype is implemented on SPARCsation and by using XView toolkit (X.R11V4) and E-mail.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123230247","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}
Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183064
Jia-bing R. Cheng, A. Hurson
Due to the nature of supported applications, object-oriented DBMSs need efficient mechanisms for the retrieval of complex objects and the navigation along semantic links among objects. Object clustering is effective when the primary access pattern follows the primary relationship used for clustering, but not so effective when multiple relationships are involved. Object buffering provides a possible solution to compensate the limitation of clustering schemes. The paper investigates the advantages of using an additional layer of object-based buffer pools on top of a traditional page-based buffer pool, and proposes a profile-based buffering scheme to optimize the efficiency of object buffer pools. The performance evaluation based on the semantic implementation of profiles was conducted.<>
{"title":"On the performance issues of object-based buffering","authors":"Jia-bing R. Cheng, A. Hurson","doi":"10.1109/PDIS.1991.183064","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183064","url":null,"abstract":"Due to the nature of supported applications, object-oriented DBMSs need efficient mechanisms for the retrieval of complex objects and the navigation along semantic links among objects. Object clustering is effective when the primary access pattern follows the primary relationship used for clustering, but not so effective when multiple relationships are involved. Object buffering provides a possible solution to compensate the limitation of clustering schemes. The paper investigates the advantages of using an additional layer of object-based buffer pools on top of a traditional page-based buffer pool, and proposes a profile-based buffering scheme to optimize the efficiency of object buffer pools. The performance evaluation based on the semantic implementation of profiles was conducted.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127910296","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}
Pub Date : 1991-12-01DOI: 10.1109/PDIS.1991.183088
D. Silberberg
Summary form only given. The Hubble space telescope (HST) Ingest program reads files representing external database tables of any topology, normalizes or joins the tables to the HST catalog database topology, parses and converts data values, and writes the tuples to the HST catalog. Ingest is driven by translation tables defining the interdatabase mapping and can be altered on-the-fly. Ingest has proven to be a powerful tool in an environment where multiple databases rapidly evolve.<>
{"title":"Populating databases from multiple sources-the Hubble space telescope paradigm","authors":"D. Silberberg","doi":"10.1109/PDIS.1991.183088","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183088","url":null,"abstract":"Summary form only given. The Hubble space telescope (HST) Ingest program reads files representing external database tables of any topology, normalizes or joins the tables to the HST catalog database topology, parses and converts data values, and writes the tuples to the HST catalog. Ingest is driven by translation tables defining the interdatabase mapping and can be altered on-the-fly. Ingest has proven to be a powerful tool in an environment where multiple databases rapidly evolve.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134125977","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}
Pub Date : 1900-01-01DOI: 10.1109/PDIS.1991.183065
M.R. van Steen, E. de Jong
The paper presents the specification language Vista, which incorporates a new parallel programming model strongly influenced by concepts originating in the field of object oriented database programming. Before introducing Vista, it first gives a brief overview of the problems related to existing parallel programming models, and shows that support for a higher level of abstraction is necessary. Following the presentation of Vista, the paper presents a comparison to related research, including a discussion on the Linda parallel programming model that has also successfully incorporated concepts from the field of database programming. Some indications of future research conclude the paper.<>
{"title":"Designing highly parallel applications using database programming concepts","authors":"M.R. van Steen, E. de Jong","doi":"10.1109/PDIS.1991.183065","DOIUrl":"https://doi.org/10.1109/PDIS.1991.183065","url":null,"abstract":"The paper presents the specification language Vista, which incorporates a new parallel programming model strongly influenced by concepts originating in the field of object oriented database programming. Before introducing Vista, it first gives a brief overview of the problems related to existing parallel programming models, and shows that support for a higher level of abstraction is necessary. Following the presentation of Vista, the paper presents a comparison to related research, including a discussion on the Linda parallel programming model that has also successfully incorporated concepts from the field of database programming. Some indications of future research conclude the paper.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125614789","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：