2005
DOI: 10.24297/ijct.v4i2b2.3313
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Tasks Assignment for Multiple Heterogeneous Processors with Dynamic Re-assignment

Abstract: Distributed Computing System [DCS] has attracted several researchers by posing several challenging problems. In this paper we have developed a mathematical model for allocating “M” tasks of distributed program to “N” multiple processors (M>N) that minimizes the total cost of the program. Relocating the tasks from one processor to another at certain points during the course of execution of the program that contributes to the total cost of the running program has been taken into account. Most of the r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…A dynamic task allocation method is used here to solve task allocation problem and it allocates the tasks to optimize overall task allocation cost. Some of the other related task allocation methods have been reported in literature such asTask Assignment [1, 10,19], task scheduling [2, 3], Distributed Processing Environment [4], Task Allocation [5,7,9,11,13], data communication in Mobile Computing [6], Dynamic Task Allocation [8], Dynamic Tasks Scheduling [12,16,20,22], Dynamic Optimization Algorithm [14], dynamic programming [15], Dynamic Reassignment [17], Dynamic Load Balancing [18] and Dynamic Task Assignment [21].This research solve here a task allocation problem dynamically in DCS by allocating available processors in such a way that overall load should be balanced so system overloading can be avoided by using the proper utilization of processors.…”
Section: Introductionmentioning
confidence: 99%
“…A dynamic task allocation method is used here to solve task allocation problem and it allocates the tasks to optimize overall task allocation cost. Some of the other related task allocation methods have been reported in literature such asTask Assignment [1, 10,19], task scheduling [2, 3], Distributed Processing Environment [4], Task Allocation [5,7,9,11,13], data communication in Mobile Computing [6], Dynamic Task Allocation [8], Dynamic Tasks Scheduling [12,16,20,22], Dynamic Optimization Algorithm [14], dynamic programming [15], Dynamic Reassignment [17], Dynamic Load Balancing [18] and Dynamic Task Assignment [21].This research solve here a task allocation problem dynamically in DCS by allocating available processors in such a way that overall load should be balanced so system overloading can be avoided by using the proper utilization of processors.…”
Section: Introductionmentioning
confidence: 99%