2011
DOI: 10.5120/2910-3824
|View full text |Cite
|
Sign up to set email alerts
|

A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment

Abstract: The Distributed Processing Environment [DPE] in which services provided for the network reside at multiple sites. Instead of single large machine being responsible for all aspects of process, each separate processor handles subset. In the distributed environments the program or tasks are also often developed with the subsets of independent units under various environments. The Allocation problems in any computer system play the key role for deciding the performance of the system. The allocation put the direct… 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
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 10 publications
(8 reference statements)
0
1
0
Order By: Relevance
“…To overcome such problem in a MCE, a task scheduling technique would be needed where more than one task to a single processor can be schedule in order to achieve minimum processing time, processing cost and maximum processing reliability in MCE. Some of the task allocation schemes have been reported in the literature, such as Task modeling [1], Scheduling of tasks [2,5,7,8,11], Task allocation scheme [3,15,20], Resource allocation [4,13,14,16,19], Load balancing [10], Static task assignment [6], Resource scheduling [9], Job scheduling algorithm [12], Resource management and scheduling [17], Application scheduling in Mobile Cloud Computing [18]. This research paper propose a new task scheduling technique to task allocation in MCE by using the proper utilization of processors of the MCE so the problem of load balancing can be avoid.…”
Section: Introductionmentioning
confidence: 99%
“…To overcome such problem in a MCE, a task scheduling technique would be needed where more than one task to a single processor can be schedule in order to achieve minimum processing time, processing cost and maximum processing reliability in MCE. Some of the task allocation schemes have been reported in the literature, such as Task modeling [1], Scheduling of tasks [2,5,7,8,11], Task allocation scheme [3,15,20], Resource allocation [4,13,14,16,19], Load balancing [10], Static task assignment [6], Resource scheduling [9], Job scheduling algorithm [12], Resource management and scheduling [17], Application scheduling in Mobile Cloud Computing [18]. This research paper propose a new task scheduling technique to task allocation in MCE by using the proper utilization of processors of the MCE so the problem of load balancing can be avoid.…”
Section: Introductionmentioning
confidence: 99%