Built with Alectryon, running Coq+SerAPI v8.15.0+0.15.0. Bubbles () indicate interactive fragments: hover for details, tap to reveal contents. Use Ctrl+↑Ctrl+↓ to navigate, Ctrl+🖱️ to focus. On Mac, use ⌘ instead of Ctrl.
From mathcomp Require Export fintype.
Notation"[ rel _ _ | _ ]" was already used in scope
fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ : _ | _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ & _ | _ ]" was already used
in scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ & _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ | _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ ]" was already used in scope
fun_scope. [notation-overridden,parsing]
Notation"_ + _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"_ - _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"_ <= _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"_ < _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"_ >= _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"_ > _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"_ <= _ <= _" was already used in scope
nat_scope. [notation-overridden,parsing]
Notation"_ < _ <= _" was already used in scope
nat_scope. [notation-overridden,parsing]
Notation"_ <= _ < _" was already used in scope
nat_scope. [notation-overridden,parsing]
Notation"_ < _ < _" was already used in scope
nat_scope. [notation-overridden,parsing]
Notation"_ * _" was already used in scope nat_scope.
[notation-overridden,parsing]
Notation"[ rel _ _ | _ ]" was already used in scope
fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ : _ | _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ & _ | _ ]" was already used
in scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ & _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ | _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ ]" was already used in scope
fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ | _ ]" was already used in scope
fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ : _ | _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ & _ | _ ]" was already used
in scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ & _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ | _ ]" was already used in
scope fun_scope. [notation-overridden,parsing]
Notation"[ rel _ _ in _ ]" was already used in scope
fun_scope. [notation-overridden,parsing]
(** * Multiprocessor State *)(** In the following, we define a model of identical multiprocessors, i.e., of processors with multiple cores of identical capabilities. The multiprocessor model is generic in the type of processor state of the cores. That is, it is possible to combine any uniprocessor state (such as the ideal state) with the following generic multiprocessor construction. (In fact, by combining the below multiprocessor model with variable speed processors, it is even possible to obtain a so-called uniform multiprocessor model.) NB: For now, the definition serves only to document how this can be done; it is not actually used anywhere in the library. *)SectionSchedule.(** Consider any types of jobs... *)VariableJob: JobType.(** ... and consider any type of per-processor state. *)Variableprocessor_state: ProcessorState Job.(** Given a desired number of processors [num_cpus], we define a finite type of integers from [0] to [num_cpus - 1]. The purpose of this definition is to obtain a finite type (i.e., set of values) that can be enumerated in a terminating computation. Syntax hint: the ['I_] before [num_cpus] is ssreflect syntax for the finite set of integers from zero to [num_cpus - 1]. *)Definitionprocessor (num_cpus: nat) := 'I_num_cpus.(** Next, for any given number of processors [num_cpus]... *)Variablenum_cpus : nat.(** ...we represent the type of the "multiprocessor state" as a function that maps processor IDs (as defined by [processor num_cpus], see above) to the given state on each core. *)Definitionmultiprocessor_state := processor num_cpus -> processor_state.(** Based on this notion of multiprocessor state, we say that a given job [j] is currently scheduled on a specific processor [cpu], according to the given multiprocessor state [mps], iff [j] is scheduled in the processor-local state [(mps cpu)]. *)Definitionmultiproc_scheduled_on
(j : Job) (mps : multiprocessor_state) (cpu : processor num_cpus)
:= scheduled_in j (mps cpu).(** Similarly, the service received by a given job [j] in a given multiprocessor state [mps] on a given processor of ID [cpu] is exactly the service given by [j] in the processor-local state [(mps cpu)]. *)Definitionmultiproc_service_on
(j : Job) (mps : multiprocessor_state) (cpu : processor num_cpus)
:= service_in j (mps cpu).(** Finally, we connect the above definitions with the generic Prosa interface for processor models. *)#[local] Program Instancemultiproc_state : ProcessorState Job :=
{|
State := multiprocessor_state;
scheduled_on := multiproc_scheduled_on;
service_on := multiproc_service_on
|}.
Job: JobType processor_state: ProcessorState Job num_cpus: nat j: Job s: multiprocessor_state r: 'I_num_cpus H: ~~ multiproc_scheduled_on j s r
~~ multiproc_scheduled_on j mps cpu ->
multiproc_service_on j mps cpu = 0
byapply: service_in_implies_scheduled_in.Qed.(** From the instance [multiproc_state], we get the function [service_in]. The service received by a given job [j] in a given multiprocessor state [mps] is given by the sum of the service received across all individual processors of the multiprocessor. *)