Scheduling problems that involve distance constrained tasks with repetitive requests are enjoying an increase in popularity in real time system design. Timing constraints defined by periods of fixed lengths for each task enforce some frequency of task execution. Alternatively deadlines could be specified relatively to the finish time of the previous execution of the same task. Hence, the schedu...

Scheduling algorithms that use application and system knowledge have been shown to be more eeective at scheduling parallel jobs on a multiprocessor than algorithms that do not. This paper focuses on obtaining such information for use by a scheduler in a network of workstations environment. The log les from three parallel systems are examined to determine both how to categorize parallel jobs for...

In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster – group EDF (DC-gEDF) is propos...

This paper studies and gives an analysis of a particular queuing model. It considers a non-preemptive priority queuing system with K ( ≥ 2 ) classes of jobs. The system consists of a single processor. It represents the model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedule jobs arriving according to a Markov arrival proc...

In this paper we present a new algorithm for the oo-line scheduling of parallel and independent jobs on a parallel processor system. To this end we introduce a machine model which is based on existing multiprocessors and accounts for the penalty of preemption. After examining the relation between the makespan and the total weighted completion time costs for the scheduling of parallel jobs it is...

Scheduling problems that involve distance constraint tasks with repetitive requests is becoming increasingly popular in real time systems. Timing constraints defined by periods of fixed lengths for each task enforce some frequency of task execution. Alternatively deadlines could be specified relatively to the finish time of the previous execution of the same task. Hence the scheduling algorithm...

We study classic machine sequencing problems in an online setting. Specifically, we look at deterministic and randomized algorithms for the problem of scheduling jobs with release dates on identical parallel machines, to minimize the sum of weighted completion times: Both preemptive and non-preemptive versions are analyzed. Using linear programming techniques, borrowed from the single machine c...

The network of workstations (NOW) we consider for local scheduling of parallel tasks and communications is heterogeneous and nondedicated, where computing power varies among the workstations, and multiple jobs may interact with each other in execution. Local scheduling is a standard method on networks of workstations, where each node in the system makes independent scheduling decisions. Coordin...

In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems.

We present a reduction from a concurrent real-time program with priority preemptive scheduling to a sequential program that has the same set of behaviors. Whereas many static analyses of concurrent programs are undecidable, our reduction enables the application of any sequential program analysis to be applied to a concurrent real-time program with priority preemptive scheduling.