In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The performance of the used scheduling policies (e.g. FCFS, SJF, LJF) depends on the characteristics of the queued jobs. Hence we developed the dynP scheduler family. The basic idea was to change between different scheduling pol...

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines onK machines when jobs are characterized in terms of their minimum stretch factor α (or, equivalently, their maximum execution rate r = 1/α). We consider two well known preemptive models that are of interest from practical applications: the hard real-time sch...

Corresponding Author: Saleh Atiewi College of Information Technology, Tenaga National University, Kajang, Malaysia Email: [email protected] Abstract: Cloud computing is an interesting and beneficial area in modern distributed computing. It enables millions of users to use the offered services through their own devices or terminals. Cloud computing offers an environment with low cost, ease of u...

Running jobs on the IBM SP2, as in most distributed memory parallel system in the market today, is done by giving each job a subset of the available processors for its exclusive use. Scheduling jobs in FCFS order suuers from severe fragmentation that leads to utilization loss. This led Argonne National Lab, where the rst large SP1 was installed, to develop the EASY scheduler, which has since th...

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor α (or, equivalently, their maximum execution rate r = 1/α). We consider two well known preemptive models that are of interest from practical applications: the hard real-time sc...