this paper introduces the scheduling of frame-based real-time tasks in partitioning schemes for multiprocessor systems powered by rechargeable batteries. In frame-based real-timesystems, a set of tasks must execute i...
详细信息
ISBN:
(纸本)9780769533490
this paper introduces the scheduling of frame-based real-time tasks in partitioning schemes for multiprocessor systems powered by rechargeable batteries. In frame-based real-timesystems, a set of tasks must execute in a frame, and the whole frame is repeated. this system model is widely used in real-time communication, real-time imaging and a lot of other real-time/embeddedsystems. Nowadays, many of these systems are powered by rechargeable batteries. Scheduling real-time tasks on these rechargeable systems is an important yet largely ignored issue. the problem for uniprocessor systems had been studied in [1], in which an algorithm of complexity O(N) was proposed for determining the feasibility of the task set. However, it poses a challenge when doing so in a rechargeable multiprocessor system considering different characteristics of the batteries. In this paper, we first show this problem to be NP-Hard, and then propose efficient algorithms to overcome it. the simulation results have shown that our algorithms exhibit very good behaviors and they can be considered as solutions to the problem.
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-timeembeddedsystems need to minimize...
详细信息
ISBN:
(纸本)9780769533490
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-timeembeddedsystems need to minimize task real-time utilization (function of execution time and period) instead of only minimizing the number of cache misses. In this work, the partitioning problem is presented as an optimization problem whose solution sets the size of each cache partition and assigns tasks to partitions such that system worst-case utilization is minimized thus increasing real-time schedulability. Since the problem is NP-Hard, a genetic algorithm is presented to find a near optimal solution. A case stud), and experiments show that in a typical real-timeembedded system, the proposed algorithm is able to reduce the worst-case utilization by 15% (on average) if compared to the case when the system uses a shared cache or a proportional cache partitioned environment.
Minimizing, energy consumption is a key issue in designing real-timeapplications on wireless embeddedsystems. While a lot of work has been done to manage energy consumption on single processor real-time system, few ...
详细信息
ISBN:
(纸本)9780769533490
Minimizing, energy consumption is a key issue in designing real-timeapplications on wireless embeddedsystems. While a lot of work has been done to manage energy consumption on single processor real-time system, few work addresses network-wide energy consumption management for real-time tasks. Moreover, existing work on network-wide energy consumption assumes that the underlying network is always connected, which is not consistent withthe practice in which wireless nodes often turn off their network interfaces in a sleep schedule to reduce energy consumption. In this paper, we propose solutions to minimize network-wide energy consumption for real-time tasks with precedence constraints executing on wireless embeddedsystems. Our solutions take the radio sleep scheduling of wireless nodes into account when adjusting the execution modes of processors. We also propose a runtime dynamic energy management scheme to further reduce energy consumption while guaranteeing the timing constraint. the experiments show that our approach significantly reduces total energy consumption compared withthe previous work.
embeddedsystems tend to use demand paging in order to provide more memory to applications in a cost-effective manner. However demand paging drastically degrades the performance when the page fault rate is high. Prefe...
详细信息
ISBN:
(纸本)9780769533490
embeddedsystems tend to use demand paging in order to provide more memory to applications in a cost-effective manner. However demand paging drastically degrades the performance when the page fault rate is high. Prefetching has been known as a common remedy for page fault overhead. Although many prefetching mechanisms have been proposed, they are either effective only for specific page access patterns or too straight-forward to decrease a page fault rate to an acceptable level. We propose a scheduler-assisted prefetching mechanism which does not have such fundamental defects. As a proof of concept, our mechanism was completely implemented in Linux. We have also conducted a series of experiments to show its effectiveness. the experimental results showed a significant improvement: the number of the major page faults and the scheduling latency decreased by 30% and 51%, respectively.
real-timesystems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. these systems consist of a mix of hard and soft tasks with varying cr...
详细信息
ISBN:
(纸本)9780769533490
real-timesystems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. these systems consist of a mix of hard and soft tasks with varying criticality, as well as associated fault tolerance requirements. Additionally, the relative criticality of tasks could undergo changes during the system evolution. time redundancy techniques are often preferred in embeddedapplications and, hence, it is extremely important to devise appropriate methodologies for scheduling real-time tasks under failure assumptions. In this paper we propose a methodology to provide a priori guarantees in fixed priority scheduling (FPS) such that the system will be able to tolerate one error per every critical task instance. We do so by using Integer Linear Programming (ILP) to derive task attributes that guarantee re-execution of ever), critical task instance before its deadline, while keeping the associated costs minimized. We illustrate the effectiveness of our approach, in comparison with fault tolerant (FT) adaptations of the well-known rate monotonic (RM) scheduling, by simulations.
Performance evaluation is key to many computer applications. Many techniques and profiling tools are available for measuring performance, but most of them depend on the hardware and the software on which they run. For...
详细信息
ISBN:
(纸本)9780769533490
Performance evaluation is key to many computer applications. Many techniques and profiling tools are available for measuring performance, but most of them depend on the hardware and the software on which they run. For a new platform, or a platform which is not popular, programmers usually suffer from few analysis tools, which has been a serious problem for application development on many embeddedsystems. thus, a performance analysis tool withthe software mechanism is quite important for developing embeddedapplications. this paper describes a software mechanism for analyzing program performance on a wide range of platforms via code instrumentation at the source level. We implement this mechanism in a pure software profiling toolkit, called Moduletracer, which works with a public-domain tool, CIL, to carry out code instrumentation for C programs. the toolkit aids programmers in understanding the behavior of applications by generating and analyzing traces and identify potential performance problems.
Energy-efficient real-time task scheduling has been actively explored in the past decade. Different from the past work, this paper considers schedulability conditions for stochastic real-time tasks. A schedulability c...
详细信息
ISBN:
(纸本)9780769533490
Energy-efficient real-time task scheduling has been actively explored in the past decade. Different from the past work, this paper considers schedulability conditions for stochastic real-time tasks. A schedulability condition is first presented for frame-based stochastic real-time tasks, and several algorithms are also examined to check the schedulability of a given strategy An approach is then proposed based on the schedulability condition to adapt a continuous-speed-based method to a discrete-speed system. the approach is able to stay as close as possible to the continuous-speed-based method., but still guaranteeing the schedulability. It is shown by simulations that the energy saving can be more than 20% for some system configurations.
Nowadays, systems often integrate a variety of applications whose service requirements are heterogeneous. Consequently, systems must be able to concurrently serve applications which rely on different constraints. this...
详细信息
ISBN:
(纸本)9780769533490
Nowadays, systems often integrate a variety of applications whose service requirements are heterogeneous. Consequently, systems must be able to concurrently serve applications which rely on different constraints. this raises the problem of the dynamic distribution of the system resources (CPU, memory, network, etc.). therefore, an integrated Quality of Service (QoS) management is needed so as to efficiently assign resources according to the various application demands. Within this paper we focus on a dynamic approach of QoS management for memory resource allocation based on the Skip-Over model. We detail our solution and we show how it improves the service of task memory requests while providing them guarantees. Quantitative results using the TLSF allocator have been performed in order to evaluate the memory failure probability with and without memory QoS manager.
In networked embedded sensor systems, data fusion is a viable solution to significantly reduce energy consumption while achieving real-time guarantee. Emerging data fusion applications demand efficient task allocation...
详细信息
ISBN:
(纸本)9780769533490
In networked embedded sensor systems, data fusion is a viable solution to significantly reduce energy consumption while achieving real-time guarantee. Emerging data fusion applications demand efficient task allocation and scheduling techniques. However, existing approaches can not be effectively applied concerning both network. topology and wireless communications. In this paper, we formally model TATAS, the Topology-Aware Task Allocation and Scheduling problem for real-time data fusion applications, and show it is NP-complete. We also propose an efficient three-phase heuristic to solve the TATAS problem. We implement our technique and conduct experiments based on a simulation environment. Experimental results show that, as compared with traditional approaches, our technique can achieve significant energy saving and effectively meet the real-time requirements as well.
Renewable energies can enable embeddedsystems to be functional indefinitely. In particular for small antonomous sensors, energy harvesting techniques have attracted much interest. this paper considers systems which P...
详细信息
ISBN:
(纸本)9780769533490
Renewable energies can enable embeddedsystems to be functional indefinitely. In particular for small antonomous sensors, energy harvesting techniques have attracted much interest. this paper considers systems which Provide services Periodically with, adjustable quality evaluated in terms of rewards. the reward garnered for one service is monotonically increasing and Strictly concave with respect to the energy consumption of the service. there exist two major constraints which arise due to the burstiness of common energy sources: (1) the harvested energy is temporarily low and the service must be lowered or suspended. (2) During bursts, the harvested energy exceeds the battery capacity. To resolve these issues, we propose algorithms to derive optimal solutions which maximize the overall reward. Furthermore, we determine the minimum battery capacity necessary to optimally exploit a given power source. By applying real data recorded for photovoltaic cells as the harvested energy, simulations illuminate the merits of our algorithms.
暂无评论