The FCFS-based backfill algorithm is widely used in scheduling high-performance computer systems. The algorithm relies on runtime estimate of jobs which is provided by users. However, statistics show the accuracy of user-provided estimate is poor. Users are very likely to provide a much longer runtime estimate than its real execution time. In this paper, we propose an aggressive backfilling app...

In Grid Environment the number of resources and tasks to be scheduled is usually variable and dynamic in nature. This characteristic emphasizes the scheduling approach as a complex optimization problem. Scheduling is a key issue which must be solved in grid computing study and a better scheduling scheme can greatly improve the efficiency.The objective of this paper is to explore and investigate...

We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with exponential service times. A fixed number N of customers cycles through this network. We determine the joint sojourn time distribution of a tagged customer in, first, the general queue and, then, the exponential queue. Subsequently, we indicate how th...

For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when priority comes with preemption. We derived the resulting mean waiting time (which is invariant wit...

Due to popularity of Cloud computing environment, the cloud computing users are increasing day by day and that has become one of the important challenge for the cloud providers in terms of load balancing. Load balancing distributes the traffic evenly over multiple paths. In this research work, we have proposed the Dynamic Improved PSO Load balancing algorithm and implement it over CloudSim tool...

In personalized queues, information at the level of individuals – customers or servers – is affecting system dynamics. Such information is becoming increasingly accessible, directly or statistically, as exemplified by personalized medicine (customers) or call-center workforce management (servers). In the present work, we take advantage of personalized information about customers, specifically k...

In this paper, we propose a neuro-genetic decision support system coupled with simulation to design a job shop manufacturing system by achieving predetermined values of targeted performance measures such as flow time, number of tardy jobs, total tardiness and machine utilization at each work center. When a manufacturing system is designed, the management has to make decisions on the availabilit...

This paper introduces a new priority mechanism in discretetime queueing systems that compromises between first-come-first-served (FCFS) and head-of-line (HoL) priority. In this scheduling discipline which we dubbed slot-bound priority customers of different priority classes entering the system during the same time-slot are served in order of their respective priority class. Customers entering d...

− Dynamic load sharing policies have been extensively studied. Most of the previous studies have assumed a homogeneous distributed system with a first-come-first-served (FCFS) node scheduling policy. In addition, job service times and inter-arrival times are assumed to be exponentially distributed. In this paper, we study the impact of these assumptions on the performance of sender-initiated an...

Fault tolerance in cloud computing platforms and applications is a crucial issue. This issue is especially difficult since cloud computing relies by nature on a complex splitting into many layers. This paper analyses the implementation of fault tolerance in such a complex cloud computing environment with a focus on FCFS and SJF along with MPIL method with fault tolerance property. The proposed ...