Travelling salesman problem (TSP) is a combinatorial optimization problem. It is NP hard problem and TSP is the most intensively studied problem in the area of optimization. There are a number ofâ€¦ (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â€¦ (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â€¦ (More)

Genetic Algorithm is a search technique used in computing to find approximate solutions to optimization and search problems. As a search strategy, genetic algorithm has been applied successfully inâ€¦ (More)

Multiprocessor architectures are becoming more attractive for embedded systems, primarily because major processor manufacturers like Intel and AMD are designing cost effective processors even forâ€¦ (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â€¦ (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â€¦ (More)