GSOC 2020 - Non-Preemptive / Limited preemptive in Response Time Analysis

Motivation

I have been working on RTA related field for the past 1.5 years during my master program, and this time GSoC provides me an opportunity to extend that knowledge into more detail and complicated with a great mentor/supervisor. Prior to this GSoC, I only know 1 method to calculate response time of a task in unicore using recurrence relation.

However, that method is even older than me, and not very optimal in my opinion. I want to find a faster, more optimal way to calculate response time where all task would meet it deadline by configure its preemptive type and its environment. Furthermore, APP4MC with Amalthea model already have those preemption properties needed for the implementation, this reduced greatly the orientation time needed to get familiar with new platform/software since I have already used it since 2019

This led me to my decision choosing this topic: Non-Preemptive / Limited preemptive in Response Time Analysis

With all the software related material sorted out, all I needed to do left is to find how to calculate response time in 2 different environments: non-preemptive, and limited preemptive.

Content

Contents:

• How to use
  • NPandPRTA
  • Blocking
• Implementation functions
  • Function inside the class NPandPRTA and its usage:
  • Function inside the class Blocking and its usage:
• Theory
  • Fully preemptive environment
  • Non-preemptive environment
  • Limitted preemptive (or cooperative) environment
• Plan and timeline
  • Phase 1
  • Phase 2
  • Phase 3
• Contribute to the community
• Repositories
  • RTA Implementation in eclipse
  • Readthedoc repo
• Future work
  • Implementing preemption threshold
  • Investigate different scheduling method
  • Visualize busy window
• References

If you have any question, contact me via : the.bui003@stud.fh-dortmund.de

Happy coding