Many scheduling algorithms have been studied to guarantee the time constraints of real-time processes. Scheduling decision of these algorithms is usually based on parameters which are assumed to be crisp. However, in many circumstances the values of these parameters are vague. The vagueness of parameters suggests that we make use of fuzzy logic to decide in what order the requests should be executed to better utilize the system and as a result reduce the chance of a request being missed. We have proposed a new fuzzy algorithm called highest fuzzy priority first. The performance of this algorithm is compared with the well-known earliest deadline first algorithm through simulation. For both algorithms, tasks are considered to be non-preemptable. Simulation results show that this fuzzy approach outperforms the earliest deadline first has algorithm in that it decreases the number of missed deadlines and serves more important tasks better
{"title":"Scheduling non-preemptive periodic tasks in soft real-time systems using fuzzy inference","authors":"M. Sabeghi, Mahmoud Naghibzadeh, T. Taghavi","doi":"10.1109/ISORC.2006.70","DOIUrl":"https://doi.org/10.1109/ISORC.2006.70","url":null,"abstract":"Many scheduling algorithms have been studied to guarantee the time constraints of real-time processes. Scheduling decision of these algorithms is usually based on parameters which are assumed to be crisp. However, in many circumstances the values of these parameters are vague. The vagueness of parameters suggests that we make use of fuzzy logic to decide in what order the requests should be executed to better utilize the system and as a result reduce the chance of a request being missed. We have proposed a new fuzzy algorithm called highest fuzzy priority first. The performance of this algorithm is compared with the well-known earliest deadline first algorithm through simulation. For both algorithms, tasks are considered to be non-preemptable. Simulation results show that this fuzzy approach outperforms the earliest deadline first has algorithm in that it decreases the number of missed deadlines and serves more important tasks better","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130293773","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, E. P. Freitas, F. Wagner, Fabiano Costa Carvalho, C. Pereira
This paper presents the evaluation of a multithread distributed real-time object-oriented platform. A communication API was developed to increase functionalities of an API that implements the real-time specification for Java standard, extending it to cover embedded distributed applications. Real-time restrictions of the communication are ensured by a time-out mechanism. The API can be adapted to be used with different underlying network and physical mediums. The development focused on restrictive embedded platforms with low performance and small memory. An evaluation in terms of the fulfillment of timing constraints, and memory footprint is presented for a CAN-bus network. The results also demonstrate the timely correctness provided by the communication API running over an RTSJ implementation
{"title":"Java framework for distributed real-time embedded systems","authors":"Elias Teodoro da Silva, E. P. Freitas, F. Wagner, Fabiano Costa Carvalho, C. Pereira","doi":"10.1109/ISORC.2006.44","DOIUrl":"https://doi.org/10.1109/ISORC.2006.44","url":null,"abstract":"This paper presents the evaluation of a multithread distributed real-time object-oriented platform. A communication API was developed to increase functionalities of an API that implements the real-time specification for Java standard, extending it to cover embedded distributed applications. Real-time restrictions of the communication are ensured by a time-out mechanism. The API can be adapted to be used with different underlying network and physical mediums. The development focused on restrictive embedded platforms with low performance and small memory. An evaluation in terms of the fulfillment of timing constraints, and memory footprint is presented for a CAN-bus network. The results also demonstrate the timely correctness provided by the communication API running over an RTSJ implementation","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":" 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132094235","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}
U. Brinkschulte, Mathias Pacher, F. Picioroaga, Stefan Gaa
The main focus of this work is to evaluate and study the real-time properties of the Komodo Java microcontroller and the OSA+ middleware in a non-trivial real-world example. We describe an approach to control an autonomous guided vehicle (AGV) by the Komodo microcontroller, a multi-threaded Java microcontroller. The main challenge is that the microcontroller has to meet hard real-time constraints to ensure a faultless drive. Then we show that we are also able to run the AGV using a real-time middleware and we measure the overhead in time and memory introduced by the middleware
{"title":"Evaluation of the Komodo microcontroller and the OSA+ middleware using an autonomous guided vehicle","authors":"U. Brinkschulte, Mathias Pacher, F. Picioroaga, Stefan Gaa","doi":"10.1109/ISORC.2006.34","DOIUrl":"https://doi.org/10.1109/ISORC.2006.34","url":null,"abstract":"The main focus of this work is to evaluate and study the real-time properties of the Komodo Java microcontroller and the OSA+ middleware in a non-trivial real-world example. We describe an approach to control an autonomous guided vehicle (AGV) by the Komodo microcontroller, a multi-threaded Java microcontroller. The main challenge is that the microcontroller has to meet hard real-time constraints to ensure a faultless drive. Then we show that we are also able to run the AGV using a real-time middleware and we measure the overhead in time and memory introduced by the middleware","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130142941","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}
Service overlays that support distributed stream processing applications are increasingly being deployed in wide-area environments. The inherent heterogeneous, dynamic and large-scale nature of these systems makes it difficult to meet the quality of service (QoS) requirements of the distributed stream processing applications. In this paper we address the load balancing problem for distributed stream processing applications and present a decentralized and adaptive algorithm that allows the composition of distributed stream processing applications on the fly across a large-scale system, while satisfying their QoS demands. The algorithm fairly distributes the load on the resources and adapts dynamically to changes in the resource utilization or the QoS requirements of the applications. Our experimental results demonstrate the scalability, efficiency and performance of our approach
{"title":"Load balancing techniques for distributed stream processing applications in overlay environments","authors":"Yannis Drougas, T. Repantis, V. Kalogeraki","doi":"10.1109/ISORC.2006.47","DOIUrl":"https://doi.org/10.1109/ISORC.2006.47","url":null,"abstract":"Service overlays that support distributed stream processing applications are increasingly being deployed in wide-area environments. The inherent heterogeneous, dynamic and large-scale nature of these systems makes it difficult to meet the quality of service (QoS) requirements of the distributed stream processing applications. In this paper we address the load balancing problem for distributed stream processing applications and present a decentralized and adaptive algorithm that allows the composition of distributed stream processing applications on the fly across a large-scale system, while satisfying their QoS demands. The algorithm fairly distributes the load on the resources and adapts dynamically to changes in the resource utilization or the QoS requirements of the applications. Our experimental results demonstrate the scalability, efficiency and performance of our approach","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124517007","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}
For distributed real-time systems, adequate profiling tools are exceedingly rare. The sheer variety and low-level nature of these systems impede the adoption of standard, general-purpose tools for performance analysis and visualization. Although much research has been devoted to profiling parallel clusters and supercomputers, the literature virtually ignores the real-time domain. Correspondingly, a handful of commercial tools is available for profiling realtime software, but they invariably make a single-node assumption and are unable to cope with distributed environments. We examine the state of performance analysis and discuss why profilers are conspicuously absent in the field of distributed real-time systems. We then explore how developers of these systems could benefit from graphical profiling tools with automatic instrumentation and data collection. Toward that end, we demonstrate the prototype of a performance visualization tool called "Bacara", the second addition to our suite of tools for visual analysis of distributed real-time systems, or VADR (vamacr'der)
{"title":"Automatic performance visualization of distributed real-time systems","authors":"T. Harmon, R. Klefstad","doi":"10.1109/ISORC.2006.22","DOIUrl":"https://doi.org/10.1109/ISORC.2006.22","url":null,"abstract":"For distributed real-time systems, adequate profiling tools are exceedingly rare. The sheer variety and low-level nature of these systems impede the adoption of standard, general-purpose tools for performance analysis and visualization. Although much research has been devoted to profiling parallel clusters and supercomputers, the literature virtually ignores the real-time domain. Correspondingly, a handful of commercial tools is available for profiling realtime software, but they invariably make a single-node assumption and are unable to cope with distributed environments. We examine the state of performance analysis and discuss why profilers are conspicuously absent in the field of distributed real-time systems. We then explore how developers of these systems could benefit from graphical profiling tools with automatic instrumentation and data collection. Toward that end, we demonstrate the prototype of a performance visualization tool called \"Bacara\", the second addition to our suite of tools for visual analysis of distributed real-time systems, or VADR (vamacr'der)","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121060249","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}
Embedded real-time systems are becoming increasingly complex due to ever increasing size and functionality so that complexity management is of growing importance, especially in dependable hard real-time systems development, where errors caused by complexity can have fatal consequences. This paper systematically characterizes different kinds of complexity: system-level complexity, component interface complexity, and component implementation complexity. The effects of the different kinds of complexity are described and it is explained why minimizing system-level complexity should be a principal goal of any distributed embedded real-time systems architecture. The concept of system-level components is introduced as a solution to the problem of system-level complexity during the integration process
{"title":"Complexity management for composable real-time systems","authors":"B. Rumpler","doi":"10.1109/ISORC.2006.24","DOIUrl":"https://doi.org/10.1109/ISORC.2006.24","url":null,"abstract":"Embedded real-time systems are becoming increasingly complex due to ever increasing size and functionality so that complexity management is of growing importance, especially in dependable hard real-time systems development, where errors caused by complexity can have fatal consequences. This paper systematically characterizes different kinds of complexity: system-level complexity, component interface complexity, and component implementation complexity. The effects of the different kinds of complexity are described and it is explained why minimizing system-level complexity should be a principal goal of any distributed embedded real-time systems architecture. The concept of system-level components is introduced as a solution to the problem of system-level complexity during the integration process","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"387 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134436637","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}
Junggyu Park, Hyojun Song, S. Cho, Najeong Han, Kyung-Seop Kim, Jinman Park
Multiprocessor-system-on-a-chips (MPSoCs) are being increasingly employed to solve a diverse spectrum of problems from both high-end and low-end computing. Multimedia streaming applications can get great performance from them, but developing MPSoC software that guarantees real-time requirements is very difficult. In this paper, we present an architecture of real-time media framework that can provide both easy of programming and real-time guarantee to multimedia applications. In addition, programming model and mechanism for real-time guarantee are briefly explained. Issues in developing media framework on asymmetric MPSoC hardware further presented, which we are going to apply in our media framework implementation
{"title":"A real-time media framework for asymmetric MPSoC","authors":"Junggyu Park, Hyojun Song, S. Cho, Najeong Han, Kyung-Seop Kim, Jinman Park","doi":"10.1109/ISORC.2006.11","DOIUrl":"https://doi.org/10.1109/ISORC.2006.11","url":null,"abstract":"Multiprocessor-system-on-a-chips (MPSoCs) are being increasingly employed to solve a diverse spectrum of problems from both high-end and low-end computing. Multimedia streaming applications can get great performance from them, but developing MPSoC software that guarantees real-time requirements is very difficult. In this paper, we present an architecture of real-time media framework that can provide both easy of programming and real-time guarantee to multimedia applications. In addition, programming model and mechanism for real-time guarantee are briefly explained. Issues in developing media framework on asymmetric MPSoC hardware further presented, which we are going to apply in our media framework implementation","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133327351","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 RTSJ memory model proposes a mechanism based on a scope three containing all scope-stacks in the system and a reference-counter collector. In order to avoid reference cycles among regions on the scope-stack, RTSJ defines the single parent rule. The given algorithms to maintain the scope-stack structure are not compliant with the defined parentage relation. More over, the suggested algorithms to maintain the single parent rule makes the application behaviour non-deterministic. This paper provides an in-depth analytical investigation of the RTSJ requirements effecting the RTSJ defined parentage relation, and propose alternative approaches to avoid the indeterminism problem
{"title":"Analyzing the memory management semantic and requirements of the real-time specification of Java JSR-0000001","authors":"M. T. Higuera-Toledano","doi":"10.1109/ISORC.2006.17","DOIUrl":"https://doi.org/10.1109/ISORC.2006.17","url":null,"abstract":"The RTSJ memory model proposes a mechanism based on a scope three containing all scope-stacks in the system and a reference-counter collector. In order to avoid reference cycles among regions on the scope-stack, RTSJ defines the single parent rule. The given algorithms to maintain the scope-stack structure are not compliant with the defined parentage relation. More over, the suggested algorithms to maintain the single parent rule makes the application behaviour non-deterministic. This paper provides an in-depth analytical investigation of the RTSJ requirements effecting the RTSJ defined parentage relation, and propose alternative approaches to avoid the indeterminism problem","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115482398","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}
A reconfiguration management pattern for UML real-time projects inspired by the Specification PEARL methodology is defined. It is parameterised by defining the properties of its components as well as by defining how the software is mapped to the hardware architecture. The pattern itself is a UML representation of a Specification PEARL architectural specification, together with the definition of the initial and alternative configurations as well as of methods of switching between operation scenarios. The article includes the description of the UML pattern and its parameterisation, with the goal to obtain clearly specified operation scenarios with well-defined transitions among them. In order to achieve safe and timely operation, the pattern must provide a "safety shell" for all scenarios, i.e., enable their deterministic, temporally predictable operation, and transitions between them
{"title":"Safe and timely scenario switching in UML real-time projects","authors":"R. Gumzej, M. Colnaric, W. Halang","doi":"10.1109/ISORC.2006.69","DOIUrl":"https://doi.org/10.1109/ISORC.2006.69","url":null,"abstract":"A reconfiguration management pattern for UML real-time projects inspired by the Specification PEARL methodology is defined. It is parameterised by defining the properties of its components as well as by defining how the software is mapped to the hardware architecture. The pattern itself is a UML representation of a Specification PEARL architectural specification, together with the definition of the initial and alternative configurations as well as of methods of switching between operation scenarios. The article includes the description of the UML pattern and its parameterisation, with the goal to obtain clearly specified operation scenarios with well-defined transitions among them. In order to achieve safe and timely operation, the pattern must provide a \"safety shell\" for all scenarios, i.e., enable their deterministic, temporally predictable operation, and transitions between them","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123684831","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 increasing complexity of mobile phones directly affects their reliability, while the user tolerance for failures becomes to decrease, especially when the phone is used for business- or mission-critical applications. Despite these concerns, there is still little understanding on how and why these devices fail and no techniques have been defined to gather useful information about failures manifestation from the phone. This paper presents the design of a logger application to collect failure-related information from mobile phones. Preliminary failure data collected from real-world mobile phones confirm the proposed logger is a useful instrument to gain knowledge about mobile phone failure's dynamics and causes
{"title":"Automated logging of mobile phones failures data","authors":"Paolo Ascione, M. Cinque, Domenico Cotroneo","doi":"10.1109/ISORC.2006.20","DOIUrl":"https://doi.org/10.1109/ISORC.2006.20","url":null,"abstract":"The increasing complexity of mobile phones directly affects their reliability, while the user tolerance for failures becomes to decrease, especially when the phone is used for business- or mission-critical applications. Despite these concerns, there is still little understanding on how and why these devices fail and no techniques have been defined to gather useful information about failures manifestation from the phone. This paper presents the design of a logger application to collect failure-related information from mobile phones. Preliminary failure data collected from real-world mobile phones confirm the proposed logger is a useful instrument to gain knowledge about mobile phone failure's dynamics and causes","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130655280","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
扫码关注我们
求助内容：
应助结果提醒方式：