Björn Andersson , Dionisio de Niz and Sagar Chaki Software Engineering Institute

1. Non-Preemptive Fixed-Priority Uniprocessor Scheduling where the Execution Time of a Job Depends on the Scheduling of Jobs that Executed Before it Björn Andersson, Dionisio de Niz and Sagar Chaki Software Engineering Institute Carnegie Mellon University

2. Processor Memory

3. Processor Cache Memory Memory

4. Sensor Processor Cache Memory Memory

5. Sensor Processor Cache Memory Memory Signature of a known object

6. Sensor Processor Job A time Read sensor … Compare sensor readings with signature … Cache Memory Memory Signature of a known object

7. Sensor Processor Job B time Read sensor … Compare sensor readings with signature … Cache Memory Memory Signature of a known object

8. Sensor Processor Job A Job B time Read sensor … Compare sensor readings with signature … Read sensor … Compare sensor readings with signature … Cache Memory Memory Signature of a known object

9. Sensor Processor Job A Job B time Read sensor … Compare sensor readings with signature … Read sensor … Compare sensor readings with signature … Cache Memory Memory Signature of a known object

10. Sensor Processor Job A Job B time Read sensor … Compare sensor readings with signature … Read sensor … Compare sensor readings with signature … Cache Memory Memory The execution time of Job B depends on whether Job A executes before Job B. Signature of a known object

11. Sensor Processor Job A Job B time Read sensor … Compare sensor readings with signature … Read sensor … Compare sensor readings with signature … Cache Memory Memory Signature of a known object How can we model such systems?

12. Example of Task Set in the New Model

13. Example of Task Set in the New Model

14. 0 5 10 15 Example of Task Set in the New Model t1 • t1 t2 t2 t3 t3 time Example of Schedule

15. 0 5 10 15 Example of Task Set in the New Model t1 • t1 t2 t2 t3 t3 The execution time of this job of task t2 is 4. time Example of Schedule

16. Open Questions OP1. Is it possible to create an algorithm,with pseudo-polynomial time- complexity, which computes Ri? OP2. How to create an optimal priorityassignment scheme.

17. Thanks!