{"title":"On the complexity of scheduling real-time tasks with self-suspensions on one processor","authors":"P. Richard","doi":"10.1109/EMRTS.2003.1212743","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212743","url":null,"abstract":"Integrating practical factors in scheduling theory is a major issue. Efficient schedulability tests (polynomial time or pseudo-polynomial time algorithms) are known for preemptive, independent tasks. In this paper, tasks are allowed to self-suspend. In practice, the real-time kernel suspends a task when it requests an external blocking operation. We study feasibility analysis problems from the computational complexity point of view. The problem is proved NP-hard in the strong sense for periodic, preemptive or non-preemptive task sets. If we allow tasks to have several flows of control (multi-threaded tasks), then the corresponding feasibility problem is shown to be NP-hard in the strong sense in the case of unit execution time threads.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133909764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using supertasks to improve processor utilization in multiprocessor real-time systems","authors":"Philip Holman, James H. Anderson","doi":"10.1109/EMRTS.2003.1212726","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212726","url":null,"abstract":"We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems by presenting a generalized \"reweighting\" algorithm. The generalized algorithm we present breaks new ground by permitting tasks to have noninteger execution costs, by incorporating blocking terms into the analysis, and by assuming a more flexible global-scheduling model. To demonstrate the efficacy of the supertasking approach, we present an experimental evaluation of our algorithm that suggests that reweighting may often result in almost no schedulability loss in practice.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125320264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Characteristics of EDF schedulability on uniform multiprocessors","authors":"S. Funk, Sanjoy Baruah","doi":"10.1109/EMRTS.2003.1212746","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212746","url":null,"abstract":"In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design of efficient tests for determining whether the earliest deadline first scheduling algorithm (EDF) can successfully schedule a given real-time task system to meet all deadlines upon a specified uniform multiprocessor platform. Upon uniform multiprocessor platforms, we show that it is often far easier (from a computational complexity perspective) to determine feasibility than it is to check for EDF-schedulability. In designing an EDF-schedulability test for uniform multiprocessors, therefore, our approach is as follows: for a given uniform multiprocessor platform, we attempt to efficiently identify all those uniform multiprocessor platforms such that any real-time instance feasible upon these platforms is guaranteed to be EDF-schedulable upon the platform under consideration. EDF-schedulability upon the given platform can then be determined by ascertaining whether the real-time system is feasible upon any of these platforms.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126957412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluation of new POSIX real-time operating systems services for small embedded platforms","authors":"M. A. Rivas, M. G. Harbour","doi":"10.1109/EMRTS.2003.1212739","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212739","url":null,"abstract":"The ongoing revision of the POSIX.13 standard - real-time profiles for portable operating system interfaces - proposes adding services to the minimum real-time system profile that are considered useful to the small embedded applications to which this profile is targeted. Concerns have been raised that these services may introduce too much overhead or may be difficult to implement. In this paper, we evaluate the implementation of some of these services in our MaRTE operating system. The implemented services are the monotonic clock, a high resolution sleep operation with specifiable clock, execution-time clock and timers, the sporadic server scheduling policy, and the timed mutex lock operation. We show that the complexity of these implementations is small, and the overheads introduced by the new services are fully acceptable.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124610448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Schedulability analysis for distributed heterogeneous time/event triggered real-time systems","authors":"T. Pop, P. Eles, Zebo Peng","doi":"10.1109/EMRTS.2003.1212751","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212751","url":null,"abstract":"This paper deals with specific issues related to the design of distributed embedded systems implemented with mixed, event-triggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases. Such systems are emerging as a new standard for automotive applications. We have developed a holistic timing analysis and scheduling approach for this category of systems. Three alternative scheduling heuristics are presented and compared. We have also identified several new design problems characteristic to such hybrid systems. An example related to bus access optimization in the context of a mixed static/dynamic bus protocol is presented. Experimental results prove the efficiency of such an optimization approach.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128480589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient scheduling of soft real-time applications on multiprocessors","authors":"A. Srinivasan, James H. Anderson","doi":"10.1109/EMRTS.2003.1212727","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212727","url":null,"abstract":"In this paper, we consider fair scheduling of soft real-time applications on multiprocessors using the earliest pseudo deadline first (EPDF) Pfair algorithm. Our main contributions are twofold. First, we establish a condition for ensuring a tardiness of at most one quantum under EPDF. This condition is very liberal and should often hold in practice. Second, we present simulation results involving randomly-generated task sets, including those that do not satisfy our condition. In these experiments, deadline misses were rare, and no misses by more than one quantum ever occurred.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129825199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Starting conditions for post-mortem debugging using deterministic replay of real-time systems","authors":"Joel Huselius, Daniel Sundmark, Henrik Thane","doi":"10.1109/EMRTS.2003.1212741","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212741","url":null,"abstract":"Repeatable executions are required in order to successfully debug a computer system. However, for real-time systems, interactions with the environment and race conditions in the execution of multitasking real-time systems software make reproducible behavior difficult to achieve. Earlier work on debugging of real-time software has established the use of a deterministic replay, a record/replay solution, as a viable approach to reproduce executions. When combining the deterministic replay approach with infinite loop recorders (similar to black-box recorders in airplanes) for post-mortem debugging, it is essential that the recordings are sufficiently long and detailed in order to be able to re-execute the system. Basis problems however, are how to find a well-defined starting point within the recording, and how to find a reachable state in the rebooted/restarted system to match that instance? Previous work has not presented solutions to these fundamental problems, in this paper we do. We also present some implementation details from an industrial case study.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130086181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multiversion scheduling in rechargeable energy-aware real-time systems","authors":"C. Rusu, R. Melhem, D. Mossé","doi":"10.1109/EMRTS.2003.1212732","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212732","url":null,"abstract":"In the context of battery-powered real-time systems three constraints need to be addressed: energy; deadlines; and task rewards. Many future real-time systems will count on different software versions, each with different rewards, time and energy requirements, to achieve a variety of QoS-aware tradeoffs. We propose a solution that allows the device to run the most valuable task versions while still meeting all deadlines and without depleting the energy. Assuming that the battery is rechargeable, we also propose: (a) a static solution that maximizes the system value assuming a worst-case scenario (i.e., worst-case task execution times); and (b) a dynamic scheme that takes advantage of the extra energy in the system when worst-case scenarios do not happen. Three dynamic policies are shown to make better use of the recharging energy while improving the system value.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123274670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hardware-based solution detecting illegal references in real-time Java","authors":"M. T. Higuera-Toledano","doi":"10.1109/EMRTS.2003.1212748","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212748","url":null,"abstract":"The memory model used in the Real-Time Specification for Java (RTSJ) imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus maintaining the pointer safety of Java. An implementation solution to ensure the checking of these rules before each assignment statement consists to use write barriers executing a stack-based algorithm. This paper provides a hardware-based solution for both write barriers and the stack-based algorithm.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124960926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Resource sharing in an enhanced rate-based execution model","authors":"Xin Liu, S. Goddard","doi":"10.1109/EMRTS.2003.1212736","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212736","url":null,"abstract":"A theory of resource sharing in a mixed system with hard real-time and non-real-time processing requirements is presented. The real-time processing is modeled as rate-based execution (RBE) tasks whose resource needs are known in advance. The non-real-time processing is modeled as aperiodic requests and dynamically mapped to weight-based variable rate execution tasks. The resource sharing requirements of the aperiodic requests are unknown a priori and only become known when a critical section is reached. A scheduling algorithm that supports resource sharing without deadlock in such a mixed system is presented with a sufficient off-line schedulability condition.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127160696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}