Reinder J. Bril
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Reinder J. Bril has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Johan J. Lukkien
4 shared publications- Johan J. Lukkien
Eindhoven University of Technology, Eindhoven, The Netherlands
3 shared publications - Christian Hentschel
Department of Media Technology, Brandenburg University of Technology
2 shared publications Martijn M. H. P. van Den Heuvel
Technische Universiteit Eindhoven (TU/e)
2 shared publications- Martijn M. H. P. van Den Heuvel
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (TU/e), Den Dolech 2, 5612 AZ Eindhoven, The Netherlands
2 shared publications Moris Behnam
Mälardalen University (MDH)
2 shared publications
Latest Publications
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 65-68
Experience Report: Combining Mixed-Criticality Support with Resource Reservation and Spare Capacity Allocation
This paper reports upon our on-going research in supporting mixed criticality by means of an OSEK-compliant real-time operating system (RTOS). In our earlier work, we presented support for an (extended) adaptive mixed-criticality (AMC*) scheme using the OSEK-compliant RTOS μC/OS-II. Based on experiments with that set-up, we identified AMC-inherited undesirable behavior, and sketched improvements of that scheme to resolve or mitigate those issues. In this paper, we revisit the identified undesirable behavior, and specify and illustrate improvements based on resource reservation and space-capacity allocation. Our proposed improvements have also been implemented in μC/OS- II in combination with RELTEQ (Relative Timed Event Queues).
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 65-68
Experience Report: Combining Mixed-Criticality Support with Resource Reservation and Spare Capacity Allocation
This paper reports upon our on-going research in supporting mixed criticality by means of an OSEK-compliant real-time operating system (RTOS). In our earlier work, we presented support for an (extended) adaptive mixed-criticality (AMC*) scheme using the OSEK-compliant RTOS μC/OS-II. Based on experiments with that set-up, we identified AMC-inherited undesirable behavior, and sketched improvements of that scheme to resolve or mitigate those issues. In this paper, we revisit the identified undesirable behavior, and specify and illustrate improvements based on resource reservation and space-capacity allocation. Our proposed improvements have also been implemented in μC/OS- II in combination with RELTEQ (Relative Timed Event Queues).
- Open Access
- 3 October 2018
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (4) , 861-911
Independent WCRT analysis for individual priority classes in Ethernet AVB
- 3 October 2018
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (4) , 861-911
Open AccessIndependent WCRT analysis for individual priority classes in Ethernet AVB
- 15 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 19 (4) , 1213-1226
Cooperative Automated Maneuvering at the 2016 Grand Cooperative Driving Challenge
Cooperative adaptive cruise control and platooning are well-known applications in the field of cooperative automated driving. However, extension toward maneuvering is desired to accommodate common highway maneuvers, such as merging, and to enable urban applications. To this end, a layered control architecture is adopted. In this architecture, the tactical layer hosts the interaction protocols, describing the wireless information exchange to initiate the vehicle maneuvers, supported by a novel wireless message set, whereas the operational layer involves the vehicle controllers to realize the desired maneuvers. This hierarchical approach was the basis for the Grand Cooperative Driving Challenge (GCDC), which was held in May 2016 in The Netherlands. The GCDC provided the opportunity for participating teams to cooperatively execute a highway lane-reduction scenario and an urban intersection-crossing scenario. The GCDC was set up as a competition and, hence, also involving assessment of the teams' individual performance in a cooperative setting. As a result, the hierarchical architecture proved to be a viable approach, whereas the GCDC appeared to be an effective instrument to advance the field of cooperative automated driving.
- 15 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 19 (4) , 1213-1226
Cooperative Automated Maneuvering at the 2016 Grand Cooperative Driving Challenge
Cooperative adaptive cruise control and platooning are well-known applications in the field of cooperative automated driving. However, extension toward maneuvering is desired to accommodate common highway maneuvers, such as merging, and to enable urban applications. To this end, a layered control architecture is adopted. In this architecture, the tactical layer hosts the interaction protocols, describing the wireless information exchange to initiate the vehicle maneuvers, supported by a novel wireless message set, whereas the operational layer involves the vehicle controllers to realize the desired maneuvers. This hierarchical approach was the basis for the Grand Cooperative Driving Challenge (GCDC), which was held in May 2016 in The Netherlands. The GCDC provided the opportunity for participating teams to cooperatively execute a highway lane-reduction scenario and an urban intersection-crossing scenario. The GCDC was set up as a competition and, hence, also involving assessment of the teams' individual performance in a cooperative setting. As a result, the hierarchical architecture proved to be a viable approach, whereas the GCDC appeared to be an effective instrument to advance the field of cooperative automated driving.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8411-8418
Incorporating implementation overheads in the analysis for the flexible spin-lock model
The flexible spin-lock model (FSLM) unifies suspension-based and spin-based resource sharing protocols for partitioned fixed-priority preemptive scheduling based real-time multiprocessor platforms. Recent work has been done in defining the protocol for FSLM and providing a schedulability analysis without accounting for the implementation overheads. In this paper, we extend the analysis for FSLM with implementation overheads. Utilizing an initial implementation of FSLM in the OSEK/VDX-compliant Erika Enterprise RTOS on an Altera Nios II platform using 4 soft-core processors, we present an improved implementation. Given the design of the implementation, the overheads are characterized and incorporated in specific terms of the existing analysis. The paper also supplements the analysis with measurement results, enabling an analytical comparison of FSLM with the natively provided multiprocessor stack resource policy (MSRP), which may serve as a guideline for the choice of FSLM or MSRP for a specific application.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8411-8418
Incorporating implementation overheads in the analysis for the flexible spin-lock model
The flexible spin-lock model (FSLM) unifies suspension-based and spin-based resource sharing protocols for partitioned fixed-priority preemptive scheduling based real-time multiprocessor platforms. Recent work has been done in defining the protocol for FSLM and providing a schedulability analysis without accounting for the implementation overheads. In this paper, we extend the analysis for FSLM with implementation overheads. Utilizing an initial implementation of FSLM in the OSEK/VDX-compliant Erika Enterprise RTOS on an Altera Nios II platform using 4 soft-core processors, we present an improved implementation. Given the design of the implementation, the overheads are characterized and incorporated in specific terms of the existing analysis. The paper also supplements the analysis with measurement results, enabling an analytical comparison of FSLM with the natively provided multiprocessor stack resource policy (MSRP), which may serve as a guideline for the choice of FSLM or MSRP for a specific application.
- Open Access
- 31 January 2017
- Published by Springer Nature in Real-Time Systems
- Vol. 53 (4) , 403-466
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
- 31 January 2017
- Published by Springer Nature in Real-Time Systems
- Vol. 53 (4) , 403-466
Open AccessFixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
- Open Access
- 8 June 2016
- Published by IntechOpen
Uniform Interfaces for Resource-Sharing Components in Hierarchically Scheduled Real-Time Systems
- 8 June 2016
- Published by IntechOpen
Open AccessUniform Interfaces for Resource-Sharing Components in Hierarchically Scheduled Real-Time Systems
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Tight worst-case response-time analysis for ethernet AVB using eligible intervals
Busy period analysis is often used as a basis for worst-case response time analysis of priority based systems. However, when shaping strategies are used to prevent starvation of lower priorities, it becomes difficult to achieve tightness results using this method. The reason for this is that a busy period is defined as the longest interval in which there exists pending load. It is exclusively based on execution time, and does not take the amount of provided bandwidth into account. As a consequence, it is less suitable for the study of idling systems. In particular, we do not yet have tightness results regarding the analysis of the Ethernet AVB standard, in which credit-based shaping is applied. In this paper, we propose an alternative to the use of busy periods. We show that, by defining an eligible interval in such a way that provisioning is taken into account, tight worst-case response time bounds can more easily be obtained for Ethernet AVB, at least in the case of either lower-or higher-priority interference.
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Tight worst-case response-time analysis for ethernet AVB using eligible intervals
Busy period analysis is often used as a basis for worst-case response time analysis of priority based systems. However, when shaping strategies are used to prevent starvation of lower priorities, it becomes difficult to achieve tightness results using this method. The reason for this is that a busy period is defined as the longest interval in which there exists pending load. It is exclusively based on execution time, and does not take the amount of provided bandwidth into account. As a consequence, it is less suitable for the study of idling systems. In particular, we do not yet have tightness results regarding the analysis of the Ethernet AVB standard, in which credit-based shaping is applied. In this paper, we propose an alternative to the use of busy periods. We show that, by defining an eligible interval in such a way that provisioning is taken into account, tight worst-case response time bounds can more easily be obtained for Ethernet AVB, at least in the case of either lower-or higher-priority interference.
- 1 January 2015
- Published by Springer Nature
- p. 185-215
Model, Analysis, and Improvements for Inter-Vehicle Communication Using One-Hop Periodic Broadcasting Based on the 802.11p Protocol
- 1 January 2015
- Published by Springer Nature
- p. 185-215
Model, Analysis, and Improvements for Inter-Vehicle Communication Using One-Hop Periodic Broadcasting Based on the 802.11p Protocol
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19460740,p. 1-9
Limited preemptive scheduling of mixed time-triggered and event-triggered tasks
Many embedded systems have complex timing constraints and, at the same time, have flexibility requirements which prohibit offline planning of the entire system. To support a mixture of time-triggered and event-triggered tasks, some industrial systems deploy a table-driven dispatcher for time-triggered tasks complemented with a preemptive scheduler to allocate the free time slots to event-driven tasks. Contrary to fully preemptive scheduling, limiting the preemptions of tasks to fixed preemptions points may reduce memory requirements and it alleviates the preemption costs in the system. We revisit slotshifting, which at run time mixes time-triggered and event-triggered tasks in a preemptive EDF schedule. In this paper, we extend slotshifting with limited-preemptive execution of event-triggered tasks. We present a synchronization protocol to arbitrate the executions of non-preemptive regions, so that time-triggered tasks keep meeting their timing constraints implicitly. Furthermore, we investigate how to disable preemptions of event-triggered tasks during the execution of the offline-scheduled time-triggered tasks, while keeping the feature of slotshifting to reallocate their slots of execution dynamically at run time.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19460740,p. 1-9
Limited preemptive scheduling of mixed time-triggered and event-triggered tasks
Many embedded systems have complex timing constraints and, at the same time, have flexibility requirements which prohibit offline planning of the entire system. To support a mixture of time-triggered and event-triggered tasks, some industrial systems deploy a table-driven dispatcher for time-triggered tasks complemented with a preemptive scheduler to allocate the free time slots to event-driven tasks. Contrary to fully preemptive scheduling, limiting the preemptions of tasks to fixed preemptions points may reduce memory requirements and it alleviates the preemption costs in the system. We revisit slotshifting, which at run time mixes time-triggered and event-triggered tasks in a preemptive EDF schedule. In this paper, we extend slotshifting with limited-preemptive execution of event-triggered tasks. We present a synchronization protocol to arbitrate the executions of non-preemptive regions, so that time-triggered tasks keep meeting their timing constraints implicitly. Furthermore, we investigate how to disable preemptions of event-triggered tasks during the execution of the offline-scheduled time-triggered tasks, while keeping the feature of slotshifting to reallocate their slots of execution dynamically at run time.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10683070,p. 233-244
Parallel-Task Scheduling on Multiple Resources
This paper addresses the problem of scheduling periodic parallel tasks on a multi-resource platform, where tasks have real-time constraints. The goal is to exploit the inherent parallelism of a platform comprised of multiple heterogeneous resources. A resource model is proposed, which abstracts the key properties of any heterogeneous resource from a scheduling perspective. A new scheduling algorithm called PSRP is presented, which refines MSRP. The schedulability analysis for PSRP is presented. The benefits of PSRP are demonstrated by means of an example application showing that PSRP indeed exploits the available concurrency in heterogeneous real-time systems.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10683070,p. 233-244
Parallel-Task Scheduling on Multiple Resources
This paper addresses the problem of scheduling periodic parallel tasks on a multi-resource platform, where tasks have real-time constraints. The goal is to exploit the inherent parallelism of a platform comprised of multiple heterogeneous resources. A resource model is proposed, which abstracts the key properties of any heterogeneous resource from a scheduling perspective. A new scheduling algorithm called PSRP is presented, which refines MSRP. The schedulability analysis for PSRP is presented. The benefits of PSRP are demonstrated by means of an example application showing that PSRP indeed exploits the available concurrency in heterogeneous real-time systems.