Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
From MaRDI portal
Publication:345532
DOI10.1016/J.APM.2012.02.011zbMath1349.68042OpenAlexW2029570564MaRDI QIDQ345532
Kamal Sheel Mishra, Anil Kumar Tripathi, Pramod Kumar Mishra, Abhishek Mishra
Publication date: 2 December 2016
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.02.011
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (2)
A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling ⋮ A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Graham's bound
- Multiprocessor scheduling with interprocessor communication delays
- List scheduling with and without communication delays
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- Benchmarking and comparison of the task graph scheduling algorithms
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Optimal scheduling for two-processor systems
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- A comparison of list schedules for parallel processing systems
- Bounds on Multiprocessing Timing Anomalies
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
This page was built for publication: Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
