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...

Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...

The objective of this journal is to compare the efficiency between these two algorithms, simple round robin and improved algorithms. In real time systems algorithm, plays a significant role be used in embedded systems. Here we average turn around waiting time, also number context switching Improved an algorithm where if remaining burst less than allocated quantum then running process executed. ...

This work attempts to mathematically formulize the computation of waiting time of any process in a static n-process, CPU-bound round robin scheme. That in effect, can calculate other performance measures also. An improvement in the existing round robin algorithm has also been worked out that provides priority to processes nearing completion. The suggested approach uses two ready queues, wherein...

A hybrid bandwidth scheduling scheme is proposed to improve the quality of service and the bandwidth utilization for the CAN-based networked control systems. It combines rate monotonic and improved round-robin scheme for both the realtime and non-real-time data. Moreover, considering the constraints of control performance and network schedulability, a heuristic branch and bound & genetic algori...

CPU scheduling is the basis of multi-programmed operating systems. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. Round Robin assumes that all processes are equally important; each receives an equal portion (time slice) of the CPU. This will sometimes affect the performance of CPU. This paper considers...

We study scheduling in Bluetooth piconets. A good scheduling method should use the limited resources efficiently and fairly. A novel scheduling scheme based on fuzzy logic is proposed. It dynamically adjusts resource allocation to each master-slave pair based on the traffic characteristics. The proposed algorithm is compared with the Pure Round Robin (PRR) and Exhaustive Round Robin (ERR) schem...

A layered and modular approach to implementing a process-oriented simulator testbed is described. The simulation kernel is supported by a threads library and is, in turn, capable of supporting distinct domains or application areas for various applications. The testbed offers an implementation methodology for testing novel simulation algorithms at the domain level, without interfacing with the k...