2015 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, 2015
The standard real-time computing model is based on a notion of deadline that represents both, a d... more The standard real-time computing model is based on a notion of deadline that represents both, a design parameter and a critical latency. The tolerance-based real-time computing model (TRTCM) extends the standard real-time computing model to reflect good engineering practice, where a safety margin is added to the critical latency to obtain the corresponding design parameter. The key feature of TRTCM is to add a tolerance range, which in combination with criticality specifications for services allows for fault-tolerant mixed-criticality scheduling with smooth degradation of service utility in case of resource shortage. In this paper we study the applicability of TRTCM for periodic tasks with mixed criticality on uniform multiprocessor systems. To optimise the system adaptation in case of resource shortage we formulate utility maximisation based on TRTCM as an optimisation problem. We describe two implementation strategies and derive an optimisation problem to be solved by a constraint solver for each. We use a video processing application for a concrete evaluation. Our results show that TRTCM can provide better utility than standard mixed-criticality approaches where lower criticality services are skipped in case of resource shortage.
Leader election is a frequent problem for systems where it is important to coordinate activities ... more Leader election is a frequent problem for systems where it is important to coordinate activities of a group of actors. It has been extensively studied in the context of networked systems. But with the raise of many-core computer architectures, it also became important for shared-memory systems. In this paper we present an efficient leader election technique for synchronous shared-memory systems. Synchronous in our context means the response time of code sections with relevant communication patterns is bounded. Our leader election method is used to help making the scheduling layer LPEL fault tolerant.With our approach LPEL will be efficient to resolve problems when the leader fails. Keywords—fault tolerance, leader election, parallel computation, shared memory, synchronous systems
ABSTRACT Fault tolerance and robustness are system properties of increasing importance, both in t... more ABSTRACT Fault tolerance and robustness are system properties of increasing importance, both in the domain of embedded computing as well as in the domain of high-performance computing. In this paper we study the applicability of fault-tolerance mechanisms in the context of stream-processing networks, in particular based on the coordination-language S-Net. We identify three basic fault tolerance mechanisms and discuss the technical solutions for them within S-Net. The applicability of these mechanisms depends on the requirement of the concrete application domain. The contribution of this paper is a feasibility study of tool-supported fault tolerance mechanisms in a flexible coordination language allowing for asynchronous execution. As part of this feasibility study we discuss potential extensions of the S-Net language and runtime system in order to implement the identified solutions.
Measurement-based timing analysis (MBTA) techniques have been developed as a complimentary to sta... more Measurement-based timing analysis (MBTA) techniques have been developed as a complimentary to static WCET analysis, in order to exploit worst-case execution time (WCET) analysis at early stages of system development. The direct advantage of MBTA is that, in contrast to static WCET analysis, no timing model of the hardware platform has to be developed. Instead the timing model is generated automatically by performing systematic execution time measurements. MBTA provides high retargetability, as the test suite used ...
Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series wa... more Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series was organized in 2011, again with support from the ARTIST DESIGN Network of Excellence. Following the practice established in the previous Challenges, the WCET Tool Challenge 2011 (WCC'11) dened two kinds of problems to be solved by the Challenge participants with their tools, WCET problems, which ask for bounds on the execution time, and ow-analysis problems, which ask for bounds on the number of times certain parts of ...
Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series wa... more Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series was organized in 2011, again with support from the ARTIST DESIGN Network of Excellence. Following the practice established in the previous Challenges, the WCET Tool Challenge 2011 (WCC'11) defined two kinds of problems to be solved by the Challenge participants with their tools, WCET problems, which ask for bounds on the execution time, and flow-analysis problems, which ask for bounds on the number of times certain parts of ...
Proc. 17th International Conference on Real- …, 2009
Résumé: During the design of embedded real-time systems, engineers have to consider the temporal ... more Résumé: During the design of embedded real-time systems, engineers have to consider the temporal behavior of software running on a particular hardware platform. Measurement-based timing analysis is a technique that combines elements from static code analysis with execution time measurements on real physical hardware. Because performing exhaustive measurement is generally not tractable, some kind of abstraction must be used to deal with the combinatoric complexity of real software. We propose an adaptable measurement- ...
Madhukar Anand Mikael Asberg Huseyin Aysan Yanmeng Ba Ke Bai Stanley Bak Moris Behnam Vandy Berte... more Madhukar Anand Mikael Asberg Huseyin Aysan Yanmeng Ba Ke Bai Stanley Bak Moris Behnam Vandy Berten Bjoern B. Brandenburg Sven Buente Bach Bui Che-Wei Chang Yuan-Hao Chang Thidapat Chantem Ming Chen Yi-Chao Chen Shih-Chun Chou Rob Davis Aleksander Dimov Radu Dobrin David Donari Arvind Easwaran Hua-Wei Fang Xing Fu Michael González Giovani Gracioli Song Han Damien Hardy Tim Hohm Pi-Cheng Hsiu Po-Chun Huang Shih-Ting Huang Bernhard Huber Reiley Jeyapaul Albrecht Kadlec ... Susanne Kandl Sangyeol Kang ...
2015 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, 2015
The standard real-time computing model is based on a notion of deadline that represents both, a d... more The standard real-time computing model is based on a notion of deadline that represents both, a design parameter and a critical latency. The tolerance-based real-time computing model (TRTCM) extends the standard real-time computing model to reflect good engineering practice, where a safety margin is added to the critical latency to obtain the corresponding design parameter. The key feature of TRTCM is to add a tolerance range, which in combination with criticality specifications for services allows for fault-tolerant mixed-criticality scheduling with smooth degradation of service utility in case of resource shortage. In this paper we study the applicability of TRTCM for periodic tasks with mixed criticality on uniform multiprocessor systems. To optimise the system adaptation in case of resource shortage we formulate utility maximisation based on TRTCM as an optimisation problem. We describe two implementation strategies and derive an optimisation problem to be solved by a constraint solver for each. We use a video processing application for a concrete evaluation. Our results show that TRTCM can provide better utility than standard mixed-criticality approaches where lower criticality services are skipped in case of resource shortage.
Leader election is a frequent problem for systems where it is important to coordinate activities ... more Leader election is a frequent problem for systems where it is important to coordinate activities of a group of actors. It has been extensively studied in the context of networked systems. But with the raise of many-core computer architectures, it also became important for shared-memory systems. In this paper we present an efficient leader election technique for synchronous shared-memory systems. Synchronous in our context means the response time of code sections with relevant communication patterns is bounded. Our leader election method is used to help making the scheduling layer LPEL fault tolerant.With our approach LPEL will be efficient to resolve problems when the leader fails. Keywords—fault tolerance, leader election, parallel computation, shared memory, synchronous systems
ABSTRACT Fault tolerance and robustness are system properties of increasing importance, both in t... more ABSTRACT Fault tolerance and robustness are system properties of increasing importance, both in the domain of embedded computing as well as in the domain of high-performance computing. In this paper we study the applicability of fault-tolerance mechanisms in the context of stream-processing networks, in particular based on the coordination-language S-Net. We identify three basic fault tolerance mechanisms and discuss the technical solutions for them within S-Net. The applicability of these mechanisms depends on the requirement of the concrete application domain. The contribution of this paper is a feasibility study of tool-supported fault tolerance mechanisms in a flexible coordination language allowing for asynchronous execution. As part of this feasibility study we discuss potential extensions of the S-Net language and runtime system in order to implement the identified solutions.
Measurement-based timing analysis (MBTA) techniques have been developed as a complimentary to sta... more Measurement-based timing analysis (MBTA) techniques have been developed as a complimentary to static WCET analysis, in order to exploit worst-case execution time (WCET) analysis at early stages of system development. The direct advantage of MBTA is that, in contrast to static WCET analysis, no timing model of the hardware platform has to be developed. Instead the timing model is generated automatically by performing systematic execution time measurements. MBTA provides high retargetability, as the test suite used ...
Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series wa... more Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series was organized in 2011, again with support from the ARTIST DESIGN Network of Excellence. Following the practice established in the previous Challenges, the WCET Tool Challenge 2011 (WCC'11) dened two kinds of problems to be solved by the Challenge participants with their tools, WCET problems, which ask for bounds on the execution time, and ow-analysis problems, which ask for bounds on the number of times certain parts of ...
Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series wa... more Following the successful WCET Tool Challenges in 2006 and 2008, the third event in this series was organized in 2011, again with support from the ARTIST DESIGN Network of Excellence. Following the practice established in the previous Challenges, the WCET Tool Challenge 2011 (WCC'11) defined two kinds of problems to be solved by the Challenge participants with their tools, WCET problems, which ask for bounds on the execution time, and flow-analysis problems, which ask for bounds on the number of times certain parts of ...
Proc. 17th International Conference on Real- …, 2009
Résumé: During the design of embedded real-time systems, engineers have to consider the temporal ... more Résumé: During the design of embedded real-time systems, engineers have to consider the temporal behavior of software running on a particular hardware platform. Measurement-based timing analysis is a technique that combines elements from static code analysis with execution time measurements on real physical hardware. Because performing exhaustive measurement is generally not tractable, some kind of abstraction must be used to deal with the combinatoric complexity of real software. We propose an adaptable measurement- ...
Madhukar Anand Mikael Asberg Huseyin Aysan Yanmeng Ba Ke Bai Stanley Bak Moris Behnam Vandy Berte... more Madhukar Anand Mikael Asberg Huseyin Aysan Yanmeng Ba Ke Bai Stanley Bak Moris Behnam Vandy Berten Bjoern B. Brandenburg Sven Buente Bach Bui Che-Wei Chang Yuan-Hao Chang Thidapat Chantem Ming Chen Yi-Chao Chen Shih-Chun Chou Rob Davis Aleksander Dimov Radu Dobrin David Donari Arvind Easwaran Hua-Wei Fang Xing Fu Michael González Giovani Gracioli Song Han Damien Hardy Tim Hohm Pi-Cheng Hsiu Po-Chun Huang Shih-Ting Huang Bernhard Huber Reiley Jeyapaul Albrecht Kadlec ... Susanne Kandl Sangyeol Kang ...
Uploads