The paper mainly researches on service scheduling algorithms for IEEE 802.16. Firstly, the paper researches the QoS mechanism of MAC from two sides, the management of service flow and QoS guarantee. The improved cross...
详细信息
ISBN:
(纸本)9781467360791;9781467360777
The paper mainly researches on service scheduling algorithms for IEEE 802.16. Firstly, the paper researches the QoS mechanism of MAC from two sides, the management of service flow and QoS guarantee. The improved cross layer QoS framework is proposed for the shortcomings of the existing QoS framework. Secondly, service scheduling algorithms are also one of the key parts to realize QoS. The paper mainly studies and compares the generic scheduling algorithms used in wired and wireless network. Aiming at the shortcomings of RR and MAX C/I algorithms, the improved MAX C/I algorithm is proposed to get the balance of fairness and throughput. Finally, the matlab simulation platform is constructed to evaluate the performance of the improved MAX C/I and the class-based scheduling scheme. The simulation results show that the scheme satisfies the QoS requirement of every service and improves the fairness of the users and system throughput.
scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (...
详细信息
ISBN:
(纸本)0769517900;0769517919
scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (DFG) structure to guide the scheduler to find near-optimal/optimal schedules quickly. We have developed a novel approach based on DFG analysis that is totally done as preparation phase. This DFG analysis information includes: every node knows its successor and its predecessor, total number of successors, and the tree which it belongs to, where trees are constructed from every output operation from the constructed DFG. Incorporating this knowledge in the priority functions of the scheduler guided the scheduler to make the correct choice of the perfect operation to be scheduled next.
In this paper, a novel heuristic scheduling algorithm is proposed to solve the problem of product-conversion in semiconductor assembly and test manufacturing (ATM) system. The phenomenon of product-conversion is frequ...
详细信息
ISBN:
(纸本)9781467329453
In this paper, a novel heuristic scheduling algorithm is proposed to solve the problem of product-conversion in semiconductor assembly and test manufacturing (ATM) system. The phenomenon of product-conversion is frequent and takes a lot of time in ATM enterprise. In order to reduce the frequency of product-conversion and minimize the conversion time in product-conversion station, the novel algorithm has predicted and limited the number of the permissible assigned machines for each type of products according to the processing conditions before scheduling;and takes processing conditions as the priority principle of assignment in the follow-up process;in addition, the algorithm sets up a decision-making mechanism when the machine should convert the product. Finally, comparing the algorithm with two traditional methods, the results show that the scheduling using the novel algorithm has an obvious advantage, it improves the utilization rate of equipment and productiveness.
Operating system scheduling algorithm is the core of modern operating system to realize multi-task function. For battery-powered embedded devices, low-energy consumption is a key design index. The research on embedded...
详细信息
Operating system scheduling algorithm is the core of modern operating system to realize multi-task function. For battery-powered embedded devices, low-energy consumption is a key design index. The research on embedded low-energy consumption has broad application prospects and important application value, which has gradually attracted great attention from industry and academia. This paper studies the energy-saving scheduling problem of embedded systems. Aiming at the periodic tasks with strict execution time limit in embedded system, four energy-saving scheduling algorithms are proposed. For wireless sensor networks, a three-dimensional K virtual fence coverage energy-saving scheduling algorithm is proposed. Through theoretical analysis and specific experiments, this method reduces the missed rate of task deadline, improves CPU utilization, can schedule real-time tasks more effectively, and has been well applied in wireless broadband mobile computing. According to the real-time requirements of embedded operating system, this paper studies several classical real-time scheduling algorithms, and analyzes the specific principles, and advantages and disadvantages of each algorithm. On the premise that high priority tasks are executed first, tasks with high importance and not executed which can preempt the current task if and only when the margin is zero.
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 downlink scheduling algorithm for devices (sensors and actuators) that use periodic network resources. This algorithm will aim at reducing 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.
The previous works about MapReduce task scheduling with deadline constraints neither take the diffenences of Map and Reduce task, nor the cluster's heterogeneity into account. This paper proposes an extensional Ma...
详细信息
ISBN:
(纸本)9780769546766
The previous works about MapReduce task scheduling with deadline constraints neither take the diffenences of Map and Reduce task, nor the cluster's heterogeneity into account. This paper proposes an extensional MapReduce Task scheduling algorithm for Deadline constraints in Hadoop platform: MTSD. It allows user specify a job's deadline and tries to make the job be finished before the deadline. Through measuring the node's computing capacity, a node classification algorithm is proposed in MTSD. This algorithm classifies the nodes into several levels in heterogeneous clusters. Under this algorithm, we firstly illuminate a novel data distribution model which distributes data according to the node's capacity level respectively. The experiments show that the data locality is improved about 57%. Secondly, we calculate the task's average completion time which is based on the node level. It improves the precision of task's remaining time evaluation. Finally, MTSD provides a mechanism to decide which job's task should be scheduled by calculating the Map and Reduce task slot requirements.
Input-buffering is preferentially used in high-speed commercial and experimental routers and switches. The cell scheduling algorithms are critical components in input-buffered *** have a significant impact on the thro...
详细信息
ISBN:
(纸本)0780363949
Input-buffering is preferentially used in high-speed commercial and experimental routers and switches. The cell scheduling algorithms are critical components in input-buffered *** have a significant impact on the throughput,stability and guaranteed quality of service(QOS) of input buffered *** Longest Queue First(LQF) algorithm can achieve 100%throughput for input-buffered switches,but is not starvation *** is,there are some queues will never be *** paper proposes a modified LQF algorithm called *** can achieve 100%throughput and is starvation free.
Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of re...
详细信息
ISBN:
(纸本)9783037850817
Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of real-time operating systems become an important measure to determine the real-time capability of a system. In this paper, we discuss the dynamic priority scheduling algorithm Priority Inheritance scheduling algorithm. Then we analyze the algorithm from two aspects: description and schedulability.
Multimedia data services are supported in a variety of wireless and mobile networks. The primary weakness of wireless network is the bandwidth scarcity due to the characteristics of channel state such as mobility of u...
详细信息
ISBN:
(纸本)7900081585
Multimedia data services are supported in a variety of wireless and mobile networks. The primary weakness of wireless network is the bandwidth scarcity due to the characteristics of channel state such as mobility of users, mufti-path fading and shadowing. Indeed, efficient data scheduling is required to avoid the restriction of the data transmission. In order to support optimal throughput in HDR(High Data Rate), transmitting data rate is changed according to the channel state at each time slot. Even in HDR, it is necessary to satisfy for mufti-user QoS because the required QoS(Quality of Service) of users is different to applications of users. In this paper, we propose a new scheduling algorithm named WGF(Weight-Gap First) scheduling in HDR. Weights are allocated dynamically by requested bandwidth of mobile users. A dynamic weight allocation supports feasible data rate and good performance. Therefore, each mobile user can provide necessary bandwidth for guaranteeing QoS efficiently. From the simulation study, we show that the WGF supports feasible data rate to the mobile user and efficient allocation of bandwidth.
A scientific workflow is modeled as a Directed Acyclic Graph where the nodes represent individual tasks and the directed edges represent the dependency relationship between two tasks. scheduling a workflow to achieve ...
详细信息
ISBN:
(纸本)9783031248474;9783031248481
A scientific workflow is modeled as a Directed Acyclic Graph where the nodes represent individual tasks and the directed edges represent the dependency relationship between two tasks. scheduling a workflow to achieve certain goal(s) (e.g.;minimize makespan, cost, penalty, and energy;maximize reliability, processor utilization, etc.) remains an active area of research. In this paper, we propose an efficient scheduling algorithm for workflows in heterogeneous multi-processor systems that takes into account makespan, energy consumption, and reliability. We name our methodology as Wait Aware Normalized Metric scheduling (henceforth mentioned as WANMS). The proposed approach is a list scheduling algorithm consisting of two phases namely, Task Ordering and Allocation. In the task ordering phase, it tries to find out an optimal ordering of the tasks based on the maximum execution cost starting from the current node. In the allocation phase, a task is assigned to a processor based on a normalized linear combination of finish time of the tasks and reliability or based on energy depending on the wait time of the task. Additionally, WANMS is designed in such a way so that it can satisfy any given reliability constraint while minimizing makespan and energy. The proposed algorithm has been analyzed to understand its time and space requirements. Experimental evaluations on the real-world and randomly generated workflows show that WANMS dominates state-of-the-art algorithms in terms of both makespan and energy in most cases and at least one objective in the rest of the cases. In particular, we observe that for high reliability constraints the schedule produced by WANMS algorithm leads to up to 18% improvement in makespan and 13% improvement in energy on an average compared to the existing algorithms.
暂无评论