What is he best known for?
The fields of study he is best known for:
- Operating system
- Computer network
- Artificial intelligence
His primary scientific interests are in Distributed computing, Scheduling, Parallel computing, Fair-share scheduling and Dynamic priority scheduling.
His Distributed computing study integrates concerns from other disciplines, such as Cooperative game theory, Greedy algorithm, The Internet, Server and Multi-core processor.
Ishfaq Ahmad has included themes like Analysis of parallel algorithms, Theoretical computer science, Probabilistic analysis of algorithms and Directed acyclic graph in his Scheduling study.
His work in the fields of Parallel computing, such as Parallel algorithm, intersects with other areas such as Resource management.
His Fair-share scheduling research is multidisciplinary, relying on both Evolutionary algorithm, Genetic algorithm and Heuristic.
His Dynamic priority scheduling research is mostly focused on the topic Rate-monotonic scheduling.
His most cited work include:
- Static scheduling algorithms for allocating directed task graphs to multiprocessors (1145 citations)
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors (726 citations)
- Benchmarking and Comparison of the Task Graph Scheduling Algorithms (361 citations)
What are the main themes of his work throughout his whole career to date?
Distributed computing, Scheduling, Parallel computing, Fair-share scheduling and Real-time computing are his primary areas of study.
His studies in Distributed computing integrate themes in fields like The Internet, Server and Heuristics.
Ishfaq Ahmad interconnects Genetic algorithm and Distributed database in the investigation of issues within Heuristics.
His research in Scheduling intersects with topics in Multi-core processor, Network topology, Mathematical optimization and Algorithm.
The various areas that Ishfaq Ahmad examines in his Fair-share scheduling study include Schedule and Dynamic priority scheduling.
His Parallel algorithm research is multidisciplinary, incorporating elements of Time complexity and Computational complexity theory.
He most often published in these fields:
- Distributed computing (32.75%)
- Scheduling (25.35%)
- Parallel computing (23.59%)
What were the highlights of his more recent work (between 2011-2021)?
- Mathematical optimization (8.45%)
- Scheduling (25.35%)
- Distributed computing (32.75%)
In recent papers he was focusing on the following fields of study:
Ishfaq Ahmad mainly investigates Mathematical optimization, Scheduling, Distributed computing, Artificial intelligence and Evolutionary algorithm.
He is studying Fair-share scheduling, which is a component of Scheduling.
He is interested in Rate-monotonic scheduling, which is a branch of Fair-share scheduling.
His Distributed computing study combines topics from a wide range of disciplines, such as Cloud computing, Efficient energy use and Dynamic priority scheduling.
The concepts of his Evolutionary algorithm study are interwoven with issues in Evolutionary computation, Pareto principle and Parallel computing.
His work in the fields of Parallel computing, such as Exascale computing, overlaps with other areas such as Dynamic method.
Between 2011 and 2021, his most popular works were:
- An overview and classification of thermal-aware scheduling techniques for multi-core processing systems (71 citations)
- An Evolutionary Technique for Performance-Energy-Temperature Optimized Scheduling of Parallel Tasks on Multi-Core Processors (66 citations)
- Energy- and performance-aware scheduling of tasks on parallel and distributed systems (53 citations)
In his most recent research, the most cited papers focused on:
- Operating system
- Computer network
- Artificial intelligence
His scientific interests lie mostly in Scheduling, Mathematical optimization, Fair-share scheduling, Evolutionary algorithm and Dynamic priority scheduling.
His Scheduling research is multidisciplinary, incorporating perspectives in Multi-core processor, Multi-objective optimization and Distributed computing.
His research integrates issues of Schedule and Heuristics in his study of Multi-objective optimization.
His Fair-share scheduling study frequently draws connections between adjacent fields such as Job shop scheduling.
His work carried out in the field of Evolutionary algorithm brings together such families of science as Optimization problem, Pareto principle and Parallel computing.
His research on Dynamic priority scheduling focuses in particular on Rate-monotonic scheduling.
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.
