![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 30 matches
- 2002
- Luca Abeni, Luigi Palopoli, Giuseppe Lipari
, Jonathan Walpole:
Analysis of a Reservation-Based Feedback Scheduler. RTSS 2002: 71-80 - Guillem Bernat, Antoine Colin, Stefan M. Petters:
WCET Analysis of Probabilistic Hard Real-Time System. RTSS 2002: 279-288 - Enrico Bini, Giorgio C. Buttazzo:
The Space of Rate Monotonic Schedulability. RTSS 2002: 169-178 - Ian Broster, Alan Burns, Guillermo Rodríguez-Navas:
Probabilistic Analysis of CAN with Faults. RTSS 2002: 269-278 - Marco Caccamo, Lynn Y. Zhang, Lui Sha, Giorgio C. Buttazzo:
An Implicit Prioritized Access Protocol for Wireless Sensor Networks. RTSS 2002: 39-48 - Samarjit Chakraborty, Simon Künzli, Lothar Thiele:
Approximate Schedulability Analysis. RTSS 2002: 159-168 - Darren D. Cofer, Murali Rangarajan:
Formal Verification of Overhead Accounting in an Avionics RTOS. RTSS 2002: 181-190 - Alexander G. Dean:
Compiling for Fine-Grain Concurrency: Planning and Performing Software Thread Integration. RTSS 2002: 103-113 - José Luis Díaz, Daniel F. García, Kanghee Kim, Chang-Gun Lee, Lucia Lo Bello, José María López, Sang Lyul Min, Orazio Mirabella:
Stochastic Analysis of Periodic Real-Time Systems. RTSS 2002: 289-300 - Bruno Dutertre:
Dynamic Scan Scheduling. RTSS 2002: 327-336 - E. N. Elnozahy, Rami G. Melhem, Daniel Mossé:
Energy-Efficient Duplex and TMR Real-Time Systems. RTSS 2002: 256-266 - Steve Goddard, Xin Liu:
Scheduling Aperiodic Requests under the Rate-Based Execution Model. RTSS 2002: 15-25 - Philip Holman, James H. Anderson:
Locking in Pfair-Scheduled Multiprocessor Systems. RTSS 2002: 149-158 - Rohit Jain, Christopher J. Hughes, Sarita V. Adve:
Soft Real- Time Scheduling on Simultaneous Multithreaded Processors. RTSS 2002: 134-145 - Dong-In Kang, Stephen P. Crago, Jinwoo Suh:
A Fast Resource Synthesis Technique for Energy-Efficient Real-Time System. RTSS 2002: 225-234 - Kyoung-Don Kang, Sang Hyuk Son, John A. Stankovic:
STAR: Secure Real-Time Transaction Processing with Timeliness Guarantees. RTSS 2002: 303-314 - Jasleen Kaur, Harrick M. Vin:
End-to-end Fairness Analysis of Fair Queuing Networks. RTSS 2002: 49-58 - Pau Martí, Josep M. Fuertes, Gerhard Fohler, Krithi Ramamritham:
Improving Quality-of-Control Using Flexible Timing Constraints: Metric and Scheduling Issues. RTSS 2002: 91-100 - Frank Mehnert, Michael Hohmuth, Hermann Härtig:
Cost and Benefit of Separate Address Spaces in Real-Time Operating Systems. RTSS 2002: 124-133 - Aloysius K. Mok, Chan-Gun Lee, Honguk Woo, Prabhudev Konana:
The Monitoring of Timing Constraints on Time Intervals. RTSS 2002: 191-200 - Isabelle Puaut, David Decotigny:
Low-Complexity Algorithms for Static Cache Locking in Multitasking Hard Real-Time Systems. RTSS 2002: 114-123 - Srikanth Ramamurthy:
Scheduling Periodic Hard Real-Time Tasks with Arbitrary Deadlines on Multiprocessors. RTSS 2002: 59-68 - John Regehr:
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults. RTSS 2002: 315-326 - Cosmin Rusu, Rami G. Melhem, Daniel Mossé:
Maximizing the System Value while Satisfying Time and Energy Constraints. RTSS 2002: 246-255 - Lui Sha, Xue Liu:
Queueing Model Based Network Server Performance Control. RTSS 2002: 81-90 - Chi-Sheng Shih, Jane W.-S. Liu:
State-Dependent Deadline Scheduling. RTSS 2002: 3-14 - Insik Shin, Insup Lee, Sang Lyul Min:
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements. RTSS 2002: 201-211 - Fan Zhang, Samuel T. Chanson:
Processor Voltage Scheduling for Real-Time Tasks with Non-Preemptible Sections. RTSS 2002: 235-245 - Haifeng Zhu, Jeffery P. Hansen, John P. Lehoczky, Ragunathan Rajkumar:
Optimal Partitioning for Quantized EDF Scheduling. RTSS 2002: 212-222 - Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS'02), Austin, Texas, USA, December 3-5, 2002. IEEE Computer Society 2002, ISBN 0-7695-1851-6 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06-27 05:14 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