Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
aliases / en / 0aliases / en / 0
 
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
description / endescription / en
 
scientific article; zbMATH DE number 5779716
Property / title
 
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (English)
Property / title: Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1287.68020 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-15781-3_20 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms – ESA 2010 / rank
 
Normal rank
Property / publication date
 
6 September 2010
Timestamp+2010-09-06T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 6 September 2010 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5779716 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2806792856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Property in Preemptive Parallel Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportionate progress: A notion of fairness in resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems in real-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Latest revision as of 22:42, 5 July 2024

scientific article; zbMATH DE number 5779716
  • Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
Language Label Description Also known as
English
Feasibility analysis of sporadic real-time multiprocessor task systems
scientific article; zbMATH DE number 5779716
  • Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems

Statements

Feasibility analysis of sporadic real-time multiprocessor task systems (English)
0 references
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (English)
0 references
6 December 2012
0 references
6 September 2010
0 references
sporadic task system
0 references
multiprocessor
0 references
real-time scheduling
0 references
feasibility test
0 references
schedulability test
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references