Poonam Panwar

Learn More
Traveling salesman problem is quite known in the field of combinatorial optimization. Through this research describe how the traveling salesman problem is solved by the heuristic method of genetic algorithms. This research to find the most approximate solution that gives us the least distance, which is the shortest route for traverse the cities given in the(More)
Both parallel and distributed network environment systems play a vital role in the improvement of high performance computing. The primary concern when analyzing these systems is multiprocessor task scheduling. This paper addresses the problem of efficient multiprocessor task scheduling. A multiprocessor task scheduling problem is represented as directed(More)
Scheduling parallel tasks on multiprocessor systems is to allocate a set of tasks to processors such that the optimal usage of processors and accepted computation time for scheduling algorithm are obtained. In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for(More)
It is always a very costly process to achieve a high level of reliability in software industry. So it is desirable for an industry to design software with minimum cost and optimal level of reliability. This paper addresses the problem of maximizing reliability of software by minimizing the overall cost of software. The technique deals with selecting various(More)
  • 1