This paper presents feasibility tests for scheduling instances of real-time jobs on uniform multiprocessor platforms. In a uniform multiprocessor, each processor has an associated speed – a job executing on a processor of speed s for t time units performs s × t units of work. Two feasibility tests are presented. First, a sufficient condition is presented – whenever this condition holds the jobs...

In this paper, we deene a formal model for reasoning about resource allocation and scheduling in real-time systems. We extend the model in SZJ94], which models the functionality of agents in the language TAM. Our extended model allows us to argue about the resource requirements of real-time distributed systems, and so identify connicts upon resources. We can use the model to deene and reason ab...

The development of software for reconfigurable sensor-based realtime systems is a complicated and tedious process, requiring highly specialized skills in real-time systems programming. The total development time can be reduced by automatically integrating reusable software modules to create applications. The integration of these modules can be further simplified by the use of a high-level progr...

In this paper we address the problem of uniprocessor probabilistic scheduling of real-time systems with variable execution times. For these systems the tasks have an associated probability of missing the deadline, i.e., some jobs may miss their deadlines without affecting the schedulability of the system. Therefore dropping these jobs does not affect the schedulability of the system and it coul...

We present Henge, a system to support intent-based multitenancy in modern stream processing applications. Henge supports multi-tenancy as a first-class citizen: everyone inside an organization can now submit their stream processing jobs to a single, shared, consolidated cluster. Additionally, Henge allows each tenant (job) to specify its own intents (i.e., requirements) as a Service Level Objec...

In real-time systems, it is required to complete all work on a timely basis. There are mainly two types of real time systems: hard real-time systems (HRT) and soft-real time (SRT) systems. In hard real-time systems, a missed deadline is considered a system failure; in soft real-time systems some deadlines may be missed. The aim of real-time scheduling analysis is to ensure a sequence of jobs me...

There are many real world problems in which parameters like the arrival time of new jobs, failure of resources, and completion time of jobs change continuously. This paper tackles the problem of scheduling jobs with random due dates on multiple identical machines in a stochastic environment. First to assign jobs to different machine centers LPT scheduling methods have been used, after that the ...

Applying gang scheduling can alleviate the blockade problem caused by exclusively space-sharing scheduling. To simply allow jobs to run simultaneously on the same processors as in conventional gang scheduling, however, may introduce a large number of time slots in the system. In consequence the cost of context switches will be greatly increased, and each running job can only obtain a small port...

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

:هلاقم هصلاخ This paper introduces an analytical method for approximating the performance of a -soft real-time system consisting of a number of parallel infinite-capacity single -server queues. The service discipline for the individual queues is earliest-deadline first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all ...