For great change of service time for request,big difference of hardware and software server and different network performance,this paper proposes a dynamic-feedback algorithm based on AHP in the course of studying the...
详细信息
For great change of service time for request,big difference of hardware and software server and different network performance,this paper proposes a dynamic-feedback algorithm based on AHP in the course of studying the algorithm of load balancing in the cluster-based system. Combined with Weighted scheduling algorithm of the kernel, based on the parameters influencing the performance of cluster system from dynamic feedback,we can adjust the servers'weight,solve the load imbalance problem among the servers effectively and certainly improve the throughput of the whole system.
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.
Cloud Computing is a recent developmental paradigm in the field of computing offering huge power to next generation computers. The dynamic provisioning acts as a base for cloud computing facilitating and supporting th...
详细信息
Cloud Computing is a recent developmental paradigm in the field of computing offering huge power to next generation computers. The dynamic provisioning acts as a base for cloud computing facilitating and supporting the network services. It focuses on making the vision of utility computing a reality with pay-as-you-go. It offers immense potential to bloom the world with applications and products focussing on greater resource utilization and scalability. This paper presents the basic cloud computing fundamentals and the concepts of load balancing i.e., scheduling of load in the cloud. It elaborates the existing load scheduling algorithms with their merits/demerits and suitability in the cloud and heterogeneous computing environment and proposes a new perspective for better results as per desired parameters.
Efficient workflow scheduling algorithms are crucial for attaining high performance in large-scale heterogeneous distributed infrastructures, such as cloud computing. List scheduling algorithms are one of the most eff...
详细信息
ISBN:
(数字)9781728160955
ISBN:
(纸本)9781728196497
Efficient workflow scheduling algorithms are crucial for attaining high performance in large-scale heterogeneous distributed infrastructures, such as cloud computing. List scheduling algorithms are one of the most efficient heuristic methods for assigning task graphs to fully connected heterogeneous systems. However, most existing list-based scheduling algorithms do not consider the applications' security requirements and the security services offered by cloud providers. In this paper, we extend four list scheduling algorithms for security-aware workflow scheduling in the IaaS cloud. The idea of the extension is to consider the security overheads in both tasks prioritizing phase and virtual machine selection phase of the four original algorithms. Based on real-world applications, we evaluate the performance of the proposed algorithms in terms of scheduling length, speedup and efficiency.
This paper discusses the synthesis and implementation of various scheduling algorithms for Network-on-Chip communication. Traditionally these scheduling algorithms were implemented on ASIC platforms generally for shar...
详细信息
This paper discusses the synthesis and implementation of various scheduling algorithms for Network-on-Chip communication. Traditionally these scheduling algorithms were implemented on ASIC platforms generally for shared bus based interconnection systems. In this paper we carry a comparative analysis by synthesizing and implementing various scheduling algorithms for configuring the crossbar in input queued switches. The implementation is carried out using various arbitration networks responsible for scheduling 8-bit input requests. The implementation targets Spartan6 FPGA family. The analysis concludes that the scheduling algorithm based on CLA based encoding network shows lower power delay product and lower area delay product and a reasonably lower resource utilization when implemented for speed optimization goal.
In recent years, a suite of Glauber dynamics-based CSMA algorithms have attracted great attention due to their simple, distributed implementations with guaranteed throughput-optimality. However, these algorithms often...
详细信息
ISBN:
(纸本)9781467399548
In recent years, a suite of Glauber dynamics-based CSMA algorithms have attracted great attention due to their simple, distributed implementations with guaranteed throughput-optimality. However, these algorithms often suffer from poor delay performance and the starvation problem. Among several attempts to improve the delay performance, a remarkable improvement has recently been made in a class of CSMA algorithms that utilize multiple instances of the algorithm (or Markov chains). In this paper, we develop a new approach via an antithetic coupling (AC) method, which can further improve the delay performance of those that virtually emulate multiple chains. The key enabler of utilizing AC method lies in our skilful choice of manipulating the driving sequences of random variables that govern the evolution of schedule instances, in such a way that those multiple instances of chains become negatively correlated as oppose to having them run independently. This contributes faster change of the link state, rendering it more like a periodic process and thus leading to better queueing performance. We rigorously establish an ordering relationship for the effective bandwidth of each net-input process to the queue, between our proposed algorithm (AC-CSMA) and other state-of-the-art existing algorithms in the literature, under a mild set of assumptions. The proposed algorithm involves very simple modification onto existing CSMA-based algorithms, and can be implemented in a fully distributed manner without any additional message overhead. Our extensive simulation results also confirm that AC-CSMA always delivers better queueing performance over a variety of network scenarios.
In this paper, we study the performance of some of the key scheduling algorithms such as Proportional Fair Scheduler, Modified Longest Weighted Delay First and Exponential Rule. We also propose a new algorithm called ...
详细信息
In this paper, we study the performance of some of the key scheduling algorithms such as Proportional Fair Scheduler, Modified Longest Weighted Delay First and Exponential Rule. We also propose a new algorithm called EXPQW, a variant of the Exponential rule which assigns weights to the subscriber stations based on their queue length and waiting time thereby ensuring fairness and quality of service for non-real time applications. We also present three hierarchical schedulers which use a combination of the exponential rule for waiting time and queue-length and other scheduling rules. The algorithms have been implemented in OPNET Modeler 16. The scenarios studied are: the baseline configuration specified by the 802.16m Evaluation Methodology Document with up to 60 users in a service region and a saturated frame scenario with up to 120 users. The results indicate that EXPQW and the hierarchical schedulers have comparable throughput and fairness values with algorithms like Proportional Fair Scheduler and Modified Longest Weighted Delay First in moderately loaded and heavily loaded scenarios.
Wireless Sensor Network (WSN), a network of randomly distributed unreliable sensor nodes, is a new genesis of Real-Time Embedded Systems that has become a big research area. Since the basic component of WSN i.e. senso...
详细信息
ISBN:
(纸本)9781538684931
Wireless Sensor Network (WSN), a network of randomly distributed unreliable sensor nodes, is a new genesis of Real-Time Embedded Systems that has become a big research area. Since the basic component of WSN i.e. sensor nodes have reduced energy, energy has become an important issue for WSNs with ascending applications. scheduling, one of the resource constraints of WSN, is an important WSN parameter that reduces energy usage, delay, improves network lifetime and also the fair transmission of all data packets. Hence, it is important that we study all the scheduling schemes. This paper explores the different types scheduling algorithms of WSN. A Comparative Analysis of the scheduling algorithms has also been done.
暂无评论