default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPontus Ekberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Marion Sudvarg, Ao Li, Daisy Wang, Sanjoy K. Baruah, Jeremy Buhler, Chris Gill, Ning Zhang, Pontus Ekberg:
Elastic Scheduling for Harmonic Task Systems. RTAS 2024: 334-347- 2023
- [c21]Sanjoy K. Baruah, Pontus Ekberg:
Towards Efficient Explainability of Schedulability Properties in Real-Time Systems. ECRTS 2023: 2:1-2:20 - [c20]Kunal Agrawal, Sanjoy K. Baruah, Pontus Ekberg:
Rethinking Tractability for Schedulability Analysis. RTSS 2023: 1-12 - [c19]Sanjoy K. Baruah, Pontus Ekberg, Mehdi Hosseinzadeh, Ao Li, Bryan C. Ward, Ning Zhang:
Who's Afraid of Butterflies? A Close Examination of the Butterfly Attack. RTSS 2023: 53-63 - 2022
- [c18]Sanjoy K. Baruah, Pontus Ekberg, Abhishek Singh
:
Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems. RTSS 2022: 185-196 - [p1]Pontus Ekberg, Wang Yi:
Complexity of Uniprocessor Scheduling Analysis. Handbook of Real-Time Computing 2022: 489-506 - 2021
- [c17]Sanjoy K. Baruah, Pontus Ekberg:
Graceful Degradation in Semi-Clairvoyant Scheduling. ECRTS 2021: 9:1-9:21 - [c16]Pontus Ekberg, Sanjoy K. Baruah:
Partitioned Scheduling of Recurrent Real-Time Tasks. RTSS 2021: 356-367 - 2020
- [j7]Kunal Agrawal, Sanjoy K. Baruah, Pontus Ekberg, Jing Li:
Optimal scheduling of measurement-based parallel real-time tasks. Real Time Syst. 56(3): 247-253 (2020) - [c15]Pontus Ekberg:
Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland's Bound. RTSS 2020: 308-318
2010 – 2019
- 2019
- [j6]Pontus Ekberg:
Dual Priority Scheduling is Not Optimal (Artifact). Dagstuhl Artifacts Ser. 5(1): 01:1-01:2 (2019) - [j5]Abhishek Singh, Pontus Ekberg, Sanjoy K. Baruah:
Uniprocessor scheduling of real-time synchronous dataflow tasks. Real Time Syst. 55(1): 1-31 (2019) - [c14]Pontus Ekberg:
Dual Priority Scheduling is Not Optimal. ECRTS 2019: 14:1-14:9 - 2017
- [c13]Abhishek Singh, Pontus Ekberg, Sanjoy K. Baruah:
Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation. ECRTS 2017: 8:1-8:22 - [c12]Morteza Mohaqeqi, Syed Md Jakaria Abdullah, Pontus Ekberg, Wang Yi:
Refinement of Workload Models for Engine Controllers by State Space Partitioning. ECRTS 2017: 11:1-11:22 - [c11]Pontus Ekberg, Wang Yi:
Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard. RTSS 2017: 139-146 - 2016
- [j4]Pontus Ekberg, Wang Yi:
Schedulability analysis of a graph-based task model for mixed-criticality systems. Real Time Syst. 52(1): 1-37 (2016) - [c10]Catherine E. Nemitz, Kecheng Yang, Ming Yang, Pontus Ekberg, James H. Anderson:
Multiprocessor Real-Time Locking Protocols for Replicated Resources. ECRTS 2016: 50-60 - [c9]Morteza Mohaqeqi, Pontus Ekberg, Wang Yi:
On Fixed-Priority Schedulability Analysis of Sporadic Tasks with Self-Suspension. RTNS 2016: 109-118 - 2015
- [b1]Pontus Ekberg:
Models and Complexity Results in Real-Time Scheduling Theory. Uppsala University, Sweden, 2015 - [j3]Pontus Ekberg, Nan Guan, Martin Stigge, Wang Yi:
An optimal resource sharing protocol for generalized multiframe tasks. J. Log. Algebraic Methods Program. 84(1): 92-105 (2015) - [c8]Pontus Ekberg, Wang Yi:
Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines Is Strongly coNP-Complete. ECRTS 2015: 281-286 - [c7]Pontus Ekberg, Wang Yi:
Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization. RTSS 2015: 87-95 - 2014
- [j2]Pontus Ekberg, Wang Yi:
Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Real Time Syst. 50(1): 48-86 (2014) - 2013
- [j1]Martin Stigge, Pontus Ekberg, Wang Yi:
The fork-join real-time task model. SIGBED Rev. 10(2): 20 (2013) - 2012
- [c6]Pontus Ekberg, Wang Yi:
Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks. ECRTS 2012: 135-144 - 2011
- [c5]Martin Stigge, Pontus Ekberg, Nan Guan, Wang Yi:
On the Tractability of Digraph-Based Task Models. ECRTS 2011: 162-171 - [c4]Nan Guan, Pontus Ekberg, Martin Stigge, Wang Yi:
Resource Sharing Protocols for Real-Time Task Graph Systems. ECRTS 2011: 272-281 - [c3]Pontus Ekberg, Edith C. H. Ngai:
A distributed Swarm-Intelligent Localization for sensor networks with mobile nodes. IWCMC 2011: 83-88 - [c2]Martin Stigge, Pontus Ekberg, Nan Guan, Wang Yi:
The Digraph Real-Time Task Model. IEEE Real-Time and Embedded Technology and Applications Symposium 2011: 71-80 - [c1]Nan Guan, Pontus Ekberg, Martin Stigge, Wang Yi:
Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems. RTSS 2011: 13-23
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
