Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217510
S. Hsu, C. Chung
Repeated execution of a concurrent program with the same input may produce different sequence of rendezvous, thus making different output. The output of a concurrent program executed is determined by both the statements traversed by each task and the sequence of rendezvous. The traversed statements of each task constitute a task path, all task paths in an execution instance constitute a concurrent path. This paper proposes a new approach to generate all feasible concurrent paths from task path sets of a concurrent program. All possible rendezvous sequences of each feasible concurrent path are also generated. A heuristic approach is also proposed to select the suitable concurrent path set which satisfies node or branch coverage criterion.<>
{"title":"A heuristic approach to path selection problem in concurrent program testing","authors":"S. Hsu, C. Chung","doi":"10.1109/FTDCS.1992.217510","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217510","url":null,"abstract":"Repeated execution of a concurrent program with the same input may produce different sequence of rendezvous, thus making different output. The output of a concurrent program executed is determined by both the statements traversed by each task and the sequence of rendezvous. The traversed statements of each task constitute a task path, all task paths in an execution instance constitute a concurrent path. This paper proposes a new approach to generate all feasible concurrent paths from task path sets of a concurrent program. All possible rendezvous sequences of each feasible concurrent path are also generated. A heuristic approach is also proposed to select the suitable concurrent path set which satisfies node or branch coverage criterion.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126311283","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217519
A.L.P. Chen, Kuo-Fang Chieng, Tony C. T. Kuo, E. Lee, Shu-Chin Su
In a server client based distributed computing system, data can be cached at the clients to increase read efficiency and system scalability. When the consistency of the caches can be relaxed and the inconsistency controlled, the performance of the distributed system can be further improved. The authors elaborate on this concept and present a prototype system which they have constructed to show the viability of the concept.<>
{"title":"Improving the performance of a distributed computing system through inconsistent caches","authors":"A.L.P. Chen, Kuo-Fang Chieng, Tony C. T. Kuo, E. Lee, Shu-Chin Su","doi":"10.1109/FTDCS.1992.217519","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217519","url":null,"abstract":"In a server client based distributed computing system, data can be cached at the clients to increase read efficiency and system scalability. When the consistency of the caches can be relaxed and the inconsistency controlled, the performance of the distributed system can be further improved. The authors elaborate on this concept and present a prototype system which they have constructed to show the viability of the concept.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130127057","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217482
K.H. Kim
The technology for designing loosely coupled distributed computer systems (DCSs) required to tolerate propagated errors caused by software and/or hardware has remained in an immature state. This paper focuses on the type of DCS applications where a system is structured as a set of loosely coupled interacting processes distributed among multiple physical sites and each process is designed in the 'partitioned design' mode, i.e. designed with its interface specification only, rather than with full knowledge of interfaces between other processes (or sites). The thesis is that fault tolerance capabilities must be designed into loosely coupled processes without violating the design policy. The programmer-transparent coordination (PTC) scheme is one such approach that has been evolving since 1978. While the basic PTC scheme called the PTC/OR (PTC with obedient receiver) scheme is a scheme for facilitating various forms of cooperative backward recovery in systems of loosely coupled processes, it has one drawback: the difficulty of bounding worst-case recovery time. After discussing various possible solution approaches and their limitations, a promising approach called the PTC/SL (PTC with session leaders) scheme which superimposes additional rules on structuring process interactions onto those of the PTC/OR scheme, is presented. Under the PTC/SL scheme various flexible forms of process interactions are still allowed while the task of ensuring bounded recovery time is made a simple one. Several research issues related to the PTC/SL scheme, e.g., efficient implementation techniques, remain as subjects for future research.<>
设计能够容忍由软件和/或硬件引起的传播性错误的松耦合分布式计算机系统(dcs)的技术仍然处于不成熟的状态。本文关注的是DCS应用类型，其中系统结构为一组松散耦合的交互过程，分布在多个物理站点中，每个过程以“分区设计”模式设计，即仅根据其接口规范设计，而不是充分了解其他过程(或站点)之间的接口。本文的论点是，容错能力必须在不违反设计策略的情况下设计成松散耦合的过程。程序员透明协调(PTC)方案就是自1978年以来不断发展的一种方法。基本的PTC方案称为PTC/OR (PTC with obedient receiver)方案，是一种促进松散耦合过程系统中各种形式的协作向后恢复的方案，但它有一个缺点:难以限定最坏情况恢复时间。在讨论了各种可能的解决方法及其局限性之后，提出了一种很有前途的方法，称为PTC/SL(带会话领导者的PTC)方案，该方案在PTC/OR方案的基础上附加了结构化进程交互的规则。在PTC/SL方案下，各种灵活形式的进程交互仍然被允许，而确保有界恢复时间的任务变得简单。与PTC/SL方案相关的几个研究问题，例如，有效的实施技术，仍然是未来研究的主题。
{"title":"The PTC scheme for designing loosely coupled recoverable processes: issues in realizing bounded recovery time","authors":"K.H. Kim","doi":"10.1109/FTDCS.1992.217482","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217482","url":null,"abstract":"The technology for designing loosely coupled distributed computer systems (DCSs) required to tolerate propagated errors caused by software and/or hardware has remained in an immature state. This paper focuses on the type of DCS applications where a system is structured as a set of loosely coupled interacting processes distributed among multiple physical sites and each process is designed in the 'partitioned design' mode, i.e. designed with its interface specification only, rather than with full knowledge of interfaces between other processes (or sites). The thesis is that fault tolerance capabilities must be designed into loosely coupled processes without violating the design policy. The programmer-transparent coordination (PTC) scheme is one such approach that has been evolving since 1978. While the basic PTC scheme called the PTC/OR (PTC with obedient receiver) scheme is a scheme for facilitating various forms of cooperative backward recovery in systems of loosely coupled processes, it has one drawback: the difficulty of bounding worst-case recovery time. After discussing various possible solution approaches and their limitations, a promising approach called the PTC/SL (PTC with session leaders) scheme which superimposes additional rules on structuring process interactions onto those of the PTC/OR scheme, is presented. Under the PTC/SL scheme various flexible forms of process interactions are still allowed while the task of ensuring bounded recovery time is made a simple one. Several research issues related to the PTC/SL scheme, e.g., efficient implementation techniques, remain as subjects for future research.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122974295","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217501
A. Tantawy, M. Zitterbart
The emergence of public ATM networks, such as B-ISDN and SMDS, is considered to have a high impact on future internetworking environments. This paper presents a new bridging architecture designed for that purpose and discusses its feasibility in TCP/IP networks. The new architecture, called Open Bridging, uses special capabilities of public ATM networks, such as the hierarchical addressing mechanism and the routing support inside the network, to provide for efficient interconnection of remote LANs across public ATM networks. The operation of Open Bridges does not interfere with current TCP/IP protocols. However, the efficiency of Open Bridging can be obtained in the interconnection of TCP/IP networks if a slight extension to the address resolution protocol (ARP) is implemented to push the routing of data packets down to the MAC level. Moreover, the architecture of Open Brouters is also proposed to enable full interoperability among domains using either Open Bridging or IP routing.<>
{"title":"Internetworking across public ATM networks","authors":"A. Tantawy, M. Zitterbart","doi":"10.1109/FTDCS.1992.217501","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217501","url":null,"abstract":"The emergence of public ATM networks, such as B-ISDN and SMDS, is considered to have a high impact on future internetworking environments. This paper presents a new bridging architecture designed for that purpose and discusses its feasibility in TCP/IP networks. The new architecture, called Open Bridging, uses special capabilities of public ATM networks, such as the hierarchical addressing mechanism and the routing support inside the network, to provide for efficient interconnection of remote LANs across public ATM networks. The operation of Open Bridges does not interfere with current TCP/IP protocols. However, the efficiency of Open Bridging can be obtained in the interconnection of TCP/IP networks if a slight extension to the address resolution protocol (ARP) is implemented to push the routing of data packets down to the MAC level. Moreover, the architecture of Open Brouters is also proposed to enable full interoperability among domains using either Open Bridging or IP routing.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132994077","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217518
Didier Buchs, N. Guelfi
The CO-OPN specification formalism for large concurrent systems is presented. CO-OPN includes specification of data types and concurrency through the use of modular algebraic specification and structured algebraic nets. This structure follows the object oriented paradigms. Distributed system specification is studied with CO-OPN through a case study of communication components: the Transit-Node. The interesting specification features of CO-OPN (structuring, refinements and concurrency) are discussed.<>
{"title":"Distributed system specification using CO-OPN","authors":"Didier Buchs, N. Guelfi","doi":"10.1109/FTDCS.1992.217518","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217518","url":null,"abstract":"The CO-OPN specification formalism for large concurrent systems is presented. CO-OPN includes specification of data types and concurrency through the use of modular algebraic specification and structured algebraic nets. This structure follows the object oriented paradigms. Distributed system specification is studied with CO-OPN through a case study of communication components: the Transit-Node. The interesting specification features of CO-OPN (structuring, refinements and concurrency) are discussed.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131608274","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217498
Seong-Rak Rim, Y. Cho
This paper describes the design and implementation of the basic primitives and major components of the message-based microkernel for real-time systems to find out its shortcomings and ways to improve them. The real-time OS with message-based microkernel enables a user to add or change the system services easily for special purposes. But it has rather large overhead of interrupt latency and system call due to the message copy and synchronization. In order to support true real-time performance, kernel preemption and efficient message exchange mechanism is required.<>
{"title":"Message-based microkernel for real-time system","authors":"Seong-Rak Rim, Y. Cho","doi":"10.1109/FTDCS.1992.217498","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217498","url":null,"abstract":"This paper describes the design and implementation of the basic primitives and major components of the message-based microkernel for real-time systems to find out its shortcomings and ways to improve them. The real-time OS with message-based microkernel enables a user to add or change the system services easily for special purposes. But it has rather large overhead of interrupt latency and system call due to the message copy and synchronization. In order to support true real-time performance, kernel preemption and efficient message exchange mechanism is required.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569275","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217495
M. van der Schrier, B. Teunissen
The Application Pilots of the European programme RACE announce new requirements on future telecommunication facilities. In this context the Exploitation and Service Project (RACE1091) has been established to support and evaluate the pilots. For the assessment a taxonomy was used to classify the pilots user-requirements. The taxonomy is based on the BERKOM Reference Model and supports the identification of standard solutions. It was observed, although the description of the Application Pilots in terms of their users is different, they have several communalities. The assessment shows that international standards do not completely comply with the user-requirements in a broadband environment. On the one hand overlap in functionality could be observed, on the other hand functionality offered by standards, should be enhanced. This paper describes the appliance of the taxonomy to the TELEMED-pilot.<>
{"title":"Assessment of advanced broadband scenarios in Europe","authors":"M. van der Schrier, B. Teunissen","doi":"10.1109/FTDCS.1992.217495","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217495","url":null,"abstract":"The Application Pilots of the European programme RACE announce new requirements on future telecommunication facilities. In this context the Exploitation and Service Project (RACE1091) has been established to support and evaluate the pilots. For the assessment a taxonomy was used to classify the pilots user-requirements. The taxonomy is based on the BERKOM Reference Model and supports the identification of standard solutions. It was observed, although the description of the Application Pilots in terms of their users is different, they have several communalities. The assessment shows that international standards do not completely comply with the user-requirements in a broadband environment. On the one hand overlap in functionality could be observed, on the other hand functionality offered by standards, should be enhanced. This paper describes the appliance of the taxonomy to the TELEMED-pilot.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"291 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114475313","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217464
T. Kondo, M. Inoue, K. Nakai, K. Doi, Y. Suzuki
In recent years, computer systems for information management and control have requirements for high reliable systems. Consequently hardware reliability has been highly increased, but system failures caused by failure of software modification or software function expansion have been increased. Therefore, online software maintainability and expandability is highly required to fulfil the requirements of fault tolerance. In this paper, the new system architecture fulfilling the above needs called autonomous decentralized system is explained and its application to the real time steel production computer control systems is also presented.<>
{"title":"Application of autonomous decentralized system to the steel production computer control","authors":"T. Kondo, M. Inoue, K. Nakai, K. Doi, Y. Suzuki","doi":"10.1109/FTDCS.1992.217464","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217464","url":null,"abstract":"In recent years, computer systems for information management and control have requirements for high reliable systems. Consequently hardware reliability has been highly increased, but system failures caused by failure of software modification or software function expansion have been increased. Therefore, online software maintainability and expandability is highly required to fulfil the requirements of fault tolerance. In this paper, the new system architecture fulfilling the above needs called autonomous decentralized system is explained and its application to the real time steel production computer control systems is also presented.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115755192","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217516
R.J. Coelho da Costa, J. Courtiat
This paper deals with the study of behavioral equivalences between labeled (place/transition) Petri nets preserving the causal relationship among transition firings. This is achieved by defining a very slight modification in the conventional Petri net formalism, leading to associating an additional information to each token of the net. Following this approach, bisimulation equivalences are defined within a partial order framework, in a way similar to Park's notion of bisimilarity originally defined for interleaving based models.<>
{"title":"Using Petri nets as a model for Petri nets","authors":"R.J. Coelho da Costa, J. Courtiat","doi":"10.1109/FTDCS.1992.217516","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217516","url":null,"abstract":"This paper deals with the study of behavioral equivalences between labeled (place/transition) Petri nets preserving the causal relationship among transition firings. This is achieved by defining a very slight modification in the conventional Petri net formalism, leading to associating an additional information to each token of the net. Following this approach, bisimulation equivalences are defined within a partial order framework, in a way similar to Park's notion of bisimilarity originally defined for interleaving based models.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116218831","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}
Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217496
M. Endler
The author presents a model with its linguistic and operational support for implementing consistency-preserving reconfigurations of distributed applications. This model extends the configuration-programming approach, where a distributed program is implemented at a programming and a configuration level and where dynamic changes are expressed only at the configuration level, i.e. as modifications of the connectivity structure among the parallel executing components. In this approach, besides the communication interface, every component of the application owns a reconfiguration interface, which defines the reconfiguration-specific interactions between the application processes and the reconfiguration processing. With such an interface, application and reconfiguration concerns can be well separated and existing applications can be easily upgraded to support consistency-preserving reconfigurations.<>
{"title":"Support for consistency-preserving dynamic reconfigurations in distributed systems","authors":"M. Endler","doi":"10.1109/FTDCS.1992.217496","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217496","url":null,"abstract":"The author presents a model with its linguistic and operational support for implementing consistency-preserving reconfigurations of distributed applications. This model extends the configuration-programming approach, where a distributed program is implemented at a programming and a configuration level and where dynamic changes are expressed only at the configuration level, i.e. as modifications of the connectivity structure among the parallel executing components. In this approach, besides the communication interface, every component of the application owns a reconfiguration interface, which defines the reconfiguration-specific interactions between the application processes and the reconfiguration processing. With such an interface, application and reconfiguration concerns can be well separated and existing applications can be easily upgraded to support consistency-preserving reconfigurations.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127025539","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：