Pontus Ekberg
Senior Lecturer/Associate Professor at Institutionen för informationsteknologi; Datorteknik
- Telephone:
- +46 18 471 73 41
- E-mail:
- pontus.ekberg@it.uu.se
- Visiting address:
- Hus 10, Lägerhyddsvägen 1
- Postal address:
- Box 337
751 05 UPPSALA
More information is available to staff who log in.
Short presentation
I study algorithms and computational problems, mainly in real-time scheduling theory.
Please see my personal web page for more information.
Keywords
- algorithms
- scheduling theory
Publications
Selection of publications
- Dual Priority Scheduling is Not Optimal (2019)
- Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard (2017)
- Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete (2015)
- Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization (2015)
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems (2014)
Recent publications
- Rethinking Tractability for Schedulability Analysis (2023)
- Towards Efficient Explainability of Schedulability Properties in Real-Time Systems (2023)
- Who’s Afraid of Butterflies? A Close Examination of the Butterfly Attack (2023)
- Certificates of Real-Time Schedulability (2022)
- Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems (2022)
All publications
Articles
- Optimal Scheduling of Measurement-Based Parallel Real-Time Tasks (2020)
- Uniprocessor scheduling of real-time synchronous dataflow tasks (2019)
- Schedulability analysis of a graph-based task model for mixed-criticality systems (2016)
- An optimal resource sharing protocol for generalized multiframe tasks (2015)
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems (2014)
- The fork-join real-time task model (2013)
Books
Conferences
- Rethinking Tractability for Schedulability Analysis (2023)
- Towards Efficient Explainability of Schedulability Properties in Real-Time Systems (2023)
- Who’s Afraid of Butterflies? A Close Examination of the Butterfly Attack (2023)
- Certificates of Real-Time Schedulability (2022)
- Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems (2022)
- Complexity of partitioned scheduling for periodic tasks (2022)
- Graceful Degradation in Semi-Clairvoyant Scheduling (2021)
- Partitioned Scheduling of Recurrent Real-Time Tasks (2021)
- Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland's Bound (2020)
- Dual Priority Scheduling is Not Optimal (2019)
- Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard (2017)
- Refinement of workload models for engine controllers by state space partitioning (2017)
- Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation (2017)
- On fixed-priority schedulability analysis of sporadic tasks with self-suspension (2016)
- Multiprocessor Real-Time Locking Protocols for Replicated Resources (2016)
- Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete (2015)
- Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization (2015)
- Bounding and shaping the demand of mixed-criticality sporadic tasks (2012)
- A distributed swarm-intelligent localization for sensor networks with mobile nodes (2011)
- Resource sharing protocols for real-time task graph systems (2011)
- Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems (2011)
- On the tractability of digraph-based task models (2011)
- The digraph real-time task model (2011)
