|
Sverres home Introduksjon SW development projects: Programmeringsprosjekt (Flere oppgaver) Elevator automatic FAT for TTK4145 Procedural Generation: Game Worlds Procedural Generation: Music Programvare design av simulator Dynamic deployment system for real-time tasks Measurement-based real-time system Bibliotek for meldingssending Teoretical projects: Implementing Lingua-Franca programs on real-time operating systems Models of Computation Salvaging XC features Schedulability proof for message passing systems Dynamic deployment system for real-time tasks Bruk av online eksekveringstidsestimater Real-time systems not based on timing requirements Programering av tunge tråder ved nonpreemptive scheduling. Deling av CPU og Nettverk Morsomme sensorer og applikasjoner: Døvehørsel Blindesyn Bike trainer app Eksterne oppgaver: |
Schedulability proof for message passing systemsIt is not really any reason why we do not have schedulability proofs for messagepassing systems. Certainly messagepassing systems are associated with network communication protocols with bad timing guarantees, but it is as relevant to look at communication as a time-less, conceptual information flow from one thread to the other. Another, removable, obstacle is that messagepassing systems often motivates leaving the "one thread per timing demand" assumtion. Do a litterature study; Start with Martin Korsgaards PhD Thesis, find a suitably conservative set of assumptions and attempt at a proof strategy. |