Dynamic task allocation in distributed computing systems by heuristic algorithms

DOI10.1504/IJOR.2014.065610MaRDI QIDQ2350539zbMATH OpenOpenAlexFDO

Authors Deepak Garg, Param Jeet Singh

Publication date 24 June 2015

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijor.2014.065610

zbMATH Keywords

communication costDCSdistributed computing systemsdynamic task assignmentexecution costmigration costresidence cost

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Review text

Summary: Efficient task scheduling is a crucial step to achieve high performance for multiprocessor platform. In a distributed computing system (DCS) the tasks of a program must be assigned dynamically to the heterogeneous processors to utilise the computational capabilities and resources of the system efficiently. In this article, the problem of finding an optimal dynamic assignment of a modular program for multiprocessor system is analysed. This paper deals with dynamic task assignment problem for allocating \(m\) tasks of a distributed program to \(n\) heterogeneous processors \((m >>> n)\) with effect to minimise the total cost of the program. This allocation permits each task to be migrated from one processor to another during the execution of the program. The dynamic task allocation model is developed by considering three different categories including the effect of processor relative speed. This development implies the coupling of logical modelling and statistical notions. We design the mathematical model and study the phase wise execution cost (EC), inter-task communication cost (ITCC), migration cost (MC) and residence cost (RC) of each task with respect to each processor in the form of matrices.

Recommendations

• A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
• A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems
• Task allocation in distributed processing systems
• Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system

Cited in

(16)

• Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization
• Scheduling and optimizing algorithm for parallel tasks in heterogeneous distributed computing systems
• Optimized parallelization heuristic for task scheduling
• A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems
• scientific article; zbMATH DE number 5670540 (Why is no real title available?)
• Task allocation model for distributed systems
• scientific article; zbMATH DE number 553901 (Why is no real title available?)
• A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems
• Scheduling in a dynamic heterogeneous distributed system using estimation error
• A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
• Computational Science and Its Applications – ICCSA 2004
• OPTIMIZATION OF FUZZY ASSIGNMENT PROBLEM USING R
• Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system
• Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
• Robust static allocation of resources for independent tasks under makespan and dollar cost constraints
• Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization

This page was built for publication: Dynamic task allocation in distributed computing systems by heuristic algorithms

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