Name
Papers
Collaborators
RADU DOBRIN
42
65
Citations 
PageRank 
Referers 
169
22.41
398
Referees 
References 
587
511
Search Limit
100587
Title
Citations
PageRank
Year
Cache-aware response time analysis for real-time tasks with fixed preemption points00.342020
Improving the Accuracy of Cache-Aware Response Time Analysis Using Preemption Partitioning.00.342020
A Comparison of Partitioning Strategies for Fixed Points Based Limited Preemptive Scheduling.00.342019
On Fault-Tolerant Scheduling of Time Sensitive Networks.00.342019
Exact speedup factors and sub-optimality for non-preemptive scheduling.00.342018
Improved Cache-Related Preemption Delay Estimation For Fixed Preemption Point Scheduling10.352018
Tightening the Bounds on Cache-Related Preemption Delay in Fixed Preemption Point Scheduling.00.342017
Self-configuration of IEEE 802.1 TSN networks30.852017
An Event-Based Messaging Architecture for Vehicular Internet of Things (IoT) Platforms.00.342017
An Empirical Investigation Of Eager And Lazy Preemption Approaches In Global Limited Preemptive Scheduling10.352016
Protecting Clock Synchronization00.342016
Error Handling Algorithm and Probabilistic Analysis Under Fault for CAN-Based Steer-by-Wire System.20.362016
Learning the parameters of periodic traffic based on network measurements20.382015
A configuration agent based on the time-triggered paradigm for real-time networks30.422015
The Limited-preemptive Feasibility of Real-time Tasks on Uniprocessors30.372015
Quantifying the Exact Sub-optimality of Non-preemptive Scheduling50.392015
Multiprocessor fixed priority scheduling with limited preemptions30.392015
Bounding the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error bursts00.342014
The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks90.472014
Probabilistic Schedulability Analysis for Fault Tolerant Tasks under Stochastic Error Occurrences00.342013
Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling40.402013
On voting strategies for loosely synchronized dependable real-time systems00.342012
Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts40.422012
Probabilistic preemption control using frequency scaling for sporadic real-time tasks.40.442012
Probabilistic Schedulability Guarantees for Dependable Real-Time Systems under Error Bursts50.462011
Towards preemption control using CPU frequency scaling in sporadic task systems.10.362011
Task-Level Probabilistic Scheduling Guarantees for Dependable Real-Time Systems - A Designer Centric Approach.20.362011
Preemption Control Using Frequency Scaling in Fixed Priority Scheduling00.342010
Fault Tolerant Scheduling on Controller Area Network (CAN).20.442010
Mapping complex timing constraints to simple real-time scheduling parameters00.342010
Efficient Fault Tolerant Scheduling On Controller Area Network (Can)40.432010
A Cascading Redundancy Approach for Dependable Real-Time Systems10.362009
'State of the Art' in Using Agile Methods for Embedded Systems Development90.862009
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules90.532008
Error Modeling in Dependable Component-Based Systems60.662008
VTV - A Voting Strategy for Real-Time Systems50.512008
GENESIS: a framework for global engineering of embedded systems00.342008
Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network524.852004
Reducing the Number of Preemptions in Fixed Priority Scheduling130.632004
Attaining Flexible Real-Time Systems by Bringing Together Component Technologies and Real-Time Systems Theory30.472003
A component based real-time scheduling architecture00.342002
Translating Off-Line Schedules into Task Attributes for Fixed Priority Scheduling130.802001