What is he best known for?
The fields of study he is best known for:
- Operating system
- Computer network
- Software
Robert I. Davis focuses on Distributed computing, Scheduling, Earliest deadline first scheduling, Dynamic priority scheduling and Fixed-priority pre-emptive scheduling.
His work deals with themes such as Redundancy, Priority inheritance, Correctness and Priority inversion, which intersect with Distributed computing.
His Scheduling study integrates concerns from other disciplines, such as Multiprocessing, Jitter and Response time.
His studies link Deadline-monotonic scheduling with Earliest deadline first scheduling.
His research in Dynamic priority scheduling is mostly focused on Least slack time scheduling.
Robert I. Davis interconnects Mutual exclusion and Parallel computing in the investigation of issues within Fixed-priority pre-emptive scheduling.
His most cited work include:
- A survey of hard real-time scheduling for multiprocessor systems (682 citations)
- Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised (634 citations)
- Fixed priority pre-emptive scheduling: an historical perspective (337 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Distributed computing, Scheduling, Dynamic priority scheduling, Earliest deadline first scheduling and Parallel computing.
His studies deal with areas such as Mixed criticality, CAN bus, Correctness, Jitter and Software as well as Distributed computing.
His biological study spans a wide range of topics, including Multiprocessing, Real-time computing, Response time and Speedup.
His works in Rate-monotonic scheduling, Fixed-priority pre-emptive scheduling and Least slack time scheduling are all subjects of inquiry into Dynamic priority scheduling.
His Earliest deadline first scheduling study frequently links to adjacent areas such as Deadline-monotonic scheduling.
His Deadline-monotonic scheduling study which covers Priority inheritance that intersects with Priority ceiling protocol.
He most often published in these fields:
- Distributed computing (41.83%)
- Scheduling (42.48%)
- Dynamic priority scheduling (29.41%)
What were the highlights of his more recent work (between 2017-2020)?
- Scheduling (42.48%)
- Cache (25.49%)
- Mixed criticality (13.73%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Scheduling, Cache, Mixed criticality, Static timing analysis and Response time.
His study in Scheduling is interdisciplinary in nature, drawing from both Offset, Correctness, Embedded system and Parallel computing.
His study in the field of Cache algorithms also crosses realms of Path.
His Mixed criticality research incorporates themes from Distributed computing, Task analysis, Robustness and Wireless.
His Distributed computing research includes elements of Optimization problem and Adaptive system.
In his study, Deadline-monotonic scheduling is strongly linked to Earliest deadline first scheduling, which falls under the umbrella field of Speedup.
Between 2017 and 2020, his most popular works were:
- An extensible framework for multicore response time analysis (21 citations)
- An extensible framework for multicore response time analysis (21 citations)
- Robust Mixed-Criticality Systems (18 citations)
In his most recent research, the most cited papers focused on:
- Operating system
- Computer network
- Software
His main research concerns Taxonomy, Static timing analysis, Earliest deadline first scheduling, Rate dependent and Real-time computing.
Key, Probabilistic timing analysis, Field, Subject areas and Data science are fields of study that intersect with his Taxonomy study.
His Static timing analysis research incorporates elements of Multi-core processor, Response time and Cache.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
