{"title":"A multi-access window protocol for transmission of time constrained messages","authors":"Wei Zhao, J. Stankovic, K. Ramamritham","doi":"10.1109/DCS.1988.12540","DOIUrl":"https://doi.org/10.1109/DCS.1988.12540","url":null,"abstract":"A novel window protocol for transmitting time-constrained messages in a multiaccess network is proposed that explicitly takes time constraints into account. The window is formed on the basis of latest time to send a message (LS). A newly arriving message is immediately considered for transmission if its LS is less than those of the all pending messages in the system. As a result, the protocol closely approximates the optimal minimum-laxity-first policy. A performance evaluation by simulation shows that the protocol performs well in a wide range of environments, even under overloaded conditions.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115022356","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":"Near optimal embedding of binary tree architecture in VLSI","authors":"H. Youn, A. Singh","doi":"10.1109/DCS.1988.12503","DOIUrl":"https://doi.org/10.1109/DCS.1988.12503","url":null,"abstract":"An efficient scheme is presented for embedding a complete binary tree architecture in a two-dimensional array of processing elements. The scheme utilizes almost 100% of the processing elements in the array as actual computing elements, with small and asymptotically optimal propagation delay. The maximum edge length is optimal for trees with up to six levels. The scheme is compared with other designs proposed in the literature and shown to be significantly better.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125481383","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":"Data reorganization in a dynamically reconfigurable environment","authors":"X. Du, F. Maryanski","doi":"10.1109/DCS.1988.12549","DOIUrl":"https://doi.org/10.1109/DCS.1988.12549","url":null,"abstract":"The authors consider data reorganization in a dynamically reconfigurable distributed database system. The network environment they study is a dynamic system prototype called Driftwood. They present reallocation strategies corresponding to different network reconfiguration and then address the nonblocking reorganization approach. They cover the implementation strategies, impact on user transaction processing, and efficiency. The authors present an algorithm to construct a parallel reorganization scheduler that is expected to minimize the system recovery time.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123185046","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 new node-join-tree distributed algorithm for minimum weight spanning trees","authors":"Y. Lien","doi":"10.1109/DCS.1988.12534","DOIUrl":"https://doi.org/10.1109/DCS.1988.12534","url":null,"abstract":"A distributed algorithm that uses a node-join-tree approach for the minimum-spanning-tree problem in a communication network is developed. The algorithm needs at most (2e+n(n-1)/4) messages in O(n/sup 2/) time on a general random graph. In the best case, it needs only 2e messages in O(log n) time. The parameters e and n are the number of edges and nodes, respectively. Although the worst-case performance is not better than that of tree-join-tree algorithms under some extreme cases, simulation results show that it provides better performance in most cases. The algorithm is initialized from a single node, so that there is no need to wake up all nodes at the beginning. It is less complicated than other algorithms, so that a reliable implementation is easier to achieve. The results can be used to improve the algorithms for many other problems in distributed computing, such as leader-election, node-counting, deadlock-resolution, and message-broadcasting.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115621189","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":"Scheduled and nonscheduled access in a distributed system based upon a functional communication model","authors":"D. Marinescu","doi":"10.1109/DCS.1988.12518","DOIUrl":"https://doi.org/10.1109/DCS.1988.12518","url":null,"abstract":"Request-response communication is studied in the framework of the functional communication model. A scheme that uses the channel access algorithm for distributed scheduling is investigated. A timed token protocol is used to control the two access modes, the scheduled access, with communication initiated by a server, and the nonscheduled access when a client sends a request to a functional group without prior consent from any of the servers in the group. In case of scheduled communication, the server guarantees the acceptance of the request.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114505937","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":"Dynamic partitioning in a class of parallel systems","authors":"Menkae Jeng, H. Siegel","doi":"10.1109/DCS.1988.12497","DOIUrl":"https://doi.org/10.1109/DCS.1988.12497","url":null,"abstract":"Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. This problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. These two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. The complexities of these two processes are also analyzed. The method can be applied to any system that can be modeled by a lattice.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127479743","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":"Exploiting symmetries for low-cost comparison of file copies","authors":"Daniel Barbará, H. Garcia-Molina, Bernardo Feijoo","doi":"10.1109/DCS.1988.12550","DOIUrl":"https://doi.org/10.1109/DCS.1988.12550","url":null,"abstract":"A novel technique for comparison of remotely located file copies is examined. With this technique up to two differing pages can be located, and any other number of multiple differing pages can be detected. It uses a communication overhead of O(log/sup 2/(N)), where N is the number of pages in the file. It is based on a set of symmetries of a hypercube with dimension log(N).<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126701221","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":"Reliable broadcast in networks with nonprogrammable servers","authors":"H. Garcia-Molina, B. Kogan, N. Lynch","doi":"10.1109/DCS.1988.12545","DOIUrl":"https://doi.org/10.1109/DCS.1988.12545","url":null,"abstract":"The problem of implementing reliable broadcast in ARPA-like computer networks is studied. The environment is characterized by the absence of any multicast facility on the communication by the absence of any multicast facility on the communications subnetwork level. Thus, broadcast has to be implemented directly on hosts. A reliable broadcast protocol is presented and evaluated with respect to several important performance criteria.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121668803","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 accounting service for heterogeneous distributed environments","authors":"G. Harter, K. Geihs","doi":"10.1109/DCS.1988.12519","DOIUrl":"https://doi.org/10.1109/DCS.1988.12519","url":null,"abstract":"The integration of accounting functions and an account server into the distributed academic computing network operating system (DACNOS), which is an NOS built on top of a heterogeneous collection of networked computers, is described. The accounting is supported by NOS-kernel mechanisms that can be tailored to the needs of the heterogeneous servers. Accounting data is collected and stored by an account server in the NOS that manages the balances and the resource consumption data of clients. Depending on privileges, accounting data is accessible to clients, servers, and an account server administrator who may use this information for various resource and request management purposes.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158669","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":"Analysis of distributed systems with many identical processes","authors":"V. Garg","doi":"10.1109/DCS.1988.12537","DOIUrl":"https://doi.org/10.1109/DCS.1988.12537","url":null,"abstract":"The symmetry of distributed systems that have one or more sets of identical processes, is used to reduce the state space for automatic analysis techniques. A model called the Synchronous Token-based Communicating State Model (STOCS) is proposed to facilitate specification and analysis of symmetric distributed systems. Symbolic and inductive techniques to analyze the STOCS are described. The techniques are demonstrated by analyzing the 2-out-of-3, readers-writers, dining philosophers, and mutual exclusion problems.<<ETX>>","PeriodicalId":327239,"journal":{"name":"[1988] Proceedings. The 8th International Conference on Distributed","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125280397","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}