180 research outputs found
Scheduling task systems with resources.
Thesis. 1980. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.Vita.Bibliography: leaves 144-145.Ph.D
Recommended from our members
A Comparative Study of Divergence Control Algorithms
This paper evaluates and compares the performance of two-phase locking divergence control (2PLDC) and optimistic divergence control (ODC) algorithms using a comprehensive centralized database simulation model. We examine a system with multiclass workloads in which on-line update transactions and long-duration queries progress based on epsilon serializability (ESR). Our results demonstrate that significant performance enhancements can be achieved with a non-zero tolerable inconsistency (ϵ-spec). With sufficient ϵ-spec and limited system resources, both algorithms achieve comparable performance. However, with low resource contention, ODC performs significantly better than 2PLDC. Moreover, given a small ϵ-spec, ODC returns more accurate results on the committed queries then 2PLDC
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
AbstractThe problem we consider is that of scheduling n unit length tasks on identical processors in the presence of additional scarce resources. The objective is to minimize maximum lateness. It has been known for some time that the problem is NP-hard even for two processors and one resource type. In the present paper we show that the problem can be solved in O(n log n) time, even for an arbitrary number of resources if the instance of the problem has the saturation property (i.e., no resource unit is idle in an optimal schedule). For the more general problem without saturation, two heuristic algorithms and a branch and bound approach are proposed. The results of computational tests of the above methods are also reported
A Real-time Calculus Approach for Integrating Sporadic Events in Time-triggered Systems
In time-triggered systems, where the schedule table is predefined and
statically configured at design time, sporadic event-triggered (ET) tasks can
only be handled within specially dedicated slots or when time-triggered (TT)
tasks finish their execution early. We introduce a new paradigm for
synthesizing TT schedules that guarantee the correct temporal behavior of TT
tasks and the schedulability of sporadic ET tasks with arbitrary deadlines. The
approach first expresses a constraint for the TT task schedule in the form of a
maximal affine envelope that guarantees that as long as the schedule generation
respects this envelope, all sporadic ET tasks meet their deadline. The second
step consists of modeling this envelope as a burst limiting constraint and
building the TT schedule via simulating a modified Least-Laxity-First (LLF)
scheduler. Using this novel technique, we show that we achieve equal or better
schedulability and a faster schedule generation for most use-cases compared to
other approaches inspired by, e.g., hierarchical scheduling. Moreover, we
present an extension to our method that finds the most favourable schedule for
TT tasks with respect to ET schedulability, thus increasing the probability of
the computed TT schedule remaining feasible when ET tasks are later added or
changed
Some topics on deterministic scheduling problems
Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives.
This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on m \u3e= 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. Both preemptive and nonpreemptive schedules are considered. This dissertation shows that optimal online algorithms exist for some cases, while for others it is impossible to have one. The results give a sharp boundary delineating the possible and the impossible cases.
Then an O(n log n)-time implementation is given for the algorithm which solves P|pj = 1, rj, outtree| ΣCj and P|pmtn, pj=1,rj,outtree|ΣCj.
A fundamental problem in scheduling theory is that of scheduling a set of n unit-execution-time (UET) tasks, with precedence constraints, on m \u3e 1 parallel and identical processors so as to minimize the mean flow time. For arbitrary precedence constraints, this dissertation gives a 2-approximation algorithm. For intrees, a 1.5-approximation algorithm is given.
Six dual criteria problems are also considered in this dissertation. Two open problems are first solved. Both problems are single machine scheduling problems with the number of tardy jobs as the primary criterion and with the total completion time and the total tardiness as the secondary criterion, respectively. Both problems are shown to be NP-hard. Then it focuses on bi-criteria scheduling problems involving the number of tardy jobs, the maximum weighted tardiness and the maximum tardiness. NP-hardness proofs are given for the scheduling problems when the number of tardy jobs is the primary criterion and the maximum weighted tardiness is the secondary criterion, or vice versa. It then considers complexity relationships between the various problems, gives polynomial-time algorithms for some special cases, and proposes fast heuristics for the general case
Four decades of research on the open-shop scheduling problem to minimize the makespan
One of the basic scheduling problems, the open-shop scheduling problem has a broad range of applications across different sectors. The problem concerns scheduling a set of jobs, each of which has a set of operations, on a set of different machines. Each machine can process at most one operation at a time and the job processing order on the machines is immaterial, i.e., it has no implication for the scheduling outcome. The aim is to determine a schedule, i.e., the completion times of the operations processed on the machines, such that a performance criterion is optimized. While research on the problem dates back to the 1970s, there have been reviving interests in the computational complexity of variants of the problem and solution methodologies in the past few years. Aiming to provide a complete road map for future research on the open-shop scheduling problem, we present an up-to-date and comprehensive review of studies on the problem that focuses on minimizing the makespan, and discuss potential research opportunities
When Network Matters: Data Center Scheduling with Network Tasks
International audienceWe consider the placement of jobs inside a data center. Traditionally, this is done by a task orchestrator without taking into account network constraints. According to recent studies, network transfers represent up to 50% of the completion time of classical jobs. Thus, network resources must be considered when placing jobs in a data center. In this paper, we propose a new scheduling framework, introducing network tasks that need to be executed on network machines alongside traditional (CPU) tasks. The model takes into account the competition between communications for the network resources, which is not considered in the formerly proposed scheduling models with communication. Network transfers inside a data center can be easily modeled in our framework. As we show, classical algorithms do not efficiently handle a limited amount of network bandwidth. We thus propose new provably efficient algorithms with the goal of minimizing the makespan in this framework. We show their efficiency and the importance of taking into consideration network capacity through extensive simulations on workflows built from Google data center traces
- …