International Journal of Advanced Networking and Applications

Faizul Navi Khan ¹, Kapil Govil ¹

Affiliations
1 Department of Computer Application, Teerthanker Mahaveer University, Moradabad - 244 001, UP, IN

Abstract

A Distributed Computing System (DCS) is a network of workstations, personal computer and /or other computing systems. Such system may be heterogeneous in the sense that the computing nodes may have different speeds and memory capacities. A DCS accepts tasks from users and executes different modules of these tasks on various nodes of the system. Task allocation in a DCS is a common problem and a good number of task allocation algorithms have been proposed in the literature. In such environment an application runs in a DCS can be accessible on every node present within the DCS. In such cases if number of tasks is less than or equal to available processors in the DCS, we can assign these task without any trouble. But this allocation becomes complicated when numbers of tasks are greater than the numbers of processors. The problem of task allocation for processing of 'm' tasks to 'n' processors (m>n) in a DCS is addressed here through a new modified tasks allocation technique. The model, presented in this paper allocates the tasks to the processor of different processing capacity to increase the performance of the DCS. The technique presented in this paper is based on the consideration of processing cost of the task to the processors. We have tried a new technique to assign all the tasks as per the required availability of processors and their processing capacity so that all the tasks of application get execute in the DCS.

Keywords

Distributed Computing System, Optimization Technique, Performance, Processing Cost, Task Allocation.

Full Text

   

Pankaj Saxena ¹, Kapil Govil ¹

Affiliations
1 Department of Computer Applications, Teerthanker Mahaveer University, Moradabad (U.P), IN

Abstract

Distributed Computing System (DCS) refers to multiple computer systems working on a single problem. A distributed system consists of a collection of autonomous computers, connected through a network which enables computers to coordinate their activities and to share the resources of the system. In distributed computing, a single problem is divided into many parts, and each part is solved by different computers. As long as the computers are networked, they can communicate with each other to solve the problem. DCS consists of multiple software components that are on multiple computers, but run as a single system. The computers that are in a distributed system can be physically close together and connected by a local network, or they can be geographically distant and connected by a wide area network. The ultimate goal of distributed computing is to maximize performance in a time effective, cost-effective, and reliability effective manner. In DCS the whole workload is divided into small and independent units, called tasks and it allocates onto the available processors. It also ensures fault tolerance and enables resource accessibility in the event that one of the components fails. The problem is addressed of assigning a task to a distributed computing system. The assignment of the modules of tasks is done statically. We have to give an algorithm to solve the problem of static task assignment in DCS, i.e. given a set of communicating tasks to be executed on a distributed system on a set of processors, to which processor should each task be assigned to get the more reliable results in lesser time and cost. In this paper an efficient algorithm for task allocation in terms of optimum time or optimum cost or optimum reliability is presented where numbers of tasks are more then the number of processors.

Keywords

Cost, Distributed Computing System (DCS), Reliability, Task, Time.

Full Text

   

Kapil Govil ¹

Affiliations
1 Department of Computer Applications, Teerthanker Mahaveer University, Moradabad-244001, IN

Abstract

Distributed Computing Environment (DCE) is one the appropriate network for providing the optimal solution in real-time applications problems. The systematic allocation of tasks needs to plays the key role to optimize the overall processing reliability of the DCE. DCE consists of multiple autonomous computers that communicate through a common communication channel. The computers interact with each other in order to achieve a common goal. A computer program that runs in a distributed system is called a distributed program, and distributed programming is the process of writing such programs. The allocation problems in any computer system play the key role for deciding the performance of the system. The allocation of tasks in DCE has an important role to the evaluation of the performance of the network. The problem of processing of “m” tasks to “n” processors (m>n) in a distributed networks is addressed here through a new modified tasks allocation policy for the task processing in a DCE. The model, presented in this paper allocates the tasks to the processor to enhance the performance of the DCE.

Keywords

Allocation, Distributed Computing Environment, Performance, Task.

Full Text