default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitra Nasri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c40]Pourya Gohari, Jeroen Voeten, Mitra Nasri
:
Reachability-Based Response-Time Analysis of Preemptive Tasks Under Global Scheduling. ECRTS 2024: 3:1-3:24- [c39]Nasim Samimi, Mitra Nasri, Twan Basten, Marc Geilen:
Guaranteeing Weakly-Hard Timing Constraints of Real-Time Server-Based Systems. ETFA 2024: 1-8 - [c38]Nasim Samimi, Mitra Nasri, Twan Basten, Marc Geilen:
Work in Progress: Guaranteeing Weakly-Hard Timing Constraints in Server-Based Real-Time Systems. RTAS 2024: 402-405 - [c37]Pourya Gohari, Jeroen Voeten, Mitra Nasri:
Towards a Safe and Latency-Aware Fault-tolerant Scheduling Technique for Multi-rate Task Chains. RTNS 2024: 25-36 - [c36]Pourya Gohari, Geoffrey Nelissen, Jeroen Voeten, Mitra Nasri:
Leveraging Parallelism in Global Scheduling to Improve State Space Exploration in the SAG Framework. RTNS 2024: 70-81 - [c35]Nasim Samimi, Mitra Nasri, Twan Basten, Marc Geilen:
Online Admission Test for Real-Time Tasks with Arrival Curves for Server Platforms. RTNS 2024: 266-277 - 2023
- [j8]Eghonghon-Aye Eigbe, Bart De Schutter, Mitra Nasri, Neil Yorke-Smith:
Sequence- and Time-Dependent Maintenance Scheduling in Twice Re-Entrant Flow Shops. IEEE Access 11: 103461-103475 (2023) - [j7]Sayra Ranjha, Pourya Gohari, Geoffrey Nelissen, Mitra Nasri:
Partial-order reduction in reachability-based response-time analyses of limited-preemptive DAG tasks. Real Time Syst. 59(2): 201-255 (2023) - [c34]Pourya Gohari, Jeroen Voeten, Mitra Nasri:
Response-time Analysis of Fault-Tolerant Hard Real-Time Systems Under Global Scheduling. RTCSA 2023: 263-264 - [c33]Pourya Gohari, Jeroen Voeten, Mitra Nasri:
Work-in-Progress: Tight Response-Time Analysis for Periodic Preemptive Tasks Under Global Scheduling. RTSS 2023: 451-454 - [c32]Yimi Zhao, Srinidhi Srinivasan, Geoffrey Nelissen, Mitra Nasri:
Work-in-Progress: Generating Counter-Examples to Schedulability Using the Schedule Abstraction. RTSS 2023: 459-462 - 2022
- [j6]Serban Vadineanu, Mitra Nasri:
Robust and accurate regression-based techniques for period inference in real-time systems. Real Time Syst. 58(3): 313-357 (2022) - [j5]Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, Robert I. Davis:
A comprehensive survey of industry practice in real-time systems. Real Time Syst. 58(3): 358-398 (2022) - [c31]Geoffrey Nelissen, Joan Marcè i Igual, Mitra Nasri:
Response-Time Analysis for Non-Preemptive Periodic Moldable Gang Tasks. ECRTS 2022: 12:1-12:22 - [c30]Sayra Ranjha, Geoffrey Nelissen, Mitra Nasri:
Partial-Order Reduction for Schedule-Abstraction-based Response-Time Analyses of Non-Preemptive Tasks. RTAS 2022: 121-132 - [c29]Pourya Gohari, Mitra Nasri, Jeroen Voeten:
Data-Age Analysis for Multi-Rate Task Chains under Timing Uncertainty. RTNS 2022: 24-35 - 2021
- [c28]Sena Hounsinou, Mark Stidd, Uchenna Ezeobi, Habeeb Olufowobi, Mitra Nasri, Gedare Bloom:
Vulnerability of Controller Area Network to Schedule-Based Attacks. RTSS 2021: 495-507 - [c27]Sayra Ranjha, Mitra Nasri, Geoffrey Nelissen:
Work-in-Progress: Partial-Order Reduction in Reachability-Based Response-Time Analyses. RTSS 2021: 544-547 - 2020
- [c26]Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, Robert I. Davis:
An Empirical Survey-based Study into Industry Practice in Real-time Systems. RTSS 2020: 3-11 - [c25]Suhail Nogd, Geoffrey Nelissen, Mitra Nasri, Björn B. Brandenburg:
Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks. RTSS 2020: 115-127 - [c24]Serban Vadineanu, Mitra Nasri:
Robust and Accurate Period Inference using Regression-Based Techniques. RTSS 2020: 358-370
2010 – 2019
- 2019
- [c23]Beyazit Yalcinkaya, Mitra Nasri, Björn B. Brandenburg:
An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks. DATE 2019: 1228-1233 - [c22]Arpan Gujarati, Mitra Nasri, Rupak Majumdar, Björn B. Brandenburg:
From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems. ECRTS 2019: 9:1-9:23 - [c21]Mitra Nasri, Geoffrey Nelissen, Björn B. Brandenburg:
Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global Scheduling. ECRTS 2019: 21:1-21:23 - [c20]Mitra Nasri, Thidapat Chantem, Gedare Bloom, Ryan M. Gerdes:
On the Pitfalls and Vulnerabilities of Schedule Randomization Against Schedule-Based Attacks. RTAS 2019: 103-116 - [c19]Saranya Natarajan, Mitra Nasri, David Broman, Björn B. Brandenburg, Geoffrey Nelissen:
From Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed C. RTSS 2019: 167-180 - 2018
- [j4]Morteza Mohaqeqi, Mitra Nasri, Yang Xu, Anton Cervin, Karl-Erik Årzén:
Optimal harmonic period assignment: complexity results and approximation algorithms. Real Time Syst. 54(4): 830-860 (2018) - [c18]Mitra Nasri, Geoffrey Nelissen, Björn B. Brandenburg:
A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling. ECRTS 2018: 9:1-9:23 - [c17]Arpan Gujarati, Mitra Nasri, Björn B. Brandenburg:
Quantifying the Resiliency of Fail-Operational Real-Time Networked Control Systems. ECRTS 2018: 16:1-16:24 - [c16]Mitra Nasri, Robert I. Davis, Björn B. Brandenburg:
FIFO with Offsets: High Schedulability with Low Overheads. RTAS 2018: 271-282 - 2017
- [j3]Mitra Nasri:
On flexible and robust parameter assignment for periodic real-time components. SIGBED Rev. 14(3): 8-15 (2017) - [c15]Vladislav Golyanik, Mitra Nasri, Didier Stricker:
Towards scheduling hard real-time image processing tasks on a single GPU. ICIP 2017: 4382-4386 - [c14]Mitra Nasri, Björn B. Brandenburg:
Offline Equivalence: A Non-preemptive Scheduling Technique for Resource-Constrained Embedded Real-Time Systems (Outstanding Paper). RTAS 2017: 75-86 - [c13]Mitra Nasri, Björn B. Brandenburg:
An Exact and Sustainable Analysis of Non-preemptive Scheduling. RTSS 2017: 12-23 - 2016
- [c12]Mitra Nasri, Geoffrey Nelissen, Gerhard Fohler:
A New Approach for Limited Preemptive Scheduling in Systems with Preemption Overhead. ECRTS 2016: 25-35 - [c11]Mitra Nasri, Gerhard Fohler:
Non-work-conserving Non-preemptive Scheduling: Motivations, Challenges, and Potential Solutions. ECRTS 2016: 165-175 - [c10]Mitra Nasri, Morteza Mohaqeqi, Gerhard Fohler:
Quantifying the Effect of Period Ratios on Schedulability of Rate Monotonic. RTNS 2016: 161-170 - [c9]Morteza Mohaqeqi, Mitra Nasri, Yang Xu, Anton Cervin, Karl-Erik Årzén:
On the Problem of Finding Optimal Harmonic Periods. RTNS 2016: 171-180 - 2015
- [c8]Mitra Nasri, Gerhard Fohler:
An Efficient Method for Assigning Harmonic Periods to Hard Real-Time Tasks with Period Ranges. ECRTS 2015: 149-159 - [c7]Mitra Nasri, Gerhard Fohler:
Non-work-conserving scheduling of non-preemptive hard real-time tasks based on fixed priorities. RTNS 2015: 309-318 - 2014
- [j2]Mitra Nasri, Mehdi Kargahi:
Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks. Real Time Syst. 50(4): 548-584 (2014) - [c6]Mitra Nasri, Gerhard Fohler, Mehdi Kargahi:
A Framework to Construct Customized Harmonic Periods for Real-Time Systems. ECRTS 2014: 211-220 - [c5]Mitra Nasri, Sanjoy K. Baruah, Gerhard Fohler, Mehdi Kargahi:
On the Optimality of RM and EDF for Non-Preemptive Real-Time Harmonic Tasks. RTNS 2014: 331 - 2012
- [j1]Mitra Nasri, Mehdi Kargahi, Morteza Mohaqeqi:
Scheduling of Accuracy-Constrained Real-Time Systems in Dynamic Environments. IEEE Embed. Syst. Lett. 4(3): 61-64 (2012) - [c4]Mitra Nasri, Mehdi Kargahi:
A Method for Improving Delay-Sensitive Accuracy in Real-Time Embedded Systems. RTCSA 2012: 378-387
2000 – 2009
- 2009
- [c3]Mitra Nasri, Mohsen Sharifi:
Load Balancing Using Consistent Hashing: A Real Challenge for Large Scale Distributed Web Crawlers. AINA Workshops 2009: 715-720 - 2008
- [c2]Mitra Nasri, Saeed Shariati, Mohammad Abdollahi Azgomi:
Performance Modeling of a Distributed Web Crawler Using Stochastic Activity Networks. CSICC 2008: 535-542 - [c1]Mitra Nasri, Saeed Shariati, Mohsen Sharifi:
Availability and Accuracy of Distributed Web Crawlers: A Model-Based Evaluation. EMS 2008: 453-458
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
