发布求助
文献互助 智能选刊 最新文献

[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems最新文献

筛选
英文 中文
On global transaction scheduling criteria in multidatabase systems 多数据库系统全局事务调度准则研究
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253063
Aidong Zhang, A. Elmagarmid
{"title":"On global transaction scheduling criteria in multidatabase systems","authors":"Aidong Zhang, A. Elmagarmid","doi":"10.1109/PDIS.1993.253063","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253063","url":null,"abstract":"A theoretical basis for global transaction scheduling to maintain global serializability in multidatabase systems is presented. Three correctness criteria are formulated to utilize the intrinsic characteristics of global transactions at the global level to determine the serialization order of global subtransactions at each local site. In particular, two new types of serializability, chain-conflicting serializability and sharing serializability, are proposed, and an optimal criterion (termed hybrid serializability) combining these two basic criteria is discussed. These criteria offer the advantage of imposing no restrictions on local sites while retaining global serializability. In addition, the optimal aspect of hybrid serializability defines limits on global serializability in multidatabase systems.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522893","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}
引用次数: 6
Using timestamping to optimize two phase commit 使用时间戳优化两阶段提交
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253073
D. Lomet
{"title":"Using timestamping to optimize two phase commit","authors":"D. Lomet","doi":"10.1109/PDIS.1993.253073","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253073","url":null,"abstract":"The two-phase commit (2PC) protocol is used to guarantee the serializability of distributed transactions. The message cost of the standard 2PC has led to efforts to optimize the protocol and reduce the number of messages required. The common optimizations require that each cohort of a transaction be terminated (finished with normal accessing of data) in order for these optimizations to lead to serial schedules. The use of timestamps is suggested as a substitute for knowing when cohorts are terminated, and it is shown how the 2PC protocol itself can be used to choose the timestamps. The key to this is to permit cohorts to vote transaction time ranges within which the transaction must commit or else be aborted. Using time ranges, the read only optimization and early release of read locks can be supported. The transaction times chosen are appropriate for identifying versions of data in a multiversion rollback database.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130092266","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}
引用次数: 12
Implementation and evaluation of relational algebra operations on the Connection Machine
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253086
W. Hou, Jerry Kindred
{"title":"Implementation and evaluation of relational algebra operations on the Connection Machine","authors":"W. Hou, Jerry Kindred","doi":"10.1109/PDIS.1993.253086","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253086","url":null,"abstract":"The authors describe the implementation and analysis of relational algebra (RA) operators on a single instruction multiple data computer, the Connection Machine. Several traditional algorithms for RA operations are parallelized and reevaluated in this environment.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123348559","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}
引用次数: 1
Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor 传递闭包:在共享内存多处理器上的三种多线程数据库算法的实验案例研究
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253085
Hélène Young-Myers, L. Raschid
{"title":"Transitive closure: an experimental case study of three multithreaded database algorithms on a shared memory multiprocessor","authors":"Hélène Young-Myers, L. Raschid","doi":"10.1109/PDIS.1993.253085","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253085","url":null,"abstract":"An experimental performance evaluation of three multithreaded database transitive closure algorithms on a shared memory multiprocessor is described. The algorithms are differentiated on the basis of the dataflow patterns among the threads, namely no dataflow, pipelined dataflow, and network dataflow. Close to linear speedup is achieved by the no dataflow algorithm when there is sufficiently large workload, and sufficient primary memory for processing. Even when communication is through shared memory, the no dataflow algorithm performs significantly better than the algorithms with dataflow. When access to each package of memory is shared by multiple threads, the number of threads significantly affects the performance of the algorithms in limited primary memory. When each page is exclusively accessed by a single thread, performance remains constant when the number of threads is varied.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121503841","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}
引用次数: 0
ACMS: Digital's open, distributed TP monitor ACMS: Digital公司的开放式、分布式TP监视器
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253083
V. Trehan
{"title":"ACMS: Digital's open, distributed TP monitor","authors":"V. Trehan","doi":"10.1109/PDIS.1993.253083","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253083","url":null,"abstract":"The ACMS transaction processing (TP) monitor is discussed. ACMS enforces a unique, structured application programming style that makes it easy to develop/modify/reuse application modules. It supports a wide range of industry-standard clients. CMS's scalable architecture gives it best-in-industry price/performance.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130831335","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}
引用次数: 0
PANDA: a testbed for investigating strategies for parallel query execution PANDA:用于调查并行查询执行策略的测试平台
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253065
Günter von Bültzingsloewen, Ralf Kramer, Michael Schryro
{"title":"PANDA: a testbed for investigating strategies for parallel query execution","authors":"Günter von Bültzingsloewen, Ralf Kramer, Michael Schryro","doi":"10.1109/PDIS.1993.253065","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253065","url":null,"abstract":"Strategies for data distribution, query optimization, and control of query processing are investigated by implementing a shared-nothing database system with reduced functionality. The testbed's special features are the support of several advanced data distribution strategies and the pipelined execution of parallel query execution plans. Data distribution and query execution plan editors support the interactive design of query execution plans, thus achieving the flexibility necessary for a testbed.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133848960","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}
引用次数: 3
Optimizing multi-joint queries in parallel relational databases 并行关系数据库中多联合查询的优化
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253067
J. Srivastava, G. Elsesser
{"title":"Optimizing multi-joint queries in parallel relational databases","authors":"J. Srivastava, G. Elsesser","doi":"10.1109/PDIS.1993.253067","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253067","url":null,"abstract":"The authors determine a plan that makes the execution of an individual query very fast, with minimizing parallel execution time as the objective. This creates a circular dependence: a plan tree is needed for effective resource assignment, which is needed to estimate the parallel execution time, and which in turn is needed for the cost-based search for a good plan tree. A search heuristic that breaks the cycle by constructing the plan tree layer by layer in a bottom-up manner is proposed. To select nodes at the next level, the lower and upper bounds on the execution time for plans consistent with the decisions made so far are estimated and are used to guide the search. A query plan representation for intraoperator and interoperator parallelism, pipelining, and processor and memory assignment is proposed, as is a new approach for estimating the parallel execution time of a plan that considers sum and max of operators working sequentially and in parallel, respectively.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133474584","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}
引用次数: 47
Satisfying response time goals in transaction processing 满足事务处理中的响应时间目标
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1993-01-20 DOI: 10.1109/PDIS.1993.253060
D. Ferguson, L. Georgiadis, C. Nikolaou, K. Davies
{"title":"Satisfying response time goals in transaction processing","authors":"D. Ferguson, L. Georgiadis, C. Nikolaou, K. Davies","doi":"10.1109/PDIS.1993.253060","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253060","url":null,"abstract":"Workload management algorithms for satisfying administration defined response time goals in transaction processing systems are presented. Each arriving transaction belongs to a predefined transaction class, and the system administrator defines an average response time goal for each transaction class. A dynamic transaction priority algorithm and a set of transaction routing algorithms for multiple processor transaction systems are given. These algorithms set priorities and route transactions based on the data objects accessed by the transactions, the current load of each system, and the goal satisfaction of the transaction classes. The algorithms have low overhead, and a detailed simulation study shows that they substantially improve goal satisfaction compared to previous work.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125442121","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}
引用次数: 7
Declustering using fractals 使用分形进行聚类
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1900-01-01 DOI: 10.1109/PDIS.1993.253077
C. Faloutsos, P. Bhagwat
{"title":"Declustering using fractals","authors":"C. Faloutsos, P. Bhagwat","doi":"10.1109/PDIS.1993.253077","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253077","url":null,"abstract":"A method for achieving declustering for Cartesian product files on M units is proposed. The focus is on range queries, as opposed to partial match queries that older declustering methods have examined. The method uses a distance-preserving mapping, the Hilbert curve, to impose a linear ordering on the multidimensional points (buckets); then, it traverses the buckets according to this ordering, assigning buckets to disks in a round-robin fashion. Because of the good distance-preserving properties of the Hilbert curve, the end result is that each disk contains buckets that are far away in the linear ordering, and, most probably, far away in the k-d address space. This is exactly the goal of declustering. Experiments show that these intuitive arguments lead to good performance: the proposed method performs at least as well as or better than older declustering schemes.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114182734","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}
引用次数: 166
Issues in the design of multi-server file systems to cope with load skew 多服务器文件系统设计中应对负载倾斜的问题
[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems Pub Date : 1900-01-01 DOI: 10.1109/PDIS.1993.253091
D. Sitaram, A. Dan, Philip S. Yu
{"title":"Issues in the design of multi-server file systems to cope with load skew","authors":"D. Sitaram, A. Dan, Philip S. Yu","doi":"10.1109/PDIS.1993.253091","DOIUrl":"https://doi.org/10.1109/PDIS.1993.253091","url":null,"abstract":"It is observed that a large number of operations in many environments are to the files that are mostly-read and rarely updated. Such operations can be served by any server without incurring a high coherency. Several dynamic load balancing algorithms of various degrees of complexity that achieve high reduction in load skew albeit reducing the server buffer hit probability are proposed. It is shown using real workload traces that server load skew can be significantly reduced using these policies, and that there is an inherent tradeoff between load balancing and server buffer hit probability. Some variations of the proposed buddy-based policies which limit the number of replications of buffer pages seem to provide a good compromise between the two factors.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415338","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}
引用次数: 12
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信