Pontus Ekberg
Universitetslektor vid Institutionen för informationsteknologi; Datorteknik
- Telefon:
- 018-471 73 41
- E-post:
- pontus.ekberg@it.uu.se
- Besöksadress:
- Hus 10, Regementsvägen 10
- Postadress:
- Box 337
751 05 UPPSALA
- Akademiska meriter:
- Docent
Nyckelord
- algorithms
- scheduling theory

Publikationer
Urval av publikationer
Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems
Ingår i 2022 IEEE Real-Time Systems Symposium (RTSS 2022), s. 185-196, 2022
Partitioned Scheduling of Recurrent Real-Time Tasks
Ingår i 2021 IEEE Real-Time Systems Symposium (RTSS), s. 356-367, 2021
Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland's Bound
Ingår i 2020 IEEE Real-Time Systems Symposium (RTSS), s. 308-318, 2020
Dual Priority Scheduling is Not Optimal
Ingår i Leibniz International Proceedings in Informatics (LIPIcs), 2019
- DOI för Dual Priority Scheduling is Not Optimal
- Ladda ner fulltext (pdf) av Dual Priority Scheduling is Not Optimal
Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard
Ingår i 2017 IEEE Real-Time Systems Symposium (RTSS), s. 139-146, 2017
Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete
Ingår i Proc. 27th Euromicro Conference on Real-Time Systems, s. 281-286, 2015
Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization
Ingår i Proc. 36th Real-Time Systems Symposium, s. 87-95, 2015
Senaste publikationer
A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory
Ingår i Real time and such, s. 120-134, Springer Nature, 2025
The Safe and Effective Use of Optimistic Period Predictions
Ingår i 2024 32ND INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS, RTNS 2024, s. 197-206, 2024
- DOI för The Safe and Effective Use of Optimistic Period Predictions
- Ladda ner fulltext (pdf) av The Safe and Effective Use of Optimistic Period Predictions
The Safe and Effective Use of Optimistic Period Predictions
Ingår i Proceedings of the 32nd International Conference on Real-Time Networks and Systems (RTNS), 2024
Using Deep Learning for Schedulability Verification in Safety-Critical Systems
2024
A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory
Ingår i Lecture Notes in Computer Science, 2024
Alla publikationer
Artiklar i tidskrift
Optimal Scheduling of Measurement-Based Parallel Real-Time Tasks
Ingår i Real-time systems, s. 247-253, 2020
- DOI för Optimal Scheduling of Measurement-Based Parallel Real-Time Tasks
- Ladda ner fulltext (pdf) av Optimal Scheduling of Measurement-Based Parallel Real-Time Tasks
Uniprocessor scheduling of real-time synchronous dataflow tasks
Ingår i Real-time systems, s. 1-31, 2019
Schedulability analysis of a graph-based task model for mixed-criticality systems
Ingår i Real-time systems, s. 1-37, 2016
An optimal resource sharing protocol for generalized multiframe tasks
Ingår i The Journal of logical and algebraic methods in programming, s. 92-105, 2015
- DOI för An optimal resource sharing protocol for generalized multiframe tasks
- Ladda ner fulltext (pdf) av An optimal resource sharing protocol for generalized multiframe tasks
Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
Ingår i Real-time systems, s. 48-86, 2014
- DOI för Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
- Ladda ner fulltext (pdf) av Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
The fork-join real-time task model
Ingår i ACM SIGBED Review, s. 20-20, 2013
- DOI för The fork-join real-time task model
- Ladda ner fulltext (pdf) av The fork-join real-time task model
Doktorsavhandlingar, sammanläggning
Kapitel i böcker, delar av antologi
A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory
Ingår i Real time and such, s. 120-134, Springer Nature, 2025
Konferensbidrag
The Safe and Effective Use of Optimistic Period Predictions
Ingår i 2024 32ND INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS, RTNS 2024, s. 197-206, 2024
- DOI för The Safe and Effective Use of Optimistic Period Predictions
- Ladda ner fulltext (pdf) av The Safe and Effective Use of Optimistic Period Predictions
The Safe and Effective Use of Optimistic Period Predictions
Ingår i Proceedings of the 32nd International Conference on Real-Time Networks and Systems (RTNS), 2024
Using Deep Learning for Schedulability Verification in Safety-Critical Systems
2024
A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory
Ingår i Lecture Notes in Computer Science, 2024
Efficient Explainability of Real-Time Schedulability
2023
Elastic Scheduling for Harmonic Task Systems
Ingår i 2024 IEEE 30TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, RTAS 2024, s. 334-347, 2023
Rethinking Tractability for Schedulability Analysis
Ingår i Proceedings of the 44th IEEE Real-Time Systems Symposium (RTSS), s. 1-12, 2023
Who’s Afraid of Butterflies? A Close Examination of the Butterfly Attack
Ingår i Proceedings of the 44th IEEE Real-Time Systems Symposium (RTSS), 2023
Towards Efficient Explainability of Schedulability Properties in Real-Time Systems
Ingår i Proceedings of the 35th Euromicro Conference on Real-Time Systems (ECRTS), 2023
Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems
Ingår i 2022 IEEE Real-Time Systems Symposium (RTSS 2022), s. 185-196, 2022
Certificates of Real-Time Schedulability
2022
Complexity of partitioned scheduling for periodic tasks
2022
Partitioned Scheduling of Recurrent Real-Time Tasks
Ingår i 2021 IEEE Real-Time Systems Symposium (RTSS), s. 356-367, 2021
Graceful Degradation in Semi-Clairvoyant Scheduling
Ingår i 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021), 2021
- DOI för Graceful Degradation in Semi-Clairvoyant Scheduling
- Ladda ner fulltext (pdf) av Graceful Degradation in Semi-Clairvoyant Scheduling
Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland's Bound
Ingår i 2020 IEEE Real-Time Systems Symposium (RTSS), s. 308-318, 2020
Dual Priority Scheduling is Not Optimal
Ingår i Leibniz International Proceedings in Informatics (LIPIcs), 2019
- DOI för Dual Priority Scheduling is Not Optimal
- Ladda ner fulltext (pdf) av Dual Priority Scheduling is Not Optimal
Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard
Ingår i 2017 IEEE Real-Time Systems Symposium (RTSS), s. 139-146, 2017
Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation
2017
Refinement of workload models for engine controllers by state space partitioning
Ingår i 29th Euromicro Conference on Real-Time Systems, 2017
Multiprocessor Real-Time Locking Protocols for Replicated Resources
Ingår i Proc. 28th Euromicro Conference on Real-Time Systems (ECRTS), s. 50-60, 2016
On fixed-priority schedulability analysis of sporadic tasks with self-suspension
Ingår i Proc. 24th International Conference on Real-Time Networks and Systems, s. 109-118, 2016
Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete
Ingår i Proc. 27th Euromicro Conference on Real-Time Systems, s. 281-286, 2015
Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization
Ingår i Proc. 36th Real-Time Systems Symposium, s. 87-95, 2015
Bounding and shaping the demand of mixed-criticality sporadic tasks
Ingår i Proc. 24th Euromicro Conference on Real-Time Systems, s. 135-144, 2012
Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems
Ingår i Proc. Real-Time Systems Symposium, s. 13-23, 2011
Resource sharing protocols for real-time task graph systems
Ingår i Proc. 23rd Euromicro Conference on Real-Time Systems, s. 272-281, 2011
On the tractability of digraph-based task models
Ingår i Proc. 23rd Euromicro Conference on Real-Time Systems, s. 162-171, 2011
A distributed swarm-intelligent localization for sensor networks with mobile nodes
Ingår i Proc. 7th International Wireless Communications and Mobile Computing Conference, s. 83-88, 2011
The digraph real-time task model
Ingår i 17th Real-Time and Embedded Technology and Applications Symposium, s. 71-80, 2011