suggestedprojecttopics

suggestedprojecttopics内容摘要：

ns, and applications. ACM Trans. Inf. Syst. Secur. 13(1): (2020) Use of Scripting Languages in RT Systems • Scripting languages like JavaScript, Python, Ruby, Lua, etc. are very useful, but can they be used in a hard RT environment? – Will garbage collection affect RT performance? • Some authors addressed this issue for Lua – Markus Klotzbuecher, et al, Hard realtime Control and Coordination of Robot Tasks using Lua, RealTime Linux Workshop 2020. • Run performance experiments using a scripting language, and if possible, propose improvements to ensure realtime performance. 11/23/2020 Spring 2020 Lecture 6 9 UPPAALbased Static Scheduling • UPPAAL is a formal verification tool based on Timed Automata ( • Static cyclic scheduling is a mon scheduling method for safetycritical avionics applications. • UPPAAL can be used to find the optimal schedule by checking reachability of the final state (all tasks finished) from the initial state (all tasks not started) and finding the shortest path. – Yasmina Abdedda239。 m, Oded Maler: Preemptive JobShop Scheduling Using Stopwatch Automata. TACAS 2020: 113126 • Implement UPPAAL models for optimal static cyclic scheduling on multicore processors. – I have a preliminary model available upon request. 11/23/2020 Spring 2020 Lecture 6 10 UPPAALTIGA for Scheduling w/ Uncertainties • UPPAALTIGA is a modelchecker for twoplayer games – Download: – Quick tutorial: • It can be used to handle RT scheduling problems with uncertainty – Uncertain execution times, ., exec time in the interval [4, 7] instead of a fixed number – Uncertain runtime control flow, ., ifthenelse statements – It’s a game between the environment and the scheduler: env. chooses an exec time or control flow decision, and scheduler must react to handle it by making runtime decisions, ., the schedule is not fully static, but runtime adaptive. • Implement some examples in this paper – Yasmina Abdedda239。 m, Eugene Asarin, Oded Maler: Scheduling with timed automata. Theor. Comput. Sci. 354(2): 272300 (2020) 11/23/2020 Spring 2020 Lecture 6 11 ModelChecking for WCET Analysis • WCET (WorstCase Execution Time) analysis is for determining the longest execution time of a piece of code. The conventional approach to WCET analysis is based on ILP (Integer Linear Programming) • A number of authors have developed techniques。