Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287699
H. Gladney
Emerging technology permits electronic document libraries which store large numbers of images for access in wide-area networks. The expected statistics and security needs of electronic library applications favor new client-server session protocols. The author proposes a scheme that makes communications efficient in a well-defined sense. DocSS, a document storage subsystem, implements the scheme. An early version is in production in human service (welfare, taxation, police) and engineering applications.<>
{"title":"Inter-machine protocols for electronic libraries","authors":"H. Gladney","doi":"10.1109/ICDCS.1993.287699","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287699","url":null,"abstract":"Emerging technology permits electronic document libraries which store large numbers of images for access in wide-area networks. The expected statistics and security needs of electronic library applications favor new client-server session protocols. The author proposes a scheme that makes communications efficient in a well-defined sense. DocSS, a document storage subsystem, implements the scheme. An early version is in production in human service (welfare, taxation, police) and engineering applications.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555995","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287688
J. Brzeziński, J. Hélary, M. Raynal
Termination detection constitutes one of the basic problems of distributed computing, and many distributed algorithms have been proposed to solve it, but all these algorithms consider a very simple model for the underlying application programs: for processes of such programs, nondeterministic constructs are allowed, but each 'receive' statement (request) concerns only one message at a time. A more realistic and very general model of distributed computing is first presented, allowing a request to be atomic on several messages and to obey AND/OR/AND-OR/k-out-of-n/etc. request types. Within this framework, two definitions of termination are proposed and discussed. Then, accordingly, two distributed algorithms for detecting these terminations are presented and evaluated; they differ in the information they use and in the time they need to claim termination.<>
终止检测是分布式计算的基本问题之一，已经提出了许多分布式算法来解决这个问题，但是所有这些算法都考虑了底层应用程序的一个非常简单的模型:对于这些程序的进程，允许不确定性结构，但是每个“接收”语句(请求)一次只关注一个消息。首先提出了一种更现实、更通用的分布式计算模型，它允许请求在多个消息上是原子的，并遵循and /OR/ and -OR/k-out- n等规则。请求类型。在此框架下，提出并讨论了两种终止的定义。然后，提出并评估了两种用于检测这些终端的分布式算法;他们在使用的信息和要求终止所需的时间上有所不同。
{"title":"Termination detection in a very general distributed computing model","authors":"J. Brzeziński, J. Hélary, M. Raynal","doi":"10.1109/ICDCS.1993.287688","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287688","url":null,"abstract":"Termination detection constitutes one of the basic problems of distributed computing, and many distributed algorithms have been proposed to solve it, but all these algorithms consider a very simple model for the underlying application programs: for processes of such programs, nondeterministic constructs are allowed, but each 'receive' statement (request) concerns only one message at a time. A more realistic and very general model of distributed computing is first presented, allowing a request to be atomic on several messages and to obey AND/OR/AND-OR/k-out-of-n/etc. request types. Within this framework, two definitions of termination are proposed and discussed. Then, accordingly, two distributed algorithms for detecting these terminations are presented and evaluated; they differ in the information they use and in the time they need to claim termination.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125792438","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287680
C. Pu, Wenwey Hseush, G. Kaiser, Kun-Lung Wu, Philip S. Yu
Epsilon serializability (ESR) allows for more concurrency by permitting nonserializable interleavings of database operations among epsilon transactions (ETs). The authors present the design of distributed divergence control (DDC) algorithms for ESR in homogeneous and heterogeneous distributed databases. They first present a strict two-phase locking DDC algorithm (S2PLDDC) and an optimistic DDC algorithm (ODDC) for homogeneous distributed databases, where the local orderings of all the sub-ETs of a distributed ET are the same, and the total inconsistency of a distributed ET is simply the sum of that of all its sub-ETs. A superdatabase DDC algorithm is described for heterogeneous distributed databases, where the local orderings of all the sub-ETs of a distributed ET may not be the same, and the total inconsistency of a distributed ET may be greater than the sum of that of all its sub-ETs. As a result, in addition to local divergence control in each site, a global mechanism is needed to guarantee ESR.<>
{"title":"Distributed divergence control for epsilon serializability","authors":"C. Pu, Wenwey Hseush, G. Kaiser, Kun-Lung Wu, Philip S. Yu","doi":"10.1109/ICDCS.1993.287680","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287680","url":null,"abstract":"Epsilon serializability (ESR) allows for more concurrency by permitting nonserializable interleavings of database operations among epsilon transactions (ETs). The authors present the design of distributed divergence control (DDC) algorithms for ESR in homogeneous and heterogeneous distributed databases. They first present a strict two-phase locking DDC algorithm (S2PLDDC) and an optimistic DDC algorithm (ODDC) for homogeneous distributed databases, where the local orderings of all the sub-ETs of a distributed ET are the same, and the total inconsistency of a distributed ET is simply the sum of that of all its sub-ETs. A superdatabase DDC algorithm is described for heterogeneous distributed databases, where the local orderings of all the sub-ETs of a distributed ET may not be the same, and the total inconsistency of a distributed ET may be greater than the sum of that of all its sub-ETs. As a result, in addition to local divergence control in each site, a global mechanism is needed to guarantee ESR.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126458078","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287700
B. Bershad
An important class of concurrent objects are those that are nonblocking, that is, whose operations are not contained within mutually exclusive critical sections. A nonblocking object can be accessed by many threads at a time, yet update protocols based on atomic compare-and-swap operations can be used to guarantee the object's consistency. The author examines the compare-and-swap operation in the content of contemporary bus-based shared memory multiprocessors, although the results generalize to distributed shared memory multiprocessors. He describes an operating system-based solution that permits the construction of a nonblocking compare-and-swap function on architectures that only support more primitive atomic primitives such as test-and-set or atomic exchange. Several locking strategies are evaluated that can be used to synthesize a compare-and-swap operation, and it is shown that the common techniques for reducing synchronization overhead in the presence of contention are inappropriate when used as the basis for nonblocking synchronization. A simple synchronization strategy is described that has good performance because it avoids much of the synchronization overhead that normally occurs when there is contention.<>
{"title":"Practical considerations for non-blocking concurrent objects","authors":"B. Bershad","doi":"10.1109/ICDCS.1993.287700","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287700","url":null,"abstract":"An important class of concurrent objects are those that are nonblocking, that is, whose operations are not contained within mutually exclusive critical sections. A nonblocking object can be accessed by many threads at a time, yet update protocols based on atomic compare-and-swap operations can be used to guarantee the object's consistency. The author examines the compare-and-swap operation in the content of contemporary bus-based shared memory multiprocessors, although the results generalize to distributed shared memory multiprocessors. He describes an operating system-based solution that permits the construction of a nonblocking compare-and-swap function on architectures that only support more primitive atomic primitives such as test-and-set or atomic exchange. Several locking strategies are evaluated that can be used to synthesize a compare-and-swap operation, and it is shown that the common techniques for reducing synchronization overhead in the presence of contention are inappropriate when used as the basis for nonblocking synchronization. A simple synchronization strategy is described that has good performance because it avoids much of the synchronization overhead that normally occurs when there is contention.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133223968","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287718
C. Hofmeister, James M. Purtilo
Dynamic reconfiguration of a distributed application is the act of changing the configuration of the application as it executes. Examples of configuration changes are replacing a software component (module), moving a module to another machine, and adding or removing a module from the application. The extension to a reconfiguration platform described automatically prepares a module for participation in reconfiguration. A machine-independent method for automatically installing this functionality in the application, given a set of reconfiguration points designated by the programmer, is presented. The focus is on the difficult problem of capturing and restoring the state of a module during a procedure call, when the activation record stack contains crucial parts of the process state.<>
{"title":"Dynamic reconfiguration in distributed systems: adapting software modules for replacement","authors":"C. Hofmeister, James M. Purtilo","doi":"10.1109/ICDCS.1993.287718","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287718","url":null,"abstract":"Dynamic reconfiguration of a distributed application is the act of changing the configuration of the application as it executes. Examples of configuration changes are replacing a software component (module), moving a module to another machine, and adding or removing a module from the application. The extension to a reconfiguration platform described automatically prepares a module for participation in reconfiguration. A machine-independent method for automatically installing this functionality in the application, given a set of reconfiguration points designated by the programmer, is presented. The focus is on the difficult problem of capturing and restoring the state of a module during a procedure call, when the activation record stack contains crucial parts of the process state.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408016","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287678
V. Mainkar, Kishor S. Trivedi
Presents a performance analysis of a heterogeneous multiprocessor system where tasks may arrive from Poisson sources as well as by spawning and probabilistic branching of other tasks. Non-preemptive priority scheduling is used between different tasks. Stochastic reward nets are used as the system model, and are solved analytically by generating the underlying continuous-time Markov chain. An approximation technique is used, that is based on fixed-point iteration to avoid the problem of a large underlying Markov chain. The iteration scheme works reasonably well, and the existence of a fixed point for the iterative scheme is guaranteed under certain conditions.<>
{"title":"Approximate analysis of priority scheduling systems using stochastic reward nets","authors":"V. Mainkar, Kishor S. Trivedi","doi":"10.1109/ICDCS.1993.287678","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287678","url":null,"abstract":"Presents a performance analysis of a heterogeneous multiprocessor system where tasks may arrive from Poisson sources as well as by spawning and probabilistic branching of other tasks. Non-preemptive priority scheduling is used between different tasks. Stochastic reward nets are used as the system model, and are solved analytically by generating the underlying continuous-time Markov chain. An approximation technique is used, that is based on fixed-point iteration to avoid the problem of a large underlying Markov chain. The iteration scheme works reasonably well, and the existence of a fixed point for the iterative scheme is guaranteed under certain conditions.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129536003","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287710
Akhil Kumar, M. Rabinovich, R. Sinha
Recently, there has been considerable interest in the study of replica-control protocols which are based on organizing several copies of an object into logical structures, such as rectangular grids. In addition to high availability, another objective in exploiting such structures is to improve the degree of load sharing in a system. The authors extend the scope of grid structures to general grids, which allow holes in various positions of a rectangular structure and are useful to consider because they often produce availabilities that are higher than solid grids, where every position must be occupied by a node. In addition to proposing an improvement to the existing grid protocol, new insights are offered into the performance of the grids, from both availability and load sharing points of view. Algorithms for designing grids to maximize availability independently and also in conjunction with a load sharing constraint are given.<>
{"title":"A performance study of general grid structures for replicated data","authors":"Akhil Kumar, M. Rabinovich, R. Sinha","doi":"10.1109/ICDCS.1993.287710","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287710","url":null,"abstract":"Recently, there has been considerable interest in the study of replica-control protocols which are based on organizing several copies of an object into logical structures, such as rectangular grids. In addition to high availability, another objective in exploiting such structures is to improve the degree of load sharing in a system. The authors extend the scope of grid structures to general grids, which allow holes in various positions of a rectangular structure and are useful to consider because they often produce availabilities that are higher than solid grids, where every position must be occupied by a node. In addition to proposing an improvement to the existing grid protocol, new insights are offered into the performance of the grids, from both availability and load sharing points of view. Algorithms for designing grids to maximize availability independently and also in conjunction with a load sharing constraint are given.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"932 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133314541","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287692
Shirish S. Sathaye, William S. Kish, J. Strosnider
A fast packet-switched network is considered that transmits fixed-sized packets or cells and provides connection-oriented services. A number of rate-based service disciplines that offer timing guarantees have recently been proposed. These disciplines work well for connections which exhibit low burstiness or whose burstiness can be managed by admission control. However, some messages have irregular arrival patterns, but must be delivered with low delay. These aperiodic messages include connection set-up/tear-down messages, link-slate updates, and other status or alarm messages. The authors propose techniques that significantly minimize aperiodic message delay without jeopardizing guarantees made to existing connections. Simple hardware implementations of these techniques that can be embedded in output queues of fast packet-switches are also described.<>
{"title":"Responsive aperiodic services in high-speed networks","authors":"Shirish S. Sathaye, William S. Kish, J. Strosnider","doi":"10.1109/ICDCS.1993.287692","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287692","url":null,"abstract":"A fast packet-switched network is considered that transmits fixed-sized packets or cells and provides connection-oriented services. A number of rate-based service disciplines that offer timing guarantees have recently been proposed. These disciplines work well for connections which exhibit low burstiness or whose burstiness can be managed by admission control. However, some messages have irregular arrival patterns, but must be delivered with low delay. These aperiodic messages include connection set-up/tear-down messages, link-slate updates, and other status or alarm messages. The authors propose techniques that significantly minimize aperiodic message delay without jeopardizing guarantees made to existing connections. Simple hardware implementations of these techniques that can be embedded in output queues of fast packet-switches are also described.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124016695","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287714
T. Higashino, Kozo Okano, Hiroshi Imajo, K. Taniguchi
The authors propose a synthetic technique to derive a correct protocol specification from a given service specification modeled as a nondeterministic extended finite state machine (EFSM). Each EFSM has a finite state control and a finite number of registers. In the model, the next state and the next values of the registers are determined depending on not only the current state and input but also the current values of the registers. The registers correspond to the system resources and they are allocated to some of the protocol entities in a distributed system. The derived protocol entities' specifications satisfy the resource allocation specified by the designer. A procedure solving 0-1 integer linear programming problems is used to reduce the number of the messages exchanged among the protocol entities.<>
{"title":"Deriving protocol specifications from service specifications in extended FSM models","authors":"T. Higashino, Kozo Okano, Hiroshi Imajo, K. Taniguchi","doi":"10.1109/ICDCS.1993.287714","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287714","url":null,"abstract":"The authors propose a synthetic technique to derive a correct protocol specification from a given service specification modeled as a nondeterministic extended finite state machine (EFSM). Each EFSM has a finite state control and a finite number of registers. In the model, the next state and the next values of the registers are determined depending on not only the current state and input but also the current values of the registers. The registers correspond to the system resources and they are allocated to some of the protocol entities in a distributed system. The derived protocol entities' specifications satisfy the resource allocation specified by the designer. A procedure solving 0-1 integer linear programming problems is used to reduce the number of the messages exchanged among the protocol entities.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128089066","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}
Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287677
D. Saha, S. Rangarajan, S. Tripathi
Management of replicated data has received considerable attention in the last few years. Several replica control schemes have been proposed which work in the presence of both node and communication link failures. However, this resiliency to failure inflicts a performance penalty in terms of the communication overhead incurred. Though the issue of performance of these schemes, from the standpoint of availability of the system, has been well addressed, the issue of message overhead has been limited to the analysis of worst-case and best-case message bounds. In this paper, we compare several well-known replica management protocols and control schemes in terms of their average-case message overhead. We also consider the tradeoff between the message overhead and availability, and we define the system model considered. Analytical expressions are derived for five well-known replica control protocols. The results are discussed with numerical examples.<>
{"title":"Average message overhead of replica control protocols","authors":"D. Saha, S. Rangarajan, S. Tripathi","doi":"10.1109/ICDCS.1993.287677","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287677","url":null,"abstract":"Management of replicated data has received considerable attention in the last few years. Several replica control schemes have been proposed which work in the presence of both node and communication link failures. However, this resiliency to failure inflicts a performance penalty in terms of the communication overhead incurred. Though the issue of performance of these schemes, from the standpoint of availability of the system, has been well addressed, the issue of message overhead has been limited to the analysis of worst-case and best-case message bounds. In this paper, we compare several well-known replica management protocols and control schemes in terms of their average-case message overhead. We also consider the tradeoff between the message overhead and availability, and we define the system model considered. Analytical expressions are derived for five well-known replica control protocols. The results are discussed with numerical examples.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132289541","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：