This paper addresses a preemptive scheduling problem on two parallel machines with a single server. Each job has to be loaded (setup) by the server before being processed on the machines. The preemption is allowed in this paper. The goal is to minimize the makespan. We first show that it is no of use to preempt the job during its setup time. Namely, every optimal preemptive schedule can be conv...

Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turnaround time, job suspension/restart is not much used in practice at supercomputer centres for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of preemptive scheduling. We explore this issue through a simulation based study...

Many of multimedia applications in distributed systems should transmit continuous audio/video across networks when clients request. Typically, messages for continuous media in packet-switched networks are split into periodic, different sized packets with deadlines. Since clients request different typed services, traffic streams are heterogeneous. Furthermore, since the continuity of continuous ...

This paper addresses the complexity of scheduling problems considering two jobs to schedule and availability constraints imposed on the machines. A polynomial algorithm called temporized geometric approach is first proposed for the minimization of the makespan, under the non-preemption constraint. Then, a generalization to the preemptive case is developed. These algorithms are extensions of the...

Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling policies, including priority backfill polic...

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...