{"title":"A case study on the fault-tolerizability of an archetypical shared memory minisuper multiprocessor","authors":"F. Mathur, J. Rohr, D. Rennels","doi":"10.1109/FTDCS.1988.26716","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26716","url":null,"abstract":"Issues in assessing fault-tolerance are addressed. A specific archetypical high-performance shared-memory architecture is chosen as a test case (specifically the Encore Multimax, to be used in space defense applications and environments), and a set of target fault-tolerance requirements are specified. The requirements are established to meet realistically the anticipated needs of aerospace applications of the 1990s. A methodology is then presented to systematize the steps and document the alternatives to be evaluated and the issues to be resolved in the process of fault-tolerization. The design of the resultant final target fault-tolerant machine is presented. The advantage to design based on parallel architectures is that resources can be dynamically reallocated to enhance either performance or fault-tolerance.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840360","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":"Lightnet: a protocol for future real time high speed broadcast networks","authors":"P. Jacquet, P. Muhlethaler","doi":"10.1109/FTDCS.1988.26682","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26682","url":null,"abstract":"A set of high-speed protocols working on unidirectional broadcast systems is defined. Lightnet 1 is based on collision avoidance and a simple reservation scheme; Lightnet 2 is a version for heavy loads; and Lightnet 3 is designed to work on a ring topology. Three analytical models are developed to evaluate the performances of these protocols. Comparisons between analytical and simulation results show the accuracy of these models. A careful comparison between Lightnet I and Expressnet shows that the former outperforms the latter both for average delay and for flexibility to various kinds of traffic mixes under the assumption of uniform packet size.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470726","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":"Computer architectures: a case for top-down design","authors":"H. Topfer, T. Ungerer, E. Zehendner","doi":"10.1109/FTDCS.1988.26727","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26727","url":null,"abstract":"It is shown how top-down design, decomposition, abstraction, rapid prototyping and other methods from software engineering can be adapted to computer architecture design. A sample architecture design process is used to demonstrate the use of the methods. The case study deals with the upper architecture levels.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122143939","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 aggregated model of CSMA/CD as an example for runtime reduction in LAN-simulation","authors":"E. Heck, R. Lange","doi":"10.1109/FTDCS.1988.26679","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26679","url":null,"abstract":"An aggregated model of a carrier-sense multiple access with collision detection (CSMA/CD) model is used to reduce simulation runtimes. The costs for the simulated transmission of a packet are reduced, regardless of the number of competing stations. The service distribution of the aggregated model is obtained using a modified Markov chain, which serves as a basic model. The aggregates' quality of approximation is shown by a comparison with numerous performance results from measurements, as well as from simulation and numerical models.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122184080","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":"Hypercube computing; Connected components","authors":"Jinwoon Woo, S. Sahni","doi":"10.1109/FTDCS.1988.26723","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26723","url":null,"abstract":"The connected-components problem is used to illustrate the programming issues that arise when a multiple-instruction/multiple-data hypercube multicomputer is used. These issues include selection of algorithmic abstraction, problem partitioning and mapping, overlapping computation and communication, and load balancing. Performance measures are also discussed.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124155009","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 global load balancing strategy for a distributed computer system","authors":"K. M. Baumgartner, B. Wah","doi":"10.1109/FTDCS.1988.26685","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26685","url":null,"abstract":"A load-balancing strategy is described for a computer systems connected by a multiaccess broadcast network. The strategy uses the existing broadcast capability of these networks to implement an efficient search technique for finding stations with the maximum and the minimum workload. The overhead of distributing status information in the proposed strategy is independent of the number of stations, eliminating the primary source of overhead in load balancing. An implementation of the strategy on a network of Sun workstations is presented. It consists of two modules that are executed at all participating computers: the distributed-search module that isolates the maximally and minimally loaded computers, and the job-migration module that places a job on the basic of the load extremes.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126524816","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 framework to integrate system specification tools","authors":"A. Di Stefano, M. Malgeri","doi":"10.1109/FTDCS.1988.26710","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26710","url":null,"abstract":"Strategies to support the communication between tools and interface are discussed. The functions that general-purpose interfaces should offer are analyzed is presented. These functions are collected in two sets: the first is oriented to give a user-friendly interface; the second tackles both user and tool needs. The problems and solutions relevant to the merging of a tool inside this framework are discussed. As a case study, a behavioral simulator is considered. The object to be simulated is specified by using the behavioral FDT LOTOS, based on concurrent communicating systems. Presently, this language is under standardization by the ISO.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"52 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989050","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":"Design of an object-oriented distributed system: experience with CSA","authors":"M. Tag, A. Benkiran, G. Durand, M. J. Wilson","doi":"10.1109/FTDCS.1988.26698","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26698","url":null,"abstract":"The Communication System Architecture (CSA), a five-year project to design and implement an object-oriented architecture for distributed office systems is described. The architecture is based on an object model supported by a hierarchy of recursive abstract object machines, allowing transparent communication and providing a set of facilities for building high-quality distributed applications in a heterogeneous and distributed office environment. The CSA architecture is presented, and the CSA communication facilities, transparent means of communication between CSA object machines, are described. The CSA object model is discussed, and it is shown that how the CSA architecture provides a suitable method to facilitate application design. The CSA native language is introduced, and the CSA mail service is presented as an application example.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129330337","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":"Global stability detection in the asynchronous distributed computations","authors":"M. Naimi","doi":"10.1109/FTDCS.1988.26684","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26684","url":null,"abstract":"A simple algorithm for detecting global stability in asynchronous distributed computations is presented. it is based on observation of the outgoing channels, using a single token which acts as observer. No vector is necessary (in the transmission of the token on the ring), and this algorithm does not require the first-in/first-out (FIFO) property for the communication channels.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132092930","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 future trend of employing distributed architecture form","authors":"D. Peng","doi":"10.1109/FTDCS.1988.26719","DOIUrl":"https://doi.org/10.1109/FTDCS.1988.26719","url":null,"abstract":"Trends in distributed architectures are discussed, focusing on highly distributed parallel architectures. The use of a system, Wupp-80, in which the microcomputers directly access each others memory, to study parallel algorithms and distributed parallel processing is described. Crucial issues are examined, and the requirements of knowledge and intelligent processing are considered.<<ETX>>","PeriodicalId":384536,"journal":{"name":"[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124558416","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}