Resource scheduling has always been a hot and difficult problem in systems engineering and management at home and abroad, and it is also very important in the research of satellite earth station system. Due to the lim...
详细信息
ISBN:
(数字)9781728180281
ISBN:
(纸本)9781728180298
Resource scheduling has always been a hot and difficult problem in systems engineering and management at home and abroad, and it is also very important in the research of satellite earth station system. Due to the limited resources in the satellite earth station system, the rationality of resource allocation directly affects the overall performance of the multi-satellite system. The resource scheduling problem of satellite earth station is a combinatorial optimization problem based on *** paper summarizes the existing resource scheduling model and scheduling algorithm of satellite earth station system, and provides reference for the further research and development of this field.
Cloud computing is a new paradigm in computing that enables the availability of various resources at one place on the user's demand. In cloud computing, a cloud is a unit containing various resources like hardware...
详细信息
ISBN:
(纸本)9781665447874
Cloud computing is a new paradigm in computing that enables the availability of various resources at one place on the user's demand. In cloud computing, a cloud is a unit containing various resources like hardware, software, etc. In contrast, computing refers to the way or mechanism to access the available resources from the cloud. Numerous challenges such as cloud security, performance, task scheduling etc., are observed during the adaption of cloud computing. Task scheduling aims at the optimized resource allocation to the various tasks. The performance of any system is directly dependent on the scheduling process. More effective task scheduling will undoubtedly lead to the high performance of the system. This paper highlights the various task scheduling algorithms and their advantages and disadvantages in the cloud environment. Further, A novel effort is made to categorize existing task scheduling algorithms based on their working concepts.
Modern GPGPUs (General-Purpose Graphics Processing Units) have the ability of executing thousands of threads simultaneously. However, the resource utilization of GPGPU in real systems is limited as the load balancing ...
详细信息
ISBN:
(纸本)9781665495530
Modern GPGPUs (General-Purpose Graphics Processing Units) have the ability of executing thousands of threads simultaneously. However, the resource utilization of GPGPU in real systems is limited as the load balancing between SMs (Stream Multiprocessors) is difficult during the scheduling of thread blocks, which are the basic units for resource allocation in GPGPU. In order to schedule thread blocks in GPGPU, the current hardware scheduler allocates thread blocks to SMs by the Round-Robin order. Although this is simple and easy to implement, we show that Round-Robin is not efficient when thread blocks of heterogeneous workloads are mixed. In such environments, efficient resource sharing in GPGPU is challenging as workloads have different resource usage patterns, but scheduling should be performed instantly. In this paper, we present a new thread block scheduling algorithm that has the ability of analyzing the load of SMs and the characteristics of pending thread blocks. Specifically, we formulate thread block scheduling as a bin-packing problem, and aim to minimize the internal fragmentation of SMs by arranging size-aware filling of thread blocks to overall SMs in advance. To do so, we make use of multiple queues for incoming thread blocks according to their sizes and perform scheduling by considering the load balancing of SMs. Our experimental results under a wide range of workload conditions show that the proposed algorithm improves the performance of GPGPU by 24.8% on average compared to the Round-Robin scheduler.
This paper presents an efficient algorithm for scheduling vaccination process which is based on the CPU scheduling algorithms of an operating system. Based on a custom-designed scoring system of the given schedule, an...
详细信息
ISBN:
(纸本)9781665442121
This paper presents an efficient algorithm for scheduling vaccination process which is based on the CPU scheduling algorithms of an operating system. Based on a custom-designed scoring system of the given schedule, an analysis of why the first-come, first-served basis of scheduling vaccines is inefficient. The ranking system is based on the concept that health care personnel should be given higher priority, followed by front-line workers, major healthcare patients, elderly people, and finally the general public. This is the category in the dataset, the higher the importance of the person who needs to be vaccinated, the better the score. Different CPU scheduling methods are analyzed based on Arrival Time, Turn Around Time, Waiting Time, and Response Time. We obtain the resultant schedule after providing the dataset, the number of vaccines per day, and the selected algorithm for scheduling, and we get a customized schedule based on the data by entering the Aadhar number. The FCFS and Priority algorithms were compared to visualize the differences in efficiency for both algorithms, as well as an analysis of how many vaccines to choose per day and the related length of schedule in days.
The cloud based innovative applications are increasing regularly and hence the data and job load also increasing proportionally. Cloud based service providers are also increasing their infrastructure and service facil...
详细信息
ISBN:
(纸本)9781665439718
The cloud based innovative applications are increasing regularly and hence the data and job load also increasing proportionally. Cloud based service providers are also increasing their infrastructure and service facility to serve in a much better way to its clients. The job processing load will also increase the waiting time and hence affect the service response time at user’s end. So, it is always a matter of great importance that which job scheduling algorithm should be applied to serve the client in an efficient manner. This is the main motivation for framing this research paper. In this paper, we are taking the main five heuristic job scheduling algorithms like FCFS (First Come First Server), SJF (Shortest Job First), MaxMin, MinMin, and Saffrage for analyzing on the pre-decided cloud infrastructure. Among these heuristic algorithm, MaxMin algorithm outperforms than others in all the test cases i.e. with the cloudlet load of 100, 200, 300, …, 1000 cloudlets. Hence we can say that the MaxMin is the best scheduling algorithm among these five heuristic job scheduling algorithms.
More and more mobile applications rely on the combination of both mobile and cloud computing technology to bring out their full potential. The cloud is usually used for providing additional computing resources that ca...
详细信息
More and more mobile applications rely on the combination of both mobile and cloud computing technology to bring out their full potential. The cloud is usually used for providing additional computing resources that cannot be handled efficiently by the mobile devices. Cloud usage, however, results in several challenges related to the management of virtualized resources. A large number of scheduling algorithms are proposed to balance between performance and cost of data center. Due to huge cost and time consuming of measure-based and simulation method, this paper proposes an adaptive method to evaluate scheduling algorithms. In this method, the virtual machine placement and migration process are modeled by using Stochastic Reward Nets. Different scheduling methods are described as reward functions to perform the adaptive evaluation. Two types of performance metrics are also discussed: one is about quality of service, such as system availability, mean waiting time, and mean service time, and the other is the cost of runtime, such as energy consumption and cost of migration. Compared to a simulation method, the analysis model in this paper only modifies the reward function for different scheduling algorithms and does not need to reconstruct the process. The numeric results suggest that it also has a good accuracy and can quantify the infiuence of scheduling algorithms on both quality of service and cost of runtime.
Currently, a new type of wireless sensor network (WSN) named as battery-free network (BF-WSN), has been proposed and widely studied. Compared with traditional battery-powered WSN (BP-WSN), nodes in BF-WSN can harvest ...
详细信息
ISBN:
(纸本)9781728146010
Currently, a new type of wireless sensor network (WSN) named as battery-free network (BF-WSN), has been proposed and widely studied. Compared with traditional battery-powered WSN (BP-WSN), nodes in BF-WSN can harvest energy from ambient environment, prolonging the lifetime of the network greatly. Multicast is an important way for data dissemination in WSNs. The problem of minimum latency multicast scheduling (MLMS) that seeks a fast schedule without collision for data multicast has been studied extensively in BP-WSNs. However, existing algorithms are not suitable in BF-WSNs. In this paper we study the MLMS problem in BF-WSNs (BF-MLMS). To reduce latency, we investigate how to compute the end-to-end transmission delay. By considering both energy supply and collision, we propose centralized and distributed algorithms for constructing collision-free multicast trees in BF-WSNs. To the best of our knowledge, this is the first work to consider the BF-MLMS problem. Simulation results verify our protocols have high performance in terms of multicast latency and message volume.
This paper focuses on researching and visualizing the differences of the quality of network connections between several network applications using popular scheduling algorithms. The aim of this work is to examine and ...
详细信息
ISBN:
(纸本)9781510630666
This paper focuses on researching and visualizing the differences of the quality of network connections between several network applications using popular scheduling algorithms. The aim of this work is to examine and compare the impact of application of scheduling algorithms for FIFO, DWRR, WFQ, PQ packets in IPv4 and IPv6 networks on the quality of data transmission. Using Riverbed Modeler Academic Edition version 17.5 software there was developed 10 research scenarios with different scheduling algorithms and IP protocols implemented on routers. Scenarios based on IP protocols in the fourth and sixth versions with implemented FIFO, PQ, DWRR and WFQ scheduling algorithms has been developed. Each scenario includes the operation of real-time VoIP and video conferencing applications as well as HTTP, FTP and e-mail applications. The research showed that there are significant differences in the quality of packet transmission of the tested applications using different configurations of the scheduling algorithms and network protocols.
LoRa-based transmissions suffer from extensive collisions due to the ALOHA-style transmission policy. As a consequence, delivering a high number of packets in a short amount of time becomes an unfeasible task. To tack...
详细信息
ISBN:
(纸本)9781538649800
LoRa-based transmissions suffer from extensive collisions due to the ALOHA-style transmission policy. As a consequence, delivering a high number of packets in a short amount of time becomes an unfeasible task. To tackle this problem we propose to schedule node transmissions in slots of different size depending on the Spreading Factor (SF). Transmissions with the same SF are scheduled in different slots to avoid collisions while those with different SF can occur in parallel. In this paper, we propose two algorithms executed in an offline manner to allocate SFs to nodes aimed at minimising the total data collection time while respecting the radio duty cycle restriction. The examined simulation scenarios and our comparison with LoRaWAN show an up to 101% improvement in terms of data collection time and an up to 250% improvement in terms of energy consumption combined with a nearly 100% packet delivery ratio.
The possibility of providing mobile devices with fast and affordable Cloud computing (CC) services is a major motivation for Cloudlet technology. However, for this happen, a suitable scheduling algorithm that minimize...
详细信息
ISBN:
(纸本)9781728132891
The possibility of providing mobile devices with fast and affordable Cloud computing (CC) services is a major motivation for Cloudlet technology. However, for this happen, a suitable scheduling algorithm that minimizes the consumer's (i.e. Mobile devices) waiting time under various Cloudlet scenarios needs to be determined. Hence, determining the suitability of a scheduling algorithm with respect to consumer's waiting time is the main objective of this study. To this end, we first present a brief review of existing scheduling algorithms as a road map towards evaluating the performance of each algorithm. Next, we present the performance evaluation of three popular scheduling algorithms under various Cloudlet scenarios. Specifically, an EdgeCloudSim simulator is used to evaluate the performance of MM1, Priority (PR) and Round Robin (RR) with respect to consumer's waiting time. Results gotten from the simulation show a noticeable difference in the performance of scheduling algorithms for different mobile applications as the number of mobile devices fluctuates.
暂无评论