Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRisat Mahmud Pathan
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Petros Voudouris
, Per Stenström, Risat Pathan:
Bounding the execution time of parallel applications on unrelated multiprocessors. Real Time Syst. 58(2): 189-232 (2022)- 2021
- [j6]Petros Voudouris, Per Stenström, Risat Pathan:
Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors. ACM Trans. Embed. Comput. Syst. 20(5s): 87:1-87:25 (2021)
2010 – 2019
- 2018
- [j5]Risat Pathan, Petros Voudouris, Per Stenström:
Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms. IEEE Trans. Parallel Distributed Syst. 29(4): 915-928 (2018) - [c20]Risat Mahmud Pathan:
Improving the Schedulability and Quality of Service for Federated Scheduling of Parallel Mixed-Criticality Tasks on Multiprocessors. ECRTS 2018: 12:1-12:22 - [c19]Xiaozhe Gu, Arvind Easwaran, Risat Pathan:
Design and Analysis for Dual Priority Scheduling. ISORC 2018: 164-173 - 2017
- [j4]Risat Mahmud Pathan:
Real-time scheduling algorithm for safety-critical systems on faulty multicore environments. Real Time Syst. 53(1): 45-81 (2017) - [c18]Risat Mahmud Pathan:
Improving the Quality-of-Service for Scheduling Mixed-Criticality Systems on Multiprocessors. ECRTS 2017: 19:1-19:22 - [c17]Petros Voudouris, Per Stenström, Risat Pathan:
Timing-Anomaly Free Dynamic Scheduling of Task-Based Parallel Applications. RTAS 2017: 365-376 - 2016
- [j3]Risat Mahmud Pathan:
Real-Time Scheduling on Uni- and Multiprocessors based on Priority Promotions. Leibniz Trans. Embed. Syst. 3(1): 02:1-02:29 (2016) - [c16]Risat Mahmud Pathan:
Design of an efficient ready queue for earliest-deadline-first (EDF) scheduler. DATE 2016: 293-296 - [c15]Petros Voudouris, Per Stenström, Risat Pathan:
Timing-anomaly free dynamic scheduling of task-based parallel applications. RTSS 2016: 371 - 2015
- [c14]Negin Fathollahnejad, Risat Pathan, Johan Karlsson:
On the Probability of Unsafe Disagreement in Group Formation Algorithms for Vehicular Ad Hoc Networks. EDCC 2015: 256-267 - [c13]Risat Mahmud Pathan:
Unifying fixed- and dynamic-priority scheduling based on priority promotion and an improved ready queue management technique. RTAS 2015: 209-220 - 2014
- [j2]Risat Mahmud Pathan, Jan Jonsson:
Interference-aware fixed-priority schedulability analysis on multiprocessors. Real Time Syst. 50(4): 411-455 (2014) - [j1]Risat Mahmud Pathan:
Fault-tolerant and real-time scheduling for mixed-criticality systems. Real Time Syst. 50(4): 509-547 (2014) - [c12]Negin Fathollahnejad, Emília Villani, Risat Pathan, Raul Barbosa, Johan Karlsson:
On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols. EDCC 2014: 23-34 - [c11]Risat Mahmud Pathan, Per Stenström, Lars-Goran Green, Torbjorn Hult, Patrik Sandin:
Overhead-aware temporal partitioning on multicore processors. RTAS 2014: 251-262 - 2013
- [c10]Negin Fathollahnejad, Emília Villani, Risat Pathan, Raul Barbosa, Johan Karlsson:
On reliability analysis of leader election protocols for virtual traffic lights. DSN Workshops 2013: 1-12 - [c9]Negin Fathollahnejad, Emília Villani, Risat Pathan, Raul Barbosa, Johan Karlsson:
Probabilistic Analysis of a 1-of-n Selection Algorithm Using a Moderately Pessimistic Decision Criterion. PRDC 2013: 68-77 - [c8]Emília Villani, Negin Fathollahnejad, Risat Pathan, Raul Barbosa, Johan Karlsson:
Reliability Analysis of Consensus in Cooperative Transport Systems. ASCoMS@SAFECOMP 2013 - 2012
- [b1]Risat Mahmud Pathan:
Three Aspects of Real-Time Multiprocessor Scheduling: Timeliness, Fault Tolerance, Mixed Criticality. Chalmers University of Technology, Gothenburg, Sweden, 2012 - [c7]Risat Mahmud Pathan:
Schedulability Analysis of Mixed-Criticality Systems on Multiprocessors. ECRTS 2012: 309-320 - 2011
- [c6]Risat Mahmud Pathan, Jan Jonsson:
Improved Schedulability Tests for Global Fixed-Priority Scheduling. ECRTS 2011: 136-147 - [c5]Risat Mahmud Pathan, Jan Jonsson:
FTGS: Fault-Tolerant Fixed-Priority Scheduling on Multiprocessors. TrustCom 2011: 1164-1175 - 2010
- [c4]Johan Nordlander, Rolf Johansson, Risat Mahmud Pathan:
Unambiguous semantics in automotive timing modeling. EDCC-CARS 2010: 39-42 - [c3]Risat Mahmud Pathan, Jan Jonsson:
Parameterized Schedulability Analysis on Uniform Multiprocessors. ICPP 2010: 323-332 - [c2]Risat Mahmud Pathan, Jan Jonsson:
Load regulating algorithm for static-priority task scheduling on multiprocessors. IPDPS 2010: 1-12 - [c1]Risat Mahmud Pathan, Jan Jonsson:
Exact Fault-Tolerant Feasibility Analysis of Fixed-Priority Real-Time Tasks. RTCSA 2010: 265-274
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 2023-09-28 02:44 CEST 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:
