Pub Date : 1993-08-01DOI: 10.1109/ICDCS.1993.287667
A. Schiper, A. Sandoz
The authors present the definition of and solution to the uniform reliable multicast problem in the virtually synchronous environment defined by the Isis system. A uniform reliable multicast of a message m has the property that if m has been received by any destination process (faulty or not), then m is received by all processes that reach a decision. Uniform reliable multicast provides a solution to the distributed commit problem. Two multicast primitives are defined in the virtually synchronous model: reliable multicast (called view-atomic) and uniform reliable multicast (called uniform view-atomic). The view-atomic multicast is used to implement the uniform view-atomic primitive. As view-atomicity is based on the concept of process group membership, a connection is established between the process group membership and the distributed commit problems.<>
{"title":"Uniform reliable multicast in a virtually synchronous environment","authors":"A. Schiper, A. Sandoz","doi":"10.1109/ICDCS.1993.287667","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287667","url":null,"abstract":"The authors present the definition of and solution to the uniform reliable multicast problem in the virtually synchronous environment defined by the Isis system. A uniform reliable multicast of a message m has the property that if m has been received by any destination process (faulty or not), then m is received by all processes that reach a decision. Uniform reliable multicast provides a solution to the distributed commit problem. Two multicast primitives are defined in the virtually synchronous model: reliable multicast (called view-atomic) and uniform reliable multicast (called uniform view-atomic). The view-atomic multicast is used to implement the uniform view-atomic primitive. As view-atomicity is based on the concept of process group membership, a connection is established between the process group membership and the distributed commit problems.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557295","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.287685
S. Finke, P. Jahn, Olaf Langmack, Klaus-Peter Löhr, Irina Piens, T. Wolff
HERON is a platform for object-oriented distributed computing in an open systems environment. We try to achieve a degree of distribution transparency previously known only from special distributed programming systems, while at the same time accommodating heterogeneous, autonomous computer systems. Distributed programs are written in Eiffel. The Eiffel language system is not modified: HERON employs proxies for remote object invocation and a flexible configuration procedure for building servers and distributed programs. In addition to regular objects, two kinds of distributed objects are supported by the proxy generator: dispersed objects and objects fragmented by remote inheritance. They contribute to distribution transparency both for distributed programs and for client/server systems.<>
{"title":"Distribution and inheritance in the HERON approach to heterogeneous computing","authors":"S. Finke, P. Jahn, Olaf Langmack, Klaus-Peter Löhr, Irina Piens, T. Wolff","doi":"10.1109/ICDCS.1993.287685","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287685","url":null,"abstract":"HERON is a platform for object-oriented distributed computing in an open systems environment. We try to achieve a degree of distribution transparency previously known only from special distributed programming systems, while at the same time accommodating heterogeneous, autonomous computer systems. Distributed programs are written in Eiffel. The Eiffel language system is not modified: HERON employs proxies for remote object invocation and a flexible configuration procedure for building servers and distributed programs. In addition to regular objects, two kinds of distributed objects are supported by the proxy generator: dispersed objects and objects fragmented by remote inheritance. They contribute to distribution transparency both for distributed programs and for client/server systems.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"12 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":"122884703","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.287716
J. Ordille, B. Miller
Today's global internetworks challenge the ability of name services and other information services to locate data quickly. The authors introduce distributed active catalog and meta-data caching for optimizing queries in this environment. The active catalog constrains the search space for a query by returning a list of data repositories where the answer to the query is likely to be found. Meta-data caching improves performance by keeping frequently used characterizations of the search space close to the user, and eliminating active catalog communication and processing costs. When searching for query responses, the techniques contact only the small percentage of the data repositories with actual responses, resulting in search times of a few seconds. A distributed active catalog and meta-data caching method was implemented in a prototype descriptive name service called Nomenclator. Performance results for Nomenclator in a search space of 1000 data repositories are presented.<>
{"title":"Distributed active catalogs and meta-data caching in descriptive name services","authors":"J. Ordille, B. Miller","doi":"10.1109/ICDCS.1993.287716","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287716","url":null,"abstract":"Today's global internetworks challenge the ability of name services and other information services to locate data quickly. The authors introduce distributed active catalog and meta-data caching for optimizing queries in this environment. The active catalog constrains the search space for a query by returning a list of data repositories where the answer to the query is likely to be found. Meta-data caching improves performance by keeping frequently used characterizations of the search space close to the user, and eliminating active catalog communication and processing costs. When searching for query responses, the techniques contact only the small percentage of the data repositories with actual responses, resulting in search times of a few seconds. A distributed active catalog and meta-data caching method was implemented in a prototype descriptive name service called Nomenclator. Performance results for Nomenclator in a search space of 1000 data repositories are presented.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"102 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":"128336322","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.287681
Jiansan Chen, O. Bukhres, A. Elmagarmid
A multidatabase system (MDBS) integrates preexisting and heterogeneous databases in a distributed environment. A multidatabase transaction is a consistent and reliable execution of an application over a multidatabase system. The authors summarize the characteristics of multidatabase transactions and present a multidatabase transaction specification language, the InterBase Parallel Language (IPL). IPL allows users to write MDBS transactions by specifying all associated actions, their sequences, control flow, and data flow among subtransactions, and yet retaining the autonomies of the preexisting software systems. IPL also allows users to specify different commit protocols for different subtransactions and to control the atomicity and isolation granularity of an MDBS transaction. IPL components and design issues are described in detail. The implementation of IPL is also discussed.<>
多数据库系统(mdb)在分布式环境中集成了预先存在的和异构的数据库。多数据库事务是应用程序在多数据库系统上的一致和可靠的执行。作者总结了多数据库事务的特点，提出了一种多数据库事务规范语言——InterBase Parallel language (IPL)。IPL允许用户通过指定所有相关的操作、它们的序列、控制流和子事务之间的数据流来编写mdb事务，同时保留预先存在的软件系统的自主性。IPL还允许用户为不同的子事务指定不同的提交协议，并控制mdb事务的原子性和隔离粒度。详细描述了IPL的组成和设计问题。并对IPL的实现进行了讨论。
{"title":"IPL: a multidatabase transaction specification language","authors":"Jiansan Chen, O. Bukhres, A. Elmagarmid","doi":"10.1109/ICDCS.1993.287681","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287681","url":null,"abstract":"A multidatabase system (MDBS) integrates preexisting and heterogeneous databases in a distributed environment. A multidatabase transaction is a consistent and reliable execution of an application over a multidatabase system. The authors summarize the characteristics of multidatabase transactions and present a multidatabase transaction specification language, the InterBase Parallel Language (IPL). IPL allows users to write MDBS transactions by specifying all associated actions, their sequences, control flow, and data flow among subtransactions, and yet retaining the autonomies of the preexisting software systems. IPL also allows users to specify different commit protocols for different subtransactions and to control the atomicity and isolation granularity of an MDBS transaction. IPL components and design issues are described in detail. The implementation of IPL is also discussed.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"11 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":"128565260","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.287682
B. Kao, H. Garcia-Molina
In a distributed environment, tasks often have processing demands on multiple sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. To study the subtask deadline assignment problem a simple model of the system and tasks is postulated. The focus is on soft real-time systems. In such systems, it is very difficult to guarantee that all deadlines will be met, and hence one tries to minimize the number of deadlines that are missed. The authors examine (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment.<>
{"title":"Deadline assignment in a distributed soft real-time system","authors":"B. Kao, H. Garcia-Molina","doi":"10.1109/ICDCS.1993.287682","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287682","url":null,"abstract":"In a distributed environment, tasks often have processing demands on multiple sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. To study the subtask deadline assignment problem a simple model of the system and tasks is postulated. The focus is on soft real-time systems. In such systems, it is very difficult to guarantee that all deadlines will be met, and hence one tries to minimize the number of deadlines that are missed. The authors examine (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"16 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":"129451376","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.287707
Gerhard Weiss
Learning in multiagent systems is a new research field in distributed artificial intelligence. The author investigates an action-oriented approach to delayed reinforcement learning in reactive multiagent systems and focuses on the question of how the agents can learn to coordinate their actions. Two basic algorithms, the ACE algorithm and the AGE algorithm (ACE and AGE stand for Action Estimation and Action Group Estimation, respectively), for the collective learning of appropriate action sequences are introduced. Both algorithms explicitly take into consideration that (i) each agent typically knows only a fraction of its environment, (ii) the agents typically have to cooperate in solving tasks, and (iii) actions carried out by the agents can be incompatible. The experiments described illustrate these algorithms and their learning capacities.<>
{"title":"Collective learning of action sequences","authors":"Gerhard Weiss","doi":"10.1109/ICDCS.1993.287707","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287707","url":null,"abstract":"Learning in multiagent systems is a new research field in distributed artificial intelligence. The author investigates an action-oriented approach to delayed reinforcement learning in reactive multiagent systems and focuses on the question of how the agents can learn to coordinate their actions. Two basic algorithms, the ACE algorithm and the AGE algorithm (ACE and AGE stand for Action Estimation and Action Group Estimation, respectively), for the collective learning of appropriate action sequences are introduced. Both algorithms explicitly take into consideration that (i) each agent typically knows only a fraction of its environment, (ii) the agents typically have to cooperate in solving tasks, and (iii) actions carried out by the agents can be incompatible. The experiments described illustrate these algorithms and their learning capacities.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"100 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":"124130213","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.287721
Shing-Tsaan Huang, Jehn-Ruey Jiang, Yu-Chen Kuo
The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.<>
{"title":"k-coteries for fault-tolerant k entries to a critical section","authors":"Shing-Tsaan Huang, Jehn-Ruey Jiang, Yu-Chen Kuo","doi":"10.1109/ICDCS.1993.287721","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287721","url":null,"abstract":"The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"2 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":"126535727","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.287695
A. Duda
The author presents an analysis of three object replication strategies based on reliable multicast protocols. A multiclass queuing model is used for obtaining performance characteristics of each strategy. The strategies are compared for a wide set of parameters showing the best strategy suitable for a given situation: the parallel update strategy is interesting for low load conditions and for the low read/write ratio.<>
{"title":"Analysis of multicast-based object replication strategies in distributed systems","authors":"A. Duda","doi":"10.1109/ICDCS.1993.287695","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287695","url":null,"abstract":"The author presents an analysis of three object replication strategies based on reliable multicast protocols. A multiclass queuing model is used for obtaining performance characteristics of each strategy. The strategies are compared for a wide set of parameters showing the best strategy suitable for a given situation: the parallel update strategy is interesting for low load conditions and for the low read/write ratio.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"53 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":"125972523","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.287722
K. Ravindran, A. Thenmozhi
Some methods are discussed to extract and represent the concurrency inherent in distributed applications. Concurrency is an application level property that is characterized completely by the set of messages exchanged in the application and the causal ordering relationship among the messages. The concurrency may be viewed at the logical level in the application rather than at the physical message communication level. The concurrency has a direct relationship to the message delivery performance in the underlying computation such as asynchronism in message delivery protocols. The authors quantitatively analyze how the application level concurrency influences the execution of the application. The analysis is based on methods for representing concurrency and deriving measures of concurrency from the representations. System level execution models based on ISIS, x-kernel and the causal broadcast communication system are used as case studies in the analysis. The analysis is in general useful in the design of applications and to compare their projected performance levels in an implementation-independent manner.<>
{"title":"Extraction of logical concurrency in distributed applications","authors":"K. Ravindran, A. Thenmozhi","doi":"10.1109/ICDCS.1993.287722","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287722","url":null,"abstract":"Some methods are discussed to extract and represent the concurrency inherent in distributed applications. Concurrency is an application level property that is characterized completely by the set of messages exchanged in the application and the causal ordering relationship among the messages. The concurrency may be viewed at the logical level in the application rather than at the physical message communication level. The concurrency has a direct relationship to the message delivery performance in the underlying computation such as asynchronism in message delivery protocols. The authors quantitatively analyze how the application level concurrency influences the execution of the application. The analysis is based on methods for representing concurrency and deriving measures of concurrency from the representations. System level execution models based on ISIS, x-kernel and the causal broadcast communication system are used as case studies in the analysis. The analysis is in general useful in the design of applications and to compare their projected performance levels in an implementation-independent manner.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"74 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":"124667313","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.287705
K. Ravindran, Gurdip Singh, Pankaj Gupta
Connectivity among a set of user entities in a network can be provided by a network level abstraction of an acyclic graph (or spanning tree). The authors discuss the reconfiguration of a graph in the presence of failures of network nodes. A reconfiguration manifests itself as a graph fragmentation problem, whereby two or more disjoint subgraphs attempt to connect with one another to form a composite graph. Fragment interconnection requires contention resolution between fragments to avoid cycles. Two classes of contention resolution algorithms applicable for environments with a potentially large number of fragments are presented. They are based on preestablished ranking among fragments and random arbitration among fragments. The algorithms have been evaluated by simulation and compared. The algorithms are useful in supporting data multicasting across workstations and distributed computations involving data on different machines.<>
{"title":"Reconfiguration of spanning trees in networks in the presence of node failures","authors":"K. Ravindran, Gurdip Singh, Pankaj Gupta","doi":"10.1109/ICDCS.1993.287705","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287705","url":null,"abstract":"Connectivity among a set of user entities in a network can be provided by a network level abstraction of an acyclic graph (or spanning tree). The authors discuss the reconfiguration of a graph in the presence of failures of network nodes. A reconfiguration manifests itself as a graph fragmentation problem, whereby two or more disjoint subgraphs attempt to connect with one another to form a composite graph. Fragment interconnection requires contention resolution between fragments to avoid cycles. Two classes of contention resolution algorithms applicable for environments with a potentially large number of fragments are presented. They are based on preestablished ranking among fragments and random arbitration among fragments. The algorithms have been evaluated by simulation and compared. The algorithms are useful in supporting data multicasting across workstations and distributed computations involving data on different machines.<<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":"128236789","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
扫码关注我们
求助内容：
应助结果提醒方式：