Abstract
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.
Highlights
Over the last several years, distributed computing systems have become popular as a very attractive option for fast computing and information processing
Distributed computing system is used to describe a system whenever there are several computers interconnected in some fashion so that a program or procedure runs on the system with multiple processors
The basis for dynamic program model is the concept of the phases of a task program.With each phase the following information is associated: (1) the executing task during this phase and its execution cost on each processor in a heterogeneous system; (2) residence costs of the remaining tasks, except for the executing task, on each processor. These costs may come from the use of storages; Step-1: Input: K, M, N, ECM(,), RCM(,), RECM(, ), ITCCM(,)
Summary
Over the last several years, distributed computing systems have become popular as a very attractive option for fast computing and information processing. In a general case each task may have multiple computational characteristics due to the dynamic control behavior ofthe task Such tightly and medium-coupled portions of code task will be more difficult to break up and assign to different processors. Bokhari [10] analyzed the problem of dynamic assignment in a two-processor system, which permits relocation of tasks from one processor to the other at certain points during the execution of the program This relocation incurs a predefined relocation cost that contributes to the total cost of running the program and code-conversion overheads. We consider the dynamic task assignment problem for a general program structure and a heterogeneous Nprocessors in DCS.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
