Sökning: "single-processor scheduling"
Hittade 3 uppsatser innehållade orden single-processor scheduling.
1. Implementation of a Fast Approximation Algorithm for Precedence Constrained Scheduling
Master-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : We present an implementation of a very recent approximation algorithm for scheduling jobs on a single machine with precedence constraints, minimising the total weighted completion time. We also evaluate the performance of this implementation. LÄS MER
2. Heuristiska algoritmer för schemaläggning i real-tidssystem med hänsyn till data beroenden
Kandidat-uppsats, Linköpings universitet/Optimeringslära; Linköpings universitet/Tekniska fakultetenSammanfattning : The schedule for the jobs in a real-time system can have a huge impact on how the system behave. Since real-time systems are common in safety applications it is important that the scheduling is done in a valid way. Furthermore, one can enhance the performance of the applications by minimizing data latency and jitter. LÄS MER
3. Design and Evaluation of a Real-Time Task Scheduler using Tabu Search
Kandidat-uppsats, Institutionen för datavetenskapSammanfattning : Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is necessary to apply a heuristic search strategy on these problems. This project focuses on the development of a real-time scheduling algorithm using tabu search. A dynamic real-time task scheduling problem is defined for a single processor. LÄS MER