The Experts below are selected from a list of 127257 Experts worldwide ranked by ideXlab platform
R B Garg - One of the best experts on this subject based on the ideXlab platform.
-
simulation of an optimum multilevel dynamic round robin Scheduling Algorithm
International Journal of Computer Applications, 2013Co-Authors: Neetu Goel, R B GargAbstract:CPU Scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin Algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool “OMDRRS” was utilized to simulate the four Algorithms (FCFS, SJF, ROUND ROBIN & Proposed Dynamic Round Robin Algorithm) utilizing either manual entered process with burst time as well as system generated processes with randomly generated burst time. In order to simulate the behavior of various CPU Scheduling Algorithms and to improve Round Robin Scheduling Algorithm using dynamic time slice concept, in this paper we produce the implementation of new CPU Scheduling Algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling (OMDRRS), which calculates intelligent time slice and warps after every round of execution. The results display the robustness of this software, especially for academic, research and experimental use, as well as proving the desirability and efficiency of the probabilistic Algorithm over the other existing techniques and it is observed that this OMDRRS projects good performance as compared to the other existing CPU Scheduling Algorithms.
-
an optimum multilevel dynamic round robin Scheduling Algorithm
arXiv: Operating Systems, 2013Co-Authors: Neetu Goel, R B GargAbstract:The main objective of this paper is to improve the Round Robin Scheduling Algorithm using the dynamic time slice concept. CPU Scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. CPU Scheduling has strong effect on resource utilization as well as overall performance of the system. Round Robin Algorithm performs optimally in time-shared systems, but it is not suitable for soft real time systems, because it gives more number of context switches, larger waiting time and larger response time. In this paper, a new CPU Scheduling Algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling Algorithm is proposed, which calculates intelligent time slice and changes after every round of execution. The suggested Algorithm was evaluated on some CPU Scheduling objectives and it was observed that this Algorithm gave good performance as compared to the other existing CPU Scheduling Algorithms.
Gui Xian-zhou - One of the best experts on this subject based on the ideXlab platform.
-
Schedulability Analysis and Simulation for Rate-Monotonic Scheduling Algorithm
Computer Simulation, 2006Co-Authors: Gui Xian-zhouAbstract:The rate-monotonic Scheduling Algorithm is a classic Scheduling Algorithm for periodic tasks. It is necessary to analyse and simulate the schedulability of rate-monotonic Scheduling Algorithm before using it. The article introduces the Scheduling discipline of rate-monotonic Scheduling Algorithm and the necessary and sufficient conditions for RM-schedulability, simulates on schedulability of rate-monotonic Scheduling Algorithm through multi-thread method of Windows and RMS manager of real-time operating system SACOS, analyses the simulation results. The two methods provide useful guidance for the schedulability analysis for rate-monotonic Scheduling Algorithm.
Jiajia Chen - One of the best experts on this subject based on the ideXlab platform.
-
Efficient and fine Scheduling Algorithm for bandwidth allocation in ethernet passive optical networks
IEEE Journal of Selected Topics in Quantum Electronics, 2006Co-Authors: Biao Chen, Jiajia ChenAbstract:A novel fine Scheduling Algorithm is introduced for upstream bandwidth allocation in an Ethernet-based passive optical network. This Scheduling Algorithm consists of an inter optical network unit (ONU) scheduler at the optical line terminal (OLT) and an intra-ONU scheduler at each ONU. In the inter-ONU Scheduling, a novel GATE/REPORT approach is introduced to eliminate the unused remainders without transmission delay and maximize the utilization of bandwidth. Our novel intra-ONU scheduler gives fair bandwidth allocation to the queues of different priorities for each user in a hierarchical and decentralized way. Numerical results have shown that our overall Scheduling Algorithm can fulfill various requirements of delay and throughput for the transmission of multimedia traffic for each end user
Ruay-shiung Chang - One of the best experts on this subject based on the ideXlab platform.
-
A green energy-efficient Scheduling Algorithm using the DVFS technique for cloud datacenters
Future Generation Computer Systems, 2014Co-Authors: Ruay-shiung Chang, Hsin-yu ChanAbstract:Abstract Information and communication technology (ICT) has a profound impact on environment because of its large amount of CO2 emissions. In the past years, the research field of “green” and low power consumption networking infrastructures is of great importance for both service/network providers and equipment manufacturers. An emerging technology called Cloud computing can increase the utilization and efficiency of hardware equipment. The job scheduler is needed by a cloud datacenter to arrange resources for executing jobs. In this paper, we propose a Scheduling Algorithm for the cloud datacenter with a dynamic voltage frequency scaling technique. Our Scheduling Algorithm can efficiently increase resource utilization; hence, it can decrease the energy consumption for executing jobs. Experimental results show that our scheme can reduce more energy consumption than other schemes do. The performance of executing jobs is not sacrificed in our scheme. We provide a green energy-efficient Scheduling Algorithm using the DVFS technique for Cloud computing datacenters.
-
an adaptive scoring job Scheduling Algorithm for grid computing
Information Sciences, 2012Co-Authors: Ruay-shiung ChangAbstract:When human culture advances, current problems in science and engineering become more complicated and need more computing power to tackle and analyze. A supercomputer is not the only choice for solving complex problems any more as a result of the speed-up of personal computers and networks. Grid technology, which connects a number of personal computer clusters with high speed networks, can achieve the same computing power as a supercomputer does, also with a lower cost. However, grid is a heterogeneous system. Scheduling independent tasks on it is more complicated. In order to utilize the power of grid completely, we need an efficient job Scheduling Algorithm to assign jobs to resources in a grid. In this paper, we propose an Adaptive Scoring Job Scheduling Algorithm (ASJS) for the grid environment. Compared to other methods, it can decrease the completion time of submitted jobs, which may compose of computing-intensive jobs and data-intensive jobs.
Neetu Goel - One of the best experts on this subject based on the ideXlab platform.
-
simulation of an optimum multilevel dynamic round robin Scheduling Algorithm
International Journal of Computer Applications, 2013Co-Authors: Neetu Goel, R B GargAbstract:CPU Scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin Algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool “OMDRRS” was utilized to simulate the four Algorithms (FCFS, SJF, ROUND ROBIN & Proposed Dynamic Round Robin Algorithm) utilizing either manual entered process with burst time as well as system generated processes with randomly generated burst time. In order to simulate the behavior of various CPU Scheduling Algorithms and to improve Round Robin Scheduling Algorithm using dynamic time slice concept, in this paper we produce the implementation of new CPU Scheduling Algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling (OMDRRS), which calculates intelligent time slice and warps after every round of execution. The results display the robustness of this software, especially for academic, research and experimental use, as well as proving the desirability and efficiency of the probabilistic Algorithm over the other existing techniques and it is observed that this OMDRRS projects good performance as compared to the other existing CPU Scheduling Algorithms.
-
an optimum multilevel dynamic round robin Scheduling Algorithm
arXiv: Operating Systems, 2013Co-Authors: Neetu Goel, R B GargAbstract:The main objective of this paper is to improve the Round Robin Scheduling Algorithm using the dynamic time slice concept. CPU Scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. CPU Scheduling has strong effect on resource utilization as well as overall performance of the system. Round Robin Algorithm performs optimally in time-shared systems, but it is not suitable for soft real time systems, because it gives more number of context switches, larger waiting time and larger response time. In this paper, a new CPU Scheduling Algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling Algorithm is proposed, which calculates intelligent time slice and changes after every round of execution. The suggested Algorithm was evaluated on some CPU Scheduling objectives and it was observed that this Algorithm gave good performance as compared to the other existing CPU Scheduling Algorithms.
