Morteza Mohaqeqi
Forskare vid Institutionen för informationsteknologi; Datorteknik
- Telefon:
- 018-471 79 79
- E-post:
- morteza.mohaqeqi@it.uu.se
- Besöksadress:
- Hus 10, Lägerhyddsvägen 1
- Postadress:
- Box 337
751 05 UPPSALA
Mer information visas för dig som medarbetare om du loggar in.
Kort presentation
Denna text finns inte på svenska, därför visas den engelska versionen.
Morteza received his B.S., M.S., and Ph.D. degrees in Computer Engineering from the University of Tehran, Iran, in 2008, 2010, and 2015, respectively. He subsequently joined the Embedded Systems Group at the Department of Information Technology, Uppsala University, as a postdoctoral researcher. He currently works in the same group as a permanent researcher.
Forskning
Denna text finns inte på svenska, därför visas den engelska versionen.
Publications:
Mohaqeqi, M., Abdullah, J., Guan, N., Yi, W. (2016). Schedulability Analysis of Synchronous Digraph Real-Time Tasks. In Euromicro Conference on Real-Time Systems (ECRTS), to appear.
Publikationer
Urval av publikationer
- Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks (2022)
- Counting Priority Inversions (2022)
- Optimal harmonic period assignment: complexity results and approximation algorithms (2018)
- Refinement of workload models for engine controllers by state space partitioning (2017)
Senaste publikationer
- Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks (2022)
- Schedulability Analysis of WSAN Applications (2022)
- Counting Priority Inversions (2022)
- MIMOS (2022)
- Timing-Anomaly Free Dynamic Scheduling of Periodic DAG Tasks with Non-Preemptive Nodes (2021)
Alla publikationer
Artiklar
- Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks (2022)
- Sound conformance testing for cyber-physical systems (2018)
- Optimal harmonic period assignment: complexity results and approximation algorithms (2018)
Konferenser
- Schedulability Analysis of WSAN Applications (2022)
- Counting Priority Inversions (2022)
- MIMOS (2022)
- Timing-Anomaly Free Dynamic Scheduling of Periodic DAG Tasks with Non-Preemptive Nodes (2021)
- Schedulability Analysis and Software Synthesis for Graph-Based Task Models with Resource Sharing (2018)
- Towards a Tool (2017)
- Synthesis of Ada code from graph-based task models (2017)
- Refinement of workload models for engine controllers by state space partitioning (2017)
- An executable semantics for synchronous task graphs (2017)
- Schedulability analysis of synchronous digraph real-time tasks (2016)
- Modeling and analysis of data flow graphs using the digraph real-time task model (2016)
- On fixed-priority schedulability analysis of sporadic tasks with self-suspension (2016)
- Sound test-suites for cyber-physical systems (2016)
- Towards an approximate conformance relation for hybrid I/O automata (2016)
- On the problem of finding optimal harmonic periods (2016)
- Quantifying the effect of period ratios on schedulability of rate monotonic (2016)
