{"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}
{"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}
{"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}
{"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}
{"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}
Carl K. Chang, Y. Al-Salqan, T. DeFanti, R. Ramakrishnan, C. Kang
{"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}
{"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}
{"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}
{"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}
{"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}