Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment
Distributed computing systems [DCSs] offer the potential for improved performance and resource sharing. To make the best use of the computational power available, it is essential to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution of the tas...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2008-01-01
|
| Series: | Journal of Computer Systems, Networks, and Communications |
| Online Access: | http://dx.doi.org/10.1155/2008/578180 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850159876952555520 |
|---|---|
| author | Pradeep Kumar Yadav M. P. Singh Harendra Kumar |
| author_facet | Pradeep Kumar Yadav M. P. Singh Harendra Kumar |
| author_sort | Pradeep Kumar Yadav |
| collection | DOAJ |
| description | Distributed computing systems [DCSs] offer the potential for improved performance and resource sharing. To make the best use of the computational power available, it is essential to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution of the tasks in distributed processing system. 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. Phasewise execution cost [EC], intertask communication cost [ITCT], residence cost [RC] of each task on different processors, and relocation cost [REC] for each task have been considered while preparing a dynamic tasks allocation model. The present model is suitable for arbitrary number of phases and processors with random program structure. |
| format | Article |
| id | doaj-art-b5f77180fb0f40cfab401cfaedbefb7a |
| institution | OA Journals |
| issn | 1687-7381 1687-739X |
| language | English |
| publishDate | 2008-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Systems, Networks, and Communications |
| spelling | doaj-art-b5f77180fb0f40cfab401cfaedbefb7a2025-08-20T02:23:20ZengWileyJournal of Computer Systems, Networks, and Communications1687-73811687-739X2008-01-01200810.1155/2008/578180578180Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic ReassignmentPradeep Kumar Yadav0M. P. Singh1Harendra Kumar2Department of Research Planning and Business Development, Central Building Research Institute, Roorkee 247667, Uttarakhand, IndiaDepartment of Mathematics and Statistics, Gurkula Kangari University, Hardwar 249404, Uttarakhand, IndiaDepartment of Mathematics and Statistics, Gurkula Kangari University, Hardwar 249404, Uttarakhand, IndiaDistributed computing systems [DCSs] offer the potential for improved performance and resource sharing. To make the best use of the computational power available, it is essential to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution of the tasks in distributed processing system. 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. Phasewise execution cost [EC], intertask communication cost [ITCT], residence cost [RC] of each task on different processors, and relocation cost [REC] for each task have been considered while preparing a dynamic tasks allocation model. The present model is suitable for arbitrary number of phases and processors with random program structure.http://dx.doi.org/10.1155/2008/578180 |
| spellingShingle | Pradeep Kumar Yadav M. P. Singh Harendra Kumar Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment Journal of Computer Systems, Networks, and Communications |
| title | Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment |
| title_full | Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment |
| title_fullStr | Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment |
| title_full_unstemmed | Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment |
| title_short | Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment |
| title_sort | scheduling algorithm tasks scheduling algorithm for multiple processors with dynamic reassignment |
| url | http://dx.doi.org/10.1155/2008/578180 |
| work_keys_str_mv | AT pradeepkumaryadav schedulingalgorithmtasksschedulingalgorithmformultipleprocessorswithdynamicreassignment AT mpsingh schedulingalgorithmtasksschedulingalgorithmformultipleprocessorswithdynamicreassignment AT harendrakumar schedulingalgorithmtasksschedulingalgorithmformultipleprocessorswithdynamicreassignment |