[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s最新文献

筛选
英文 中文
Assigning distinct identities to sites on an anonymous distributed system 为匿名分布式系统上的站点分配不同的身份
J. Hélary, M. Raynal
{"title":"Assigning distinct identities to sites on an anonymous distributed system","authors":"J. Hélary, M. Raynal","doi":"10.1109/FTDCS.1988.26683","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26683","url":null,"abstract":"A distributed algorithm that assigns distinct and ordered identities to the sites of a connect anonymous distributed system is presented. The basis for this algorithm is the sequential distributed traversal scheme, the sequential aspect of which ensures that all sites are systematically visited in mutual exclusion. Such an algorithm allows the definition of sites to be independent of particular of initial values (as far as identities are concerned).<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122106539","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
Fast data selection and broadcast on the Butterfly network 快速数据选择和广播在蝴蝶网络
W. Lin, T. Sheu, C. Das, T. Feng, C.-L. Wu
{"title":"Fast data selection and broadcast on the Butterfly network","authors":"W. Lin, T. Sheu, C. Das, T. Feng, C.-L. Wu","doi":"10.1109/FTDCS.1988.26681","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26681","url":null,"abstract":"A quadtree communication structure is presented, along with two associated procedures for efficient, contention-free data selection and broadcast on the BBN Butterfly parallel processor and its family. the proposed structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for performing two primitive operations: selecting data from many different sources and distributing data from a single source. While performing these two operations through the quadtree structure, the two procedures, ascend and descend, incur no link conflicts in the Butterfly network. By properly merging messages and efficiently replicating data, they can complete required communications in O(log/sub 4/ M) parallel steps, where M is the size of a Butterfly parallel processor. Contraction and stretch of the quadtree communication structure while retaining the conflict-free property, is considered. The contracted and stretched tree structures allow the adaptive balance of computations and communication requirements for various algorithms with different computation/communication ratios.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123832585","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
A hierarchical message mechanism for distributed systems software 分布式系统软件的分层消息机制
Y. K. Choe, D. Agrawal, C. R. Green
{"title":"A hierarchical message mechanism for distributed systems software","authors":"Y. K. Choe, D. Agrawal, C. R. Green","doi":"10.1109/FTDCS.1988.26691","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26691","url":null,"abstract":"The authors investigate a mechanism for distributed computer systems that can support control and data communication right from the beginning of a distributed-software design to the actual execution and maintenance. The concept of message hierarchy is illustrated by an example of remote rendezvous in distributed systems. The control messages need a faster communication structure than the data messages. This observation suggests two-speed communication structure as a realization of hierarchical message systems. The two-speed structure involves four major components per node: communication links with different transmission speeds, a message arbiter, a node information table (NIT), and a system node directory (SND). A major benefit of a system based on hierarchical message-passing is that the desired systemwide information can be updated very quickly.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122877515","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
Future trend on concurrency control in distributed database system design 分布式数据库系统设计中并发控制的未来趋势
S.M. Wu, D. Pan
{"title":"Future trend on concurrency control in distributed database system design","authors":"S.M. Wu, D. Pan","doi":"10.1109/FTDCS.1988.26733","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26733","url":null,"abstract":"The state of the art of concurrency control is reviewed, and the pros and cons of various approaches are compared. The time-stamp interval approach is emphasized due to its promising features. Critical issues and control strategy are suggested for future studies in the 1990s. A time-stamp interval approach with parallel validation is presented under the proposed guidelines. Simulation results are analyzed to compare the related methods.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"96 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120914585","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
The effective implementation of a flexible communication mechanism for distributed and parallel programming 有效实现了一种灵活的通信机制,适用于分布式并行编程
C. Kordecki, Stefan Jähnichen
{"title":"The effective implementation of a flexible communication mechanism for distributed and parallel programming","authors":"C. Kordecki, Stefan Jähnichen","doi":"10.1109/FTDCS.1988.26701","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26701","url":null,"abstract":"A mechanism that relies on shared communication resources but avoids many of its known disadvantages is proposed. Its main idea is introduced as an extension of the Communicating Sequential Processes (CSP) notation to asynchronous and type-safe communication behavior. It is shown that this mechanism can be used for strongly and loosely coupled processors and is thus independent of a specific distributed or parallel architecture. This independence allows changes of the hardware system as well as static or dynamic changes of the software system. The mechanism relies on asynchronous message-passing but can easily be extended to send no-wait procedure calls.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207341","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
Specification of concurrently executable modules and distributed modular systems 并发可执行模块和分布式模块化系统的规范
H. Weber, H. Ehrig
{"title":"Specification of concurrently executable modules and distributed modular systems","authors":"H. Weber, H. Ehrig","doi":"10.1109/FTDCS.1988.26699","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26699","url":null,"abstract":"A specification concept for a distributed modular system is introduced. Concurrently executable modules and their interconnections are used as the basis for a computational model for distributed systems that allows the representation of distributed systems in which each of the local subsystems can be concurrently executable. Hence, both internal concurrency within local subsystems and external concurrency in the network between different subsystems can be appropriately expressed. A specification language for systems of that kind, called Pi language is introduced by giving an overview of its syntax and semantics.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"763 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133283210","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}
引用次数: 11
Modeling robust computations in a data-flow-like style 以类似数据流的样式建模健壮的计算
Andrea Bondavalli, L. Simoncini
{"title":"Modeling robust computations in a data-flow-like style","authors":"Andrea Bondavalli, L. Simoncini","doi":"10.1109/FTDCS.1988.26705","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26705","url":null,"abstract":"The outline of a programming language which can be used to avoid limitations and satisfy the requirements of visibility of the application and high mapping to the physical support is presented. Its expressive power is shown through a set of examples, characteristics of robustness of the applications, as well as the possibility of describing fault-tolerant applications, are discussed and exemplified.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132909256","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 characterization of the dynamical ascending routing 动态上升路由的一种表征
A. Bouabdallah, M. Tréhel
{"title":"A characterization of the dynamical ascending routing","authors":"A. Bouabdallah, M. Tréhel","doi":"10.1109/FTDCS.1988.26703","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26703","url":null,"abstract":"A characterization of a routing defined on a dynamical logical structure is presented. By uniting the structure with the messages destabilizing it, an invariant is obtained, that allows a simple proof of the properties of the routing. The results are exploited by designing and structuring the proof of the mutual exclusion algorithm, which uses this routing. The specifications are done in an axiomatic manner, and the proof is given in a temporal framework.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130497957","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}
引用次数: 2
On basic rewriting rules to verify communicating machines 关于验证通信机器的基本重写规则
H. Mountassir
{"title":"On basic rewriting rules to verify communicating machines","authors":"H. Mountassir","doi":"10.1109/FTDCS.1988.26700","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26700","url":null,"abstract":"An approach to proving some properties of the communication of communicating machines is presented. The methodology is based on a simple algebra, using rewriting systems on communicating words and homogeneous expressions. The semicommutations and partial commutations over an alphabet of sending and receiving messages suffice to guarantee the progress properties or the communication. Basic rules of an automatic validation communicating machine are defined in an algebraic fashion, without representing the global states, transitions, and contents of channels. Only the behavior is needed as a basis for the results obtained.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127265266","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
The architecture of a distributed computer system 分布式计算机系统的结构
Richard Studdert, J. Buckley, C. Sreenan, M. P. Russell
{"title":"The architecture of a distributed computer system","authors":"Richard Studdert, J. Buckley, C. Sreenan, M. P. Russell","doi":"10.1109/FTDCS.1988.26720","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26720","url":null,"abstract":"Some design and implementation issues of the Ogham kernel for distributed operating systems are presented. Ogham is based on an object model, with all objects accessed in a location-independent fashion using a specialized communication facility. Resource managers are realized as processes that are free to migrate throughout the system. Ogham is designed to allow local-area-interconnected microcomputers to be used as a computing facility for the investigation of distributed operating systems and related topics.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128995040","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
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学术官方微信