What is he best known for?
The fields of study he is best known for:
- Operating system
- Scheduling
- Computer network
His primary areas of study are Distributed computing, Scheduling, Parallel computing, Fixed-priority pre-emptive scheduling and Dynamic priority scheduling.
His Scheduling study which covers Real-time computing that intersects with Asymptotically optimal algorithm, Data acquisition and Uniprocessor scheduling.
His Parallel computing research is multidisciplinary, relying on both Computational complexity theory and Multiprocessor scheduling.
His Fixed-priority pre-emptive scheduling study integrates concerns from other disciplines, such as Earliest deadline first scheduling and Preemption.
The Dynamic priority scheduling study combines topics in areas such as Schedule and Fair-share scheduling.
Round-robin scheduling is closely connected to Two-level scheduling in his research, which is encompassed under the umbrella topic of Rate-monotonic scheduling.
His most cited work include:
- Proportionate progress: A notion of fairness in resource allocation (623 citations)
- Preemptively scheduling hard-real-time sporadic tasks on one processor (598 citations)
- Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor (525 citations)
What are the main themes of his work throughout his whole career to date?
Sanjoy Baruah mostly deals with Scheduling, Distributed computing, Parallel computing, Earliest deadline first scheduling and Dynamic priority scheduling.
Sanjoy Baruah interconnects Real-time computing and Speedup in the investigation of issues within Scheduling.
His study in Distributed computing is interdisciplinary in nature, drawing from both Mixed criticality, Workload, Preemption, Uniprocessor scheduling and Multi-core processor.
The concepts of his Parallel computing study are interwoven with issues in Computational complexity theory, Multiprocessor scheduling and Priority scheduling.
His Earliest deadline first scheduling research includes themes of Correctness and Deadline-monotonic scheduling.
In most of his Dynamic priority scheduling studies, his work intersects topics such as Fair-share scheduling.
He most often published in these fields:
- Scheduling (51.24%)
- Distributed computing (50.93%)
- Parallel computing (40.37%)
What were the highlights of his more recent work (between 2014-2021)?
- Scheduling (51.24%)
- Distributed computing (50.93%)
- Parallel computing (40.37%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Scheduling, Distributed computing, Parallel computing, Mixed criticality and Multiprocessing.
The various areas that Sanjoy Baruah examines in his Scheduling study include Mathematical optimization, Speedup and Operations research.
Sanjoy Baruah has researched Distributed computing in several fields, including Earliest deadline first scheduling, Rate-monotonic scheduling, Dynamic priority scheduling, Fixed-priority pre-emptive scheduling and Fair-share scheduling.
He focuses mostly in the field of Earliest deadline first scheduling, narrowing it down to matters related to Deadline-monotonic scheduling and, in some cases, Priority inversion.
Sanjoy Baruah has included themes like Multiprocessor scheduling and Two-level scheduling in his Parallel computing study.
His work in Multiprocessing addresses issues such as Job shop scheduling, which are connected to fields such as Directed acyclic graph and Approximation algorithm.
Between 2014 and 2021, his most popular works were:
- Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems (51 citations)
- Multiprocessor Scheduling for Real-Time Systems (47 citations)
- The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks (45 citations)
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.
