His primary scientific interests are in Distributed computing, Scheduling, Dynamic priority scheduling, Real-time computing and Earliest deadline first scheduling. His studies in Distributed computing integrate themes in fields like Priority inheritance, Priority inversion, Deadline-monotonic scheduling and Operations research. His work carried out in the field of Scheduling brings together such families of science as Multiprocessing and Jitter.
The various areas that he examines in his Dynamic priority scheduling study include Systems architecture and Fair-share scheduling. The study incorporates disciplines such as Second-generation programming language, Programming language, Real-time operating system and Software engineering in addition to Real-time computing. Within one scientific family, Alan Burns focuses on topics pertaining to Parallel computing under Earliest deadline first scheduling, and may sometimes address concerns connected to Worst-case execution time.
Alan Burns focuses on Distributed computing, Scheduling, Real-time computing, Programming language and Dynamic priority scheduling. His Distributed computing research incorporates themes from Shared resource, Mixed criticality, Protocol and Response time. His Scheduling research is multidisciplinary, incorporating perspectives in Multiprocessing and Real-time operating system.
His studies deal with areas such as Systems design and Correctness as well as Real-time computing. His is doing research in Earliest deadline first scheduling, Rate-monotonic scheduling, Fixed-priority pre-emptive scheduling and Deadline-monotonic scheduling, both of which are found in Dynamic priority scheduling. His research integrates issues of Operations research and Parallel computing in his study of Earliest deadline first scheduling.
Alan Burns mainly focuses on Distributed computing, Mixed criticality, Scheduling, Multiprocessing and Dynamic priority scheduling. His study in Distributed computing is interdisciplinary in nature, drawing from both Shared resource, Resource, Mixed criticality scheduling, Task and Cyber-physical system. He combines subjects such as Fault tolerance, Task analysis and Preemption with his study of Scheduling.
Rate-monotonic scheduling, Earliest deadline first scheduling and Deadline-monotonic scheduling are the core of his Dynamic priority scheduling study. Earliest deadline first scheduling is closely attributed to Real-time computing in his research. In his research on the topic of Deadline-monotonic scheduling, Priority inheritance is strongly related with Priority ceiling protocol.
Alan Burns spends much of his time researching Distributed computing, Mixed criticality, Scheduling, Dynamic priority scheduling and Earliest deadline first scheduling. His biological study spans a wide range of topics, including Schedule, Multiprocessing, Shared resource, Resource and Cyber-physical system. Alan Burns has included themes like Embedded system, Network on a chip and Robustness in his Mixed criticality study.
His Dynamic priority scheduling research is multidisciplinary, incorporating elements of Uniprocessor system and Real-time computing. His research in Real-time computing intersects with topics in Concurrency control, Mutual exclusion and Preemption. His Deadline-monotonic scheduling research integrates issues from Priority inversion, Priority ceiling protocol and Parallel computing.
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.
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Alan Burns;Andrew J. Wellings.
Applying new scheduling theory to static priority pre-emptive scheduling
Neil C. Audsley;Alan Burns;Mike M. Richardson;Ken Tindell.
Software Engineering Journal (1993)
A survey of hard real-time scheduling for multiprocessor systems
Robert I. Davis;Alan Burns.
ACM Computing Surveys (2011)
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
Robert I. Davis;Alan Burns;Reinder J. Bril;Johan J. Lukkien.
Real-time Systems (2007)
Calculating controller area network (can) message response times
K. Tindell;A. Burns;A.J. Wellings.
IFAC Proceedings Volumes (1994)
Real-Time Systems and Programming Languages
Alan Burns;Andrew J. Wellings.
Real Time Scheduling Theory: A Historical Perspective
Lui Sha;Tarek Abdelzaher;Karl-Erik Årzén;Anton Cervin.
Real-time Systems (2004)
An extendible approach for analyzing fixed priority hard real-time tasks
K. W. Tindell;A. Burns;A. J. Wellings.
Real-time Systems (1994)
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
N.C. Audsley;A. Burns;M.F. Richardson;A.J. Wellings.
IFAC Proceedings Volumes (1991)
Fixed priority pre-emptive scheduling: an historical perspective
Neil C. Audsley;Alan Burns;Robert I. Davis;Ken W. Tindell.
Real-time Systems (1995)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: