The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there a...
详细信息
The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective roundrobin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.
Central Processing Unit (CPU) scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. Several scheduling algorithms have been designed to arrange acc...
详细信息
Central Processing Unit (CPU) scheduling involves a careful examination of pending processes to determine the most efficient way to service the requests. Several scheduling algorithms have been designed to arrange accesses to computer resources efficiently. roundrobin scheduling algorithm (RRSA) is an attractive algorithm but suffers from the problem of time quantum determination. In the classical round robin algorithm, quantum time is fixed throughout the scheduling process. This static nature made it very difficult to optimize the algorithm. The only solution to this problem is to provide a quantum time that changes dynamically during execution. Major challenges of dynamic roundrobin schedulers reported in the literature are: they do not include Average Response Time as a criterion for comparison and they do not bother much on preempting processes with negligible completion time after executing for a given time quantum leading to an increase in the number of context switches. This research proposed an algorithm, the Modified Median roundrobin (MMRRA), with a dynamic time quantum aimed at reducing the overhead of the RRSA. The proposed algorithm was implemented and evaluated against the following five algorithms in the literature: Improved roundrobin (IRR), Improved Mean roundrobin with Shortest Job First (IMRRSJF), Dynamic roundrobin with Controlled Preemption (DRRCP), Half Life Variable Quantum Time RR (HLVQTRR) and CLASSICAL RR. Which in turns, proved to perform better in terms of AWT, ATAT and NCS. But, in terms of ART, HLVQTRR has the best result but still the result for MMRRA was not bad.
Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are som...
详细信息
ISBN:
(纸本)9781728175652
Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are some services (priority based preemption etc.) in real time operating systems to control software tasks. But in some situations there is a need for scheduling algorithms in real time systems. This need arises especially when time-critical software tasks need to run at different working periods and on a specific timeline. Different scheduling algorithms can be selected to meet the requirements of the system. The flight software that runs on the real-time operating system, especially on satellite platforms, is responsible for time-critical tasks. Main goals of this paper are providing analyze of scheduling algorithms using in real time operating systems, giving the method which is used to apply scheduling algorithms in a real time operating system and providing performance results of these scheduling algorithms obtained as a result of this application. In addition, it is mentioned that which of these algorithms are preferred in space domain.
In last ten to fifteen years lots of improved and transformed forms of RR Scheduling have been created to overcome some of issues which were available in the standard RR Scheduling. When these transformed versions wer...
详细信息
ISBN:
(纸本)9781728132457
In last ten to fifteen years lots of improved and transformed forms of RR Scheduling have been created to overcome some of issues which were available in the standard RR Scheduling. When these transformed versions were given by various scientists and researchers, these algorithms were always compared with the standard round robin algorithm to make sure that the improved version is better than the standard algorithm. In this research paper we tried to draw comparison between various improved versions of round robin algorithm and analyze their average waiting time, average turnaround times and context switches, to check which one improved version would be able to suggest a fruitful modification over the original one.
Wireless communication is an emerging technology in recent days which involves the transmission of data or information over a wide range of distance. The wireless network is capable of using the unlicensed spectrum fo...
详细信息
Wireless communication is an emerging technology in recent days which involves the transmission of data or information over a wide range of distance. The wireless network is capable of using the unlicensed spectrum for the transmission of data for various applications like medical, science, and industries. There are cases where the licensed spectrum is not utilized up to the level. In such cases, the cognitive radio network (CRN) technology allows cognitive devices to sense it and further enables the dynamic access of the scarce resource for proper utilization. However, the excessive number of bandwidth access may lead to the occurrence of interferences among the system. This is the major issue faced in all CRNs. To resolve this, effective band scheduling mechanism in CRN has been proposed. In this research, efficient spectrum sensing is performed using stochastic optimization algorithm called Salp Swarm Optimization algorithm (SSOA). This SSOA algorithm utilizes the best fitness function through three phases such as leaving, contention and joining of bands and provides a list of nonacquired list of bands. From the list of bands, the best band with majority bandwidth has been selected using roundrobin (RR) algorithm. Here, the load system is allotted dynamically. Based on the load factor, the spectrum is scheduled. As a matter of fact, the whole spectrum scheduling methodology depends primarily on the base contributions made by the operation of spectrum sensing. Finally, the performance analysis is estimated for the throughput, settling time, number of bands occupied by base station (BS), and the bands occupied by each BS. From the performance analysis, the proposed system attains better results than other conventional approaches.
Load balancing plays an important role in cloud computing environment. A better load balancing algorithm provides more efficient service and improves cloud computing performance. In this paper, a new dynamic time quan...
详细信息
ISBN:
(纸本)9781538676387
Load balancing plays an important role in cloud computing environment. A better load balancing algorithm provides more efficient service and improves cloud computing performance. In this paper, a new dynamic time quantum priority-based algorithm has been proposed which is suitable for load balancing in cloud computing environment. roundrobin is a very simple algorithm in cloud computing environment but the disadvantage of round robin algorithm is long waiting time, long response time and overhead for context switches. In this paper, we have proposed a new dynamic round robin algorithm with execution time slice which is used to determine dynamic time quantum (TQ) for individual service request in every round. Here the priority has been used to calculate the Priority Component (PC) of the process. Our experimental result gives the better performance in term of minimizing average waiting time, total number of context switches and average turnaround time.
In last ten to fifteen years lots of improved and transformed forms of RR Scheduling have been created to overcome some of issues which were available in the standard RR Scheduling. When these transformed versions wer...
详细信息
ISBN:
(数字)9781728132457
ISBN:
(纸本)9781728132464
In last ten to fifteen years lots of improved and transformed forms of RR Scheduling have been created to overcome some of issues which were available in the standard RR Scheduling. When these transformed versions were given by various scientists and researchers, these algorithms were always compared with the standard round robin algorithm to make sure that the improved version is better than the standard algorithm. In this research paper we tried to draw comparison between various improved versions of round robin algorithm and analyze their average waiting time, average turnaround times and context switches, to check which one improved version would be able to suggest a fruitful modification over the original one.
Recently, there has been enormous attention given to the network on chip (NoC) because it is scalable compared to the communication bus. Three dimensional (3D) NoC is getting more popular due to the reduction of wire ...
详细信息
Recently, there has been enormous attention given to the network on chip (NoC) because it is scalable compared to the communication bus. Three dimensional (3D) NoC is getting more popular due to the reduction of wire length with that off two dimensional NoC. The router in the NoC is provides communication between the different computational units. In this paper, a two-phase bundled-data handshake latch is used with an asynchronous router. The Mousetrap latch controller forms the basis of this asynchronous router. The major part of the arbiter is to schedule the packet, then deliver to its destination without any loss of the packet. This paper proposes a novel asynchronous 3D lottery routing algorithm which is based on arbitral mechanism. The Lottery routing algorithm distinguishes the different priorities of the input port and makes sure that it responses to the higher priority port. The proposed hardware is implemented using Cadence 180 nm technology. The result shows that the power reduction is about 17% and a slight increase in area and delay of about 2% with respect to synchronous 3D NoC.
As flash memory technology scales down the 20 nm and below, data reliability becomes a major design concern for storage systems. A novel integrated approach is proposed for chip architecture. The conventional architec...
详细信息
ISBN:
(纸本)9781538623695
As flash memory technology scales down the 20 nm and below, data reliability becomes a major design concern for storage systems. A novel integrated approach is proposed for chip architecture. The conventional architecture suffers from read disturbance during high amount of power consumption. A read disturb error occurs which causes data loss to a page. To overcome the problem of read disturbance parallel processing multi input multi output round robin algorithm is proposed and also adopted clock gating technique in the architecture. The proposed round robin algorithm is used for the multiple processing of inputs and outputs. It can reduce the read disturbance and consumes low power. The simulations are implemented on the Xilinx ISE 14.7 tool. By using round robin algorithm and clock gating together increase the performance and reduce thearea, delay and power consumption.
In this paper, a load balancing framework is presented which allows user requests to be dynamically distributed among clustered back-end web servers based on the response time to achieve efficient load balancing of th...
详细信息
ISBN:
(纸本)9781538646922
In this paper, a load balancing framework is presented which allows user requests to be dynamically distributed among clustered back-end web servers based on the response time to achieve efficient load balancing of the system. In this proposed approach, load balancer runs on jetty web server which is a light weight server and easy to embed in java. Request will come from browser or SoapUI (for bulk messages). A track of requests and response on each server is maintained in hash map data structure. Whenever a new request comes in, it will be distributed among web servers based on response time and pending jobs on that server. The performance and comparisons of proposed algorithm is demonstrated through various experimental results and graphs.
暂无评论