Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217467
Min-Sheng Lin, Deng-Jyi Chen
This paper presents an algorithm for computing the distributed program reliability in distributed computing systems (DCS). The algorithm, called FREA (fast reliability evaluation algorithm), is based on the generalized factoring theorem with several incorporated reliability-preserving reductions to speedup the reliability evaluation. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economic in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.<>
{"title":"Distributed program reliability analysis","authors":"Min-Sheng Lin, Deng-Jyi Chen","doi":"10.1109/FTDCS.1992.217467","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217467","url":null,"abstract":"This paper presents an algorithm for computing the distributed program reliability in distributed computing systems (DCS). The algorithm, called FREA (fast reliability evaluation algorithm), is based on the generalized factoring theorem with several incorporated reliability-preserving reductions to speedup the reliability evaluation. The effect of file distributions, program distributions, and various topologies on reliability of the DCS is studied in detail using the proposed algorithm. Compared with existing algorithms on various network topologies, file distributions, and program distributions, the proposed algorithm is much more economic in both time and space. To compute the distributed program reliability, the ARPA network is studied to illustrate the feasibility of the proposed algorithm.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"41 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":"123092275","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.217466
N. Kamel, T. Song, M. Kamel
The authors describe a loose coupling approach to integrate molecular biology databases that is based on concepts from graphical user interfaces. The system allows the user to custom build a graphical environment in which a uniform set of commands is provided for all the databases chosen to be members of that environment. The paper also includes preliminary description of a system, currently under development, that provides this integration. The system is designed to satisfy a few principles that guarantee that no degradation of previously existing user skills will occur and that the system can be tailored to the needs of different classes of users. The design goals of the system also include operation and database extensibility and robustness in the sense that only a minimal amount of effort is required to accommodate changes in individual database.<>
{"title":"Incorporating GUI in integration of molecular biology databases","authors":"N. Kamel, T. Song, M. Kamel","doi":"10.1109/FTDCS.1992.217466","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217466","url":null,"abstract":"The authors describe a loose coupling approach to integrate molecular biology databases that is based on concepts from graphical user interfaces. The system allows the user to custom build a graphical environment in which a uniform set of commands is provided for all the databases chosen to be members of that environment. The paper also includes preliminary description of a system, currently under development, that provides this integration. The system is designed to satisfy a few principles that guarantee that no degradation of previously existing user skills will occur and that the system can be tailored to the needs of different classes of users. The design goals of the system also include operation and database extensibility and robustness in the sense that only a minimal amount of effort is required to accommodate changes in individual database.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"39 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":"122755573","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.217512
N. B. Serbedzija, Stefan Jähnichen
To program real-time distributed applications, programmers have to choose between the general purpose distributed programming languages or a combination of a sequential language and low-level services offered by network-oriented operating systems. However, both solutions prove to be unsatisfactory. While the former alternative rarely meets application needs, the latter usually yields poor software which is difficult to maintain and re-structure. This approach suggests the use of a simple concurrency model well-suited for expressing both real-time and real parallelism. It is based on a language extension providing features for high-level real-time distributed programming. Such a language extension can be easily embedded in any sequential language (e.g. C, C++ or Modula-2). This allows programmers to develop complex systems using their favourite language extended with a small set of new constructs.<>
{"title":"High-level real-time distributed programming","authors":"N. B. Serbedzija, Stefan Jähnichen","doi":"10.1109/FTDCS.1992.217512","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217512","url":null,"abstract":"To program real-time distributed applications, programmers have to choose between the general purpose distributed programming languages or a combination of a sequential language and low-level services offered by network-oriented operating systems. However, both solutions prove to be unsatisfactory. While the former alternative rarely meets application needs, the latter usually yields poor software which is difficult to maintain and re-structure. This approach suggests the use of a simple concurrency model well-suited for expressing both real-time and real parallelism. It is based on a language extension providing features for high-level real-time distributed programming. Such a language extension can be easily embedded in any sequential language (e.g. C, C++ or Modula-2). This allows programmers to develop complex systems using their favourite language extended with a small set of new constructs.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"39 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":"128710538","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.217509
M. Hurfin, N. Plouzeau, M. Raynal
This paper addresses the problem of debugging distributed programs executed on distributed memory parallel computers with message-passing interprocess communication. The main issues of debugging such programs are exposed. Principles for designing and implementing a debugger for programs specified in the Estelle language are presented. All the described solutions have been implemented in a distributed debugger called EREBUS.<>
{"title":"EREBUS: a debugger for asynchronous distributed computing systems","authors":"M. Hurfin, N. Plouzeau, M. Raynal","doi":"10.1109/FTDCS.1992.217509","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217509","url":null,"abstract":"This paper addresses the problem of debugging distributed programs executed on distributed memory parallel computers with message-passing interprocess communication. The main issues of debugging such programs are exposed. Principles for designing and implementing a debugger for programs specified in the Estelle language are presented. All the described solutions have been implemented in a distributed debugger called EREBUS.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"76 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":"129190141","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.217490
Chih-Cheng Lien, Chien-Chiao Yang
A distributed computing system consists of objects and messages which are transmitted between objects. An object can request other objects to do some services by passing messages through a communication system. Usually, the services are done if the message transmission on the communication system is reliable. However, in some applications with timing constraints, a service may be of no value if it violates some constraints. The authors thus can allow the object to send the constraint within the message to avoid this useless service. In validating the satisfaction of a service for a constraint, using the current elapsed time and using the predicted elapsed time are discussed. The relative accuracy of the prediction in several types of message transmissions is also explained.<>
{"title":"Reduction of useless services with timing constraints","authors":"Chih-Cheng Lien, Chien-Chiao Yang","doi":"10.1109/FTDCS.1992.217490","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217490","url":null,"abstract":"A distributed computing system consists of objects and messages which are transmitted between objects. An object can request other objects to do some services by passing messages through a communication system. Usually, the services are done if the message transmission on the communication system is reliable. However, in some applications with timing constraints, a service may be of no value if it violates some constraints. The authors thus can allow the object to send the constraint within the message to avoid this useless service. In validating the satisfaction of a service for a constraint, using the current elapsed time and using the predicted elapsed time are discussed. The relative accuracy of the prediction in several types of message transmissions is also explained.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"308 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":"123215328","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.217468
Carl K. Chang, Y. Al-Salqan, T. DeFanti, R. Ramakrishnan, C. Kang
Scientific visualization is a method of computing which provides an insight into the visualized-simulated system. Recently, the simulation of different physical processes and systems has developed. Furthermore, the simulated system getting bigger and more sophisticated. Recently, the authors proposed a new hybrid architecture local area network (Hybrid-Meshnet). The Hybrid-Meshnet allows an insertion of data links into existing LANs. The authors simulate, investigate and visualize the operation and performance behaviour of Hybrid-Ethernet in comparison with conventional Ethernet. Through the event-driven simulation, a computer animation of the network operation is visualized. The simulator, in addition, generates the required data which is displayed as a 3D animated graph for performance investigation. Simulation results indicate that the performance of the Hybrid-Ethernet is improved with respect to the pure Ethernet. Moreover, the visualization technique is very efficient for seeing the unseen through simulation process.<>
{"title":"Scientific visualization: a performance study of CSMA/CD with connected data links-(Hybrid-Ethernet)","authors":"Carl K. Chang, Y. Al-Salqan, T. DeFanti, R. Ramakrishnan, C. Kang","doi":"10.1109/FTDCS.1992.217468","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217468","url":null,"abstract":"Scientific visualization is a method of computing which provides an insight into the visualized-simulated system. Recently, the simulation of different physical processes and systems has developed. Furthermore, the simulated system getting bigger and more sophisticated. Recently, the authors proposed a new hybrid architecture local area network (Hybrid-Meshnet). The Hybrid-Meshnet allows an insertion of data links into existing LANs. The authors simulate, investigate and visualize the operation and performance behaviour of Hybrid-Ethernet in comparison with conventional Ethernet. Through the event-driven simulation, a computer animation of the network operation is visualized. The simulator, in addition, generates the required data which is displayed as a 3D animated graph for performance investigation. Simulation results indicate that the performance of the Hybrid-Ethernet is improved with respect to the pure Ethernet. Moreover, the visualization technique is very efficient for seeing the unseen through simulation process.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"72 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":"116299476","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.217521
L. Navarro, W. Prinz, T. Rodden
Applications designed to support the work of groups is becoming increasingly important to future distributed systems. This paper considers the role of distributed systems within the development of cooperative systems. In particular, the authors focus on the need to provide open CSCW systems and their impact on distributed systems. The work currently being undertaken in open distributed systems (ODP) is used to highlight significant trends for future open CSCW systems. It is shown that the CSCW and ODP community share mutual interests and have complementary aims and goals developed from different perspectives. Within the paper the authors provide a brief introduction to CSCW highlighting the requirements CSCW places on distributed systems. The development of an environment to support open CSCW systems is introduced and briefly described. Finally, the relationships between requirements and models for open CSCW systems and the basic reference model of ODP are discussed.<>
{"title":"Towards open CSCW systems","authors":"L. Navarro, W. Prinz, T. Rodden","doi":"10.1109/FTDCS.1992.217521","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217521","url":null,"abstract":"Applications designed to support the work of groups is becoming increasingly important to future distributed systems. This paper considers the role of distributed systems within the development of cooperative systems. In particular, the authors focus on the need to provide open CSCW systems and their impact on distributed systems. The work currently being undertaken in open distributed systems (ODP) is used to highlight significant trends for future open CSCW systems. It is shown that the CSCW and ODP community share mutual interests and have complementary aims and goals developed from different perspectives. Within the paper the authors provide a brief introduction to CSCW highlighting the requirements CSCW places on distributed systems. The development of an environment to support open CSCW systems is introduced and briefly described. Finally, the relationships between requirements and models for open CSCW systems and the basic reference model of ODP are discussed.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"55 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":"121670852","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.217488
S. Yau, Du-Hwan Bae, M. Chidambaram
A framework for software development for distributed parallel computing systems based on the parallel object-oriented functional computational model PROOF is presented. The authors approach enables programming to be independent of the configuration of the computing system on which the program is executed. In their approach, the programmer does not need to be bothered by the parallelism in the application or the architectural details. These considerations can be handled at the translation and the allocation stages. Their approach retains the benefits of both the object-oriented as well the functional paradigms.<>
{"title":"A framework for software development for distributed parallel computing systems","authors":"S. Yau, Du-Hwan Bae, M. Chidambaram","doi":"10.1109/FTDCS.1992.217488","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217488","url":null,"abstract":"A framework for software development for distributed parallel computing systems based on the parallel object-oriented functional computational model PROOF is presented. The authors approach enables programming to be independent of the configuration of the computing system on which the program is executed. In their approach, the programmer does not need to be bothered by the parallelism in the application or the architectural details. These considerations can be handled at the translation and the allocation stages. Their approach retains the benefits of both the object-oriented as well the functional paradigms.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"5 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":"130147998","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.217485
M. Orimo, S. Hirasawa, H. Fujise, M. Takeuchi, K. Mori
From the standpoint of system construction/expansion, it is required that a computer system is flexible and tolerant for change of the system structure and has software productivity. A computer system is also required to be easily operated by users regardless of its structure and status. In order to achieve these requirements, the EVERUN (EVEr RUNning) computer system has been developed based on the autonomous decentralized system concept. The distributed file system for this EVERUN computer system is proposed. This file system realizes flexible fault-tolerance, and easy expansion, operation and maintenance. The EVERUN computer system including this file system has been applied to production management systems and so on. The effectiveness of this computer system has been verified.<>
{"title":"Autonomous decentralized file system and its application","authors":"M. Orimo, S. Hirasawa, H. Fujise, M. Takeuchi, K. Mori","doi":"10.1109/FTDCS.1992.217485","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217485","url":null,"abstract":"From the standpoint of system construction/expansion, it is required that a computer system is flexible and tolerant for change of the system structure and has software productivity. A computer system is also required to be easily operated by users regardless of its structure and status. In order to achieve these requirements, the EVERUN (EVEr RUNning) computer system has been developed based on the autonomous decentralized system concept. The distributed file system for this EVERUN computer system is proposed. This file system realizes flexible fault-tolerance, and easy expansion, operation and maintenance. The EVERUN computer system including this file system has been applied to production management systems and so on. The effectiveness of this computer system has been verified.<<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":"131674765","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.217497
S. Yuan, Chiao-Jang Wu, Hsiou-Mien Lien, I-Neng Chen
This paper describes a distributed semaphore facility called DISEM. DISEM supports semaphore mechanism in a distributed workstations environment, it is implemented at the application level for workstations running a version or a derivative of UNIX operating system which support BSD sockets and System V IPCs. In addition, DISEM also provides fault tolerant service in case a workstation crashes. Generally speaking, DISEM is a useful and portable facility for supporting of distributed semaphore in a local network of workstations.<>
本文介绍了一种分布式信号量工具DISEM。DISEM在分布式工作站环境中支持信号量机制，它是在运行支持BSD套接字和system V ipc的UNIX操作系统版本或派生版本的工作站的应用层实现的。此外，在工作站崩溃的情况下，DISEM还提供容错服务。一般来说，DISEM是支持局域工作站网络中的分布式信号量的一种有用的、可移植的工具
{"title":"Design and implementation of a distributed semaphore facility","authors":"S. Yuan, Chiao-Jang Wu, Hsiou-Mien Lien, I-Neng Chen","doi":"10.1109/FTDCS.1992.217497","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217497","url":null,"abstract":"This paper describes a distributed semaphore facility called DISEM. DISEM supports semaphore mechanism in a distributed workstations environment, it is implemented at the application level for workstations running a version or a derivative of UNIX operating system which support BSD sockets and System V IPCs. In addition, DISEM also provides fault tolerant service in case a workstation crashes. Generally speaking, DISEM is a useful and portable facility for supporting of distributed semaphore in a local network of workstations.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"34 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":"126423495","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
扫码关注我们
求助内容：
应助结果提醒方式：