default search action
Geoffrey Nelissen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c59]Srinidhi Srinivasan, Geoffrey Nelissen, Reinder J. Bril, Nirvana Meratnia:
Analysis of TSN Time-Aware Shapers Using Schedule Abstraction Graphs. ECRTS 2024: 16:1-16:24 - [c58]Jatin Arora, Syed Aftab Rashid, Geoffrey Nelissen, Cláudio Maia, Eduardo Tovar:
Improved Memory Contention Analysis for the 3-Phase Task Model. RTCSA 2024: 11-20 - 2023
- [j21]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) - [j20]Geoffrey Nelissen
Special issue on reliable data transmission in real-time systems. Real Time Syst. 59(4): 662-663 (2023) - [c57]Federico Aromolo, Geoffrey Nelissen, Alessandro Biondi
Replication-Based Scheduling of Parallel Real-Time Tasks. ECRTS 2023: 18:1-18:23 - [c56]Yilian Ribot González
Traffic Injection Regulation Protocol Based on Free Time-Slots Requests. RTCSA 2023: 157-166 - [c55]Jatin Arora, Syed Aftab Rashid, Geoffrey Nelissen, Cláudio Maia, Eduardo Tovar
Improved Bus Contention Analysis for 3-Phase Tasks. RTCSA 2023: 243-252 - [c54]Yilian Ribot González
IPDeN 2.0: Real-time NoC with selective flit deflection and buffering. RTNS 2023: 87-98 - [c53]Yimi Zhao, Srinidhi Srinivasan, Geoffrey Nelissen, Mitra Nasri:
Work-in-Progress: Generating Counter-Examples to Schedulability Using the Schedule Abstraction. RTSS 2023: 459-462 - [c52]Reinder J. Bril, Hamid Hassani, Pieter J. L. Cuijpers
Cost of Robustness of Independent WCRT Analysis for CBS of Ethernet AVB Using Eligible Intervals. WFCS 2023: 1-4 - 2022
- [j19]Federico Aromolo, Alessandro Biondi, Geoffrey Nelissen
Response-Time Analysis for Self-Suspending Tasks Under EDF Scheduling (Artifact). Dagstuhl Artifacts Ser. 8(1): 05:1-05:2 (2022) - [j18]Syed Aftab Rashid
Tightening the CRPD bound for multilevel non-inclusive caches. J. Syst. Archit. 122: 102340 (2022) - [j17]Jatin Arora
Bus-contention aware WCRT analysis for the 3-phase task model considering a work-conserving bus arbitration scheme. J. Syst. Archit. 122: 102345 (2022) - [j16]Jatin Arora
Schedulability analysis for 3-phase tasks with partitioned fixed-priority scheduling. J. Syst. Archit. 131: 102706 (2022) - [j15]Benny Akesson
A comprehensive survey of industry practice in real-time systems. Real Time Syst. 58(3): 358-398 (2022) - [c51]Geoffrey Nelissen
Response-Time Analysis for Non-Preemptive Periodic Moldable Gang Tasks. ECRTS 2022: 12:1-12:22 - [c50]Federico Aromolo, Alessandro Biondi
Response-Time Analysis for Self-Suspending Tasks Under EDF Scheduling. ECRTS 2022: 13:1-13:18 - [c49]Sayra Ranjha, Geoffrey Nelissen
Partial-Order Reduction for Schedule-Abstraction-based Response-Time Analyses of Non-Preemptive Tasks. RTAS 2022: 121-132 - [c48]Yilian Ribot González
IPDeN: Real-Time deflection-based NoC with in-order flits delivery. RTCSA 2022: 160-169 - [c47]Jatin Arora, Syed Aftab Rashid, Cláudio Maia, Geoffrey Nelissen, Eduardo Tovar
Work-in-Progress: A Holistic Approach to WCRT Analysis for Multicore Systems. RTSS 2022: 511-514 - [e1]Yasmina Abdeddaïm, Liliana Cucu-Grosjean, Geoffrey Nelissen, Laurent Pautet:
RTNS 2022: The 30th International Conference on Real-Time Networks and Systems, Paris, France, June 7 - 8, 2022. ACM 2022, ISBN 978-1-4503-9650-9 [contents] - 2021
- [c46]Yilian Ribot González
nDimNoC: Real-Time D-dimensional NoC. ECRTS 2021: 5:1-5:22 - [c45]Federico Aromolo, Alessandro Biondi
Event-Driven Delay-Induced Tasks: Model, Analysis, and Applications. RTAS 2021: 53-65 - [c44]Jatin Arora
Bus-Contention Aware Schedulability Analysis for the 3-Phase Task Model with Partitioned Scheduling. RTNS 2021: 123-133 - [c43]Srinidhi Srinivasan, Geoffrey Nelissen, Reinder J. Bril:
Work-in-Progress: Analysis of TSN Time-Aware Shapers using Schedule Abstraction Graphs. RTSS 2021: 508-511 - [c42]Sayra Ranjha, Mitra Nasri
Work-in-Progress: Partial-Order Reduction in Reachability-Based Response-Time Analyses. RTSS 2021: 544-547 - 2020
- [j14]Yilian Ribot González
HopliteRT*: Real-Time NoC for FPGA. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3650-3661 (2020) - [c41]Syed Aftab Rashid, Geoffrey Nelissen
Cache Persistence-Aware Memory Bus Contention Analysis for Multicore Systems. DATE 2020: 442-447 - [c40]Humberto Carvalho
mcQEMU: Time-Accurate Simulation of Multi-core platforms using QEMU. DSD 2020: 81-88 - [c39]Daniel Casini
A Holistic Memory Contention Analysis for Parallel Real-Time Tasks under Partitioned Scheduling. RTAS 2020: 239-252 - [c38]Syed Aftab Rashid, Geoffrey Nelissen
Bounding Cache Persistence Reload Overheads for Set-Associative Caches. RTCSA 2020: 1-10 - [c37]Benny Akesson, Mitra Nasri
An Empirical Survey-based Study into Industry Practice in Real-time Systems. RTSS 2020: 3-11 - [c36]Suhail Nogd, Geoffrey Nelissen
Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks. RTSS 2020: 115-127 - [c35]Jatin Arora
Work-In-Progress: WCRT Analysis for the 3-Phase Task Model in Partitioned Scheduling. RTSS 2020: 407-410
2010 – 2019
- 2019
- [j13]Arpan Gujarati, Felipe Cerqueira, Björn B. Brandenburg
Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling. Real Time Syst. 55(1): 136-143 (2019) - [j12]Jian-Jia Chen
Many suspensions, many problems: a review of self-suspending tasks in real-time systems. Real Time Syst. 55(1): 144-207 (2019) - [j11]José Carlos Fonseca, Geoffrey Nelissen
Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling. Real Time Syst. 55(2): 387-432 (2019) - [c34]Mitra Nasri
Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global Scheduling. ECRTS 2019: 21:1-21:23 - [c33]Saranya Natarajan, Mitra Nasri
From Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed C. RTSS 2019: 167-180 - 2018
- [j10]Konstantinos Bletsas
Errata for Three Papers (2004-05) on Fixed-Priority Scheduling with Self-Suspensions. Leibniz Trans. Embed. Syst. 5(1): 02:1-02:20 (2018) - [j9]Alexandre Esper, Geoffrey Nelissen
An industrial view on the common academic understanding of mixed-criticality systems. Real Time Syst. 54(3): 745-795 (2018) - [c32]Mitra Nasri
A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling. ECRTS 2018: 9:1-9:23 - [c31]Felipe Cerqueira, Geoffrey Nelissen
On Strong and Weak Sustainability, with an Application to Self-Suspending Real-Time Tasks. ECRTS 2018: 26:1-26:21 - [c30]Syed Aftab Rashid, Geoffrey Nelissen
Trading Between Intra- and Inter-Task Cache Interference to Improve Schedulability. RTNS 2018: 125-136 - [c29]Daniel Casini
Memory Feasibility Analysis of Parallel Tasks Running on Scratchpad-Based Architectures. RTSS 2018: 312-324 - [c28]Geoffrey Nelissen
The SRP Resource Sharing Protocol for Self-Suspending Tasks. RTSS 2018: 361-372 - [c27]Daniel Casini
Partitioned Fixed-Priority Scheduling of Parallel Tasks Without Preemptions. RTSS 2018: 421-433 - 2017
- [c26]Cláudio Maia
Schedulability analysis for global fixed-priority scheduling of the 3-phase task model. RTCSA 2017: 1-10 - [c25]José Carlos Fonseca, Geoffrey Nelissen
Improved response time analysis of sporadic DAG tasks for global FP scheduling. RTNS 2017: 28-37 - [c24]Syed Aftab Rashid, Geoffrey Nelissen
Integrated Analysis of Cache Related Preemption Delays and Cache Persistence Reload Overheads. RTSS 2017: 188-198 - 2016
- [j8]Muhammad Ali Awan
Online slack consolidation in global-EDF for energy consumption minimisation. J. Syst. Archit. 63: 1-15 (2016) - [j7]Muhammad Ali Awan
Energy-aware task mapping onto heterogeneous platforms using DVFS and sleep states. Real Time Syst. 52(4): 450-485 (2016) - [j6]Ricardo Garibay-Martínez, Geoffrey Nelissen
Improved Holistic Analysis for Fork-Join Distributed Real-Time Tasks Supported by the FTT-SE Protocol. IEEE Trans. Ind. Informatics 12(5): 1865-1876 (2016) - [c23]Mitra Nasri
A New Approach for Limited Preemptive Scheduling in Systems with Preemption Overhead. ECRTS 2016: 25-35 - [c22]Jian-Jia Chen
A Unifying Response Time Analysis Framework for Dynamic Self-Suspending Tasks. ECRTS 2016: 61-71 - [c21]Syed Aftab Rashid, Geoffrey Nelissen
Cache-Persistence-Aware Response-Time Analysis for Fixed-Priority Preemptive Systems. ECRTS 2016: 262-272 - [c20]Syed Aftab Rashid, Geoffrey Nelissen, Eduardo Tovar:
Poster Abstract: Cache Persistence Aware Response Time Analysis for Fixed Priority Preemptive Systems. RTAS 2016: 57 - [c19]Geoffrey Nelissen, Humberto Carvalho
Demo Abstract: Run-Time Monitoring Environments for Real-Time and Safety Critical Systems. RTAS 2016: 67 - [c18]Sangeeth Kochanthara, Geoffrey Nelissen
REVERT: Runtime Verification for Real-Time Systems. RTSS 2016: 365 - [c17]Syed Aftab Rashid, Geoffrey Nelissen
Integrating the calculation of preemption and persistence related cache overhead. RTSS 2016: 366 - [c16]José Carlos Fonseca, Geoffrey Nelissen
Response time analysis of sporadic DAG tasks under partitioned scheduling. SIES 2016: 290-299 - [i2]Jian-Jia Chen
A Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems. CoRR abs/1602.07750 (2016) - 2015
- [j5]Ricardo Garibay-Martínez, Geoffrey Nelissen
Task partitioning and priority assignment for distributed hard real-time systems. J. Comput. Syst. Sci. 81(8): 1542-1555 (2015) - [c15]Geoffrey Nelissen
A Novel Run-Time Monitoring Architecture for Safe and Efficient Inline Monitoring. Ada-Europe 2015: 66-82 - [c14]Andrea Baldovin, Alessandro Zovi, Geoffrey Nelissen
The CONCERTO Methodology for Model-Based Development of Avionics Software. Ada-Europe 2015: 131-145 - [c13]Ricardo Garibay-Martínez, Geoffrey Nelissen
Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures Supported by an FTT-SE Network. ARCS 2015: 224-235 - [c12]Geoffrey Nelissen
Timing Analysis of Fixed Priority Self-Suspending Sporadic Tasks. ECRTS 2015: 80-89 - [c11]Alexandre Esper, Geoffrey Nelissen
How realistic is the mixed-criticality real-time system model? RTNS 2015: 139-148 - [c10]Ricardo Garibay-Martínez, Geoffrey Nelissen
Holistic analysis for fork-join distributed tasks supported by the FTT-SE protocol. WFCS 2015: 1-4 - 2014
- [j4]Geoffrey Nelissen
An optimal boundary fair scheduling. Real Time Syst. 50(4): 456-508 (2014) - [j3]Geoffrey Nelissen
CPMD-mindful task assignment for NPS-F. Real Time Syst. 50(5-6): 585-591 (2014) - [c9]Yannick Allard, Geoffrey Nelissen
A context aware cache controller to bridge the gap between theory and practice in real-time systems. RTCSA 2014: 1-10 - [c8]Andrea Baldovin, Geoffrey Nelissen
SPRINT: Extending RUN to Schedule Sporadic Tasks. RTNS 2014: 321 - [c7]Ricardo Garibay-Martínez, Geoffrey Nelissen
On the scheduling of fork-join parallel/distributed real-time tasks. SIES 2014: 31-40 - 2013
- [c6]François Santy, Gurulingesh Raravi, Geoffrey Nelissen
Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems. RTNS 2013: 183-192 - [c5]Ricardo Garibay-Martínez, Geoffrey Nelissen, Luis Lino Ferreira, Luís Miguel Pinho:
Task Partitioning and Priority Assignment for Hard Real-time Distributed Systems. REACTION 2013 - [i1]François Santy, Geoffrey Nelissen, Joël Goossens:
Improving Mixed-Criticality System Consistency and Behavior on Multiprocessor Platforms by Means of Multi-Moded Approaches. CoRR abs/1302.1010 (2013) - 2012
- [c4]Geoffrey Nelissen
U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks. ECRTS 2012: 13-23 - [c3]Geoffrey Nelissen
Techniques Optimizing the Number of Processors to Schedule Multi-threaded Tasks. ECRTS 2012: 321-330 - [c2]Geoffrey Nelissen
Reducing Preemptions and Migrations in EKG. RTCSA 2012: 134-143 - 2011
- [j2]Geoffrey Nelissen
A counter-example to: Sticky-ERfair: a task-processor affinity aware proportional fair scheduler. Real Time Syst. 47(4): 378-381 (2011) - [j1]Geoffrey Nelissen, Shelby H. Funk, Joël Goossens, Dragomir Milojevic:
Swapping to reduce preemptions and migrations in EKG. SIGBED Rev. 8(3): 36-39 (2011) - [c1]Geoffrey Nelissen
Reducing Preemptions and Migrations in Real-Time Multiprocessor Scheduling Algorithms by Releasing the Fairness. RTCSA (1) 2011: 15-24
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 2024-10-17 20:30 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: