Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
PROSA - Formally Proven Schedulability Analysis
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Lasse Blaauwbroek
PROSA - Formally Proven Schedulability Analysis
Commits
68e92a7f
Commit
68e92a7f
authored
5 years ago
by
Sergey Bozhko
Browse files
Options
Downloads
Patches
Plain Diff
Add notion of preemptions for priority-aware scheduler
parent
55cdcae7
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
restructuring/model/schedule/priority_based/preemption_aware.v
+43
-0
43 additions, 0 deletions
...ucturing/model/schedule/priority_based/preemption_aware.v
with
43 additions
and
0 deletions
restructuring/model/schedule/priority_based/preemption_aware.v
0 → 100644
+
43
−
0
View file @
68e92a7f
From
rt
.
restructuring
.
behavior
Require
Import
all
.
From
rt
.
restructuring
.
model
Require
Import
priorities
processor
.
ideal
.
From
rt
.
restructuring
.
model
.
preemption
Require
Import
preemption_time
job
.
parameters
.
(** We now define what it means for a schedule to respect a priority
in the presence of jobs with non-preemptive segments. *)
(** We only define it for a JLDP policy since the definitions for JLDP
and JLFP are the same and can be used through the conversions. *)
Section
Priority
.
(** Consider any type of tasks ... *)
Context
{
Task
:
TaskType
}
.
Context
`{
TaskCost
Task
}
.
(** ... and any type of jobs associated with these tasks. *)
Context
{
Job
:
JobType
}
.
Context
`{
JobTask
Job
Task
}
.
Context
`{
JobArrival
Job
}
.
Context
`{
JobCost
Job
}
.
Context
`{
JobPreemptable
Job
}
.
Context
`{
JobReady
Job
(
ideal
.
processor_state
Job
)}
.
(** Consider any job arrival sequence... *)
Variable
arr_seq
:
arrival_sequence
Job
.
(** ...and any uniprocessor schedule of these jobs. *)
Variable
sched
:
schedule
(
ideal
.
processor_state
Job
)
.
(** We say that a JLDP policy ...*)
Context
`{
JLDP_policy
Job
}
.
(** ...is respected by the schedule iff, at every preemption point,
a scheduled task has higher (or same) priority than (as) any
backlogged job. *)
Definition
respects_policy_at_preemption_point
:=
forall
j
j_hp
t
,
arrives_in
arr_seq
j
->
preemption_time
sched
t
->
backlogged
sched
j
t
->
scheduled_at
sched
j_hp
t
->
hep_job_at
t
j_hp
j
.
End
Priority
.
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment