Pub Date : 2000-03-15DOI: 10.1109/ISORC.2000.839517
R. Grosu, Ingolf Krüger, T. Stauner
We introduce Hybrid Sequence Charts (HySCs) as a visual description technique for communication in hybrid system models. To that end, we adapt a subset of the well-known MSC syntax to the application domain of hybrid systems. The semantics of HySCs is different from standard MSC semantics. Most notably, we use a shared variables communication model and assume the existence of a continuous, global clock. Similar to their classic counterpart HySCs can be advantageously used in the early phases of the software development process. In particular in the requirements capture phase, they improve the dialog between customers and application experts: They complement existing formalisms like hybrid automata by focusing on the interaction between the system's components. We outline the key concepts and the usage of HySCs along an example, the specification of an electronic height control system. Then we define the formal semantics of their basic elements.
{"title":"Hybrid Sequence Charts","authors":"R. Grosu, Ingolf Krüger, T. Stauner","doi":"10.1109/ISORC.2000.839517","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839517","url":null,"abstract":"We introduce Hybrid Sequence Charts (HySCs) as a visual description technique for communication in hybrid system models. To that end, we adapt a subset of the well-known MSC syntax to the application domain of hybrid systems. The semantics of HySCs is different from standard MSC semantics. Most notably, we use a shared variables communication model and assume the existence of a continuous, global clock. Similar to their classic counterpart HySCs can be advantageously used in the early phases of the software development process. In particular in the requirements capture phase, they improve the dialog between customers and application experts: They complement existing formalisms like hybrid automata by focusing on the interaction between the system's components. We outline the key concepts and the usage of HySCs along an example, the specification of an electronic height control system. Then we define the formal semantics of their basic elements.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129321098","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839528
J. Putman
Fault tolerance (FT) is a topic of major concern in achieving dependable systems, for both real time as well as non real time systems. The paper provides a model of achieving fault tolerance, based on the ISO/ITU Reference Model for Open Distributed Processing (RM-ODP). This reference model provides a system software engineering methodology for fault tolerance, an object based model of fault tolerance, system requirements for achieving fault tolerance in an open manner, modeling constructs and rules to enable a proper system specification of fault tolerance, and business rules in terms of policies to achieve a well formed system specification. All these aspects are discussed at some depth, but the author primarily focuses on how certain behavior can be specified and achieved in an object based system, the constructs of the Unified Modeling Language (UML) and the Object Constraint Language (OCL).
{"title":"Model for fault tolerance and policy from RM-ODP expressed in UML/OCL","authors":"J. Putman","doi":"10.1109/ISORC.2000.839528","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839528","url":null,"abstract":"Fault tolerance (FT) is a topic of major concern in achieving dependable systems, for both real time as well as non real time systems. The paper provides a model of achieving fault tolerance, based on the ISO/ITU Reference Model for Open Distributed Processing (RM-ODP). This reference model provides a system software engineering methodology for fault tolerance, an object based model of fault tolerance, system requirements for achieving fault tolerance in an open manner, modeling constructs and rules to enable a proper system specification of fault tolerance, and business rules in terms of policies to achieve a well formed system specification. All these aspects are discussed at some depth, but the author primarily focuses on how certain behavior can be specified and achieved in an object based system, the constructs of the Unified Modeling Language (UML) and the Object Constraint Language (OCL).","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863399","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839506
Kane Kim, Juqiang Liu, Moon-hae Kim
Deadline handling is a fundamental part of real-time computing but has been practiced in ad hoc forms for decades. A general framework for systematic deadline handling in real-time distributed computer systems is proposed in this paper. The notions of hard deadlines and hard-real-time program components are discussed along with the advantages of a hard-real-time component based construction approach. To present approaches for implementation of systematic deadline handling in concrete forms, we use the time-triggered message triggered object (TMO) network structuring as the basic design framework in which deadline handling approaches are incorporated. The TMO structuring scheme is a general-style component structuring scheme and supports design of all types of components including hard-real-time objects and non-real-time objects within one general structure. An augmentation of the TMO structure with statistical performance indicators is also proposed.
{"title":"Deadline handling in real-time distributed objects","authors":"Kane Kim, Juqiang Liu, Moon-hae Kim","doi":"10.1109/ISORC.2000.839506","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839506","url":null,"abstract":"Deadline handling is a fundamental part of real-time computing but has been practiced in ad hoc forms for decades. A general framework for systematic deadline handling in real-time distributed computer systems is proposed in this paper. The notions of hard deadlines and hard-real-time program components are discussed along with the advantages of a hard-real-time component based construction approach. To present approaches for implementation of systematic deadline handling in concrete forms, we use the time-triggered message triggered object (TMO) network structuring as the basic design framework in which deadline handling approaches are incorporated. The TMO structuring scheme is a general-style component structuring scheme and supports design of all types of components including hard-real-time objects and non-real-time objects within one general structure. An augmentation of the TMO structure with statistical performance indicators is also proposed.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125172641","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839513
T. Saunders
The Air Force has enthusiastically endorsed at its most senior levels, advanced thinking with regard to the application of information technology. Information superiority is a regularly emphasized core competency, and the AF is developing the concept of an enterprise wide integrated management for C2 with the application of information technology as the core component. Recently, the notion of a Joint Battlespace Infosphere (JBI) has emerged as an idea; extending beyond the bounds of the Air Force, which could have significant impact on both the operational procedures of the Air Force and on the technologies that support them. This paper discusses some, but not all, of the many issues that are involved in developing the JBI, and it provides a couple of pointers to research topics that would be beneficial towards furthering the JBI concept.
{"title":"A vision of the future for the Air Force (and perhaps the whole DoD)","authors":"T. Saunders","doi":"10.1109/ISORC.2000.839513","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839513","url":null,"abstract":"The Air Force has enthusiastically endorsed at its most senior levels, advanced thinking with regard to the application of information technology. Information superiority is a regularly emphasized core competency, and the AF is developing the concept of an enterprise wide integrated management for C2 with the application of information technology as the core component. Recently, the notion of a Joint Battlespace Infosphere (JBI) has emerged as an idea; extending beyond the bounds of the Air Force, which could have significant impact on both the operational procedures of the Air Force and on the technologies that support them. This paper discusses some, but not all, of the many issues that are involved in developing the JBI, and it provides a couple of pointers to research topics that would be beneficial towards furthering the JBI concept.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122668942","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839546
Z. Choukair, Damien Retailleau
Today's virtual environments are expected to be distributed to allow collaboration for common purposes. However, they must ensure a high level of quality of service (QoS) to the user, especially in an open context with unknown, a priori, man-in-the-loop event occurrence. This paper presents our Distributed Virtual Environment COllaboration Model (DVECOM) and its implementation which aims to provide an end-user QoS support for distributed virtual reality applications. The idea of DVECOM is to guarantee full consistency and soft synchronization of the virtual world distributed displays, with the least rendering degradation possible, and also to auto-adapt the rendering in accordance with the retained strategy, ensuring best effort and least suffering for virtual world rendering. This representation degradation is driven by the users' choices. The receiver-side protocol is based upon the end-user preferences, physical level capability information, as well as the pertinence of the notification to each client (contextual end-user information). When available, such guarantees would make it possible to use DVE out of a closed, oversized, very restricted context for industrial collaborative applications with an expected QoS.
{"title":"Integrating QoS to collaborative distributed virtual reality applications","authors":"Z. Choukair, Damien Retailleau","doi":"10.1109/ISORC.2000.839546","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839546","url":null,"abstract":"Today's virtual environments are expected to be distributed to allow collaboration for common purposes. However, they must ensure a high level of quality of service (QoS) to the user, especially in an open context with unknown, a priori, man-in-the-loop event occurrence. This paper presents our Distributed Virtual Environment COllaboration Model (DVECOM) and its implementation which aims to provide an end-user QoS support for distributed virtual reality applications. The idea of DVECOM is to guarantee full consistency and soft synchronization of the virtual world distributed displays, with the least rendering degradation possible, and also to auto-adapt the rendering in accordance with the retained strategy, ensuring best effort and least suffering for virtual world rendering. This representation degradation is driven by the users' choices. The receiver-side protocol is based upon the end-user preferences, physical level capability information, as well as the pertinence of the notification to each client (contextual end-user information). When available, such guarantees would make it possible to use DVE out of a closed, oversized, very restricted context for industrial collaborative applications with an expected QoS.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127831928","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839550
T. Lizambri, F. Duran, S. Wakid
There have been may debates about the feasibility of providing guaranteed quality of service (QoS) when network traffic travels beyond the enterprise domain and into the vast unknown of the Internet. Many mechanisms have been proposed to bring QoS to TCP/IP and the Internet (RSVP, DiffServ, 802.1p). However, until these techniques and the equipment to support them become ubiquitous, most enterprises will rely on local prioritization of the traffic to obtain the best performance for mission-critical and time-sensitive applications. This paper explores prioritizing critical TCP/IP traffic using a multi-queue buffer management strategy that becomes biased against random low-priority flows and remains biased while congestion exists in the network. This biasing implies a degree of unfairness but proves to be more advantageous to the overall throughput of the network than strategies that attempt to be fair. Only two classes of service are considered, where TCP connections are assigned to these classes and mapped to two underlying queues with round-robin scheduling and shared memory. In addition to improving the throughput, cell losses are minimized for the class of service (queue) with the higher priority.
{"title":"TCP throughput and buffer management","authors":"T. Lizambri, F. Duran, S. Wakid","doi":"10.1109/ISORC.2000.839550","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839550","url":null,"abstract":"There have been may debates about the feasibility of providing guaranteed quality of service (QoS) when network traffic travels beyond the enterprise domain and into the vast unknown of the Internet. Many mechanisms have been proposed to bring QoS to TCP/IP and the Internet (RSVP, DiffServ, 802.1p). However, until these techniques and the equipment to support them become ubiquitous, most enterprises will rely on local prioritization of the traffic to obtain the best performance for mission-critical and time-sensitive applications. This paper explores prioritizing critical TCP/IP traffic using a multi-queue buffer management strategy that becomes biased against random low-priority flows and remains biased while congestion exists in the network. This biasing implies a degree of unfairness but proves to be more advantageous to the overall throughput of the network than strategies that attempt to be fair. Only two classes of service are considered, where TCP connections are assigned to these classes and mapped to two underlying queues with round-robin scheduling and shared memory. In addition to improving the throughput, cell losses are minimized for the class of service (queue) with the higher priority.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121081604","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839525
Hirokazu Nagasawa, N. Omori, M. Nishino
A next generation digital image library system called NetMars has been developed. This system enables moving pictures on the network to be retrieved and viewed, and provides simple compiling functions for rearranging retrieved moving pictures. With NetMars, specific proposals are made for copyright processing, focusing on secondary usage as a new method for distributing video contents. NetMars applies CORBA based object oriented technology in a distributed processing environment. It emphasizes mutual interconnectivity and provides a mechanism for the issuing, distribution, and sharing of information among image libraries existing on multiple networks.
{"title":"NetMars: next-generation digital image library system","authors":"Hirokazu Nagasawa, N. Omori, M. Nishino","doi":"10.1109/ISORC.2000.839525","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839525","url":null,"abstract":"A next generation digital image library system called NetMars has been developed. This system enables moving pictures on the network to be retrieved and viewed, and provides simple compiling functions for rearranging retrieved moving pictures. With NetMars, specific proposals are made for copyright processing, focusing on secondary usage as a new method for distributing video contents. NetMars applies CORBA based object oriented technology in a distributed processing environment. It emphasizes mutual interconnectivity and provides a mechanism for the issuing, distribution, and sharing of information among image libraries existing on multiple networks.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301835","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839555
Gerasimos Xydas, J. Tassel
Describes experiences in using an object-oriented language (Java) in designing, prototyping and evaluating a CPU manager. "QoS Animator" facilitates the execution of Java applications with time requirements and provides protection mechanisms to preserve the system's integrity against untrusted code. It is adapted to the system performance and provides a rate-monotonic-based scheduling algorithm, a worst-case execution time (WCET) calculation at run-time, and protection from high CPU-consuming and "bad" code. The introduction of a low-frequency filter enhances the timeliness offered to applications in general-purposes operating systems. The evaluation was done with a Windows NT-specific prototype and proved successful.
{"title":"Experimentation in CPU control with Real-Time Java","authors":"Gerasimos Xydas, J. Tassel","doi":"10.1109/ISORC.2000.839555","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839555","url":null,"abstract":"Describes experiences in using an object-oriented language (Java) in designing, prototyping and evaluating a CPU manager. \"QoS Animator\" facilitates the execution of Java applications with time requirements and provides protection mechanisms to preserve the system's integrity against untrusted code. It is adapted to the system performance and provides a rate-monotonic-based scheduling algorithm, a worst-case execution time (WCET) calculation at run-time, and protection from high CPU-consuming and \"bad\" code. The introduction of a low-frequency filter enhances the timeliness offered to applications in general-purposes operating systems. The evaluation was done with a Windows NT-specific prototype and proved successful.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126274403","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839547
Frank Siqueira, V. Cahill
Distributed application programmers rely on middleware such as CORBA in order to handle the complexity that arises from the distributed and heterogeneous nature of the underlying computing platform. CORBA, in particular, provides a media streaming mechanism that can be used both for media streaming and for associating QoS requirements with media streams. Despite defining the interfaces of the media streaming mechanism, the corresponding specification does not prescribe how QoS is enforced at low levels by the middleware. This paper describes the design and implementation of a QoS architecture, called Quartz, which has been integrated with CORBA in order to provide a framework that allows applications to transfer real-time media in open systems. This framework is employed to model and simulate a pattern recognition mechanism for use in an automated manufacturing cell, which is also described and analysed in this paper.
{"title":"An open QoS architecture for CORBA applications","authors":"Frank Siqueira, V. Cahill","doi":"10.1109/ISORC.2000.839547","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839547","url":null,"abstract":"Distributed application programmers rely on middleware such as CORBA in order to handle the complexity that arises from the distributed and heterogeneous nature of the underlying computing platform. CORBA, in particular, provides a media streaming mechanism that can be used both for media streaming and for associating QoS requirements with media streams. Despite defining the interfaces of the media streaming mechanism, the corresponding specification does not prescribe how QoS is enforced at low levels by the middleware. This paper describes the design and implementation of a QoS architecture, called Quartz, which has been integrated with CORBA in order to provide a framework that allows applications to transfer real-time media in open systems. This framework is employed to model and simulate a pattern recognition mechanism for use in an automated manufacturing cell, which is also described and analysed in this paper.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131383902","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 : 2000-03-15DOI: 10.1109/ISORC.2000.839512
Irfan Pyarali, C. O'Ryan, D. Schmidt
In many application domains, the distributed object computing (DOC) middleware is responsible for dispatching upcalls to one or more application objects when events or requests arrive from clients. Implementing efficient, predictable, and scalable middleware dispatching mechanisms is hard and implementing them for multi-threaded systems is even harder. In particular dispatching mechanisms must be prepared to dispatch upcalls to multiple objects, to handle recursive requests originated from application-provided upcalls, and must often collaborate with the application to control object life-cycle. In our DOC middleware research we have implemented many dispatching mechanisms that repeatedly apply common solutions to solve the challenges outlined above. Moreover, we have discovered that the forces constraining dispatching mechanisms often differ slightly thereby requiring alternative solutions. This paper presents two contributions to the design and implementation of efficient, predictable, scalable and flexible DOC middleware and applications. First, it shows how patterns can be applied to the object-oriented systems to capture key design and performance characteristics of proven dispatching mechanisms. Second it presents a pattern language that describes successful solutions that are appropriate for key dispatching challenges that arise in various real-time DOC middleware and applications.
{"title":"A pattern language for efficient, predictable, scalable, and flexible dispatching mechanisms for distributed object computing middleware","authors":"Irfan Pyarali, C. O'Ryan, D. Schmidt","doi":"10.1109/ISORC.2000.839512","DOIUrl":"https://doi.org/10.1109/ISORC.2000.839512","url":null,"abstract":"In many application domains, the distributed object computing (DOC) middleware is responsible for dispatching upcalls to one or more application objects when events or requests arrive from clients. Implementing efficient, predictable, and scalable middleware dispatching mechanisms is hard and implementing them for multi-threaded systems is even harder. In particular dispatching mechanisms must be prepared to dispatch upcalls to multiple objects, to handle recursive requests originated from application-provided upcalls, and must often collaborate with the application to control object life-cycle. In our DOC middleware research we have implemented many dispatching mechanisms that repeatedly apply common solutions to solve the challenges outlined above. Moreover, we have discovered that the forces constraining dispatching mechanisms often differ slightly thereby requiring alternative solutions. This paper presents two contributions to the design and implementation of efficient, predictable, scalable and flexible DOC middleware and applications. First, it shows how patterns can be applied to the object-oriented systems to capture key design and performance characteristics of proven dispatching mechanisms. Second it presents a pattern language that describes successful solutions that are appropriate for key dispatching challenges that arise in various real-time DOC middleware and applications.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133888551","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}