{"title":"The Stealth distributed scheduler","authors":"P. Krueger, Rohit Chawla","doi":"10.1109/ICDCS.1991.148686","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148686","url":null,"abstract":"The justification, design, and performance of the Stealth distributed scheduler is discussed. The goal of Stealth is to exploit the unused computing capacity of a workstation-based distributed system (WDS) without undermining the predictability in quality of service that a WDS provides to workstation owners. It is shown that the liberal approach taken by the Stealth distributed scheduler is a promising method of exploiting the vast quantity of unused computing capacity typically present in a WDS, while preserving predictability of service for workstation owners.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"41 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":"126148123","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 statistical approach for parallel optimization with application to VLSI placement","authors":"K. Efe","doi":"10.1109/ICDCS.1991.148720","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148720","url":null,"abstract":"A massively parallel optimization approach based on simple neighborhood search techniques was developed and applied to the problem of VLSI cell placement. Statistical models are developed to analyze the performance of the approach in general, and to derive statistical bounds on the quality of obtainable results. The results of these analyses suggest a simple framework for approximate solution of difficult problems. The approach is inherently parallel, and it can be implemented on any type of parallel computer. It was implemented on a simulated hypercube MIMD machine using Cosmic C on a network of Sun workstations. The method is empirically verified.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"190 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":"124211663","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 reconfiguration in an object-based programming language with distributed shared data","authors":"B. Hailpern, G. Kaiser","doi":"10.1109/ICDCS.1991.148645","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148645","url":null,"abstract":"An approach to dynamic reconfiguration in online distributed applications based on a data sharing model is presented. The data sharing model consists of facets, objects, and processes, with facets as the unit of sharing. The primary contribution of this work is the addition of important special cases of dynamic reconfiguration, without resorting to general dynamic allocation. A metaphor consistent with PROFIT's data sharing model for expressing dynamic reconfiguration facilities within the programming language is proposed.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"16 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":"130757891","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":"Probabilistic clock synchronization in large distributed systems","authors":"A. Olson, K. Shin","doi":"10.1109/ICDCS.1991.148679","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148679","url":null,"abstract":"Synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local clock. The algorithm does not require master/slave clocks and reduces the number of messages needed. As a result it is suitable for use in large distributed systems.<<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":"130925598","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":"Membership algorithms for asynchronous distributed systems","authors":"L. Moser, P. Melliar-Smith, V. Agrawala","doi":"10.1109/ICDCS.1991.148713","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148713","url":null,"abstract":"Algorithms for solving the processor membership problem in asynchronous distributed systems that are subject to processor and communication faults are presented. These algorithms are based on the placement of a total order on broadcast messages. The types of systems for which each of these algorithms is appropriate are characterized in terms of the properties of the communication mechanisms and the availability of stable storage. In the absence of stable storage or a mechanism for distinguishing promptly delivery messages, it is shown that no membership algorithm exists.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"44 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":"116474055","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 problem dynamics through result sharing in dataflow environments","authors":"S. Krishnaprasad, B. Shirazi, A. Hurson","doi":"10.1109/ICDCS.1991.148651","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148651","url":null,"abstract":"The notion of CPRS (concurrent processing which result sharing) graph decomposition is presented which is based on problem dynamics, and the validity of the CPRS scheme in a dataflow environment is explored. A dynamic dataflow architecture to execute programs under the new model of computation, called the CPRS architecture, is presented. An analytical modeling, based on a closed queueing network model, is used to study the effect of result sharing on the performance of the CPRS architecture.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"39 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":"123478160","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":"Overlapping window algorithm for computing GVT in Time Warp","authors":"R. Baldwin, M. Chung, Yunmo Chung","doi":"10.1109/ICDCS.1991.148722","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148722","url":null,"abstract":"Techniques are proposed for computing a global virtual time (GVT), which is the minimum local virtual time of processes in Time Warp. The algorithm computes a conservative estimate of GVT using an approach which is considerably simpler than previous algorithms for computing GVT. This algorithm does not require a global synchronization of processors. An inherent problem is GVT computation relates to handling messages in transit. Several alternatives are proposed for solving the transient message problem. The algorithm is suitable for distributed shared memory machines such as the BBN Butterfly and message passing machines with a variety of interconnection networks.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"68 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":"129666256","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":"Performance comparisons of buffer coherency policies","authors":"A. Dan, Philip S. Yu","doi":"10.1109/ICDCS.1991.148666","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148666","url":null,"abstract":"A comparison is made of four buffer coherency policies: check on access, check on access with periodic notification, selective notification, and broadcast invalidation. These policies differ in their basic approaches on how and when the invalidated granules are identified, and hence, achieve different tradeoffs between buffer hits and overhead of notifications. Analytic models are developed to evaluate the buffer hit probability, CPU overhead, and overall response time under these coherency policies. The analysis is validated through simulations. It is found that the difference in buffer hit probabilities is very sensitive to the skewness of the data access and is further affected by the number of nodes, update rates, and the buffer size.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"2007 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":"127305871","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 checkpointing scheme for heterogeneous distributed database systems","authors":"J. T. Lim, S. Moon","doi":"10.1109/ICDCS.1991.148733","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148733","url":null,"abstract":"For efficient construction of the distributed database from media failure, a transaction-consistent checkpointing algorithm is proposed for heterogeneous distributed database systems. For full design autonomy and increased availability on the heterogeneous distributed database systems, the proposed algorithm never enforces termination of normal operations of transactions and changes of checkpointing algorithms in local database systems. The global checkpoints generated by the algorithm can be used to reconstruct the previous consistent states of a database efficiently.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"72 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":"127172075","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":"Using multiple replica classes to improve performance in distributed systems","authors":"P. Triantafillou, David J. Taylor","doi":"10.1109/ICDCS.1991.148704","DOIUrl":"https://doi.org/10.1109/ICDCS.1991.148704","url":null,"abstract":"Replication has been primarily used as a means of increasing availability in distributed systems. It is known that replication can mitigate the costs of accessing remotely stored data in distributed systems. Replication control protocols in the literature have stopped short of addressing availability and performance concerns. These issues are addressed by contributing a classification of replicas with each class having different consistency requirements. Metareplicas keep track of up-to-date replicas for recently accessed objects and changes in data reference localities. Thus they allow many transaction operations to synchronously execute at only a single (and often local) replica. Pseudoreplicas are non-permanent replicas that facilitate localized execution of transaction operations. True replicas are permanent replicas that increase the availability of operations and data. A replication control protocol is presented.<<ETX>>","PeriodicalId":418924,"journal":{"name":"[1991] Proceedings. 11th International Conference on Distributed Computing Systems","volume":"20 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":"128760920","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}