Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 30 for “"Multiprocessor scheduling"”.
-
Multiprocessor scheduling with practical constraints
The problem of scheduling tasks onto multiprocessor systems has increasing practical importance as more applications are being addressed with multiprocessor systems. Actual applications and multiprocessor systems have many characteristics which become constraints to the general scheduling problem …
-
Multiprocessor Scheduling with Availability Constraints
We consider the problem of scheduling a given set of tasks on multiple pro- cessors with predefined periods of unavailability, with the aim of minimizing the maximum completion time. Since this problem is strongly NP-hard, polynomial ap- proximation algorithms are being studied for its solution. …
-
Approximation in batch and multiprocessor scheduling
This thesis is about scheduling problems where jobs arrive over time. Depending on the problem, we consider the case that each job has a deadline, or the relaxation that the sum of flow times or completion times need to be minimized. Since most of the discussed problems are NP-hard, the goal is to …
-
Efficient multiprocessor scheduling based on genetic algorithms
<p>The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimized. This scheduling problem in known to be NP-hard and methods based on heuristic search have been proposed to …
-
Multiprocessor scheduling for hard real-time software
… pioneer prototype of the static scheduler for multiprocessors which are part of the CAPS execution support system. The design of hard real-time systems is gaining importance in the software engineering field as real-world processes are becoming automated. This increase in automation needs the …
-
Multiprocessor Scheduling of Mixed-Criticality Parallel Systems
… has been an increasing research interest in scheduling mixed-criticality (MC) systems. However, most existing efforts have concentrated on scheduling sequential mixed-criticality tasks and ignored intra-task parallelism. As MC systems are increasingly being implemented on multiprocessor …
-
Slot scheduling : general-purpose multiprocessor scheduling for heterogeneous workloads
This thesis presents slot scheduling, a approach to general-purpose CPU scheduling for multiprocessor systems. The chief virtues of slot scheduling are versatility (the ability to support a broad range of classes of schedulers) and intelligibility (allowing system designers to easily reason about …
-
Efficient multiprocessor scheduling by mean field theory neural networks
… Theory (MFT) Neural Networks to solve the Task Scheduling problem. The MFT algorithm combines characteristics of the Simulated Annealing (SA) algorithm and the Hopfield neural network. MFT exhibits rapid convergence and at the same time it preserves the solution quality afforded by SA. Since MFT …
-
Partitioned Fixed-Priority Multiprocessor Scheduling for Mixed-Criticality Real-Time Systems
The scheduling of real-time systems has been the subject of research for many years since it has many implications for safety-critical embedded real-time systems. Within that field, there have been two recent developments which are the subject of this thesis. The first is the development of new …
-
Design of adaptive and hybrid energy & QOS aware heterogeneous multiprocessor scheduling strategies for embedded systems
… to address the battery-aware multi-processor schedulingproblem, which happens to be a traditional task, under the context ofeach processing node being powered by individual heterogeneous batteries.The proposed algorithm exploits rate-capacity effect and recovery effect tomaximize the charge …
-
Formalization of uniprocessor and multiprocessor scheduling of real-time systems using supervisory control of discrete-event systems
… of real-time tasks on both uniprocessor and multiprocessor systems. The set of all possible timed traces of the system is specified by a discrete timed automaton, where each transition is associated with an event occurrence or the passage of one unit of time. This approach allows a unified …
-
An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation Algorithms
… approach is presented in order to enhance scheduling of soft real-time aperiodic and periodic tasks in multiprocessor systems. The objective of this work is enhancing the QoS by increasing the total benefit, while reducing flow times and deadline misses. This method prioritizes the tasks …
-
Resource Management for Real -Time Environments
… that we study are: phased-array radar dwell scheduling, multiprocessor scheduling and multidimensional resource management. We believe that exploiting phase transitions is a simple and sufficient design approach for most real-time systems.
-
Memory Optimizations for Time-Predictable Embedded Software
… global optimization of scratchpad allocation and multiprocessor scheduling.
-
Approximation algorithms for 2d packing problems
… stock, VLSI design, image processing, and multiprocessor scheduling. The larger part of work is devoted to the storage packing problem, that is the problem of packing weighted rectangles into a single rectangle so as to maximize the total weight of the packed rectangles. Despite the …
-
System Synthesis for Embedded Multiprocessors
… techniques. Additionally, since embedded multiprocessor systems are typically designed as final implementations for dedicated functions, modifications to embedded system implementations are rare, and this allows embedded system designers to spend significantly larger amounts of time to …
-
Schedulability Analysis of Multi-Phase Limited-Preemption Tasks
… We then extend the MPS model to fixed-priority scheduling by adapting prior algorithms for fixed-priority, limited-preemption task sets. Next, we consider representing the MPS problem as a constraint program. We demonstrate that such a program can feasibly solve the MPS scheduling problem for …
Page 1 of 2