By T. J. Fountain
This e-book units out the rules of parallel computing, explaining why, the place, and the way parallel computing is used. it's distinctive in its insurance of either traditional and neural computing (which act in methods just like human brains), and likewise covers such themes because the basic paradigms hired within the box, how structures are programmed or informed, technical points together with connectivity and processing point complexity, and the way procedure functionality is envisioned (and why doing so is difficult). The penultimate bankruptcy contains a suite of case reports of archetypal parallel pcs, every one examine written through somebody heavily attached with the procedure in query. the ultimate bankruptcy correlates a number of the facets of parallel computing right into a taxonomy of platforms.
Read Online or Download Parallel Computing: Principles and Practice PDF
Similar discrete mathematics books
Computational Complexity of Sequential and Parallel Algorithms
This booklet provides a compact but complete survey of significant leads to the computational complexity of sequential algorithms. this can be through a hugely informative advent to the improvement of parallel algorithms, with the emphasis on non-numerical algorithms. the cloth is so chosen that the reader in lots of instances is ready to stick to an identical challenge for which either sequential and parallel algorithms are mentioned - the simultaneous presentation of sequential and parallel algorithms for fixing permitting the reader to understand their universal and particular gains.
Discontinuum Mechanics : Using Finite and Discrete Elements
Textbook introducing the mathematical and computational options of touch mechanics that are used more and more in commercial and educational program of the mixed finite/discrete aspect approach.
Matroids: A Geometric Introduction
Matroid idea is a colourful quarter of analysis that offers a unified technique to comprehend graph thought, linear algebra and combinatorics through finite geometry. This e-book presents the 1st finished creation to the sphere so that it will entice undergraduate scholars and to any mathematician attracted to the geometric method of matroids.
Fragile networks: Identifying Vulnerabilities and Synergies in an Uncertain World
A unified remedy of the vulnerabilities that exist in real-world community systems-with instruments to spot synergies for mergers and acquisitions Fragile Networks: deciding on Vulnerabilities and Synergies in an doubtful global provides a finished learn of community structures and the jobs those platforms play in our daily lives.
Additional resources for Parallel Computing: Principles and Practice
Sample text
Before doing so, however, in order to clarify the headings given to some of the following sections of this chapter, it is necessary to consider one of the earliest, and perhaps most useful, attempts at classifying computer systems. In 1966, M. J. Flynn published a seminal paper in the Proceedings of IEEE [1] concerning a taxonomy of computer architectures. The central idea was that this could be carried out in terms of data streams and instruction streams, and the singularity or multiplicity of each.
I will begin by describing the method of graph reduction per se, and then explain the modifications which are required for parallel implementation. The basic idea is this. Any computational program can be expressed as a graph. 9, which is known as the computation graph. Graph reduction proceeds by repeatedly evaluating sub-graphs which are reducible, that is, single functions which have parameters which are all either constants or evaluated expressions. The process of reduction normally proceeds, therefore, from the left of the graph to the right, and continues until no further reductions can take place.
The first reason why image processing is an appropriate area for the application of parallel computing has two aspects. The first concerns the sheer quantities of data which may be involved. 2 summarises the data content (in bytes) of some typical images. The second aspect lies in the speed at which processing of these images is required to proceed, and there are two quite separate ways in which this requirement arises. First, many image processing applications occur in environments where the repetition rate for processing images is fixed by some external constraint.