default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2012
- Björn Andersson, Sagar Chaki, Dionisio de Niz, Brian Dougherty, Russell Kegley, Jules White:
Non-preemptive Scheduling with History-Dependent Execution Time. ECRTS 2012: 363-372 - Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. ECRTS 2012: 145-154 - Can Basaran, Kyoung-Don Kang:
Supporting Preemptive Task Executions and Memory Copies in GPGPUs. ECRTS 2012: 287-296 - Henri Bauer, Jean-Luc Scharbarg, Christian Fraboul:
Worst-Case Backlog Evaluation of Avionics Switched Ethernet Networks with the Trajectory Approach. ECRTS 2012: 78-87 - Kostiantyn Berezovskyi, Konstantinos Bletsas, Björn Andersson:
Makespan Computation for GPU Threads Running on a Single Streaming Multiprocessor. ECRTS 2012: 277-286 - Reinder J. Bril, Martijn M. H. P. van den Heuvel, Ugur Keskin, Johan J. Lukkien:
Generalized Fixed-Priority Scheduling with Limited Preemptions. ECRTS 2012: 209-220 - Jian-Jia Chen, Samarjit Chakraborty:
Partitioned Packing and Scheduling for Sporadic Real-Time Tasks in Identical Multiprocessor Systems. ECRTS 2012: 24-33 - Liliana Cucu-Grosjean, Luca Santinelli, Michael Houston, Code Lo, Tullio Vardanega, Leonidas Kosmidis, Jaume Abella, Enrico Mezzetti, Eduardo Quiñones, Francisco J. Cazorla:
Measurement-Based Probabilistic Timing Analysis for Multi-path Programs. ECRTS 2012: 91-101 - Pontus Ekberg, Wang Yi:
Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks. ECRTS 2012: 135-144 - Glenn A. Elliott, James H. Anderson:
Robust Real-Time Multiprocessor Interrupt Handling Motivated by GPUs. ECRTS 2012: 267-276 - Jeremy P. Erickson, James H. Anderson:
Outstanding Paper Award: Fair Lateness Scheduling: Reducing Maximum Lateness in G-EDF-Like Scheduling. ECRTS 2012: 3-12 - Thomas Ferrandiz, Fabrice Frances, Christian Fraboul:
A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks. ECRTS 2012: 47-56 - Sebastian Hahn, Daniel Grund:
Relational Cache Analysis for Static Timing Analysis. ECRTS 2012: 102-111 - Yin Hang, Hans Hansson:
Timing Analysis for Mode Switch in Component-Based Multi-mode Systems. ECRTS 2012: 255-264 - Mike Holenderski, Reinder J. Bril, Johan J. Lukkien:
Parallel-Task Scheduling on Multiple Resources. ECRTS 2012: 233-244 - Rodney R. Howell:
Computing First-to-First Propagation Delays through Sequences of Fixed-Priority Periodic Tasks. ECRTS 2012: 343-352 - Pratyush Kumar, Nikolay Stoimenov, Lothar Thiele:
An Algorithm for Online Reconfiguration of Resource Reservations for Hard Real-Time Systems. ECRTS 2012: 245-254 - Haohan Li, Sanjoy K. Baruah:
Outstanding Paper Award: Global Mixed-Criticality Scheduling on Multiprocessors. ECRTS 2012: 166-175 - Stefan Metzlaff, Theo Ungerer:
Replacement Policies for a Function-Based Instruction Memory: A Quantification of the Impact on Hardware Complexity and WCET Estimates. ECRTS 2012: 112-121 - Anwar Mohammadi, Nathan Fisher, Daniel Grosu:
Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks. ECRTS 2012: 199-208 - Geoffrey Nelissen, Vandy Berten, Joël Goossens, Dragomir Milojevic:
Techniques Optimizing the Number of Processors to Schedule Multi-threaded Tasks. ECRTS 2012: 321-330 - Geoffrey Nelissen, Vandy Berten, Vincent Nélis, Joël Goossens, Dragomir Milojevic:
U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks. ECRTS 2012: 13-23 - Moritz Neukirchner, Steffen Stein, Rolf Ernst:
Deriving Monitoring Bounds for Distributed Real-Time Systems. ECRTS 2012: 57-67 - Luigi Palopoli, Daniele Fontanelli, Nicola Manica, Luca Abeni:
An Analytical Bound for Probabilistic Deadlines. ECRTS 2012: 179-188 - Risat Mahmud Pathan:
Schedulability Analysis of Mixed-Criticality Systems on Multiprocessors. ECRTS 2012: 309-320 - Gurulingesh Raravi, Björn Andersson, Konstantinos Bletsas, Vincent Nélis:
Outstanding Paper Award: Task Assignment Algorithms for Two-Type Heterogeneous Multiprocessors. ECRTS 2012: 34-43 - Soheil Samii, Unmesh D. Bordoloi, Petru Eles, Zebo Peng, Anton Cervin:
Control-Quality Optimization for Distributed Embedded Systems with Adaptive Fault Tolerance. ECRTS 2012: 68-77 - François Santy, Laurent George, Philippe Thierry, Joël Goossens:
Relaxing Mixed-Criticality Scheduling Strictness for Task Sets Scheduled with FP. ECRTS 2012: 155-165 - Mayank Shekhar, Abhik Sarkar, Harini Ramaprasad, Frank Mueller:
Semi-Partitioned Hard-Real-Time Scheduling under Locked Cache Migration in Multicore Systems. ECRTS 2012: 331-340 - Martin Stigge, Wang Yi:
Hardness Results for Static Priority Real-Time Scheduling. ECRTS 2012: 189-198
skipping 5 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-21 02:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint