The following pages link to Nathan Fisher (Q438188):
Displaying 13 items.
- A bandwidth allocation scheme for compositional real-time systems with periodic resources (Q438190) (← links)
- The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732) (← links)
- Resource holding times: Computation and optimization (Q844237) (← links)
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
- Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks (Q1640309) (← links)
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems (Q2481261) (← links)
- The partitioned dynamic-priority scheduling of sporadic task systems (Q2642543) (← links)
- An efficient algorithm for routing and recharging of electric vehicles (Q2692251) (← links)
- Truthful Mechanisms for Competitive Reward-Based Scheduling (Q2985409) (← links)
- NPM-BUNDLE: Non-Preemptive Multitask Scheduling for Jobs with BUNDLE-Based Thread-Level Scheduling. (Q5089118) (← links)
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand (Q5089126) (← links)
- Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks in Competitive Real-Time Environments (Q5268114) (← links)
- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems (Q5445754) (← links)