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

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing最新文献

筛选
英文 中文
Guaranteed intrusion removal from monitored distributed applications 保证从监控的分布式应用程序中移除入侵
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570364
Wanqing Wu, Madalene Spezialetti, Rajiv Gupta
{"title":"Guaranteed intrusion removal from monitored distributed applications","authors":"Wanqing Wu, Madalene Spezialetti, Rajiv Gupta","doi":"10.1109/SPDP.1996.570364","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570364","url":null,"abstract":"This paper presents on-line perturbation tracking and intrusion removal techniques which are designed to accommodate delays which occur due to monitoring activities. These accommodations eliminate the effect of monitoring intrusion on the execution behavior and the scheduling of the monitored computation. By maintaining an adjusted time view, the intrusion removal system preserves the execution order of processes and the message selection decisions that would have been made in an unmonitored execution.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117108456","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
A foundation for designing deadlock-free routing algorithms in wormhole networks 虫洞网络中无死锁路由算法设计的基础
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570333
D. Jayasimha, L. Schwiebert, D. Manivannan, Jeff A. May
{"title":"A foundation for designing deadlock-free routing algorithms in wormhole networks","authors":"D. Jayasimha, L. Schwiebert, D. Manivannan, Jeff A. May","doi":"10.1109/SPDP.1996.570333","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570333","url":null,"abstract":"This paper provides necessary and sufficient conditions for deadlock-free unicast and multicast routing with the path-based routing model in interconnection networks which use the wormhole switching technique. The theory is developed around three central concepts: channel waiting, false resource cycles, and valid destination sets. The first two concepts are suitable extensions to those developed for unicast routing by two authors of this paper; the third concept has been developed by Lin and Ni. The necessary and sufficient conditions can be applied in a straightforward manner to prove deadlock freedom and to find more adaptive routing algorithms for collective communication. The latter point is illustrated by developing two routing algorithms for multicast communication in 2-D mesh architectures. The first algorithm uses fewer resources (channels) than an algorithm proposed in the literature but achieves the same adaptivity. The second achieves full adaptivity for multicast routing.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127130489","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}
引用次数: 15
On-the-fly detection of conjunctions of local predicates in distributed computations 分布式计算中局部谓词连词的动态检测
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570388
M. Hurfin, M. Mizuno, M. Raynal, M. Singhal
{"title":"On-the-fly detection of conjunctions of local predicates in distributed computations","authors":"M. Hurfin, M. Mizuno, M. Raynal, M. Singhal","doi":"10.1109/SPDP.1996.570388","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570388","url":null,"abstract":"Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. The paper presents an efficient distributed algorithm to detect conjunctive form global predicates in distributed systems. The algorithm detects the first consistent global state that satisfies a given conjunction of local predicates. The algorithm is distributed because the predicate detection efforts as well as the necessary information is equally distributed among the processes.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124865411","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
Almost complete address translation (ACATS) disk array declustering 几乎完全地址转换(ACATS)磁盘阵列集群
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570350
J. Thomas, S. J. Schwarz, W. Burkhard
{"title":"Almost complete address translation (ACATS) disk array declustering","authors":"J. Thomas, S. J. Schwarz, W. Burkhard","doi":"10.1109/SPDP.1996.570350","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570350","url":null,"abstract":"We present a novel declustering scheme (ACATS) for reliability stripes in an orthogonal disk array. Our scheme is deterministic, run-time efficient and provides frequently the best possible and always an almost best possible distribution of failure-induced incremental rebuild workloads. Our scheme provides protection against single disk as well as single string failures within the disk array. Our approach presents a framework in which the Level 5 RAID organization logically appears as a Level 4 RAID; it facilitates the provision of distributed sparing in exactly the same manner ACATS does not require the existence of a suitably configured block design or of a run-time efficient pseudo-random number generator; it is applicable to arbitrarily configured orthogonal disk arrays. Our scheme is faster than declustering schemes that use pseudo-random permutations and achieves better uniformity of disk loads during a disk rebuild; it is simpler than schemes based on block designs. ACATS provides a rich spectrum of declustering schemes.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125874880","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
Concatenated parallelism: a technique for efficient parallel divide and conquer 串联并行:一种高效的并行分治技术
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570373
Sanjay Goil, S. Aluru, S. Ranka
{"title":"Concatenated parallelism: a technique for efficient parallel divide and conquer","authors":"Sanjay Goil, S. Aluru, S. Ranka","doi":"10.1109/SPDP.1996.570373","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570373","url":null,"abstract":"Efficient divide and conquer algorithms can be mapped to a parallel computer using either task parallelism or data parallelism. The former involves significant data movement and the latter can lead to severe load imbalances. A new strategy is proposed, which the authors call concatenated parallelism, for efficient parallel solution of problems resulting in divide and conquer trees. Their strategy is useful when the communication time due to data movement in distributing the subproblems is significant in comparison to the time required for subdivision.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"881 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117078046","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}
引用次数: 14
Dual of a complete graph as an interconnection network 作为互连网络的完全图的对偶
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570366
Si-Qing Zheng, Jie Wu
{"title":"Dual of a complete graph as an interconnection network","authors":"Si-Qing Zheng, Jie Wu","doi":"10.1109/SPDP.1996.570366","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570366","url":null,"abstract":"A new class of interconnection networks, called hypernetworks, was proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optical interconnects. The authors propose a scheme for deriving new hypernetworks using hypergraph duals. As an example, they investigate the dual, K/sub n/*, of the n-vertex complete graph K/sub n/, and show that it has many desirable properties. They also present a set of fundamental data communication algorithms for K/sub n/*. Their results indicate that the K/sub n/* hypernetwork is a useful and promising interconnection structure for high-performance parallel and distributed competing systems.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129631151","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}
引用次数: 9
An intelligent system architecture for urban traffic control applications 一种城市交通控制应用的智能系统架构
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570311
M. Patel, N. Ranganathan
{"title":"An intelligent system architecture for urban traffic control applications","authors":"M. Patel, N. Ranganathan","doi":"10.1109/SPDP.1996.570311","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570311","url":null,"abstract":"This paper describes an intelligent system architecture for urban traffic control which integrates a neural network and an expert system on silicon. The intelligent decision making system consists of a backpropagation based neural network for adaptive learning and a rule-based fuzzy expert system for decision making. Both the neural network and the expert system are implemented as linear systolic arrays. Thus, the entire system can be realized in VLSI with a few basic cells. The architecture exploits the principles of pipelining and parallelism to the maximum possible extent in order to achieve high speed and throughput. The effectiveness of the proposed system is illustrated by mapping two application problems: (i) adaptive traffic light control and (ii) congestion detection and avoidance in urban traffic control. The proposed hardware can yield a real-time decision every 5 ns based on a 200 MHz clock.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124571698","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
An efficient file transmission algorithm for distributed computing systems 分布式计算系统中高效的文件传输算法
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570315
D. Chen, P. Chang, Y. W. Lee
{"title":"An efficient file transmission algorithm for distributed computing systems","authors":"D. Chen, P. Chang, Y. W. Lee","doi":"10.1109/SPDP.1996.570315","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570315","url":null,"abstract":"In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and their locations are transparent to the executed program, it becomes the system's responsibility to select a proper file server such that data can be transmitted in an effective way. We consider the scenario that a particular program needs several data files simultaneously for its execution. Each data file may have replicas across the network. The problem is how to find a collection of file servers and the routing paths such that the data transmission time is minimum. An exhaustive approach could of course find the optimal solution. However, it pays a high computation price. We thus propose a heuristic method. Results obtained from the proposed method are encouraging.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129191511","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
Prolog on the multithreaded Datarol-II machine based on the logicflow execution model 基于逻辑流执行模型的多线程Datarol-II机器上的Prolog
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570323
P. Kacsuk, M. Amamiya
{"title":"Prolog on the multithreaded Datarol-II machine based on the logicflow execution model","authors":"P. Kacsuk, M. Amamiya","doi":"10.1109/SPDP.1996.570323","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570323","url":null,"abstract":"The paper shows how a massively parallel Prolog implementation can be achieved on the multithreaded Datarol-II machine. First the main features of the parallel Logicflow Model are summarized. It was developed for implementing Prolog on massively parallel computers. Prolog programs are transformed into a dataflow-like graph called the Logicflow Graph in which nodes are macro dataflow nodes and tokens represent macrothreads. The Datarol-II architecture efficiently supports both the management of macrothreads derived from the Logicflow Model and the management of microthreads created when remote loads are necessary. The architecture of the Datarol-II machine and the macrothread management of Prolog programs are described in detail.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133102725","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
Distributed, low contention task allocation 分布式、低争用任务分配
Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570355
S. Kapidakis, M. Mavronicolas
{"title":"Distributed, low contention task allocation","authors":"S. Kapidakis, M. Mavronicolas","doi":"10.1109/SPDP.1996.570355","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570355","url":null,"abstract":"Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not suffer because of limitations on processor-to-memory bandwidth. In this paper, we present a comparative study of throughput and contention guarantees provided by load balancing networks, a new class of distributed, asynchronous algorithms for real-time task allocation in shared memory multiprocessors. Load balancing networks generalize balancing networks, to accommodate tasks with varying completion times.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124088439","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学术官方微信