This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Deadline-monotonic_scheduling
rdf:type
yago:Rule105846932 yago:PsychologicalFeature100023100 yago:Algorithm105847438 dbo:Organisation yago:Event100029378 yago:Abstraction100002137 yago:WikicatSchedulingAlgorithms yago:YagoPermanentlyLocatedEntity yago:Activity100407535 yago:Act100030358 yago:Procedure101023820
rdfs:label
Deadline-monotonic scheduling Deadline Monotonic Scheduling
rdfs:comment
Deadline Monotonic Scheduling (DMS) bezeichnet in der Informatik ein Schedulingverfahren für harte Echtzeitsysteme, das zur Verwaltung von Prozessen fester Prioritäten dient. Unter den Schedulingverfahren mit festen Prioritäten ist es für beliebige Deadlines optimal. Deadline-monotonic priority assignment is a priority assignment policy used with fixed-priority pre-emptive scheduling. With deadline-monotonic priority assignment, tasks are assigned priorities according to their deadlines. The task with the shortest deadline is assigned the highest priority. This priority assignment policy is optimal for a set of periodic or sporadic tasks which comply with the following system model: If restriction 7 is lifted, then "deadline minus jitter" monotonic priority assignment is optimal.
dct:subject
dbc:Processor_scheduling_algorithms
dbo:wikiPageID
2596697
dbo:wikiPageRevisionID
1096170920
dbo:wikiPageWikiLink
dbr:Time_limit dbr:Assignment_(computer_programming) dbr:Algorithm dbr:Fixed-priority_pre-emptive_scheduling dbr:Shared_resource dbr:Monotonic dbr:Task_(computing) dbr:Rate-monotonic_scheduling dbr:Worst-case_execution_time dbc:Processor_scheduling_algorithms dbr:Jitter dbr:Dynamic_priority_scheduling dbr:Execution_(computing)
owl:sameAs
freebase:m.07ql9x dbpedia-de:Deadline_Monotonic_Scheduling n13:BnqB wikidata:Q1146103
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Processor_scheduling dbt:Short_description dbt:Comp-sci-stub
dbo:abstract
Deadline Monotonic Scheduling (DMS) bezeichnet in der Informatik ein Schedulingverfahren für harte Echtzeitsysteme, das zur Verwaltung von Prozessen fester Prioritäten dient. Unter den Schedulingverfahren mit festen Prioritäten ist es für beliebige Deadlines optimal. Deadline-monotonic priority assignment is a priority assignment policy used with fixed-priority pre-emptive scheduling. With deadline-monotonic priority assignment, tasks are assigned priorities according to their deadlines. The task with the shortest deadline is assigned the highest priority. This priority assignment policy is optimal for a set of periodic or sporadic tasks which comply with the following system model: 1. * All tasks have deadlines less than or equal to their minimum inter-arrival times (or periods). 2. * All tasks have worst-case execution times (WCET) that are less than or equal to their deadlines. 3. * All tasks are independent, and so do not block each other's execution (e.g., by accessing mutually exclusive shared resources). 4. * No task voluntarily suspends itself. 5. * There is some point in time, referred to as a critical instant, where all of the tasks become ready to execute simultaneously. 6. * Scheduling overheads (switching from one task to another) are zero. 7. * All tasks have zero release jitter (the time from the task arriving to it becoming ready to execute). If restriction 7 is lifted, then "deadline minus jitter" monotonic priority assignment is optimal. If restriction 1 is lifted, allowing deadlines greater than periods, then Audsley's optimal priority assignment algorithm may be used to find the optimal priority assignment. Deadline monotonic priority assignment is not optimal for fixed priority non-pre-emptive scheduling. A fixed priority assignment policy P is referred to as optimal if no task set exists which is schedulable using a different priority assignment policy which is not also schedulable using priority assignment policy P. Or in other words: Deadline-monotonic priority assignment (DMPA) policy is optimal if any process set, Q, that is schedulable by priority scheme W, is also schedulable by DMPA
gold:hypernym
dbr:Policy
prov:wasDerivedFrom
wikipedia-en:Deadline-monotonic_scheduling?oldid=1096170920&ns=0
dbo:wikiPageLength
2582
foaf:isPrimaryTopicOf
wikipedia-en:Deadline-monotonic_scheduling
Subject Item
dbr:Computer_engineering_compendium
dbo:wikiPageWikiLink
dbr:Deadline-monotonic_scheduling
Subject Item
dbr:Rate-monotonic_scheduling
dbo:wikiPageWikiLink
dbr:Deadline-monotonic_scheduling
Subject Item
dbr:Scheduling_(computing)
rdfs:seeAlso
dbr:Deadline-monotonic_scheduling
Subject Item
wikipedia-en:Deadline-monotonic_scheduling
foaf:primaryTopic
dbr:Deadline-monotonic_scheduling