Pages that link to "Item:Q692625"
From MaRDI portal
The following pages link to Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625):
Displaying 29 items.
- On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (Q255296) (← links)
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels (Q326990) (← links)
- Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms (Q332516) (← links)
- An optimal resource sharing protocol for generalized multiframe tasks (Q478394) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- Analysis techniques for supporting hard real-time sporadic gang task systems (Q779459) (← links)
- Feasibility analysis of real-time periodic tasks with offsets (Q813143) (← links)
- An analysis of fixed-priority schedulability on a multiprocessor (Q853595) (← links)
- Analysis of window-constrained execution time systems (Q862987) (← links)
- Lowest priority first based feasibility analysis of real-time systems (Q897377) (← links)
- Integrating job parallelism in real-time scheduling theory (Q963364) (← links)
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
- Dynamic- and static-priority scheduling of recurring real-time tasks (Q1395688) (← links)
- Scheduling hard sporadic tasks with regular languages and generating functions. (Q1426168) (← links)
- On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling (Q1616839) (← links)
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems (Q1698775) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369) (← links)
- A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems (Q2481261) (← links)
- Synthesising succinct strategies in safety games with an application to real-time scheduling (Q2636511) (← links)
- (Q3586399) (redirect page) (← links)
- Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks (Q4564221) (← links)
- (Q5089127) (← links)
- A response-time analysis for non-preemptive job sets under global scheduling (Q5140792) (← links)
- Discrete Geometry for Computer Imagery (Q5316539) (← links)
- Approximation algorithms for replenishment problems with fixed turnover times (Q5918783) (← links)
