H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 73 Citations 26,561 358 World Ranking 681 National Ranking 43

Overview

What is he best known for?

The fields of study he is best known for:

  • Operating system
  • Programming language
  • Computer network

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.

His most cited work include:

  • Applying new scheduling theory to static priority pre-emptive scheduling (949 citations)
  • A survey of hard real-time scheduling for multiprocessor systems (682 citations)
  • Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised (634 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Distributed computing (34.95%)
  • Scheduling (29.23%)
  • Real-time computing (24.40%)

What were the highlights of his more recent work (between 2013-2021)?

  • Distributed computing (34.95%)
  • Mixed criticality (6.15%)
  • Scheduling (29.23%)

In recent papers he was focusing on the following fields of study:

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.

Between 2013 and 2021, his most popular works were:

  • Mixed Criticality Systems - A Review (283 citations)
  • A Survey of Research into Mixed Criticality Systems (89 citations)
  • A Wormhole NoC Protocol for Mixed Criticality Systems (54 citations)

In his most recent research, the most cited papers focused on:

  • Operating system
  • Programming language
  • Computer network

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.

Top Publications

Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX

Alan Burns;Andrew J. Wellings.
(2009)

2069 Citations

Applying new scheduling theory to static priority pre-emptive scheduling

Neil C. Audsley;Alan Burns;Mike M. Richardson;Ken Tindell.
Software Engineering Journal (1993)

1521 Citations

A survey of hard real-time scheduling for multiprocessor systems

Robert I. Davis;Alan Burns.
ACM Computing Surveys (2011)

1066 Citations

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)

866 Citations

Calculating controller area network (can) message response times

K. Tindell;A. Burns;A.J. Wellings.
IFAC Proceedings Volumes (1994)

798 Citations

Real-Time Systems and Programming Languages

Alan Burns;Andrew J. Wellings.
(2009)

794 Citations

Real Time Scheduling Theory: A Historical Perspective

Lui Sha;Tarek Abdelzaher;Karl-Erik Årzén;Anton Cervin.
Real-time Systems (2004)

777 Citations

An extendible approach for analyzing fixed priority hard real-time tasks

K. W. Tindell;A. Burns;A. J. Wellings.
Real-time Systems (1994)

766 Citations

Hard Real-Time Scheduling: The Deadline-Monotonic Approach

N.C. Audsley;A. Burns;M.F. Richardson;A.J. Wellings.
IFAC Proceedings Volumes (1991)

727 Citations

Fixed priority pre-emptive scheduling: an historical perspective

Neil C. Audsley;Alan Burns;Robert I. Davis;Ken W. Tindell.
Real-time Systems (1995)

529 Citations

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.

Contact us

Top Scientists Citing Alan Burns

Rolf Ernst

Rolf Ernst

Technische Universität Braunschweig

Publications: 122

Andy Wellings

Andy Wellings

University of York

Publications: 108

Giorgio Buttazzo

Giorgio Buttazzo

Sant'Anna School of Advanced Studies

Publications: 94

Sanjoy Baruah

Sanjoy Baruah

Washington University in St. Louis

Publications: 80

Robert I. Davis

Robert I. Davis

University of York

Publications: 71

Eduardo Tovar

Eduardo Tovar

International Student Exchange Programs

Publications: 65

Petru Eles

Petru Eles

Linköping University

Publications: 61

Zebo Peng

Zebo Peng

Linköping University

Publications: 58

Jian-Jia Chen

Jian-Jia Chen

TU Dortmund University

Publications: 56

Haibo Zeng

Haibo Zeng

Nanjing University of Science and Technology

Publications: 51

Joël Goossens

Joël Goossens

Université Libre de Bruxelles

Publications: 49

P Puschner

P Puschner

TU Wien

Publications: 49

Giuseppe Lipari

Giuseppe Lipari

University of Lille

Publications: 46

Ragunathan Rajkumar

Ragunathan Rajkumar

Carnegie Mellon University

Publications: 45

Francisco J. Cazorla

Francisco J. Cazorla

Barcelona Supercomputing Center

Publications: 45

Something went wrong. Please try again later.