Refine your search
Collections
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Saxena, Pankaj
- An Algorithm for Optimized Time, Cost, and Reliability in a Distributed Computing System
Abstract Views :121 |
PDF Views:6
Authors
Pankaj Saxena
1,
Kapil Govil
1
Affiliations
1 Department of Computer Applications, Teerthanker Mahaveer University, Moradabad (U.P), IN
1 Department of Computer Applications, Teerthanker Mahaveer University, Moradabad (U.P), IN
Source
International Journal of Advanced Networking and Applications, Vol 4, No 5 (2013), Pagination: 1710-1718Abstract
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.- An Approach for Allocating Tasks in Optimized Time in a Distributed Processing Environment
Abstract Views :169 |
PDF Views:4
If the number of processors is denoted by P and the number of tasks is denoted by T then as in general all real world problem T>P. It is required to perform all the tasks by allocating the task in such a way that the total processing time should be minimized.
Authors
Source
International Journal of Innovative Research and Development, Vol 1, No 5 (2012), Pagination: 431-437Abstract
In distributed network in which a task is divided into many fractions and each of which is to be get processed, the task allocation problem can be explained in terms of number of tasks and number of processors available. A distributed network consists of multiple autonomous computers that communicate through a communication media. According to the task allocation problem if the number of task are more then the number of processors and every processor process the task in a particular time period for processing any particular task then we have to allocate each task to the single processor in such a way that the task should be completed in a optimal possible time and also there should not be overloading of task to anyone processor. The number of processors and number of tasks are static in nature.If the number of processors is denoted by P and the number of tasks is denoted by T then as in general all real world problem T>P. It is required to perform all the tasks by allocating the task in such a way that the total processing time should be minimized.
Keywords
Distributed Network, Task, Processor, Task Allocation- Implementation of Improved NK Protocol Using MATLAB
Abstract Views :125 |
PDF Views:0
Authors
Affiliations
1 R.B.S.College, Khandari, Agra-282002 (U.P), IN
2 Institute of Basic Science, Dr. B.R.Ambedkar University, Khandari, Agra-282002 (U.P), IN
1 R.B.S.College, Khandari, Agra-282002 (U.P), IN
2 Institute of Basic Science, Dr. B.R.Ambedkar University, Khandari, Agra-282002 (U.P), IN