{"title":"A comparative study of three token ring protocols for real-time communications","authors":"C. Lim, L. Yao, Wei Zhao","doi":"10.1109/ICDCS.1991.148682","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148682","url":null,"abstract":"When developing distributed scheduling algorithms such as communication protocols, issues in achieving optimal policy and minimizing overhead must be addressed. This problem is examined in the context of a specific distributed system-the token ring communication network. Three token ring protocols are considered which are representative of many existing ones in the sense that they incorporate message time constraints at different levels and implement the earliest deadline first transmission (scheduling) policy at different degrees with different overheads. Through a worst-case analysis, the performance of these three token ring protocols is compared. It is concluded that to evaluate a distributed scheduling algorithm such as a communication protocol, it is necessary to not only consider the scheduling policy employed but also to take into account the overhead incurred due to the implementation of the scheduling policy.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123255011","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":"ASTRA-an asynchronous remote procedure call facility","authors":"A. Ananda, B. Tay, E. Koh","doi":"10.1109/ICDCS.1991.148661","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148661","url":null,"abstract":"A transport-independent asynchronous RPC (remote procedure call) mechanism (ASTRA) that combines the advantages of both RPC and message-passing IPC (interprocess communication) has been designed and implemented. ASTRA calls do not block the caller (client) and the replies can be received as and when they are needed, thus allowing the client execution to proceed locally in parallel with the server invocation. All the calls are received and executed by the server in the order called by the client. ASTRA is unique among other asynchronous RPC systems in allowing its users to explicitly specify whether low-latency or high-throughput is required for a call, and in providing highly optimized lightweight intramachine calls. ASTRA is built within the framework of the SHILPA distributed computing environment.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144230","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":"Real-time communication in multi-hop networks","authors":"D. Kandlur, K. Shin, D. Ferrari","doi":"10.1109/ICDCS.1991.148681","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148681","url":null,"abstract":"A scheme is developed for providing predictable interprocess communication in real-time systems with (partially connected) point-to-point interconnection networks, which provides guarantees on the maximum delivery time for messages. This scheme is based on the concept of a real-time channel, a unidirectional connection between source and destination. A real-time channel has parameters which describe the performance requirements of the source-destination communication, e.g., from a sensor station to a control site. Methods to compute guarantees for the delivery time of messages belonging to real-time channels are examined. Problems associated with allocating buffers for these messages are addressed, and a scheme which preserves delivery time guarantees is developed.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124956881","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":"DisCo specification language: marriage of actions and objects","authors":"Hannu-Matti Järvinen, R. Kurki-Suonio","doi":"10.1109/ICDCS.1991.148656","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148656","url":null,"abstract":"The potential of the action-oriented paradigm has been explored in the development of a specification language, DisCo, which can be characterized as both action-oriented and object-oriented. Its possibilities are introduced by contrasting them to the more familiar process-oriented approaches. Its execution model is state-based and leads to direct application of temporal logic in formal reasoning. Action-orientation allows a natural support for such forms of modularity that cut across process boundaries. At the same time, process-oriented abstractions are retained by object-orientation and the use of hierarchical state chart structures. The novel aspects of modularity are illustrated by a protocol example. The language is semi-executable.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128042199","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}
Joshua S. Auerbach, M. Gopal, Marc A. Kaplan, S. Kutten
{"title":"Multicast group membership management in high speed wide area networks","authors":"Joshua S. Auerbach, M. Gopal, Marc A. Kaplan, S. Kutten","doi":"10.1109/ICDCS.1991.148670","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148670","url":null,"abstract":"An application for multicast service for high-speed WANs (wide area networks) which is capable of exploiting multicast hardware is described. Modularity and low cost area achieved by assigning to distinct components the separate problems of (1) naming groups, (2) finding group members in a network, (3) configuring multicast hardware, and (4) delivering multicast messages in sequence. The overall organization of the service is given, along with the methods used to solve the first two subproblems.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134387518","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":"Critical factors in NUMA memory management","authors":"J. Ramanathan, L. Ni","doi":"10.1109/ICDCS.1991.148717","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148717","url":null,"abstract":"The authors identify and incorporate the critical factors that influence nonuniform memory access (NUMA) memory management into their performance metrics. Using trace-driven simulations, it is shown that under certain conditions no replication is better than replication. It is also concluded that the effectiveness of replication depends on: (1) the ratio of access times to remote and local memory, (2) virtual address assignment to data, (3) data sharing characteristics, (4) overhead of enforcing consistency, and (5) amount of physical memory available relative to the data sharing characteristics.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116450449","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 token based distributed mutual exclusion algorithm based on quorum agreements","authors":"M. Mizuno, M. Neilsen, Raghavendra Rao","doi":"10.1109/ICDCS.1991.148690","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148690","url":null,"abstract":"A token-based mutual exclusion algorithm is presented which uses data structures similar to coteries, called quorum agreements. The performance of the algorithm depends on the quorum agreements used. When a good quorum agreement is used, the overall performance of the algorithm compares favorably with the performance of other mutual exclusion algorithms.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122389067","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 hierarchical modeling of availability in distributed systems","authors":"S. Hariri, Hasan B. Mutlu","doi":"10.1109/ICDCS.1991.148664","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148664","url":null,"abstract":"A two-level hierarchical model is proposed to analyze the availability of distributed systems as perceived by their users. At the higher level (user level), the availability of the tasks (processes) is analyzed in terms of the availability of the system components. At the lower level (component level), detailed Markov models are developed to analyze the component availabilities. These models take into account the hardware/software failures, congestion and collisions in communication links, allocation of resources, and the redundancy level. Also presented is the availability analysis of some of the services provided by the unified workstation environment (UWE) currently being implemented at AT&T Bell Laboratories.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128837862","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 efficient submesh allocation strategy for mesh computer systems","authors":"Po-Jen Chuang, N. Tzeng","doi":"10.1109/ICDCS.1991.148674","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148674","url":null,"abstract":"A processor allocation strategy is proposed which can apply to any mesh system and recognize submeshes with arbitrary sizes at any location in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Because of its efficient allocation, this strategy exhibits better performance than an earlier allocation strategy based on the buddy principle. An efficient implementation of this strategy is presented. Extensive simulation runs were carried out to collect experimental performance measures of interest under different allocation schemes for comparison.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130175969","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 implementation of F-channels, a preferable alternative to FIFO channels","authors":"Mohan L. Ahuja","doi":"10.1109/ICDCS.1991.148662","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148662","url":null,"abstract":"An F-channel can permit as much concurrency as a nonFIFO channel and yet retain the properties of a FIFO channel that leads to simplicity of reasoning in design and proofs of the correctness of distributed algorithms. This is one of the major reasons that makes it preferable to a FIFO channel and make its implementation important. This and other reasons for its superiority over a FIFO channel are discussed, and it is proposed that systems should provide implementation of F-channels. Reasons are discussed for this proposal which are based on the principle that a system should provide an interface to the users that makes algorithm design easy and that leads to efficient user efforts and system operation. Implementation of an F-channel on top of a nonFIFO channel is presented.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125727297","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}