About: Adaptive partition scheduler

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Adaptive partition scheduler Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FAdaptive_partition_scheduler

Adaptive partition schedulers are a relatively new type of partition scheduler, which in turn is a kind of scheduling algorithm, pioneered with the most recent version of the QNX operating system. Adaptive partitioning, or AP, allows the real-time system designer to request that a percentage of processing resources be reserved for a particular partition (group of threads and/or processes making up a subsystem). The operating system's will behave in the same way that a non-AP system would until the system is overloaded (i.e. system-wide there is more computation to perform than the processor is capable of sustaining over the long term). During overload, the AP scheduler enforces hard limits on total run-time for the subsystems within a partition, as dictated by the allocated percentage of

Attributes	Values
rdfs:label	Adaptive partition scheduler (en)
rdfs:comment	Adaptive partition schedulers are a relatively new type of partition scheduler, which in turn is a kind of scheduling algorithm, pioneered with the most recent version of the QNX operating system. Adaptive partitioning, or AP, allows the real-time system designer to request that a percentage of processing resources be reserved for a particular partition (group of threads and/or processes making up a subsystem). The operating system's will behave in the same way that a non-AP system would until the system is overloaded (i.e. system-wide there is more computation to perform than the processor is capable of sustaining over the long term). During overload, the AP scheduler enforces hard limits on total run-time for the subsystems within a partition, as dictated by the allocated percentage of (en)
dcterms:subject	Processor scheduling algorithms
Wikipage page ID	4419469 (xsd:integer)
Wikipage revision ID	1028277045 (xsd:integer)
Link from a Wikipage to another Wikipage	QNX Processor scheduling algorithms Hard real-time Scheduling algorithm Subsystem dbr:Fixed_partition_scheduler dbr:Priority-driven_pre-emptive_scheduler
Link from a Wikipage to an external page	http://community.qnx.com/sf/wiki/do/viewPage/projects.core_os/wiki/Adaptive_Partitioning_Scheduler http://www.ghs.com/products/safety_critical/arinc653.html http://www.kalinskyassociates.com/Wpaper3.html https://web.archive.org/web/20081228111540/http:/www.ghs.com/products/safety_critical/arinc653.html
sameAs	Adaptive partition scheduler Adaptive partition scheduler Adaptive partition scheduler Adaptive partition scheduler
dbp:wikiPageUsesTemplate	dbt:Webarchive dbt:Unix-stub
date	2008-12-28 (xsd:date)
url	https://web.archive.org/web/20081228111540/http:/www.ghs.com/products/safety_critical/arinc653.html
has abstract	Adaptive partition schedulers are a relatively new type of partition scheduler, which in turn is a kind of scheduling algorithm, pioneered with the most recent version of the QNX operating system. Adaptive partitioning, or AP, allows the real-time system designer to request that a percentage of processing resources be reserved for a particular partition (group of threads and/or processes making up a subsystem). The operating system's will behave in the same way that a non-AP system would until the system is overloaded (i.e. system-wide there is more computation to perform than the processor is capable of sustaining over the long term). During overload, the AP scheduler enforces hard limits on total run-time for the subsystems within a partition, as dictated by the allocated percentage of processor bandwidth for the particular partition. If the system is not overloaded, a partition that is allocated (for example) 10% of the processor bandwidth, can, in fact, use more than 10%, as it will borrow from the spare budget of other partitions (but will be required to pay it back later). This is very useful for the non real-time subsystems that experience variable load, since these subsystems can make use of spare budget from hard real-time partitions in order to make more forward progress than they would in a such as ARINC-653 Archived 2008-12-28 at the Wayback Machine, but without impacting the hard real-time subsystems' deadlines. QNX Neutrino 6.3.2 and newer versions have this feature. (en)
prov:wasDerivedFrom	wikipedia-en:Adaptive_partition_scheduler?oldid=1028277045&ns=0
page length (characters) of wiki page	2134 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Adaptive_partition_scheduler
is Link from a Wikipage to another Wikipage of	Real-time computing Adaptive Partition Scheduler Adaptive Partition Schedulers
is Wikipage redirect of	Adaptive Partition Scheduler Adaptive Partition Schedulers
is foaf:primaryTopic of	wikipedia-en:Adaptive_partition_scheduler

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 46 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software