Proceedings of 1994 International Conference on Parallel and Distributed Systems最新文献_第3页

Virtual Permanent Connection: network computing over switch-based high-speed networks 虚拟永久连接:基于交换机的高速网络的网络计算

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590410

Mengjou Lin, D. Du

{"title":"Virtual Permanent Connection: network computing over switch-based high-speed networks","authors":"Mengjou Lin, D. Du","doi":"10.1109/ICPADS.1994.590410","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590410","url":null,"abstract":"Recent progress in switch based high speed local area networks (LANs) makes distributed network computing promising. Three evolving switch based high speed networks are the High Performance Parallel Interface (HIPPI), Fiber Channel (FC), and Asynchronous Transfer Mode (ATM) standards. We study how high performance computing can be carried out over such networks. High performance computing can be characterized as follows: it includes multiple modules and each module is executed in a processor; its communication data flow forms a special application topology and usually such application topologies are regular; and it requires frequent communication between adjacent modules in the application topology. In order to reduce the amount of time required for a processor to set up a connection during the execution of an application, we propose a new communication protocol called the Virtual Permanent Connection (VPC). For a given application topology, a set of connections are set up and permanently maintained during the execution of the application. Communication between processors are via this group of connections. We study how a set of VPCs are chosen based on a given application topology (this process is called application topology embedding).","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"49 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":"127776053","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

A theory of fault-tolerant routing in wormhole networks 虫洞网络中的容错路由理论

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590404

J. Duato

引用次数: 133

Lock-free concurrent tree structures for multiprocessor systems 多处理器系统的无锁并发树结构

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590370

Jyh-Jong Tsay, Hsin-Chi Li

引用次数: 11

A new and efficient FFT algorithm for distributed memory systems 一种新的高效的分布式存储系统FFT算法

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590059

N. Anupindi, M. An, J. Cooley, Q. Yang

{"title":"A new and efficient FFT algorithm for distributed memory systems","authors":"N. Anupindi, M. An, J. Cooley, Q. Yang","doi":"10.1109/ICPADS.1994.590059","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590059","url":null,"abstract":"This paper presents a new and optimal parallel implementation of multidimensional fast Fourier transform algorithm on distributed memory multiprocessors. Its optimality is obtained by minimizing the number of message passings necessary, at the cost of increase in message length. This distinctive feature of the new algorithm effectively utilizes the important architectural property of most of today's distributed memory multiprocessors-wormhole routing for interprocessor communications. By using the algebra of stride permutations and tenser products as a mathematical tool, we are able to derive and formulate an efficient data partition and communication scheme that reduces communication cost from O(N/sup 2/) required for the best known FFT to O(N) on an N/sup 2/-processor machine. Our data partition scheme is natural and efficient for solving discretized boundary value problems such as partial differential equations and finite element analysis. To evaluate the actual performance of our new algorithm in comparison with other existing parallel FFT algorithms, we have carried out implementation experiments on the Intel's Touchstone Delta machine.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"39 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":"113956983","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

Probabilistic timed protocol verification for the extended state transition model 扩展状态转移模型的概率定时协议验证

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590352

Chung-Ming Huang, Shiun-Wei Lee, Jenq-Muh Hsu

引用次数: 2

Achieving dependability in mission-critical operating systems through adaptability and large-scale functional integration 通过适应性和大规模功能集成实现关键任务操作系统的可靠性

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590420

H. Wedde, J. Lind, A. Eiss

{"title":"Achieving dependability in mission-critical operating systems through adaptability and large-scale functional integration","authors":"H. Wedde, J. Lind, A. Eiss","doi":"10.1109/ICPADS.1994.590420","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590420","url":null,"abstract":"As part of the DRAGON SLAYER project, the adaptive and reliable distributed file system MELODY has emerged for supporting hard real-time applications in unpredictable environments. In MELODY, the time criticality of tasks and their sensitivity with respect to the latest file information are explicitly used for novel, flexible task scheduling algorithms and file replication management policies, featuring dynamic file replication and relocation of file copies as well as offering file versions of varying recency. The achieved adaptability far outweighs the additional overhead in comparison to simpler models, and enhances both reliability and real-time responsiveness for file access. Both the development of the model and the experimental analysis at the various stages were done in an incremental manner. This was necessary in order to cope with the complexity of the problems resulting from conflicting requirements and dynamic trade-offs (e.g. real-time responsiveness vs. reliability). As the next incremental model extension, and as the major contribution of this paper, a series of integration policies are developed for task and resource scheduling, after redefining the role and order of task and resource scheduling: the periodic and dynamic models (and combinations thereof) are used to invoke the task scheduler for a fixed interval of time. All of these policies compare very convincingly against the \"classical\" model where the task scheduler only schedules tasks after their resources have been allocated. The results are discussed.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"74 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":"116344807","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

Efficient algorithms for data distribution on distributed memory multicomputers 分布式存储多计算机上数据分发的高效算法

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590385

Peizong Lee

引用次数: 3

Designing general-purpose fault-tolerant distributed systems-a layered approach 设计通用的容错分布式系统——一种分层方法

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590327

A. Nayak, W. Jone, Sunil R. Das

引用次数: 0

Performance analysis of distributed client-server message queuing 分布式客户机-服务器消息队列的性能分析

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590372

E. Zimran, M. Rosen

引用次数: 0

Parallel algorithms for verification and sensitivity analysis of minimum spanning trees 最小生成树验证与灵敏度分析的并行算法

Proceedings of 1994 International Conference on Parallel and Distributed Systems Pub Date : 1994-12-19 DOI: 10.1109/ICPADS.1994.590315

W. Liang, Xiaojun Shen, Qing Hu

引用次数: 0