{"title":"Statistical analysis of WCET for scheduling","authors":"S. Edgar, A. Burns","doi":"10.1109/REAL.2001.990614","DOIUrl":"https://doi.org/10.1109/REAL.2001.990614","url":null,"abstract":"To perform a schedulability test, scheduling analysis relies on a known worst-case execution time (WCET). This value may be difficult to compute and may be overly pessimistic. This paper offers an alternative analysis based on estimating a WCET from test data to within a specific level of probabilistic confidence. A method is presented for calculating an estimate given statistical assumptions. The implications of the level of confidence on the likelihood of schedulability are also presented.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114665202","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":"End-to-end delay analysis for real-time networks","authors":"Shu-Ngai Yeung, John Lehoczk","doi":"10.1109/REAL.2001.990628","DOIUrl":"https://doi.org/10.1109/REAL.2001.990628","url":null,"abstract":"This paper presents an application of real-time queueing network theory to a particular network which models a video-on-demand server. Packets from each stream have stochastic arrival patterns, computation times and end-to-end delay requirements. We derive closed form solutions for the deadline miss rate of the packets. This methodology can be used to design admission control policies that provide statistical quality of service guarantees. By considering the actual requirements rather than worst-case requirements, the realtime queueing network approach significantly increases the server, utilization. This paper, illustrates how realtime, queueing network theory can be used to accurately predict the behavior of real-time systems in heavy traffic conditions. It shows how one can calculate the fraction of tasks that will miss their end-to-end deadlines. It presents new results on product form equilibrium distributions for multidimensional reflected Brownian motion processes when nodes are scheduled using EDF. Lastly, it presents simulation results to illustrate the excellent accuracy of the real-time queueing network approach and how the methodology can be used to provide statistical QoS guarantees.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124799395","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":"A bandwidth inheritance algorithm for real-time task synchronization in open systems","authors":"Gerardo Lamastra, G. Lipari, Luca Abeni","doi":"10.1109/REAL.2001.990606","DOIUrl":"https://doi.org/10.1109/REAL.2001.990606","url":null,"abstract":"In this paper, we present algorithm BandWidth Inheritance (BWI), a new scheduling strategy that extends the bandwidth reservation approach to systems where tasks can interact through shared resources. The proposed algorithm provides temporal isolation between independent groups of tasks, and enables a schedulability analysis for guaranteeing the performance of realtime tasks. After showing that BWI is the natural extension of the well-known Priority Inheritance Protocol to dynamic reservation systems, a formal analysis of the algorithm is presented, and simple guarantee tests for hard real-time tasks are proposed.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116129721","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":"An efficient algorithm for scheduling instructions with deadline constraints on ILP processors","authors":"Hui Wu, J. Jaffar","doi":"10.1109/REAL.2001.990616","DOIUrl":"https://doi.org/10.1109/REAL.2001.990616","url":null,"abstract":"We propose an efficient algorithm for scheduling UET (unit execution time) instructions with deadline constraints on ILP (instruction level parallelism) processors with multiple functional units of different types. The time complexity of our algorithm is O(ne + nd), where n is the number of instructions, e is the number of edges in the precedence graph and d is the maximum latency. Our algorithm is guaranteed to compute a feasible schedule whenever one exists in the following special cases: 1) arbitrary precedence constraints, latencies in {-1, 0} and two functional units; 2) in-forest, equal latencies and multiple functional units; 3) monotone interval graph and multiple functional units. For all above special cases, if no feasible schedule exists, our algorithm will compute a schedule with minimum lateness. In each of the above special cases, no polynomial time algorithm existed before. Moreover by setting all deadlines to a sufficiently large integer, our algorithm will compute a schedule with minimum length in all the above special cases.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122116645","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":"Jitter control in on-line scheduling of dependent real-time tasks","authors":"L. David, F. Cottet, N. Nissanke","doi":"10.1109/REAL.2001.990595","DOIUrl":"https://doi.org/10.1109/REAL.2001.990595","url":null,"abstract":"A typical characteristic of real-time systems is concurrent processing of tasks under strict timing requirements. These timing requirements may impose not only direct constraints, such as deadlines, but also indirect timing constraints in terms of inter-task dependencies. However scheduling policies which can deal with some of these constraints effectively are limited, especially for the on-line context, and are not widely known within the real-time community. In this context, this paper presents a technique to control execution irregularities, namely, jitter. The technique is based on the modification of task temporal parameters in the paradigm of the well known Deadline Monotonic (DM) and Earliest Deadline First (EDF) algorithms. The technique presents a way either to remove jitter completely (in the case of regularity constrained tasks) or to bound jitter releases. Moreover, the approach takes into account temporal dependencies of tasks on one another.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115373152","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":"Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip","authors":"Paolo Gai, G. Lipari, M. Natale","doi":"10.1109/REAL.2001.990598","DOIUrl":"https://doi.org/10.1109/REAL.2001.990598","url":null,"abstract":"The research on real-time software systems has produced algorithms that allow to effectively schedule system resources while guaranteeing the deadlines of the application and to group tasks in a very short number of non-preemptive sets which require much less RAM memory for stack. Unfortunately, up to now the research focus has been on time guarantees rather than the optimization of RAM usage. Furthermore, these techniques do not apply to multiprocessor architectures which are likely to be widely used in future microcontrollers. This paper presents a fast and simple algorithm for sharing resources in multiprocessor systems, together with an innovative procedure for assigning preemption thresholds to tasks. This allows to guarantee the schedulability of hard real-time task sets while minimizing RAM usage. The experimental part shows the effectiveness of a simulated annealing-based tool that allows to find a near-optimal task allocation. When used in conjunction with our preemption threshold assignment algorithm, our tool further reduces the RAM usage in multiprocessor systems.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635554","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":"Towards compositionality in real-time resource partitioning based on regularity bounds","authors":"A. Mok, A. Feng","doi":"10.1109/REAL.2001.990604","DOIUrl":"https://doi.org/10.1109/REAL.2001.990604","url":null,"abstract":"In real-time resource partitioning, a shared resource is partitioned by a resource-level scheduler such that each partition is accessible only by an individual application task group. Tasks within the same task group are scheduled by an application-task-level scheduler that is specialized to the real-time requirements of the tasks in the group. An ideal goal for resource partitioning in real-time systems is to achieve a complete separation of concerns so that: (1) each task group may be executed as if it had access to its own dedicated resource, and (2) there is minimal interaction between the resource-level scheduler and the application-task-level scheduler. In [15], we introduced the notion of a real-time virtual resource which operates at a fraction of the rate of the shared physical resource and whose rate of operation varies with time but is bounded. In this paper we discuss an approach to bound the variation of the rate of operation of a real-time virtual resource by characterizing the rate variation from both temporal and supply dimensions and by expanding on the concept of regularity that was first introduced in [19]. For the case of regular resource partitioning, we show that the utilization bounds of both fixed-priority scheduling and dynamic-priority scheduling remain unchanged from those for dedicated resources. We determine the utilization bounds for the more general case of irregular partitioning. In particular, both types of partitions can be efficiently constructed by exploiting compositionality, properties vis-a-vis the regularity measure.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127128427","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":"Adaptive power-fidelity in energy-aware wireless embedded systems","authors":"V. Raghunathan, P. Spanos, M. Srivastava","doi":"10.1109/REAL.2001.990601","DOIUrl":"https://doi.org/10.1109/REAL.2001.990601","url":null,"abstract":"Energy aware system operation, and not just low power hardware, is an important requirement for wireless embedded systems. These systems, such as wireless multimedia terminals or wireless sensor nodes, combine (soft) real-time constraints on computation and communication with requirements of long battery lifetime. In this paper, we present an OS-directed dynamic power management technique for such systems that goes beyond conventional techniques to provide an adaptive power vs. fidelity trade-off. The ability of wireless systems to adapt to changing fidelity in the form of data losses and errors is used to tradeoff against energy consumption. We also exploit system workload variation to proactively manage energy resources by predicting processing requirements. The supply voltage, and clock frequency are set according to predicted computation requirements of a specific task instance, and an adaptive feedback control machanism is used to keep system fidelity (deadline misses) within specifications. We present the theoretical framework underlying our approach in the context of both a static priority-based preemptive task scheduler as well as a dynamic priority based one, and present simulation-based performance analysis that shows that our technique provides large energy savings (up to 76%) with little loss in fidelity (<4%). Further, we describe the implementation of our technique in the eCos real-time operating system (RTOS) running on a StrongARM processor to illustrate the issues involved in enhancing RTOSs for energy awareness.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125553183","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}
Claude-Joachim Hamann, Lars Reuther, Jork Wolter, Hermann Härtig, Jork Löser, S. Schönberg
{"title":"Quality-assuring scheduling-using stochastic behavior to improve resource utilization","authors":"Claude-Joachim Hamann, Lars Reuther, Jork Wolter, Hermann Härtig, Jork Löser, S. Schönberg","doi":"10.1109/REAL.2001.990603","DOIUrl":"https://doi.org/10.1109/REAL.2001.990603","url":null,"abstract":"We present a unified model for admission and scheduling, applicable for various active resources such as CPU or disk to assure a requested quality in situations of temporary overload. The model allows us to predict and control the behavior of applications based on given quality requirements. It uses the variations in the execution time, i.e., the time any active resource is needed We split resource requirements into a mandatory part which must be available and an optional part which should be available as often as possible but at least with a certain percentage. In combination with a given distribution for the execution time we can move away from worst-case reservations and drastically reduce the amount of reserved resources for applications which can tolerate occasional deadline misses. This increases the number of admittable applications. For example, with negligible loss of quality our system can admit more than two times the disk bandwidth than a system based on the worst-case. Finally, we validated the predictions of our model by measurements using a prototype real-time system and observed a high accuracy between predicted and measured values.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115557875","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":"Aperiodic servers with resource constraints","authors":"M. Caccamo, L. Sha","doi":"10.1109/REAL.2001.990607","DOIUrl":"https://doi.org/10.1109/REAL.2001.990607","url":null,"abstract":"Integrating soft and hard activities in a real-time environment has been an active area of research both under fixed priority scheduling and dynamic priority scheduling. Most of the existing work, however, has been done under the assumption that soft real-time tasks and hard real-time tasks are independent. The paper presents an efficient method that allows soft realtime aperiodic tasks and hard real-time tasks to share resources.","PeriodicalId":104258,"journal":{"name":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)","volume":"51 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114323004","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}