Zvrs master slave parallel task-allocating algorithm using RR scheduling and its implement

This paper describes a new heuristic algorithm for allocating n-tasks on p-processors named ZVRS master slave parallel task allocating algorithm using RR scheduling. This parallel task-allocation is implemented on master-slave system. Task-allocation on slave processors is already presented using FC...

Full description

Saved in:
Bibliographic Details
Main Authors: Khan, Z., Sharma, V. K., Saxena, S., Singh, R.
Format: Conference Proceeding
Language:English
Subjects:
algorithm
Heuristic algorithms
load balance
Master-slave
parallel
Program processors
Resource management
Round robin
RR scheduling
Scheduling
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes a new heuristic algorithm for allocating n-tasks on p-processors named ZVRS master slave parallel task allocating algorithm using RR scheduling. This parallel task-allocation is implemented on master-slave system. Task-allocation on slave processors is already presented using FCFS scheduling. Improved master-slave parallel task allocating is also presented that Task groups are arranged in descending order on the basis of their cost and then using FCFS scheduling for arranging in a queue and then task groups are assigned to slave-processors. This paper presents the ZVRS master-slave parallel task-allocating algorithm using RR scheduling. Here Firstly task groups are arranged in descending order on the basis of their costs. Then these task groups are arranged in a queue using RR scheduling. After that, the master processor assigns the task groups to slave processors. This new algorithm shows the advantage that this system consumes the less time, better processor utilization than the previous algorithms. It also improves the efficiency.
DOI:10.1109/IAdCC.2013.6514297