The recent advent of multi-core computing environments increases the heterogeneity of grid resources and the complexity of managing them, making efficient load balancing challenging. In an environment where jobs are submitted regularly into a grid which is already executing several jobs, it becomes important to provide low job turn-around times and high throughput for the users. Typically, the ...

The First Come Served (FCFS) queuing policy is routinely assumed to be the benchmark for “fairness” in waiting-time performance. In this article, we propose a slight modification of FCFS based on natural extension well-established David and Yechiali (DY) rule analyze it context managing waiting list kidney transplants. proposed policy, agents are sequentially offered stochastically arriving org...

Task scheduling in an important element a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt reduce expense of optimizing use CPU. These techniques mostly lack planning and need be comprehensive. To address this fault, hybrid optimization technique proposed hybridization both First-Come First...

It is well known that in a firm real time system with a renewal arrival process, exponential service times and stochastic deadlines till the end of service of a job, the earliest deadline first (EDF) scheduling policy has smaller loss ratio (expected fraction of jobs that are not completed) than any other service time independent scheduling policy, including the first come first served (FCFS) p...

The use of deadline-based scheduling in support of real-time delivery of application data units (ADUs) in a packet-switched network is investigated. Of interest is priority scheduling where a packet with a smaller ratio of T/H (time until delivery deadline over number of hops remaining) is given a higher priority. We refer to this scheduling algorithm as the T/H algorithm. T/H has time complexi...

Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm in order to achieve load balancing. Gap filling or backfilling is one of the techniques used to optimize First Come First Serve (FCFS) and have been used widely in scheduling area. This paper introduced an improved backfilling technique wh...