Methods for Scheduling of xtUML State Machines Executing in Parallel
2024 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE credits
Student thesisAlternative title
Metoder för schemaläggning av parallellt exekverande tillståndsmaskiner i xtUML (Swedish)
Abstract [en]
This thesis examines ways of multithreading Finite State Machines (FSMs) derived from Executable Translatable Unified Modeling Language (xtUML) models using a model compiler. The problem has little previous research done. Delimiting the problem by requiring FSMs to be Directed Acyclic Graphs and interpreting FSMs as tasks, the problem resembles a scheduling problem. With the restrictions of FSMs and model compilation taken in consideration, the critical path of an FSM is a reasonable parameter to use when scheduling. The evaluation shows that letting critical paths be static for the entire FSM yields shorter execution time compared to calculating the critical path for each individual state. This thesis also improves on the previous multithreading solution at SAAB by letting resource access conflicts be mapped between individual states instead of entire FSMs. This increased granularity in multithreading which decreased the average execution time significantly.
Place, publisher, year, edition, pages
2024. , p. 38
Keywords [en]
xtUML, Scheduling, Finite State Machine, Parallelisation, Object Action Language, Directed Acyclic Graph, Model compiler, Model programming, Model Driven Architecture
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:liu:diva-206243ISRN: LIU-IDA/LITH-EX-A--24/078--SEOAI: oai:DiVA.org:liu-206243DiVA, id: diva2:1888621
External cooperation
SAAB
Subject / course
Computer Engineering
Presentation
2024-06-19, Donald Knuth, Linköpings Universitet, Linköping, 10:15 (English)
Supervisors
Examiners
2024-08-132024-08-132024-08-13Bibliographically approved