Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules

DOI10.1016/J.APM.2012.02.011zbMATH Open1349.68042OpenAlexW2029570564MaRDI QIDQ345532FDOQ345532

Authors: Pramod Kumar Mishra, Abhishek Mishra, Kamal Sheel Mishra, Anil Kumar Tripathi 

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

Recommendations

• A clustering algorithm for multiprocessor environments using dynamic priority of modules
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Dynamic scheduling of parallel computations
• A comparison of the static task graph scheduling algorithms
• ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems

zbMATH Keywords

clusteringdistributed computingbenchmarkingschedulinghomogeneous systemstask allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on Multiprocessing Timing Anomalies
• Optimal scheduling for two-processor systems
• Title not available (Why is that?)
• List scheduling with and without communication delays
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Multiprocessor scheduling with interprocessor communication delays
• 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
• A clustering algorithm for multiprocessor environments using dynamic priority of modules
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Inventory model for deteriorating items with inventory dependent demand rate under trade credits
• Title not available (Why is that?)
• C.P.M. Scheduling with Small Communication Delays and Task Duplication
• A comparison of list schedules for parallel processing systems
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• A note on Graham's bound

Cited In (3)

• A clustering algorithm for multiprocessor environments using dynamic priority of modules
• 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

This page was built for publication: Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345532)