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

Proceedings of 1994 International Conference on Parallel and Distributed Systems最新文献

筛选
英文 中文
Optimizing entity join queries by extended semijoins in a wide area multidatabase environment 在广域多数据库环境中通过扩展半连接优化实体连接查询
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590432
P. S. Tsai, Arbee L. P. Chen
{"title":"Optimizing entity join queries by extended semijoins in a wide area multidatabase environment","authors":"P. S. Tsai, Arbee L. P. Chen","doi":"10.1109/ICPADS.1994.590432","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590432","url":null,"abstract":"We consider processing entity join queries in a wide area multidatabase environment where the query processing cost is dominated by the cost of data transmission. An entity join operation \"integrates\" tuples representing the same entities from different relations in which inconsistent data may exist. The semijoin technique has been successfully used in a distributed database system to reduce the cost of data transmission. However, it cannot be directly applied to process the entity join query. An extension of the traditional semijoin, named extended semijoin is proposed to reduce the cost of data transmission for entity join query processing in a wide area multidatabase environment.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116225406","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}
引用次数: 4
A heuristic algorithm for the reliability-oriented file assignment in a distributed computing system 分布式计算系统中面向可靠性的文件分配启发式算法
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590355
Deng-Jyi Chen, Ruey-Shun Chen, W. C. Hol, K. Ku
{"title":"A heuristic algorithm for the reliability-oriented file assignment in a distributed computing system","authors":"Deng-Jyi Chen, Ruey-Shun Chen, W. C. Hol, K. Ku","doi":"10.1109/ICPADS.1994.590355","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590355","url":null,"abstract":"We develop a heuristic algorithm for the reliability-oriented file assignment problem (HROFA), which uses a careful reduction method to reduce the problem space. Based on some numerical results, the HROFA algorithm obtains the exact solution in most cases and the computation time is improved significantly. When it fails to give an exact solution, the deviation from the exact solution is very small.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116904145","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}
引用次数: 8
Broadcasting on uni-directional hypercubes 单向超立方体上的广播
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590063
Hua-Min Huang, C.-B. Yang
{"title":"Broadcasting on uni-directional hypercubes","authors":"Hua-Min Huang, C.-B. Yang","doi":"10.1109/ICPADS.1994.590063","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590063","url":null,"abstract":"In this paper, we solve the broadcasting problem for the even dimensional uni-directional hypercube (UHC). In the constant evaluation model, the complexity of one of our all-port broadcasting trees, is n+1, and it is optimal. Whereas the best one of our one-port broadcasting trees needs 4/3(n-n mode 6)+3/2(n mod 6) steps. These algorithms can be extended to solve the odd dimensional case. We also propose an all-port fault-tolerant broadcasting tree whose height is 3/2n+n mode 4/2.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126639485","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
Plenary Address 3: Heterogeneous Parallel Computing 全体会议发言3:异构并行计算
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.589877
E. Swartzlander
{"title":"Plenary Address 3: Heterogeneous Parallel Computing","authors":"E. Swartzlander","doi":"10.1109/ICPADS.1994.589877","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.589877","url":null,"abstract":"Heterogeneous parallel computing (i.e., parallel computers where the processors are customized or tailored to efficiently execute specific.classes of algorithms) is the only practical way to solve many computationally intensive problems. In contrast to array computers constructed with identical general purpose processors, heterogeneous parallel computing achieves very high levels of throughput, small size, and low power. The improvement in the speed-size product is often in excess of two orders of magnitude. This talk reviews past endeavors in application specific processing (which can be viewed as the root of heterogeneous computing), current research in heterogeneous parallel computing, and offers the prediction that in the near future “system compilation” (analogous to “silicon compilation”) will greatly facilitate the development of heterogeneous parallel computers.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124818259","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
Practical distributed garbage collection for networks with asynchronous clocks and message delay 具有异步时钟和消息延迟的网络的实用分布式垃圾收集
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590347
D. Kwan, F. Chin
{"title":"Practical distributed garbage collection for networks with asynchronous clocks and message delay","authors":"D. Kwan, F. Chin","doi":"10.1109/ICPADS.1994.590347","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590347","url":null,"abstract":"Distributed garbage collection over a message passage network is discussed in this paper. Traditionally, this can be done by reference counting, which is fast but cannot reclaim cyclic structures or by graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage and guaranteed to reclaim cyclic garbage. Our scheme does not rely on synchronized clocks nor zero message delay and is thus practical.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125222753","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
Trace-based analysis and tuning for distributed parallel applications 分布式并行应用程序的基于跟踪的分析和调优
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590449
C. Wu, Yew-Huey Liu, C. Benveniste, C.-L. Chen, W.-H. Chiang
{"title":"Trace-based analysis and tuning for distributed parallel applications","authors":"C. Wu, Yew-Huey Liu, C. Benveniste, C.-L. Chen, W.-H. Chiang","doi":"10.1109/ICPADS.1994.590449","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590449","url":null,"abstract":"We present an integrated approach to deal with timestamp consistency, and trace based performance analysis techniques for distributed parallel applications. Our trace generation facility captures message passing and system events such as process dispatch with minimal trace overhead. Trace driven analysis tools are developed for post execution analysis, reporting information such as the time stolen by other processes in each node, and the observed message passing time and local wait time for each message. We then present our techniques to reduce total elapsed times based on observed message passing times and local wait times.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131734684","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}
引用次数: 4
Avoiding data link and computational conflicts in mapping nested loop algorithms to lower-dimensional processor arrays 在将嵌套循环算法映射到低维处理器阵列时避免数据链和计算冲突
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590382
Jingling Xue, P. Lenders
{"title":"Avoiding data link and computational conflicts in mapping nested loop algorithms to lower-dimensional processor arrays","authors":"Jingling Xue, P. Lenders","doi":"10.1109/ICPADS.1994.590382","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590382","url":null,"abstract":"This paper describes a unified approach to checking data link and computational conflicts in mapping algorithms to lower-dimensional processor arrays. Based primarily on the notion of Hermite normal form, we propose a range of necessary and sufficient conditions to identify mappings without data link and computational conflicts. These conditions are then used to find optimal time mappings of a transitive closure algorithm to linear processor arrays.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124660498","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
Use of sequencing constraints for specifying, testing, and debugging concurrent programs 使用排序约束来指定、测试和调试并发程序
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590309
K. Tai, R. Carver
{"title":"Use of sequencing constraints for specifying, testing, and debugging concurrent programs","authors":"K. Tai, R. Carver","doi":"10.1109/ICPADS.1994.590309","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590309","url":null,"abstract":"This paper introduces the use of sequencing constraints for specifying, testing, and debugging concurrent programs. An execution of a concurrent program P nondeterministically exercises a sequence of synchronization events, called a synchronization sequence (or SYN-sequence). Sequencing constraints (or constraints) specify restrictions on the allowed SYN-sequences of P. Constraints for P are derived from a formal or informal specification of P and do not have to be complete. The SYN-sequences collected during nondeterministic testing of P can be used to measure coverage and detect violations of P's constraints. Also, SYN-sequences can be generated according to P's constraints and used for deterministic testing of P. This paper shows in detail how to accomplish coverage and detect violations of constraints written in CSPE (Constraints on Succeeding and Preceding Events) by nondeterministic and deterministic testing.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116692570","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
Some optimal parallel algorithms on weighted cographs 加权图上的一些最优并行算法
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590314
Ming-Shing Yu, Chuan-Ming Liu
{"title":"Some optimal parallel algorithms on weighted cographs","authors":"Ming-Shing Yu, Chuan-Ming Liu","doi":"10.1109/ICPADS.1994.590314","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590314","url":null,"abstract":"The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper we present an O(n) time sequential algorithm and a parallel algorithm of O(log n) time and O(n/log n) processors on the EREW PRAM model to solve the maximum weight independent set problem on weighted cographs. Using such algorithms we can easily solve the minimum weight vertex cover, maximum weight clique, minimum weight independent dominating set, minimum weight dominating set, and minimum weight maximal irredundant set problems on weighted cographs with the same bounds of time and processors.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125108595","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
Causally ordering group communication protocol 随机排序组通信协议
Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.589895
A. Nakamura, T. Tachikawa, M. Takizawa
{"title":"Causally ordering group communication protocol","authors":"A. Nakamura, T. Tachikawa, M. Takizawa","doi":"10.1109/ICPADS.1994.589895","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.589895","url":null,"abstract":"Distributed application systems require group communications among multiple processes. In the group communication, it is important to discuss in what order each process in the group can receive messages. The paper presents a causally ordering group communication (CO) protocol which provides the same causal ordering of messages for all the processes in the group. In the CO protocol, the messages received are causally ordered by using the sequence numbers of the messages. The CO protocol is based on the fully distributed control scheme, i.e. no master controller, and uses high-speed networks where each process may fail to receive messages due to the buffer overrun. Furthermore, the CO protocol provides asynchronous data transmission for multiple processes in the group.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127423914","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}
引用次数: 24
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信