Traditional scheduling algorithms typically aim to minimize the total time cost for processing all tasks. However, in cloud computing environments, computing capability differs for different resources, and so does the...
详细信息
Traditional scheduling algorithms typically aim to minimize the total time cost for processing all tasks. However, in cloud computing environments, computing capability differs for different resources, and so does the cost of resource usage. Therefore, it is vital to take into consideration the usage cost of resources. Along this line, in this paper, we proposed a modified algorithm based on PSO to solve the task scheduling problem in cloud computing environments. Specifically, by adding a cost-aware fitness function to quantify the cost of resource usage, along with the fitness function for time cost, our method can achieve the goal of minimizing both the processing time and resource usage, and therefore reach a global optimal solution. Besides, our experiment on a simulated cloud computing environment proves the efficiency of our proposed algorithm.
Heterogeneous multi-core systems are widely used in various real-time scheduling systems because of their high performance and low energy consumption. With the continuous progress of integrated circuit process technol...
详细信息
ISBN:
(纸本)9789819723027;9789819723034
Heterogeneous multi-core systems are widely used in various real-time scheduling systems because of their high performance and low energy consumption. With the continuous progress of integrated circuit process technology, heterogeneous multi-core real-time systems have improved the power density of processors and the sensitivity of circuits, but they also lead to an increasing probability of system failure, and it is an important and difficult problem to improve the reliability of the whole system and ensure the normal operation of the system. In this paper, we propose the reliability algorithm BFSA (Backward-Forward scheduling algorithm), which aims to maximize the reliability of the system under the condition of satisfying the real-time constraint. The BFSA scheduling algorithm schedules tasks backward and forward after one copyless scheduling according to the deadline to obtain the final result of scheduling. The experimental results show that this algorithm maximizes the reliability of BFSA under different different constraints of three categories of real-time conditions, which effectively improves the reliability of the system.
'Virtual kanban (VK) system' is presented as a scheduling method of pull-type. VK system is applicable to custom-made products in a large-scale and complex factory with multi-stage production system, such as a...
详细信息
'Virtual kanban (VK) system' is presented as a scheduling method of pull-type. VK system is applicable to custom-made products in a large-scale and complex factory with multi-stage production system, such as an application specific integrated circuit (ASIC) manufacturing facility. In the factory, any scheduling method of push-type can hardly improve the production rate without increase of stocks of intermediates. For products whose specifications are known before their orders, a scheduling method of pull-type named kanban system has been developed and succeeded to improve the production rate without increase of stocks of intermediates. Kanban system, however, is not applicable to custom-made products whose specifications are not known before their orders. Furthermore, the effect of processing many lots at a single step simultaneously is not investigated. The simulation of ASIC manufacturing facility demonstrates the usefulness of VK system, and the effect of processing many lots at a single step simultaneously. (C) 2000 Elsevier Science Ltd. All rights reserved.
This study investigates a time-dependent scheduling method for solving the problem of mass scheduling in single-machine task planning. A number of inverse scheduling problems are examined. First, the inverse schedulin...
详细信息
This study investigates a time-dependent scheduling method for solving the problem of mass scheduling in single-machine task planning. A number of inverse scheduling problems are examined. First, the inverse scheduling problem with maximum tardiness objective on single machines is investigated. Then, the inverse scheduling problem of the total weighted completion time problem with unit processing time on identical parallel machines is explored. Finally, the inverse scheduling problem of the total completion time objective on identical parallel machines is studied. The necessary and sufficient conditions for optimality of the maximum tardiness problem on single machines are determined, and the mathematical formulations of inverse scheduling problems and methods for solving these problems are established. The formulations for the optimal solutions of inverse scheduling problems under special conditions are also developed. Experimental results show that the proposed method can substantially improve the performance.
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.
Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a set of heterogeneous machines is known to be an NP-hard problem. In this study, we present a dup...
详细信息
ISBN:
(纸本)0769516777
Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a set of heterogeneous machines is known to be an NP-hard problem. In this study, we present a duplication based scheduling algorithm, namely the levelized duplication based scheduling (LDBS) algorithm, which solves this problem efficiently. The primary goal of LDBS is to minimize the schedule length of applications. LDBS can accommodate different duplication heuristics, thanks to its modular design. Specifically, we have designed two different duplication heuristics with different time complexities. The simulation studies confirm that LDBS is a very competitive scheduling algorithm in terms of minimizing the schedule length of applications.
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.
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.
暂无评论