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

1993 4th Workshop on Future Trends of Distributed Computing Systems最新文献

筛选
英文 中文
Blocking probability and convergence analysis of an adaptive DQDB bandwidth balancing mechanism 一种自适应DQDB带宽均衡机制的阻塞概率与收敛性分析
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344146
R. Chow, S. Ou
{"title":"Blocking probability and convergence analysis of an adaptive DQDB bandwidth balancing mechanism","authors":"R. Chow, S. Ou","doi":"10.1109/FTDCS.1993.344146","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344146","url":null,"abstract":"The authors present a distributed realization of an adaptive load-based bandwidth balancing mechanism (APR, adaptive proportional) for improving DQDB (distributed queue dual bus), fairness and performance. Under the APR strategy, bandwidth is assigned distributedly and dynamically to each station according to the current offered load distribution in the system. The major significance of the method is its simple realization in a distributed environment and its ability to achieve load-based fairness in throughput and blocking probability while at the same time reducing the wasted system bandwidth to a minimum. The APR scheme is shown to be fair in handling multi-priority traffic. In addition to the performance of APR, the system convergence behavior is also analyzed.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124438243","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
On the integration of model-based performance optimization and program implementation 基于模型的性能优化与程序实现的集成
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344157
A. Mitschele-Thiel
{"title":"On the integration of model-based performance optimization and program implementation","authors":"A. Mitschele-Thiel","doi":"10.1109/FTDCS.1993.344157","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344157","url":null,"abstract":"The author describes an approach to integrate system design and implementation of embedded parallel systems into a programming environment. The computation of the design decisions is based on the branch-and-bound-with-underestimate technique, previously applied to compute the optimal schedule for precedence constraint task graphs in the presence of communication cost. The authors have extended this method to compute the optimal system configuration (i.e., the configuration which yields optimal performance) consisting of the network topology, the schedule, and the placement of buffers. In addition, a quasi-static scheduling strategy to handle input-dependent run-time behavior is described. The ideas presented here have been implemented in the Data Stream Processing Language (DSPL) programming environment, which consists of a programming language and an integrated set of tools supporting automated system design as well as implementation.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128704524","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 the object space: a distributed parallel make 使用对象空间:分布式并行制作
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344151
Andreas Polze
{"title":"Using the object space: a distributed parallel make","authors":"Andreas Polze","doi":"10.1109/FTDCS.1993.344151","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344151","url":null,"abstract":"The author presents the object space approach to distributed computation. It allows for decoupled communication between program components by providing a shared data space of objects. The object space approach extends the sequential language C++ with coordination and communication primitives, such as those in Linda. It integrates inheritance into the associative addressing scheme and facilitates passing of arbitrary objects between program components. Furthermore, the author introduces the notion of application-specific matching functions. A prototype for object space has been implemented in C++ under UNIX. The author gives a distributed parallel make as an example to demonstrate the ideas and use of the concepts developed.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"28 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113954960","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}
引用次数: 18
Parallel programming on reconfigurable meshes with buses 带总线的可重构网格并行编程
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344158
M. Nigam, S. Sahni
{"title":"Parallel programming on reconfigurable meshes with buses","authors":"M. Nigam, S. Sahni","doi":"10.1109/FTDCS.1993.344158","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344158","url":null,"abstract":"Several mesh-like architectures have been proposed to support parallel computing. These connect the processor mesh with a system of reconfigurable buses. In this work, the authors present several examples to illustrate the ease with which efficient (in fact, constant time) programs can be developed for the weakest of these architectures. The examples are from computational geometry.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132329503","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
Programming flexible distributed real-time systems 编程灵活的分布式实时系统
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344138
E. Cardozo, M. Magalhaes, J. Adán
{"title":"Programming flexible distributed real-time systems","authors":"E. Cardozo, M. Magalhaes, J. Adán","doi":"10.1109/FTDCS.1993.344138","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344138","url":null,"abstract":"Discusses the implementation of distributed real-time systems employing the active object model. This approach handles time constraints as part of a broader concept: quality of service (QOS). This generalization is necessary to deal with many current real-time applications, particularly those related to multimedia communications.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131767198","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
Hierarchical decision structure for distributed algorithms 分布式算法的分层决策结构
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344156
C. Kim, J.-Y. Lee, C.-M. Park
{"title":"Hierarchical decision structure for distributed algorithms","authors":"C. Kim, J.-Y. Lee, C.-M. Park","doi":"10.1109/FTDCS.1993.344156","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344156","url":null,"abstract":"When the number of nodes in a distributed system becomes very large, neither a fully centralized algorithm nor a fully distributed algorithm is suitable for implementation. The number of messages exchanged in most distributed algorithms becomes too large to make them practical, while the system with a fully centralized algorithm is vulnerable to failure of the control node. The authors propose another approach to constructing an algorithm for distributed systems with a large number of nodes, in which the number of messages to be exchanged would be reduced at a cost of communication delay if needed, and fault-tolerant capability remains. The nodes in a distributed system are partitioned into multiple groups, each of which contain multiple nodes. The process of making a decision is also divided into two steps: a decision in a group is made first, followed by a decision made based on the group decisions. One can apply different algorithms at each decision level. The authors examine the applicability of the approach using well-known solutions to two problems: mutual exclusion and majority consensus. As a result, they believe that this kind of framework provides another way of designing algorithms for distributed systems.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"110 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893316","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 timed finite state machine in Z for distributed real-time systems 分布式实时系统的时间有限状态机规范
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344139
G. Noubir, D. Stephens, P. Raja
{"title":"Specification of timed finite state machine in Z for distributed real-time systems","authors":"G. Noubir, D. Stephens, P. Raja","doi":"10.1109/FTDCS.1993.344139","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344139","url":null,"abstract":"The authors' approach for real-time systems is based on defining finite state machines (FSMs) and time constraints in Z while integrating the two into a new model, called timed finite state machines (TFSM). They introduce into the FSM model the two concepts related to time, time stamps and time constraints, and then redefine the concept of events and introduce an event history. Three types of time constraints are defined which can be applied to the transitions in the FSMs creating a new set of transitions in the FSMs creating a new set of transitions, constrained transitions. These types are: absolute constraints. The event history is a sequence of events which have occurred since the initialization of the system. This sequence can also be constrained by a set of consistency invariants (i.e. constraints applied to the sequence as a whole, such as monotonicity). All constraints on the TFSM are expressed as predicates using the first-order logic of Z.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116958438","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
Quality of service based transport architecture using XTP 使用XTP的基于服务质量的传输体系结构
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344171
I. Miloucheva, K. Rebensburg
{"title":"Quality of service based transport architecture using XTP","authors":"I. Miloucheva, K. Rebensburg","doi":"10.1109/FTDCS.1993.344171","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344171","url":null,"abstract":"The RACE 2060 project CIO (Coordination, Implementation and Operation) uses a quality of service (QoS) based multimedia architecture supported by XTP (Xpress Transfer Protocol) XTP covers the OSI transport and network layer and is designed for high-speed communication. It has flexible mechanisms, such as connection-oriented mechanisms and selective retransmission, for QoS provision of multimedia and distributed applications in heterogeneous internetwork environments. Combining the flexibility of XTP's mechanisms with service- and QoS-dependent resource-reservation schemes, the authors discuss the concepts of the XTP prototype implementation, which is providing resource control especially on ATM networks. The authors also compare related multimedia platforms, like the Internet Stream (ST-II) protocol, which they use in the BERKOM project.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130621974","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
Toward modular concurrency control for object-oriented distributed systems 面向对象分布式系统的模块化并发控制
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344150
R. Guerraoui
{"title":"Toward modular concurrency control for object-oriented distributed systems","authors":"R. Guerraoui","doi":"10.1109/FTDCS.1993.344150","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344150","url":null,"abstract":"Object-based distributed systems are intended to merge the benefits of both object-based languages and distribution. To make such systems useful, it is, however, necessary to extend the basic object model so that it can permit the expression of distribution related aspects. The author discusses the issues raised by designing transaction concurrency control within an object-oriented distributed system. He proposes an original approach based on conditions bound to each object operation. These conditions allow to express various concurrency control policies, e.g., pessimistic or optimistic, all in an orthogonal way to the serialization protocol. By confining the concurrency control code within dedicated conditions, the author enhances both encapsulation and inheritance.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126891697","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
Replicated object management using group technology 使用组技术的复制对象管理
1993 4th Workshop on Future Trends of Distributed Computing Systems Pub Date : 1993-09-22 DOI: 10.1109/FTDCS.1993.344176
Luís E. T. Rodrigues, P. Veríssimo
{"title":"Replicated object management using group technology","authors":"Luís E. T. Rodrigues, P. Veríssimo","doi":"10.1109/FTDCS.1993.344176","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344176","url":null,"abstract":"The authors detail the goals of the ROMANCE (replicated object management configurable environment) project and present its software architecture and current status. A fundamental goal of the project is to experiment with group technology. In ROMANCE, distribution and replication are implemented using underlying group communication and membership services. The authors also describe how these tools are used to achieve ROMANCE goals.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134291094","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
下一页 尾页
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学术官方微信