الفهرس Only 14 pages are availabe for public view
 |  | from | 111 |  |  |
| | | from | 111 | | |
Abstract
In the last forty years, a number of complex scientific problems have been brought up. These problems could not be solved by using computer with one processor; so scientists thought of a computer with more than one processor that is called parallel computer to solve such problems. Parallel computer is a set of processors that are able to work cooperatively to solve a computation problem. This definition is broad enough to include parallel several super computers that have hundreds or thousands of processors, for example network of workstations, multiple-processors workstations and embedded system.
Parallel computers are important because they offer the potential to concentrate computational resources whether processors, memory or I /0 bandwidth-on important computational problems. Our critical need to parallel computer is to process fast amount of data and perfonn a large number of calculations quickly. Using the parallel computer we can save our time such that, the time taken by the parallel computer to solve a problem is very small compared with the time taken by the PC computer for solving the same problem. Parallel computer is characterized by dividing the problem into
a number of subproblems, each of which can be solved by a processor simultaneously [1].
Parallel computing offer the promise of a quantum leap in the computing power that can be brought to bear on many important problems. Parallel computation issued in more applications, for example, plasma physics, economical planning and oil exploration.
Work on parallel computation spans several broad areas, such as the design of parallel computers, parallel programming languages, parallel algorithms development and analysis and application related issues. The focus of this thesis is on algorithm and even within this area, we restrict our study to parallel algorithms for solving the problem of sorting.