Scheduling Jobs with Temporal Distance Constraints

Authors:
Ching-Chih Han;Kwei-Jay Lin;Jane W;.-S. Liu
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
1995

Citing 0
Cited 5

Distance-Constrained Scheduling and Its Applications to Real-Time Systems

IEEE Transactions on Computers
Communication Middleware and Software for QoS Control in Distributed Real-Time EnvironmentsSpecifically, we consider the following innovative research components

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
On-line algorithms for networks of temporal constraints

Journal of Discrete Algorithms
Deriving Deadlines and Periods for Real-Time Update Transactions

IEEE Transactions on Computers
DESH: overhead reduction algorithms for deferrable scheduling

Real-Time Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The job scheduling problems for real-time jobs with temporal distance constraints (JSD) are presented. In JSD, the start times of two related jobs must be within a given distance. The general JSD problem is NP-hard. We define the multilevel unit-time JSD (MUJSD) problem for systems with $m$ chains of unit-time jobs in which neighboring jobs in each chain must be scheduled within $c$ time units. We present an $O(n^2)$-time algorithm, where $n$ is the total number of jobs in the system, and also an $O(m^2 c^2)$-time algorithm. Some other variations of the JSD problems are also investigated.