Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Design and Evaluation of a Real-Time Task Scheduler using Tabu Search
University of Skövde, Department of Computer Science.
1997 (English)Independent thesis Basic level (degree of Bachelor)Student thesis
Abstract [en]

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. The tasks in the system are sporadic, mutually independent, non-preemptable with firm, arbitrary deadlines. This problem is represented with tabu search. For performance measurements a simulator has been designed and implemented. Simulations have been conducted comparing scheduler based on tabu search to two well known scheduling algorithms, namely: earliest deadline first and highest value first. It was expected that the scheduler based on tabu search would outperform highest-value first and it would miss fewer deadlines than earliest deadline, as soon as earliest deadline starts to miss deadlines. The results of the simulations conducted did not show this results. Nevertheless did the simulation results indicate that tabu search could be a suitable heuristic search strategy for real-time task scheduling problems. This project provides a starting point on which it is possible to continue work on enhancing the tabu search scheduler.

Place, publisher, year, edition, pages
Skövde: Institutionen för datavetenskap , 1997. , p. 70
National Category
Information Systems
Identifiers
URN: urn:nbn:se:his:diva-240OAI: oai:DiVA.org:his-240DiVA, id: diva2:2596
Presentation
(English)
Uppsok
samhälle/juridik
Supervisors
Available from: 2007-11-07 Created: 2007-11-07 Last updated: 2018-01-13

Open Access in DiVA

fulltext(383 kB)192 downloads
File information
File name FULLTEXT01.psFile size 383 kBChecksum MD5
e81567449cb044bfcf60fc60d164d42afee0e56f6243c728821764aebfcee280c4be9f0c
Type fulltextMimetype application/postscript
fulltext(375 kB)225 downloads
File information
File name FULLTEXT02.pdfFile size 375 kBChecksum SHA-512
6883e03479441410a95eb6d21209e8d1203328d63223060608d27ef67ab7ac007449a99527f760bb343e705ee61a33b14d28d4ceef481c1e44e426cf90989e82
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Information Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 417 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 487 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf