| dbo:abstract |
The term scheduling analysis in real-time computing includes the analysis and testing of the scheduler system and the algorithms used in real-time applications. In computer science, real-time scheduling analysis is the evaluation, testing and verification of the scheduling system and the algorithms used in real-time operations. For critical operations, a real-time system must be tested and verified for performance. A real-time scheduling System is composed of the scheduler, clock and the processing hardware elements. In a real-time system, a process or task has schedulability; tasks are accepted by a real-time system and completed as specified by the task deadline depending on the characteristic of the scheduling algorithm. Modeling and evaluation of a real-time scheduling system concern is on the analysis of the algorithm capability to meet a process deadline. A deadline is defined as the time required for a task to be processed. For example, in a real-time scheduling algorithm a deadline could be set to five nano-seconds. In a critical operation the task must be processed in the time specified by the deadline (i.e. five nano-seconds). A task in a real-time system must be completed “neither too early nor too late;..”. A system is said to be unschedulable when tasks can not meet the specified deadlines. A task can be classified as either a periodic or aperiodic process. (en) |
| dbo:wikiPageExternalLink |
https://ieeexplore.ieee.org/document/9052116 https://site.ieee.org/tcrts/ https://www.cs.rutgers.edu/~pxk/416/notes/08-rt_scheduling.html https://www.sciencedirect.com/topics/computer-science/real-time-computing |
| dbo:wikiPageID |
35967032 (xsd:integer) |
| dbo:wikiPageLength |
7248 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1122230547 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Pre-emptive_multitasking dbr:Algorithm dbr:Computer_science dbr:Nonpreemptive_multitasking dbr:Real-time_computing dbr:Real-time_operating_system dbc:Scheduling_(computing) dbr:Scheduler dbr:Worst-case_execution_time dbr:Pinwheel_scheduling dbr:Preemptive_scheduling |
| dbp:wikiPageUsesTemplate |
dbt:Reflist |
| dct:subject |
dbc:Scheduling_(computing) |
| rdfs:comment |
The term scheduling analysis in real-time computing includes the analysis and testing of the scheduler system and the algorithms used in real-time applications. In computer science, real-time scheduling analysis is the evaluation, testing and verification of the scheduling system and the algorithms used in real-time operations. For critical operations, a real-time system must be tested and verified for performance. (en) |
| rdfs:label |
Scheduling analysis real-time systems (en) |
| owl:sameAs |
freebase:Scheduling analysis real-time systems wikidata:Scheduling analysis real-time systems https://global.dbpedia.org/id/4ugoF |
| prov:wasDerivedFrom |
wikipedia-en:Scheduling_analysis_real-time_systems?oldid=1122230547&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Scheduling_analysis_real-time_systems |
| is dbo:wikiPageRedirects of |
dbr:Schedulability dbr:Sheduling_analysis_real-time_systems |
| is dbo:wikiPageWikiLink of |
dbr:Meta-scheduling dbr:Real-time_computing dbr:Schedulability dbr:Worst-case_execution_time dbr:Pinwheel_scheduling dbr:Sheduling_analysis_real-time_systems |
| is foaf:primaryTopic of |
wikipedia-en:Scheduling_analysis_real-time_systems |