{"title":"Reflective architectures: requirements for future distributed environments","authors":"C. Bekker, P. Putter","doi":"10.1109/FTDCS.1993.344168","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344168","url":null,"abstract":"The object-oriented paradigm offers many advantages that can assist implementors of large, complex distributed systems. The authors present a number of lower-layer concepts that enable developers to model and design systems in a way that will help in ensuring qualities of open-endedness and dynamic reconfiguration. The aspects presented in this paper flow from a combination of research in the object-oriented paradigm and experience gained in the area of distributed network management systems.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"1 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":"129350727","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":"Load distribution on microkernels","authors":"D. Milojicic, P. Giese, W. Zint","doi":"10.1109/FTDCS.1993.344219","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344219","url":null,"abstract":"The authors investigate the appropriateness of a /spl mu/kernel for load distribution. They demonstrate /spl mu/kernel benefits by presenting a load distribution implementation on top of the Mach /spl mu/kernel. The load distribution scheme is based on three main parts: task migration, load information management, and distributed scheduling. It is shown that it is relatively easy to implement transparent task migration on top of a message passing /spl mu/kernel, such as Mach. Changing the distributed scheduler so that it considers IPC and VM load in addition to processor load is straightforward, and it yields up to a 30% improvement in average execution time. The authors investigate distributed scheduling strategies in the light of the extended load information management. Finally, they compare load distribution on various OS architectures.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"117 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":"124890233","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":"A comparison of fault-tolerant atomic broadcast protocols","authors":"E. Anceaume","doi":"10.1109/FTDCS.1993.344161","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344161","url":null,"abstract":"User expectations for dependable distributed computing follow a growing trend. Atomic broadcast is at the core of problems such as reliable commit, atomic transactions, and group membership that must be tackled in distributed systems in the presence of various types of failures. However, for many applications, the usual specification of fault-tolerant atomic broadcast is inadequate, as it does not define the behaviour of faulty processors. The purpose of this work is to present the reason why previously published algorithms fail to achieve the properties sought (e.g. atomicity, total order). Hence, eight of the most significant atomic broadcast protocols are analyzed according to five properties which appear to be necessary in a reliable distributed system.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"22 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":"125178233","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 System Architect's Assistant for design and construction of distributed systems","authors":"J. Kramer, J. Magee, K. Ng, M. Sloman","doi":"10.1109/FTDCS.1993.344144","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344144","url":null,"abstract":"Distributed systems are conveniently described, constructed and managed in terms of their software structure or architecture. However, few current platforms exploit the architectural view. The authors outline current work on the provision of an architectural methodology and graphical support tool, the System Architect's Assistant, for the design and engineering of distributed systems. The tool supports both initial informal design decomposition and subsequent rigorously checked composition when a set of specified, designed and/or implemented components are integrated to analyze and/or construct the desired distributed system. The effectiveness of the methodology and prototype tool are assessed by applying it to case studies supplied by an industrial associate and by conducting controlled productivity experiments.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"62 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":"127469498","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":"Making C++ a distributed programming language","authors":"Z. Wu","doi":"10.1109/FTDCS.1993.344152","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344152","url":null,"abstract":"Complex applications, such as computer-aided design, computer-aided manufacturing and multimedia applications, can derive the benefits of abstraction, modularity, extensibility, and reuse from object-oriented programming. However, object-oriented languages do not provide direct support for distributed computing. This makes programming in object-oriented languages in a distributed system fraught with potential difficulties. By making object-oriented languages provide distribution transparency, it is hoped that the task becomes comparable with that of programming in a more traditional centralized system. The author describes the approach by which they make C++ become a distributed programming language and address some design and implementation issues.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"1 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":"129619303","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":"An Ethernet performance model with N/sub u/ users simultaneously accessing N/sub s/ servers","authors":"N. Schneidewind","doi":"10.1109/FTDCS.1993.344145","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344145","url":null,"abstract":"A previously published LAN performance model had two user response time components that involved transmission on the LAN: simultaneous input requests for N/sub u/ users for service from one of N/sub s/ servers transmitted over a broadband Ethernet; and transmission of the requested information over the Ethernet to the N/sub u/ user RAMs. The purpose of the model was to predict user response time under the condition of maximum stress on the LAN (i.e., when all users simultaneously request the same program). In the first implementation of the model, the Ethernet response time components were modeled by classical formulas. Although the model proved to be a good predictor of response time at light and moderate loads, it underestimated response time at high loads. The contribution of the revised model presented to network performance evaluation is that the author has developed a novel way of providing a level of detail and accuracy that other analytic models of Ethernet performance do not provide. A brief analysis of the potential effect on performance in this application environment of the emerging fast Ethernet is provided.<<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":"122863944","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":"Schedulability analysis of multi-access protocols for distributed real-time systems","authors":"B. di Gennaro, N. Rivierre","doi":"10.1109/FTDCS.1993.344137","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344137","url":null,"abstract":"The class of online protocols which exhibit deterministic properties in spite of a lack of global knowledge are considered. Such protocols (e.g. tree protocols) yield computable bounds on the duration of collision resolution. The authors show that combining such deterministic properties with feasibility tests, such as those developed in real-time scheduling, permits the design of provably correct hard real-time protocols. The authors extend a centralized real-time problem to a decentralized context using the idea of extra cost. The applicability of the results is then illustrated with the CSMA-DCR (Ethernet with deterministic collision resolution) protocol, which is currently used in real settings.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"36 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":"128626982","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 multimedia communication services","authors":"L. Carmo, J. Courtiat, P. de Saqui-Sannes","doi":"10.1109/FTDCS.1993.344172","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344172","url":null,"abstract":"A set of basic synchronization facilities is identified that can be expected from a general-purpose, multimedia communication service. Formalization relies on the concept of temporal signature previously introduced for characterizing the temporal properties of multimedia streams. The authors discuss several mechanisms related to temporal signature preservation. Dependency relationships among the delivered information units are further considered. The authors propose a set of service primitives, which may be seen as a first step in the definition of a synchronization layer on top of a transport service.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"33 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":"114854243","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}
H. Yamamoto, A. Yoshizawa, K. Kawano, K. Mori, K. Oshima, T. Kawamura
{"title":"On-line software test technique based on autonomous decentralized system","authors":"H. Yamamoto, A. Yoshizawa, K. Kawano, K. Mori, K. Oshima, T. Kawamura","doi":"10.1109/FTDCS.1993.344143","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344143","url":null,"abstract":"A large-scale distributed system is constructed step by step over a long period of time. Even under construction, online operation is started in its system. After starting online operation, it continuously has to be tested and maintained in various areas without stopping online operation. In the conventional online test technique for an autonomous decentralized system, the online and the test data exist concurrently in the same system. The real-time response of the online system is not assured. A method in which test/on-line subsystems are clustered and data flow among each cluster is controlled autonomously, thereby isolating each subsystem and protecting it from perturbation from other subsystems, is given. The reliability and real-time response of the online system are ensured with this method.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"1 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":"122709498","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":"Optimization techniques for parallel protocol implementation","authors":"Stefan Leue, P. Oechslin","doi":"10.1109/FTDCS.1993.344206","DOIUrl":"https://doi.org/10.1109/FTDCS.1993.344206","url":null,"abstract":"The authors propose a method for deriving parallel, scheduling-optimized protocol implementations from sequential protocol specifications. They start with an SDL specification, identify a common path for optimization, and perform a data dependency analysis. The resulting common path graph is parallelized as far as permitted by the data dependency graph. The degree of parallelism is extended even further by deferring data operations to the exit nodes of the common path graph. The resulting parallel operation model is then submitted to a scheduling algorithm, yielding an optimized compile-time schedule. An IP-based protocol stack with TCP and FTP as upper layers serves as an example.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"18 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":"130019122","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}