Task programming on μC/OS-III.
Use the examples in Chapter 3 of the μC/OS-III Users Guide to create three periodic tasks.
Assign different priority values to the tasks.
Task 1 (highest priority) simulates processing of geo-location data. It generates random
(x,y) coordinates and uses the Euclidean distance and period to calculate velocity as the
Task 2 (medium priority) simulates data processing for a thermometer sensor. It generates
random temperature readings and calculates the average, maximum and minimum
temperatures as outputs.
Task 3 (lowest priority) simulates a traffic monitoring system. Each time a random value
representing vehicle count is generated. Task 3 calculates the accumulated vehicle number
(output) and clears the number for every 20 readings.
a.) Create the three periodic tasks. They generate random sensor readings in memory.
Simulate their execution and measure the average response time of each task. Also record the
arrival times of jobs of the three tasks and check if there is any pattern.
b.) Task 1 reads random (x,y) coordinates from a file, while Task 2 and Task 3 still generate
random sensor readings in memory. Simulate their execution and measure the average response
time of each task. Compare the results from a.) and b.) .
2. For the following set of tasks:
Task (Ti) Period (pi) Exec. Time (ei)
A 6 2
B 8 2
C 12 3
a.) What is the total processor utilization of this system? What is the hyperperiod of this
b.) Create a frame-based static cyclic schedule for these tasks. Take care that it satisfies all
of the following constraints:
• the execution of each job fits within a single frame
• the frame of a job begins no earlier than the job's release time
• the frame of a job ends no later than the job's deadline
Present your schedule in the form of a Gantt chart.
c.) What is the worst-case response time of each task in your schedule above?
1 freelancer ponuja za povprečno $20 na tem delu
Hello, I can give you the solution to all 2 problems attached within 24 hours. Code will be commented and no plagiarism. Will be guaranteed to earn 100% credits also.