LAB MANUAL — REAL TIME SYTSEMS EXPERIMENT 1: INTRODUCTION TO CHEDDAR BITS,PILANI — KK BIRLA GOA CAMPUSTable of Contents Introduction to Cheddar... Starting the Simulator...... Building a new project: Running the Simulation: Experiment 1: An Example... Lab Assignment 1... Ql... Q2.... 10 a3... 10 04... 10 Qs coyIntroduction to Cheddar Starting the Simulator: Double click on the cheddar.exe from the ‘Cheddar-3.0-win32-bin’ folder. This will launch the application. Building a new project: 1. From the file icon in the menu bar, choose ‘new’ XML project. All newly created files have to be saved in the current path with an extension of .sc. 2. Adding a core: From the menu bar, Edit -> hardware -> Core. Bice Tame corer [tame [Scheduler [quantum [Preeraptne [automal Scheduler type Earliest Deadline First Protocol cw | [eoret Earliest Deadine First Protocol 0 Preemptive Quantum Preemptive type Preemptive > ‘Automaton name capacty Peco Pronty User defined scheduler fle name stort te ‘Speed LL cache system name ose cancel Delete Modify ‘Ada * Add the name of the core. For example, Core1, as shown in the figure. ‘+ Scheduler type: Add the type of scheduling algorithm * Preemptive type: Has 2 options:-preemptive and non-preemptive. To be chosen according to the requirement. * Add the core by selecting the add option. The core name along with the parameters will be reflected on the right hand side. * Modify the core parameters by selecting the core name and changing the parameter. * To delete the core by choosing delete.3. Adding the Processor: > From the menu bar, Edit -> Hardware -> Processor. v Add the name of the processor. Processor type: * Mono-core processor- Single core processor system. + Identical multicores- Multicore system with identical core parameters, that is, same architecture and same speed. * Uniform multicores- Same Architecture but different speeds. © Unrelated multicores- Different characteristics. Migration Type: ‘© No migration: The tasks will not be migrated from one processor to another. * Job level migration: The various instances of the task can be migrated across various processors. © Time unit migration: All instances of the task will be executed on the same processor. Add the core from the ‘cores table’. The Processor name along with the other parameters will be reflected on the right hand side. 4, Adding the address space: > From the menu bar, Edit -> software -> Address space. ‘eee snes g eS . eae S00 a sonata Sontng ret regen 1 rem cv v v > > Select the name for the address space. Processor name: Choose the processor. All the defined processors will appear in the drop down list Scheduler type: An address space is a piece of memory which contains the processor parameters such as tasks and resources. A scheduler type can be defined for the address spaces in case of hierarchical scheduling algorithms, otherwise choose No Scheduling Protocol. Preemptive type: opt for non-preemptive scheduling in the address space. Add the address space. 5. Adding a task: > From the menu bar, Edit -> software -> task ae ine on [rece tne [an on [ay ane orn ror Java reat se a ioe n zl tS ae z yi conn _ F sect Te ees Se Suc ener Soe cna, aaliicar =~ ol Zameen ote | n - and ee twetege vl = coe ee er aif SSS ‘Add the name of the task. Task type: > vv v * Periodic task: The task will occur periodically after the time unit defined in the period field. © Aperiodic task: Tasks that will occur only once with soft deadline. * Sporadic task: Tasks that will occur only once with a hard deadline. Processor name: Drop down list contains all the processors defined. Choose the appropriate processor for the task Capacity: Worst case Execution time of the task Deadline: Absolute deadline. Refers to the completion time for the task. Start time: The time offset for the task, that is, the time at which the task will be ready for executionPriority: To define the priority of the task. For user defined priority, use POSIX scheduling (Highest priority first scheduling, Fixed priority). There are a total of 255 priority levels available. By default, 1- lowest priority and 255- highest priority. When 2 or more tasks have the same priority, the scheduler will execute the task depending upon the scheduling policy. In case of other scheduling algorithms, priority is determined by the scheduler depending upon the task parameters such period, deadline, ete. Period: The periodicity of the task, thatiis, the time after which the task will reoccur. (note: Deadline must be lesser than the periodicity). Do not specify periodicity for aperiodic and sporadic task. v Running the Simulation: > Torun the simulation, click on > The following dialog box will appear, schedule from 0 to hyper-period. 9 seeing Srl — a x | Sahat Fam To 1 Drew Fam 7 TTR? a ok Cancel This will create a xml file (eg: file1.xml) which will be present in the same path as .sc file To clear the workspace, clickon 8, v v v To set different colors to the task, From the menu bar choose, Tools->Scheduling->Scheduling options -> Display scheduling->Several colors for time tines. > To check the schedulability feasibility tests, clickonExperiment 1: An Example Consider the following task set. Scheduling algorithm: EDF 71 =(1,4) T2 = (2,5) TB = (1,20) TA = (2,20) 1. Adding the core: ico —o x Tame wre ae aE ‘Scheduler type Earliest Deadline First Protocol ih quorum ° Preemptive type Preemptive ~ Automaton name ‘Capacity 0 ered ° Prony ° User defined shader fe name stor time ° ‘Speed 0 LU cache system name 2. Adding the processor Tae ra ane] eton [roca Tee [ara Tee neo re 8 sonar Te zl Mignon Tipe io Mipaton Tne *3. Adding the address space: 4, Adding the tasks:5. Run the simulation. 18) Scheduling Simulation - a x ‘Schedule From 0 To : 2 Draw From : 0 Draw Upto = 20 Ok Cancel Results obtained: a 5 7 7 '20 Rsk nantes! “Penodl a; Capdetiye 1; Deadine= 4; Start time= 0; Prionty= 1: Cp YasknametT® Pétod= & Cdpacii= 3, Deadine= 5; Start time= 0; Pririty= 1; Cpusproct ‘ask name=T3 og= 20: Capatij= 1! Deadtine= 20; Start tme= 0; Prionty= 1; Cpu=proct ask name=T4 Period 30; Capacity=2! Deadine= 20; Start time= 0; Prioty= 1; Cpu=proct ‘o S 70 i '20 Core Uni TProcessor name=core Nproct Protocol = EARLIES|_UEAULINE_FIRS|_PRUIUCOL ; PREEMPIIVE ee a sine mss he cored ches teas Sts shea yo comp ergo he feast wen According to EDF, the tasks are given the priorities as follows: T1 > T2 > T3 = T4. Though T3 and T4 have the same priority, T3 will be scheduled first as it follows a scheduled FIFO policy. At time unit 7, T4 (deadline = 20) will start execution, but at t = 8, third instance of T1 will arrive which has a deadline of 12, hence it preempts T4. T4 will continue its execution at t= 9 Similarly, at t = 16, T1 will preempt T2 as it has lower deadline (hence higher priority) in comparison to T2.Lab Assignment 1 For the following Task sets and scheduling algorithms — submit the screen shoot of the schedule generated by Cheddar — with proper interpretations and conclusions regarding the schedule generated. If the task set is not schedulable — suggest an alternate method of scheduling Qi For the task graph show below show that a priority driven schedule with non-preemption will produce a better schedule than priority driven schedule with pre-emption ° Ji-3 p-l B-2 ° ° Jb-2 Je-4 o D y-4 je-1 ©: Fe) All tasks are aperiodic with a deadline of 12. All tasks except for J5 release at 0. J5 releases at 4. The priority of jobs is such that J1 has a higher priority when compared to J2 has a higher priority when compared to. 4J3 and so on. The scheduling is done on a processor which has dual identical cores with jobs migratable at any point in time.Qa ‘Show that the following tasks table is schedulable using EDF on a mono-core processor, if pre-emption is allowed but is not schedulable if pre-emption is not allowed. All tasks are aperiodic. r 0 2 4 e 3 6 4 d 10 14 12 Q3 ‘Show that the following tasks table is schedulable using LLF but not using EDF on a dual-core processor. All tasks are aperiodic. ro 0 0 eu 1 5 da 2 5 Q4 Show that the following tasks table causes indeterminism due to the execution time — when scheduled using EDF. All tasks are periodic J O 10 2-6 J4 0 20 10Qs Show that the following tasks are not schedulable using either ED{/LLF on a tri-core processor. All tasks are periodic and preemptable. Migration is not possible between a Job. 6 0 0 60 o oO