We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem. Our policies apply to the recentl...

The analysis of link-based global scheduling presented in [1, 2] rests on the assumptions that (i) schedulability is established using a global schedulability test assuming fully preemptive, independent tasks,1 and that (ii) any additional delays incurred due to non-preemptive sections are accounted for by inflating the worst-case execution parameter of each task prior to applying the test. We ...

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polyn...

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

We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive a policy with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem. Our policy applies to the recent...

We consider the single machine dynamic total completion time scheduling problem. This problem is known to be NP-hard in the strong sense. The currently best available lower bound for the problem is known to be the optimal solution value of the corresponding preemptive problem which can be computed in O(n logn) time. We propose an improvement on this bound by exploiting the properties of the pre...

API extensions and performance improvements to the Linux operating system now enable it to serve as a platform for a range of embedded real-time applications, using fixed-priority preemptive scheduling. Powerful techniques exist for analytical verification of application timing constraints under this scheduling model. However, when the application is layered over an operating system the operati...

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