We describe a round robin scheduling problem for a competition played in two divisions, motivated by a scheduling problem brought to the second author by a local sports organisation. The first division has teams from 2n clubs, and is played in a double round robin in which the draw for the second round robin is identical to the first. The second division has teams from two additional clubs, and...

The main objective of the paper is to improve the Round Robin (RR) algorithm using dynamic ITS by coalescing it with Shortest Remaining Time Next (SRTN) algorithm thus reducing the average waiting time, average turnaround time and the number of context switches. The original time slice has been calculated for each process based on its burst time.This is mostly suited for soft real time systems ...

In this paper, a new algorithm proposed for soft real time operating system. In this proposed algorithm response time is better than existing algorithm. Also within deadline all process will complete. In this proposed algorithm if we will follow its then it will give better response time as well as good waiting time and turnaround time. Most important part of proposed algorithm is context switc...

We study round-robin tournaments with either three or four symmetric players whose values of winning are common knowledge. In the round-robin tournament with three players there are three stages, each of which includes one match between two players. The player who wins in two matches wins the tournament. We characterize the sub-game perfect equilibrium and show that each player maximizes his ex...

Load balancing is important in solving over-load traffic problems the network. Therefore, it has been among first appealing applications Software Defined Networking (SDN) networks. Numerous SDN-based load-balancing approaches have recommended to enhance performance of SDN However, network control could be more manageable large networks with hundreds switches and routers. The a unique way buildi...

Grid computing is a loosely couple distributed system, and it can solve complex problem with large-scale computing and storage resources. Middleware plays important role to integrate heterogeneous computing nodes. Globus Toolkit (GT) is a popular open source middleware to build grid environment. However, a job submission has lots of complicate operations in GT especially in a large scale gird. ...

Round robin tournaments are omnipresent in sport competitions and beyond. We investigate three integer programming formulations for scheduling a round tournament, one of which we call the matching formulation. analytically compare their linear relaxations, find that relaxation formulation is stronger than other while still being solvable polynomial time. In addition, provide an exponentially si...

The quantum time length is usually taken as a fixed value in all applications that use Round Robin (RR) scheduling algorithm. The determination of the optimal length of the quantum that results in a small average turn around time is very complicated because of the unknown nature of the tasks in the ready queue. The round robin algorithm becomes very similar to the first in first served algorith...