Non-Preemptive Fixed-Priority
This presentation is the property of its rightful owner.
Sponsored Links
1 / 17

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


  • 81 Views
  • Uploaded on
  • Presentation posted in: General

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. Processor. Memory. Processor.

Download Presentation

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

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Processor

Memory


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Processor

Cache Memory

Memory


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Sensor

Processor

Cache Memory

Memory


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Sensor

Processor

Cache Memory

Memory

Signature of a known object


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Sensor

Processor

Job A

time

Read

sensor

Compare

sensor

readings

with

signature

Cache Memory

Memory

Signature of a known object


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Sensor

Processor

Job B

time

Read

sensor

Compare

sensor

readings

with

signature

Cache Memory

Memory

Signature of a known object


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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?


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Example of Task Set in the New Model


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Example of Task Set in the New Model


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

0

5

10

15

Example of Task Set in the New Model

t1

  • t1

t2

t2

t3

t3

time

Example of Schedule


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

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.


Bj rn andersson dionisio de niz and sagar chaki software engineering institute

Thanks!


  • Login