Job scheduling has always been a challenging task in modern manufacturing and the most real life scheduling problems which involves multi-criteria and multi-machine environments. In this research our direction is largely motivated by the adoption of the Just-In-Time (JIT) philosophy in parallel machines system, where processing times of jobs are controllable. The goal of this paper is to minimi...

The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining whether a specified system meets all deadlines when scheduled by a static-priority algorithm. These conditions are used to obtain efficient schedulability tests for sporadic task systems scheduled using the popular Deadline-Monotonic real-time scheduling algorithm. Res...

MapReduce (MR) has become a de facto standard for largescale data analysis. Moreover, it has also attracted the attention of the HPC community due to its simplicity, efficiency and highly scalable parallel model. However, MR implementations present some issues that may complicate its execution in existing HPC clusters, specially concerning the job submission. While on MR there are no strict par...

The introduction of energy harvesting functionalities into an embedded system such as wireless sensor network raises many design questions. The central one is how to smartly use harvesting abilities so as to optimize performance and lifetime of the system? How to dynamically adapt the processing activity and schedule the real-time jobs with deadline constraints so as to subsist perpetually on a...

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...

In this paper we consider the use of fuzzy logic in the scheduling of periodic tasks in soft real-time multiprocessor systems. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real time constraints is shown to be NP hard. Most researches concerning real-time system scheduling assume scheduling constraint to be precise...

The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to react on changing characteristics of the waiting jobs. In this paper we present enhancements to the decision process of the self-tuning dynP scheduler and evaluate their impact on the performance: (i) While doing a self-tu...

One of the major challenges in ultrascale systems is the effective scheduling of complex jobs within strict timing constraints. The distributed and heterogeneous system resources constitute another critical issue that must be addressed by the employed scheduling strategy. In this paper, we investigate by simulation the performance of various policies for the scheduling of real-time directed acy...