In software fault-tolerant module, the key issue that affects the performance of fault-tolerant scheduling algorithm is how to predict precisely whether a primary is executable. In order to improve the prediction prec...
详细信息
ISBN:
(纸本)9783540725893
In software fault-tolerant module, the key issue that affects the performance of fault-tolerant scheduling algorithm is how to predict precisely whether a primary is executable. In order to improve the prediction precision, a new algorithm named DPA, Deep-Prediction based algorithm, is put forward. DPA uses prediction-table to predict whether a primary can be completed before it is scheduled. Simulation results show that DPA provides more execution time for primaries and wastes less processor time than the well-known similar algorithms.
Weakly hard real-time application requires that scheduling algorithm should provide service satisfied QoS parameter, so a new fixed-priority scheduling algorithm with (m,k)-firm guarantee is presented. It assigns sche...
详细信息
ISBN:
(纸本)9780769535593
Weakly hard real-time application requires that scheduling algorithm should provide service satisfied QoS parameter, so a new fixed-priority scheduling algorithm with (m,k)-firm guarantee is presented. It assigns scheduling priority of task based on period and QoS parameter, and the task is switched between preemptive state and optional state to reflect its pressure. Schedulability test inequation of the algorithm is presented in the paper. The validity and the flexibility of the algorithm are proved through the analysis of classical task sets.
As technology scaling into the nanometer regime, the performance is accompanied by the ever-increasing chip power consumption, in which leakage power consumption has become a major factor. Based on temperature-electri...
详细信息
ISBN:
(纸本)9781424437009
As technology scaling into the nanometer regime, the performance is accompanied by the ever-increasing chip power consumption, in which leakage power consumption has become a major factor. Based on temperature-electric coupling effect, we study the temperature-cooling and energy-saving algorithm for high-end multi-processor system-on-chip (MPSoC). This work proposes a TALO (Temperature-Aware Leakage Optimization) algorithm to schedule tasks for MPSoCs. TALO assigns high priority to the coolest processor when there are multi-processor can be used, reducing the temperature-electric coupling leakage power. Comparing with TALK and traditional DVS algorithm, experiments show TALO is more efficient in power consumption. It can reduce the leakage power up to 70 percents for MPSoCs in contrast with DVS algorithm. At the same time, TALO can help decrease the highest temperature of each processor in MPSoC. It can make the temperature of each processor 34 degrees C lower than DVS systems.
Due to the introduction of new M2M (Machine-to-Machine) functionalities and applications in the industry, new devices will need to be connected to existing communication networks, coexisting with current ones. The new...
详细信息
Due to the introduction of new M2M (Machine-to-Machine) functionalities and applications in the industry, new devices will need to be connected to existing communication networks, coexisting with current ones. The new mobile communication technologies, which are still in the standardization process, promise to comply with the communication requirements demanded by industrial automation systems. Therefore, this article has as main contribution to propose the development of a scheduling algorithm for devices (sensors and actuators) that use periodic network resources. This algorithm will aim to reduce network signaling, increase data transmission capacity, or increase the number of devices operating in the industrial network. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Reconfigurable computing has been the promising processor architecture. This paper describes a hybrid scheduling algorithm for reconfigurable processor architecture. The processor consists of the general-purpose proce...
详细信息
ISBN:
(纸本)9781538637586
Reconfigurable computing has been the promising processor architecture. This paper describes a hybrid scheduling algorithm for reconfigurable processor architecture. The processor consists of the general-purpose processor core and reconfigurable devices. And then general tasks and reconfigurable tasks are distinguished according to their features by the scheduler. The general tasks are scheduled to general processor core, and the reconfigurable tasks are scheduled to the reconfigurable devices. This algorithm implements the cooperative processing between the reconfigurable device and the general processor core. The experimental results show that this algorithm can achieve high efficiency and flexibility for such reconfigurable processor architecture.
The global growth of cloud computing services is witnessing a continuous surge, starting from storing data to sharing information with others. It makes cloud service providers (CSPs) efficiently utilize the existing r...
详细信息
ISBN:
(纸本)9783030656201;9783030656218
The global growth of cloud computing services is witnessing a continuous surge, starting from storing data to sharing information with others. It makes cloud service providers (CSPs) efficiently utilize the existing resources of datacenters to increase adaptability and minimize the unexpected expansion of datacenters. These datacenters consume enormous amounts of energy generated using fossil fuels (i.e., non-renewable energy (NRE) sources), and emit a substantial amount of carbon footprint and heat. It drastically impacts the environment. As a result, CSPs are pledged to decarbonize the datacenters by adopting renewable energy (RE) sources, such as solar, wind, hydro and biomass. However, these CSPs have not completely ditched fossil fuels as RE sources are subjected to inconsistent atmospheric conditions. Recent studies have suggested using both NRE and RE sources by the CSPs to meet user requirements. However, these studies have not considered flexible duration, nodes and utilization of the user requests (URs) with respect to datacenters. Therefore, we consider these URs' properties and propose a RE-based scheduling algorithm (RESA) to efficiently assign the URs to the datacenters. The proposed algorithm determines both the earliest completion time and energy cost, and takes their linear combination to decide a suitable datacenter for the URs. We conduct extensive simulations by taking 1000 to 16000 URs and 20 to 60 datacenters. Our simulation results are compared with other algorithms, namely round-robin (RR) and random, which show that RESA is able to reduce the overall completion time (i.e., makespan (M)), energy consumption (EC), overall cost (OC) and the number of used RE (vertical bar URE vertical bar) resources.
The paper compares several kinds scheduling algorithm, which include First-Come,First-Served,Shortest-Job (process)-First, Highest Response Ratio Next. Each algorithm has some advantages or disadvantages. In order to ...
详细信息
ISBN:
(纸本)9783642203664
The paper compares several kinds scheduling algorithm, which include First-Come,First-Served,Shortest-Job (process)-First, Highest Response Ratio Next. Each algorithm has some advantages or disadvantages. In order to take all the factors, such as first come job, shortest job,longest job,highest respones ratio job, and etc,the paper put forward a new operating system scheduling algorithm median-time slice-Highest Response Ratio Next, the method was proved to be feasible and effective after tested the five process sequence.
In view of the delay problem in the multicast and broadcast services, a real-time scheduling algorithm is proposed. By constructing the simulation scene of the multicast and broadcast services transmission, the schedu...
详细信息
ISBN:
(纸本)9781538678619
In view of the delay problem in the multicast and broadcast services, a real-time scheduling algorithm is proposed. By constructing the simulation scene of the multicast and broadcast services transmission, the scheduling algorithm to guarantee the quality of service QoS (Quality of Service) for real-time multicast services is realized, and the performance is compared with the maximum throughput algorithm and the time delay algorithm. The priority function of the scheduling is defined by analyzing the multi effect factor to guarantee the performance. In the simulation, the performance of the scheduling algorithm is evaluated by analyzing the delay and throughput indicators. The simulation results show that the proposed real-time scheduling algorithm has good delay and throughput performance. It is suitable for the transmission of multimedia services, especially the multicast traffic with higher delay requirements.
Processors are becoming into multicore ones. The same trend is also emerging in embedded systems. More cores on the single chip provide better concurrent of the tasks. However, the task scheduling becomes the new chal...
详细信息
ISBN:
(纸本)9781467371896
Processors are becoming into multicore ones. The same trend is also emerging in embedded systems. More cores on the single chip provide better concurrent of the tasks. However, the task scheduling becomes the new challenge of embedded operating system. It is still an important issue that how the tasks in multicore embedded system can be scheduled efficiently under the condition of ensuring the real-time constraint. When the number of processor cores increases continuously, such situation also relates to task scheduling for efficiency. In this paper, a novel scheduling algorithm is proposed for multicore embedded systems with the satisfied real-time condition. When the number of on-chip cores increase, this algorithm can meet the new requirements. The experimental results show that our algorithm has achieved its target.
Cyber-Physical System (CPS) becomes increasingly popular in recent years. The powerful computation capacity and low network latency of CPS attracts application developers and content providers to offload their computa...
详细信息
ISBN:
(纸本)9781728155050
Cyber-Physical System (CPS) becomes increasingly popular in recent years. The powerful computation capacity and low network latency of CPS attracts application developers and content providers to offload their computationally intensive workloads to CPS servers. In this paper, we propose an intermigration scheduling algorithm to support device mobility for CPS. Our scheduling goal is to maximize the overall throughput of the system as well as support for mobility with low migration cost under the premise of guarantee the real-time requirements of tasks. Many service subscribers of CPS have strong mobility and they will move back and forth between base stations frequently, so the scheduling algorithm must support for mobility. But always migration tasks to the closest base station along with the movement of service subscribers is not a wise idea due to the load imbalance and high migration cost. Thus, it is important to propose a scheduling algorithm that can support for mobility with low migration cost. Also, in experiments, we use thread pool to improve the performance of our system.
暂无评论