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
04db857c
Commit
04db857c
authored
5 years ago
by
Sergey Bozhko
Browse files
Options
Downloads
Patches
Plain Diff
Add notion of schedule with limited preemptions
parent
cf2e3d5e
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
restructuring/model/preemption/valid_schedule.v
+33
-0
33 additions, 0 deletions
restructuring/model/preemption/valid_schedule.v
with
33 additions
and
0 deletions
restructuring/model/preemption/valid_schedule.v
0 → 100644
+
33
−
0
View file @
04db857c
From
rt
.
util
Require
Import
all
.
From
rt
.
restructuring
.
behavior
Require
Import
all
.
From
rt
.
restructuring
.
model
Require
Import
processor
.
ideal
.
From
rt
.
restructuring
.
model
.
preemption
Require
Import
job
.
parameters
.
From
mathcomp
Require
Import
ssreflect
ssrbool
ssrfun
eqtype
ssrnat
seq
fintype
bigop
.
(** * Schedule with Limited Preemptions *)
(** In this section we introduce the notion of preemptions-aware
schedule. *)
Section
ScheduleWithLimitedPreemptions
.
(** Consider any type of jobs. *)
Context
{
Job
:
JobType
}
.
Context
`{
JobArrival
Job
}
.
Context
`{
JobCost
Job
}
.
Context
`{
JobPreemptable
Job
}
.
(** Consider any arrival sequence. *)
Variable
arr_seq
:
arrival_sequence
Job
.
(** Next, consider any ideal uniprocessor schedule of this arrival sequence. *)
Variable
sched
:
schedule
(
ideal
.
processor_state
Job
)
.
(** Based on the definition of the model with preemption points,
we define a valid schedule with limited preemptions. *)
Definition
valid_schedule_with_limited_preemptions
:=
forall
j
t
,
arrives_in
arr_seq
j
->
~~
job_preemptable
j
(
service
sched
j
t
)
->
scheduled_at
sched
j
t
.
End
ScheduleWithLimitedPreemptions
.
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