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

Latest revision as of 23: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

instance of

scholarly article

0 references

title

Feasibility analysis of sporadic real-time multiprocessor task systems (English)

0 references

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (English)

0 references

zbMATH Open document ID

1285.68019

0 references

1287.68020

0 references

DOI

10.1007/s00453-011-9505-6

0 references

10.1007/978-3-642-15781-3_20

0 references

author

Vincenzo Bonifaci

0 references

Alberto Marchetti-Spaccamela

0 references

published in

Algorithmica

0 references

Algorithms – ESA 2010

0 references

publication date

6 December 2012

0 references

6 September 2010

0 references

full work available at URL

https://arxiv.org/abs/1004.2033

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

sporadic task system

0 references

multiprocessor

0 references

real-time scheduling

0 references

feasibility test

0 references

schedulability test

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks

0 references

Integrality Property in Preemptive Parallel Machine Scheduling

0 references

Proportionate progress: A notion of fairness in resource allocation

0 references

Open problems in real-time scheduling

0 references

Q3361873

0 references

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

0 references

Q5315023

0 references

Q5417686

0 references

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

0 references

Automata, logics, and infinite games. A guide to current research

0 references

Some simple scheduling algorithms

0 references

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

0 references

Infinite games played on finite graphs

0 references

The complexity of two-player games of incomplete information

0 references

Relationships between nondeterministic and deterministic tape complexities

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:692625

@@ Property / cites work @@
+Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
+Normal rank
@@ Property / cites work @@
+Integrality Property in Preemptive Parallel Machine Scheduling
+Normal rank
@@ Property / cites work @@
+Proportionate progress: A notion of fairness in resource allocation
+Normal rank
@@ Property / cites work @@
+Open problems in real-time scheduling
@@ Property / cites work: Open problems in real-time scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q3361873
@@ Property / cites work: Q3361873 / rank @@
+Normal rank
@@ Property / cites work @@
+A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417686
@@ Property / cites work: Q5417686 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
+Normal rank
@@ Property / cites work @@
+Automata, logics, and infinite games. A guide to current research
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
+Normal rank
@@ Property / cites work @@
+Infinite games played on finite graphs
@@ Property / cites work: Infinite games played on finite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of two-player games of incomplete information
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank