Time redundancy is an effective method for achieving fault tolerance in a real-time system, when space redundancy cannot be used for cost or weight constraints. This paper presents a fault-tolerant scheduling algorithm for real-time systems consisting of firm and hard periodic tasks. Firm tasks can occasionally skip one instance according to a predefined quality-ofservice parameter, whereas har...

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such ...

In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: nonpreemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may ...

In this paper, we propose a novel algorithm to solve the starving problem of the small jobs and reduce the process time of the small jobs on Hadoop platform. Current schedulers of MapReduce/Hadoop are quite successful in achieving data locality and scheduling the reduce tasks with a greedy algorithm. Some jobs may have hundreds of map tasks and just several reduce tasks, in which case, the redu...

The development of software for dynamically reconfigurable sensor-based control systems is a complicated and tedious process, requiring specialization in real-time systems programming and an amount of time which may not be available, for instance, in a space laboratory. The total development time can be reduced by automatically integrating reusable software modules to create applications. The i...

Even though with few exceptions, grid workloads are dominated by single-node jobs, not all of these jobs are necessarily independent or unrelated. For instance, sets of jobs may be grouped because they are submitted by users in batches, e.g., to perform parameter sweeps. However, there is no reported data to confirm the presence and structure of these groupings, despite the large potential impa...