Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217502
E. Nett
An action scheme is proposed that reflects the cooperation with other autonomous database systems and other models of data repositories like file systems or object stores. It is provided by the operating system level to support this kind of heterogeneity. Its key feature is that the provided mechanisms for recoverability are designed in an orthogonal manner meaning that it is not presupposed to conform to a particular syntactical concurrency control criterion.<>
{"title":"Supporting action management in heterogeneous distributed systems","authors":"E. Nett","doi":"10.1109/FTDCS.1992.217502","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217502","url":null,"abstract":"An action scheme is proposed that reflects the cooperation with other autonomous database systems and other models of data repositories like file systems or object stores. It is provided by the operating system level to support this kind of heterogeneity. Its key feature is that the provided mechanisms for recoverability are designed in an orthogonal manner meaning that it is not presupposed to conform to a particular syntactical concurrency control criterion.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361397","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217474
C. Lindemann
This paper introduces a modeling technique for deterministic medium access schemes to communication channels. The presented approach is based on the extension of deterministic and stochastic Petri nets (DSPNs) by marking-dependent firing delays of deterministic transitions. This extension allows a compact DSPN representation of deterministic medium access schemes. To illustrate the benefit of the described modeling approach a DSPN for CSMA/CD protocols with deterministic collision resolution is presented.<>
{"title":"A stochastic performance modeling technique for deterministic medium access schemes","authors":"C. Lindemann","doi":"10.1109/FTDCS.1992.217474","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217474","url":null,"abstract":"This paper introduces a modeling technique for deterministic medium access schemes to communication channels. The presented approach is based on the extension of deterministic and stochastic Petri nets (DSPNs) by marking-dependent firing delays of deterministic transitions. This extension allows a compact DSPN representation of deterministic medium access schemes. To illustrate the benefit of the described modeling approach a DSPN for CSMA/CD protocols with deterministic collision resolution is presented.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127630241","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217489
R. Gabriel, S. Jagnichen
This paper reports the ongoing activities to generate graphical representation manipulating user interfaces from very high level specifications. First, an overview of graphical notations that are relevant for software engineering is given. Second, the capabilities offered by the current version of the generator G/sup 2/F are presented. Third, the paper shows how software technology techniques in turn have been applied to extend G/sup 2/F by the power of attribute grammars.<>
{"title":"Graphical representations and software engineering","authors":"R. Gabriel, S. Jagnichen","doi":"10.1109/FTDCS.1992.217489","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217489","url":null,"abstract":"This paper reports the ongoing activities to generate graphical representation manipulating user interfaces from very high level specifications. First, an overview of graphical notations that are relevant for software engineering is given. Second, the capabilities offered by the current version of the generator G/sup 2/F are presented. Third, the paper shows how software technology techniques in turn have been applied to extend G/sup 2/F by the power of attribute grammars.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128308581","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217472
Shoou-Gwo Jiang, G. Ma
Many multimedia systems are focusing on the techniques of teleconferencing applications and discussing the general reference architectures. Generally speaking, a distributed multimedia application is constructed of four layers: the interactive layer, the data composition layer, the network transport layer and the database management system (DBMS) layer. Although these layers are the well-known reference architectures, the connections (multimedia modeling, module operations, and module communications) between them still need to be solved. To allow users easily, flexibly, and dynamically to create, query, and present multimedia documents, the authors propose five modules as an integration solution; they are, interactive user interface module, multimedia object manipulation module, object dynamically mapping module, network transport control module, and physical object file manipulation module. These modules are the essences of the behaviorally object-oriented distributed multimedia environment. Based on these modules, the multimedia object modeling, the query processing and the presentation schema are elaborated.<>
{"title":"Distributed multimedia information presenting environment","authors":"Shoou-Gwo Jiang, G. Ma","doi":"10.1109/FTDCS.1992.217472","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217472","url":null,"abstract":"Many multimedia systems are focusing on the techniques of teleconferencing applications and discussing the general reference architectures. Generally speaking, a distributed multimedia application is constructed of four layers: the interactive layer, the data composition layer, the network transport layer and the database management system (DBMS) layer. Although these layers are the well-known reference architectures, the connections (multimedia modeling, module operations, and module communications) between them still need to be solved. To allow users easily, flexibly, and dynamically to create, query, and present multimedia documents, the authors propose five modules as an integration solution; they are, interactive user interface module, multimedia object manipulation module, object dynamically mapping module, network transport control module, and physical object file manipulation module. These modules are the essences of the behaviorally object-oriented distributed multimedia environment. Based on these modules, the multimedia object modeling, the query processing and the presentation schema are elaborated.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128542137","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217476
L. Sintonen
An approximate delay analysis of a slotted ring medium access protocol is represented. The operation is based on a continuous stream of slots circulating around the ring. The delay model is represented. Assuming that a slot is reserved with a preassumed probability, an expression for the z-transform of the number waiting in the queue is derived by using the embedded technique. From this the expression for the average access delay is obtained. The approximation of the probability is then found and the average delay can be solved. The incoming traffic is assumed to be Poisson. Numerical results are discussed.<>
{"title":"Delay analysis of a slotted ring medium access protocol","authors":"L. Sintonen","doi":"10.1109/FTDCS.1992.217476","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217476","url":null,"abstract":"An approximate delay analysis of a slotted ring medium access protocol is represented. The operation is based on a continuous stream of slots circulating around the ring. The delay model is represented. Assuming that a slot is reserved with a preassumed probability, an expression for the z-transform of the number waiting in the queue is derived by using the embedded technique. From this the expression for the average access delay is obtained. The approximation of the probability is then found and the average delay can be solved. The incoming traffic is assumed to be Poisson. Numerical results are discussed.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122103206","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217471
Feng-Jian Wang, Shun-Ting Lu, Jing-Hwa Liang
A teleconferencing system making use of computers and network communication lets people participate in a conference without staying together. During the conference, participants communicate with one another through electronic devices such as terminal, mouse, etc., and network. The authors present the construction of a teleconferencing system based on a standard software system, X/Window System. It discusses an X-based system model for tools necessary in a teleconferencing system, then analyzes the concurrency controls and communication mechanisms among these tools. A prototype for text-based conference called CTUTC for chairperson-members is presented since X provides dynamic-window configuration. The authors model provides a framework from which an iconic-based generating system is possibly built.<>
{"title":"Constructing an X-based teleconferencing system","authors":"Feng-Jian Wang, Shun-Ting Lu, Jing-Hwa Liang","doi":"10.1109/FTDCS.1992.217471","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217471","url":null,"abstract":"A teleconferencing system making use of computers and network communication lets people participate in a conference without staying together. During the conference, participants communicate with one another through electronic devices such as terminal, mouse, etc., and network. The authors present the construction of a teleconferencing system based on a standard software system, X/Window System. It discusses an X-based system model for tools necessary in a teleconferencing system, then analyzes the concurrency controls and communication mechanisms among these tools. A prototype for text-based conference called CTUTC for chairperson-members is presented since X provides dynamic-window configuration. The authors model provides a framework from which an iconic-based generating system is possibly built.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124789414","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217492
R. Schumann
Dependencies between computations may lead to unpredictable behaviour of the commit/abort protocols possibly contradicting given real-time requirements. Moreover, it is even possible that the protocols do not terminate. By using redundant dependency storing and by restricting concurrency without isolating computations from each other efficient commit/abort protocols can be provided. Obviously, there exists an alternative to the isolation of computations in distributed real-time systems which allows more concurrency between computations.<>
{"title":"Reviewing recovery-management under real-time requirements in distributed systems","authors":"R. Schumann","doi":"10.1109/FTDCS.1992.217492","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217492","url":null,"abstract":"Dependencies between computations may lead to unpredictable behaviour of the commit/abort protocols possibly contradicting given real-time requirements. Moreover, it is even possible that the protocols do not terminate. By using redundant dependency storing and by restricting concurrency without isolating computations from each other efficient commit/abort protocols can be provided. Obviously, there exists an alternative to the isolation of computations in distributed real-time systems which allows more concurrency between computations.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129941905","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217513
M. Diaz
This paper proposes a formal definition of the concept of cooperation in distributed systems. The proposed model is based on the use of Modal Logic. More precisely, cooperating activities are seen as activities that can be in different cooperating schemas and, as a consequence, follow different Modal logic systems: T, B, S4, S5. It is in particular shown how this model, using a four-valued logic, is able to express contradictions, because predicates can be both True and False in different domains (scopes) of cooperation.<>
{"title":"A logical model of cooperation","authors":"M. Diaz","doi":"10.1109/FTDCS.1992.217513","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217513","url":null,"abstract":"This paper proposes a formal definition of the concept of cooperation in distributed systems. The proposed model is based on the use of Modal Logic. More precisely, cooperating activities are seen as activities that can be in different cooperating schemas and, as a consequence, follow different Modal logic systems: T, B, S4, S5. It is in particular shown how this model, using a four-valued logic, is able to express contradictions, because predicates can be both True and False in different domains (scopes) of cooperation.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"297 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120897931","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217473
P. Muhlethaler, K. Chen
In real-time computing system each task is associated with a function (time value function TVF) whose value at time t gives the award that the system receives if the corresponding task is achieved by this time. The authors investigate the NP-hard scheduling problem which consists in maximizing the sum of these awards. First on a theoretical point of view, they define an optimal decomposition : the set of the tasks to be scheduled is divided into a ranked collection of subsets so that an optimal scheduling has to respect the ranks of subsets. They also introduce two classes of polynomial scheduling algorithms which provide sequences respecting this optimal decomposition. On a practical point of view, simulation results show that these algorithms yield optimal or nearly optimal sequences in many cases.<>
{"title":"Two classes of effective heuristics for time value functions based scheduling","authors":"P. Muhlethaler, K. Chen","doi":"10.1109/FTDCS.1992.217473","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217473","url":null,"abstract":"In real-time computing system each task is associated with a function (time value function TVF) whose value at time t gives the award that the system receives if the corresponding task is achieved by this time. The authors investigate the NP-hard scheduling problem which consists in maximizing the sum of these awards. First on a theoretical point of view, they define an optimal decomposition : the set of the tasks to be scheduled is divided into a ranked collection of subsets so that an optimal scheduling has to respect the ranks of subsets. They also introduce two classes of polynomial scheduling algorithms which provide sequences respecting this optimal decomposition. On a practical point of view, simulation results show that these algorithms yield optimal or nearly optimal sequences in many cases.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116957324","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217477
T. Chen, A.L.P. Chen, Wei-Pang Yang
Traditional semijoin and semijoin with multiple hash functions are two important methods to reduce the data transmission cost in distributed DBMS. However, these two methods are sometimes inefficient, due to their complexity and lack of flexibility. To remedy these problems, the authors propose a new technique, named hash-semijoin. They identify the situations in which it performs better than traditional semijoin and semijoin with multiple hash functions. The optimal hash functions used in hash-semijoins are also studied.<>
{"title":"Hash-semijoin: a new technique for minimizing distributed query time","authors":"T. Chen, A.L.P. Chen, Wei-Pang Yang","doi":"10.1109/FTDCS.1992.217477","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217477","url":null,"abstract":"Traditional semijoin and semijoin with multiple hash functions are two important methods to reduce the data transmission cost in distributed DBMS. However, these two methods are sometimes inefficient, due to their complexity and lack of flexibility. To remedy these problems, the authors propose a new technique, named hash-semijoin. They identify the situations in which it performs better than traditional semijoin and semijoin with multiple hash functions. The optimal hash functions used in hash-semijoins are also studied.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122994061","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
扫码关注我们
求助内容：
应助结果提醒方式：