With the increasing demand for space service transmission, the satellite network is showing great commercial value. It is significant for LEO satellite network with tens of thousands of satellites to manage and schedu...
详细信息
ISBN:
(纸本)9781728107981
With the increasing demand for space service transmission, the satellite network is showing great commercial value. It is significant for LEO satellite network with tens of thousands of satellites to manage and schedule these resources. In this manuscript, a software defined satellite network (SDSN) architecture named OpenSatNet is designed on the basis of decoupling the data forwarding plane and the control plane in SDN network. Further, we formulate a multi-objective optimization problem considering time intervals, bandwidth, and the hops of each path, which is sloved by the proposed optimized forward scheduling algorithm (OFSA). The experiments are carried by comparing the existed SDRA and DRA with OFSA in terms of the scheduled tasks, success rate of scheduled tasks and transmission delay. The results show the effectiveness of the proposed OFSA.
New Grid and cloud solutions for distributed data mining and data processing are needed for execution of data intensive workflows. In contrast of the standard workflows, in which data between the jobs are exchanged in...
详细信息
ISBN:
(纸本)9781509038435
New Grid and cloud solutions for distributed data mining and data processing are needed for execution of data intensive workflows. In contrast of the standard workflows, in which data between the jobs are exchanged in the form of files and the jobs are finished when they process the input data, data intensive workflows receive data organized in blocks which are streamed on inputs, analyze the data and produce stream output. Each job is active for a long period of time and can receive new data. In our previous research works we proposed the Open Grid Service Architecture for Data Mining (OGSA-DM), which is capable of executing data intensive workflows. According to our analysis, the current algorithms for scheduling workflows can't be applied on data intensive workflows because they produce unsatisfactory results and can't guarantee optimal solution. In this paper we propose new optimization and scheduling algorithm which is developed on the advantages of data intensive workflows. In several experiments we've shown that our proposed algorithm works and gives satisfactory results.
Iterative scheduling algorithms are attractive in finding a maximal size matching for an input-queued switch. For constructing a large high-speed switch, a distributed multi-chip implementation of an iterative schedul...
详细信息
ISBN:
(纸本)9781612842332
Iterative scheduling algorithms are attractive in finding a maximal size matching for an input-queued switch. For constructing a large high-speed switch, a distributed multi-chip implementation of an iterative scheduling algorithm should be followed. Since different chips may locate on different switch linecards and linecards can be separated by tens of meters, the propagation delay between chips/linecards is non-negligible. This calls for a pipelined implementation of a single-iteration scheduling algorithm. To this end, a new packet scheduling algorithm called Distributed Longest Queue First (D-LQF) is proposed in this paper. In D-LQF, exhaustive service policy is adopted for reusing the matched input-output pairs in the previous time slot. This helps to maximize the size of match in each time slot. To avoid incorrectly granting an empty VOQ the chance to send a packet, each output keeps track of the lengths of all VOQs destined to it. As compared with other single-iteration scheduling algorithms, simulation results show that our D-LQF provides the best delay-throughput performance.
Workflows can orchestrate multiple applications that need resources to execute. The cloud computing has emerged as an on-demand resource provisioning paradigm, which can support workflow execution. In recent years, Am...
详细信息
ISBN:
(纸本)9783319269795;9783319269788
Workflows can orchestrate multiple applications that need resources to execute. The cloud computing has emerged as an on-demand resource provisioning paradigm, which can support workflow execution. In recent years, Amazon offers a new service option, i.e., EC2 spot instances, whose price is on average more than 75 % lower than the one of on-demand instances. Therefore, we can make use of spot instances to execute workflows in a cost-efficient way. However, the spot instances is cut off when their price increases and exceeds the customer's bid, which will make the task failed and the execution time becomes unpredictable. We propose a deadline driven scheduling (DDS) algorithm which is able to use both on-demand and spot instances to reduce the cost while the deadline of workflows can also be guaranteed with a high probability. Especially, we use an attribute, called global weight, to represent the interdependency relations of tasks and schedule the tasks whose interdependent tasks need longer time first to reduce the whole execution time. The experimental results demonstrate that DDS algorithm is effective in reducing cost while satisfying the deadline constraints of workflows.
EDF (Earliest Deadline First) has been proved to be optimal scheduling algorithm for single processor real-time operating systems when the systems are preemptive and underloaded. The limitation of this algorithm is, i...
详细信息
ISBN:
(纸本)9781424418220
EDF (Earliest Deadline First) has been proved to be optimal scheduling algorithm for single processor real-time operating systems when the systems are preemptive and underloaded. The limitation of this algorithm is, its performance decreases exponentially when system becomes slightly overloaded. Authors have already proved ability of ACO (Ant Colony Optimization) based scheduling algorithm for real-time operating system which is optimal during underloaded condition and it gives outstanding results in overloaded condition. The limitation of this algorithm is, it takes more time for execution compared to EDF algorithm. In this paper, an adaptive scheduling algorithm is proposed which is combination of both of these algorithms. Basically the new algorithm uses EDF algorithm but when the system becomes overloaded, it will switch to ACO based scheduling algorithm. Again, when the overload disappears, the system will switch to EDF algorithm. Therefore, the proposed algorithm takes the advantages of both algorithms and overcomes the limitations of each other. The proposed algorithm along with EDF algorithm and ACO based scheduling algorithm, is simulated for real-time system and the results are obtained. The performance is measured in terms of Success Ratio and Effective CPU Utilization. Execution Time taken by each scheduling algorithm is also measured. From analysis and experiments it reveals that the proposed algorithm is fast as well as very efficient in both underloaded and overloaded conditions.
Not only the organizations or groups but also the laboratory or the store is in demand of a system with automatic scheduling algorithm. Current automatic scheduling with computer is time consuming. With the goal to de...
详细信息
ISBN:
(纸本)9789811501845;9789811501838
Not only the organizations or groups but also the laboratory or the store is in demand of a system with automatic scheduling algorithm. Current automatic scheduling with computer is time consuming. With the goal to develop an innovative system which can increase the productivity, we finally design an advanced algorithm based on priority and hash map. It firstly provides a method called linear programming (LP) for the problem. Then, we interpret the similar backtracking approaches and compared with another two algorithms. We rebuild their process and design and propose a more efficient and simpler algorithm based on priority and hash. After the development of such a web system, it is proved to be a simple, efficient, and easy-implement method to solve the problem.
Participants in the supply chain may have different information, leading to incomplete or inaccurate information when making decisions. To this end, a process and machine learning based collaborative scheduling algori...
详细信息
ISBN:
(纸本)9798400707032
Participants in the supply chain may have different information, leading to incomplete or inaccurate information when making decisions. To this end, a process and machine learning based collaborative scheduling algorithm for all materials is proposed. Design a health monitoring process for material supply chain based on R-tree dynamic indexing algorithm. Based on this, artificial neural networks in machine learning are applied to mine the data of the entire material supply chain. Through data mining, various data in the supply chain can be integrated and analyzed to improve information transparency and accuracy, and reduce information asymmetry. Adopting a dual layer scheduling model to achieve dual layer collaborative scheduling of materials. The experimental results show that the research method effectively improves the accuracy of data mining in the entire material supply chain, and the utilization rate of materials under this method is always higher than 95%.
Long Term Evolution (LTE) is a main mobile communication technology in the future. For the reason that different kinds of multimedia applications have different quality of service (QoS) requirements, especially for Re...
详细信息
ISBN:
(纸本)9781467391948
Long Term Evolution (LTE) is a main mobile communication technology in the future. For the reason that different kinds of multimedia applications have different quality of service (QoS) requirements, especially for Real Time (RT) traffics, it is necessary to design an effective scheduling algorithm to satisfy the various kinds of QoS needs. In this paper we propose a new scheduling algorithm named DP-VT-MLWDF. The simulation results of the proposed scheduler indicate an evident improvement of the QoS performance parameters for RT traffics, e.g., packet loss rate, average throughput, fairness index.
In the paper, a scheduling algorithm based on the estimation of packet loss amount is proposed for supporting real-time traffic in IEEE 802.22 WRAN systems. The proposed scheduling algorithm takes two steps for resour...
详细信息
ISBN:
(纸本)9783642040191
In the paper, a scheduling algorithm based on the estimation of packet loss amount is proposed for supporting real-time traffic in IEEE 802.22 WRAN systems. The proposed scheduling algorithm takes two steps for resource allocation. In the first step, it assigns resource to users having packets that are estimated to be dropped at next frame. In the second step, it assigns the remaining resource to the other users according to one of the existing scheduling algorithms. The simulation results show that the proposed scheduling algorithm provides Much better performance than the PLFS and M-LWDF algorithm. In addition, a simple calculation method is proposed for the proposed scheme. With the simple method, we can reduce the number of checking packets in the queue as much as about a half time without any performance degradation in the case of video traffic.
In order to analyze and evaluate real-time performance of CAN network, the OPNET models of CAN network with Fixed Priority scheduling (FPS) and Earliest Deadline First (EDF) have been set up in this paper. Based on si...
详细信息
ISBN:
(纸本)9783037853191
In order to analyze and evaluate real-time performance of CAN network, the OPNET models of CAN network with Fixed Priority scheduling (FPS) and Earliest Deadline First (EDF) have been set up in this paper. Based on simulation experiments, the performances of average delay and transmission success ratio in the two models are analyzed and the experiments also indicate that under normal load condition the two scheduling algorithm both can send data frame successfully before the deadline. In a slight overload condition FPS algorithm makes the transmission delay of low priority data frame significantly increased, and even occurs the phenomenon that low priority data frame can not be sent at all times;while the EDF algorithm can make all the nodes to complete the data frames in less than 3ms transmission delay, it meets the delay requirements that are delay should less than 10ms in most control systems, it indicates that EDF algorithm has the better scheduling and availability in soft real-time system.
暂无评论