Algoritmi raspoređivanja zadataka u operacijskim sustavima za rad u stvarnom vremenu

master's thesis

• Title (english): Task Scheduling Algorithms in Real-time Operating Systems
• Author: Marin Bralić
• Mentor: Davor Petrinović (mentor)
• Committee member: Davor Petrinović (predsjednik povjerenstva)
• Committee member: Damir Seršić (član povjerenstva)
• Committee member: Mladen Vučić (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2020-07-13, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

Sustavi za rad u stvarnom vremenu moraju osim logičke ispravnosti zadovoljiti i zadana vremenska ograničenja. Za jednostavne sustave može se koristiti upravljačka petlja ili upravljanje zasnovano na događajima (pomoću prekida). Kod složenijih sustava praktičnije je koristiti operacijski sustav za rad u stvarnom vremenu. Takvi operacijski sustavi nude više različitih algoritama raspoređivanja zadataka koji mogu pomoći da sustav što efikasnije obavlja poslove na vrijeme. Raspoređivanje može biti prekidivo, pri čemu zadatak u izvođenju može biti prekinut od strane drugog zadatka, ili neprekidivo, pri čemu zadatak koji se izvodi ne može biti prekinut već mora biti obavljen do kraja. Također algoritme raspoređivanja možemo podijeliti na statičke (raspoređivanje na temelju unaprijed zadanih parametara) i dinamičke (sustav tijekom rada mijenja parametre raspoređivanja). Neki od najčešće korištenih algoritama raspoređivanja su: FCFS (raspoređivanje po redu prispijeća), RR (kružno raspoređivanje podjelom vremena), prioritetno raspoređivanje, te EDF (raspoređivanje po vremenu krajnjeg završetka).

Abstract (english)

In addition to logical correctness, real-time systems must also meet the set time limits. For simple systems, a control loop or event-based control (using interrupts) can be used. For more complex systems, it is more convenient to use the real-time operating system. Real-time operating systems offer a number of different task scheduling algorithms that can help the system perform tasks on time as efficiently as possible. Task scheduling can be preemptive, whereby a task in progress can be interrupted by another task, or cooperative, whereby the task being performed cannot be interrupted but must be completed. Also, scheduling algorithms can be divided into static (scheduling based on predefined parameters) and dynamic (the system changes scheduling parameters during operation). Some of the most commonly used scheduling algorithms are: FCFS (First Come First Serve), RR (Round Robin), priority scheduling, and EDF (Earliest Deadline First).

• Keywords: algoritmi raspoređivanja; operacijski sustav; sustavi za rad u stvarnom vremenu; raspoređivanje zadataka
• Keywords (english): scheduling algorithms; operating system; real-time operating systems; task scheduling
• Language: croatian
• URN:NBN: urn:nbn:hr:168:647890
• Study programme: Title: Computing; Study programme type: university; Study level: graduate; Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2023-01-13 09:48:38