Steffen Prüter, Guido Moritz, E. Zeeb, R. Salomon, F. Golatowski, D. Timmermann
Currently the developing process for enterprise applications is improved by the service oriented architecture (SOA) paradigms. With SOAs the creation of modular and clearly defined software architectures at a high grade of interoperability and reusability is possible. For resource- constraint networked devices the devices profile for Web services (DPWS) specification adapt the SOA paradigms to create a framework for interoperable and standardized communication between embedded devices. This paper explains how special parts of DPWS can be adapted to provide real-time capabilities. So this paper shows how developers of real-time software can use the advantages of Web services and which adaptations are necessary to create Web services with real-time capabilities.
{"title":"Applicability of Web Service Technologies to Reach Real Time Capabilities","authors":"Steffen Prüter, Guido Moritz, E. Zeeb, R. Salomon, F. Golatowski, D. Timmermann","doi":"10.1109/ISORC.2008.30","DOIUrl":"https://doi.org/10.1109/ISORC.2008.30","url":null,"abstract":"Currently the developing process for enterprise applications is improved by the service oriented architecture (SOA) paradigms. With SOAs the creation of modular and clearly defined software architectures at a high grade of interoperability and reusability is possible. For resource- constraint networked devices the devices profile for Web services (DPWS) specification adapt the SOA paradigms to create a framework for interoperable and standardized communication between embedded devices. This paper explains how special parts of DPWS can be adapted to provide real-time capabilities. So this paper shows how developers of real-time software can use the advantages of Web services and which adaptations are necessary to create Web services with real-time capabilities.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130650185","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}
One promising solution for meeting the demands of constantly-evolving real-time embedded (RTE) software is the model-driven development (MDD) paradigm, based on the principle of separating the description of an application from its platform-specific implementation. Existing model-driven approaches strive to achieve this separation through dedicated model transformations which actually embed a given computing platform model. This is a major impediment for MDD dissemination in an industrial context. The resulting dearth of customizable transformations hampers description of reusable generative processes. We therefore propose to explicitly describe the targeted computing platforms in the design process. The main benefit expected from explicit platform models is a true separation of concerns that enables efficient, reusable and customizable generative processes. This proposal is strongly promoted by the new OMG (object management group) standard profile for modeling and analysis of real-time and embedded systems (MARTE), with its software multitasking platforms. In this paper, we first describe the MARTE feature and then propose a framework for integrating explicit platform descriptions into a model-based generative process.
{"title":"Towards a Framework for Explicit Platform-Based Transformations","authors":"F. Thomas, J. Delatour, F. Terrier, S. Gérard","doi":"10.1109/ISORC.2008.64","DOIUrl":"https://doi.org/10.1109/ISORC.2008.64","url":null,"abstract":"One promising solution for meeting the demands of constantly-evolving real-time embedded (RTE) software is the model-driven development (MDD) paradigm, based on the principle of separating the description of an application from its platform-specific implementation. Existing model-driven approaches strive to achieve this separation through dedicated model transformations which actually embed a given computing platform model. This is a major impediment for MDD dissemination in an industrial context. The resulting dearth of customizable transformations hampers description of reusable generative processes. We therefore propose to explicitly describe the targeted computing platforms in the design process. The main benefit expected from explicit platform models is a true separation of concerns that enables efficient, reusable and customizable generative processes. This proposal is strongly promoted by the new OMG (object management group) standard profile for modeling and analysis of real-time and embedded systems (MARTE), with its software multitasking platforms. In this paper, we first describe the MARTE feature and then propose a framework for integrating explicit platform descriptions into a model-based generative process.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134643744","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}
Many research works have focused on developing multimedia applications such as video conferencing and video-on-demand (VoD). From this trend, we see that the VoD service will become the main issue in future. However, service providers don't efficiently provide VoD services for a great number of clients yet. One of the reasons is the high cost in providing VoD services. Because a multimedia service consumes wide bandwidth in spite of great advances of video compression, network bandwidth resource must significantly be spent to maintain multiple clients concurrently. To overcome this problem, we proposed a new transmission method using the broadcast, named as a poly harmonic staggered broadcasting (PHSB) method. The proposed method is an efficient transmission method that has a simple structure of the staggered broadcasting method and substantially improved bandwidth efficiency of the poly harmonic broadcasting method. The numerical results show that the viewer's waiting time of the PHSB method is close to the waiting time of the harmonic broadcasting method which theoretically has the best bandwidth efficiency. Furthermore, the maximum buffer requirements of this can be adapted by adjusting the short front part of a video size.
{"title":"Poly Harmonic Staggered Broadcasting Method for Efficient Video on Demand Service","authors":"Sanghyuk Jung, Joohan Lee, Sungkown Park","doi":"10.1109/ISORC.2008.81","DOIUrl":"https://doi.org/10.1109/ISORC.2008.81","url":null,"abstract":"Many research works have focused on developing multimedia applications such as video conferencing and video-on-demand (VoD). From this trend, we see that the VoD service will become the main issue in future. However, service providers don't efficiently provide VoD services for a great number of clients yet. One of the reasons is the high cost in providing VoD services. Because a multimedia service consumes wide bandwidth in spite of great advances of video compression, network bandwidth resource must significantly be spent to maintain multiple clients concurrently. To overcome this problem, we proposed a new transmission method using the broadcast, named as a poly harmonic staggered broadcasting (PHSB) method. The proposed method is an efficient transmission method that has a simple structure of the staggered broadcasting method and substantially improved bandwidth efficiency of the poly harmonic broadcasting method. The numerical results show that the viewer's waiting time of the PHSB method is close to the waiting time of the harmonic broadcasting method which theoretically has the best bandwidth efficiency. Furthermore, the maximum buffer requirements of this can be adapted by adjusting the short front part of a video size.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132318230","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}
The concept of a scenario has long been utilized in military procurement as a means of evaluating capability in an operational context. With the advent of initiatives such as the USA Department of Defence's Network-Centric Operations and the UK Ministry of Defence's Network Enabled Capability, research into the application of service-oriented architectures (SOA) as a means of delivering capability is being undertaken. A promising output of this research is the definition of scenario based evaluation models that can be applied to SOA. This paper examines the application of a military scenario framework to more conventional software evaluation situations by means of case studies. This demonstrates that similar techniques can be used in their construction and thus provides a basis for the application of scenario based evaluation models in future research.
{"title":"Scenario Based Evaluation","authors":"N. Looker, D. Webster, D. Russell, Jie Xu","doi":"10.1109/ISORC.2008.56","DOIUrl":"https://doi.org/10.1109/ISORC.2008.56","url":null,"abstract":"The concept of a scenario has long been utilized in military procurement as a means of evaluating capability in an operational context. With the advent of initiatives such as the USA Department of Defence's Network-Centric Operations and the UK Ministry of Defence's Network Enabled Capability, research into the application of service-oriented architectures (SOA) as a means of delivering capability is being undertaken. A promising output of this research is the definition of scenario based evaluation models that can be applied to SOA. This paper examines the application of a military scenario framework to more conventional software evaluation situations by means of case studies. This demonstrates that similar techniques can be used in their construction and thus provides a basis for the application of scenario based evaluation models in future research.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134020695","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}
Recent years have witnessed the emergence and rapid growth of distributed service infrastructures such as mobile ad hoc networks, P2P, PlanetLab and Grids. In such distributed infrastructures, an entity needs to utilize the services provided by other entities or the infrastructures, where trust is an important factor. There exists a gap between current trust research focusing limitedly on specific applications and a systematic, adaptable and customizable trust framework. The first limitation of current research is the lack of characterizing service-specific trust features. The second limitation lies in the restricted evaluation formulae of trust values. The trust value formulae are usually drawn from a particular mathematical model and may not satisfy some desirable properties. The third limitation is the lack of flexibility and adaptability of trust models. In this paper a comprehensive trust model is presented to address these limitations and provide a trust-based environment for distributed service infrastructures. Our simulation results demonstrate the robustness of the trust model against various attacks.
{"title":"A Flexible Trust Model for Distributed Service Infrastructures","authors":"Zhaoyu Liu, S. Yau, Dichao Peng, Yin Yin","doi":"10.1109/ISORC.2008.84","DOIUrl":"https://doi.org/10.1109/ISORC.2008.84","url":null,"abstract":"Recent years have witnessed the emergence and rapid growth of distributed service infrastructures such as mobile ad hoc networks, P2P, PlanetLab and Grids. In such distributed infrastructures, an entity needs to utilize the services provided by other entities or the infrastructures, where trust is an important factor. There exists a gap between current trust research focusing limitedly on specific applications and a systematic, adaptable and customizable trust framework. The first limitation of current research is the lack of characterizing service-specific trust features. The second limitation lies in the restricted evaluation formulae of trust values. The trust value formulae are usually drawn from a particular mathematical model and may not satisfy some desirable properties. The third limitation is the lack of flexibility and adaptability of trust models. In this paper a comprehensive trust model is presented to address these limitations and provide a trust-based environment for distributed service infrastructures. Our simulation results demonstrate the robustness of the trust model against various attacks.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133912907","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}
Ji Eun Kim, Rahul Kapoor, Martin Herrmann, J. Härdtlein, Franz Grzeschniok, P. Lutz
Component based software development (CBSD) has been established in the development of automotive real-time embedded applications at Bosch. CBSD together with software product line (SPL) practice has improved software reuse, productivity, quality and complexity management, by raising the level of abstraction for software constructions and by sharing services. Although CBSD has contributed to the aforementioned improvement in the software development practice, the existing Bosch component model often requires software developers to take a close look at the implementation including models (e.g., ASCET-MD ) and even complex source code to understand software behavior and dependencies when reusing and adapting software components. This hinders the realization of the full benefits of CBSD, as the available information on the component level does not sufficiently describe important aspects of software behavior. This paper presents the concepts and case studies of 'signal flows' and 'mode dependent signal flows', which provide crucial software behavior information for real time embedded systems at the component level.
{"title":"Software Behavior Description of Real-Time Embedded Systems in Component Based Software Development","authors":"Ji Eun Kim, Rahul Kapoor, Martin Herrmann, J. Härdtlein, Franz Grzeschniok, P. Lutz","doi":"10.1109/ISORC.2008.69","DOIUrl":"https://doi.org/10.1109/ISORC.2008.69","url":null,"abstract":"Component based software development (CBSD) has been established in the development of automotive real-time embedded applications at Bosch. CBSD together with software product line (SPL) practice has improved software reuse, productivity, quality and complexity management, by raising the level of abstraction for software constructions and by sharing services. Although CBSD has contributed to the aforementioned improvement in the software development practice, the existing Bosch component model often requires software developers to take a close look at the implementation including models (e.g., ASCET-MD ) and even complex source code to understand software behavior and dependencies when reusing and adapting software components. This hinders the realization of the full benefits of CBSD, as the available information on the component level does not sufficiently describe important aspects of software behavior. This paper presents the concepts and case studies of 'signal flows' and 'mode dependent signal flows', which provide crucial software behavior information for real time embedded systems at the component level.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133691151","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}
Elias Teodoro da Silva, D. Andrews, C. Pereira, F. Wagner
The partitioning of applications into hardware and software is an important issue in embedded systems, opening room for high level specifications as well as the exploration of different implementation strategies. This paper presents a software architecture to specify threads in hardware in the context of the real time specification for Java (RTSJ) standard. There is a Java class that encapsulates hardware components, providing an abstraction layer to the application developer. Below this Java class, a wrapper hardware component provides a standard interface between RTSJ-based software components and the hardware that implements the thread behavior. This approach provides a high flexibility in choosing either a hardware or software implementation, allowing to postpone hardware/software partitioning to the very end of system development. The paper includes some quantitative data from an example containing hardware and software threads. While both implementations are compatible with the rest of the application from an interface point- of-view, they lead to very different timing and area results.
{"title":"An Infrastructure for Hardware-Software Co-Design of Embedded Real-Time Java Applications","authors":"Elias Teodoro da Silva, D. Andrews, C. Pereira, F. Wagner","doi":"10.1109/ISORC.2008.39","DOIUrl":"https://doi.org/10.1109/ISORC.2008.39","url":null,"abstract":"The partitioning of applications into hardware and software is an important issue in embedded systems, opening room for high level specifications as well as the exploration of different implementation strategies. This paper presents a software architecture to specify threads in hardware in the context of the real time specification for Java (RTSJ) standard. There is a Java class that encapsulates hardware components, providing an abstraction layer to the application developer. Below this Java class, a wrapper hardware component provides a standard interface between RTSJ-based software components and the hardware that implements the thread behavior. This approach provides a high flexibility in choosing either a hardware or software implementation, allowing to postpone hardware/software partitioning to the very end of system development. The paper includes some quantitative data from an example containing hardware and software threads. While both implementations are compatible with the rest of the application from an interface point- of-view, they lead to very different timing and area results.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134628649","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}
Hyun-Joo Kim, Jung-Guk Kim, Chun-Hyon Chang, Sunyoung Han, Shin Hue
Timeliness-guaranteed computing considering the worst case can hardly be accomplished at run time because of the uncertainty caused by resource sharing, asynchronous events and conflicting timing constraints between tasks. An easier way to reach it is to do some off-line analysis from design time with predictable characteristics of tasks. The TMO model supporting time-triggered (SpM) and message-triggered (SvM) member-threads is a well-known real-time object-oriented task model that aims the design-time guaranteed computing. In this paper, a new efficient task serializer that allocates the executions of time-triggered periodic tasks of multiple TMOs without delay and preemption to avoid resource conflicts is presented. The serializer tries to find scheduling scenarios in that each SpM is executed at its exact trigger-time without delay based on the given WCET. This is done by recasting the initial offsets of SpMs to avoid overlaps of executions. And several methods to handle SvMs according to the types of SvMs using the serializer are also proposed.
{"title":"An Efficient Task Serializer for Hard Real-Time TMO Systems","authors":"Hyun-Joo Kim, Jung-Guk Kim, Chun-Hyon Chang, Sunyoung Han, Shin Hue","doi":"10.1109/ISORC.2008.43","DOIUrl":"https://doi.org/10.1109/ISORC.2008.43","url":null,"abstract":"Timeliness-guaranteed computing considering the worst case can hardly be accomplished at run time because of the uncertainty caused by resource sharing, asynchronous events and conflicting timing constraints between tasks. An easier way to reach it is to do some off-line analysis from design time with predictable characteristics of tasks. The TMO model supporting time-triggered (SpM) and message-triggered (SvM) member-threads is a well-known real-time object-oriented task model that aims the design-time guaranteed computing. In this paper, a new efficient task serializer that allocates the executions of time-triggered periodic tasks of multiple TMOs without delay and preemption to avoid resource conflicts is presented. The serializer tries to find scheduling scenarios in that each SpM is executed at its exact trigger-time without delay based on the given WCET. This is done by recasting the initial offsets of SpMs to avoid overlaps of executions. And several methods to handle SvMs according to the types of SvMs using the serializer are also proposed.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117185612","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}
Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.
{"title":"A Methodology for Performance Modeling of Distributed Event-Based Systems","authors":"Samuel Kounev, Kai Sachs, J. Bacon, A. Buchmann","doi":"10.1109/ISORC.2008.51","DOIUrl":"https://doi.org/10.1109/ISORC.2008.51","url":null,"abstract":"Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127592184","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}
The real-time specification for Java (RTSJ) is becoming a popular choice in the world of real-time programming. However, the complexities introduced by RTSJ bring the needs for an extensive framework comprising all the aspects of RTSJ development. As the first contribution of this paper, we present a real-time component model directly fitting the needs of RTSJ. Our motivation is to clearly separate real-time and business concerns of applications. We further argue that the RTSJ concerns need to be considered at early stages of architecture design in order to mitigate the complexities of the implementation phase. Therefore, as our second contribution, we propose a design process introducing gradually RTSJ concepts into the architecture. We are thus able to alleviate the development of real-time systems and to tailor them for different real-time conditions. Finally, we demonstrate the feasibility of our solution on an example scenario.
{"title":"A Real-Time Java Component Model","authors":"Ales Plsek, Philippe Merle, L. Seinturier","doi":"10.1109/ISORC.2008.54","DOIUrl":"https://doi.org/10.1109/ISORC.2008.54","url":null,"abstract":"The real-time specification for Java (RTSJ) is becoming a popular choice in the world of real-time programming. However, the complexities introduced by RTSJ bring the needs for an extensive framework comprising all the aspects of RTSJ development. As the first contribution of this paper, we present a real-time component model directly fitting the needs of RTSJ. Our motivation is to clearly separate real-time and business concerns of applications. We further argue that the RTSJ concerns need to be considered at early stages of architecture design in order to mitigate the complexities of the implementation phase. Therefore, as our second contribution, we propose a design process introducing gradually RTSJ concepts into the architecture. We are thus able to alleviate the development of real-time systems and to tailor them for different real-time conditions. Finally, we demonstrate the feasibility of our solution on an example scenario.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"16 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525826","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}