## Handbook of Parallel Computing: Models, Algorithms and ApplicationsThe ability of parallel computing to process large data sets and handle time-consuming operations has resulted in unprecedented advances in biological and scientific computing, modeling, and simulations. Exploring these recent developments, the Handbook of Parallel Computing: Models, Algorithms, and Applications provides comprehensive coverage on all aspects of this field. The first section of the book describes parallel models. It covers evolving computational systems, the decomposable bulk synchronous model, parallel random access machine-on-chip architecture, the parallel disks model, mobile agents, fault-tolerant computing, hierarchical performance modeling, the partitioned optical passive star network, and the reconfigurable mesh model. The subsequent section on parallel algorithms examines networks of workstations, grid and packet scheduling, the derandomization technique, isosurface extraction and rendering, suffix trees, and mobile computing algorithmics. The final part of the text highlights an array of problems and offers ways to combat these challenges. This volume provides an up-to-date assessment of the models and algorithms involved in applying parallel computing to a variety of fields, from computational biology to wireless networking. |

### What people are saying - Write a review

User Review - Flag as inappropriate

CGM

### Contents

xxxi | |

liii | |

lxxv | |

4-1 | |

5-1 | |

5-61 | |

16 | |

36 | |

20-139 | |

20-183 | |

20-201 | |

20 | |

42 | |

66 | |

96 | |

116 | |

56 | |

78 | |

100 | |

122 | |

144 | |

158 | |

15-1 | |

15-19 | |

Alogorithms | 15-41 |

15-43 | |

18-1 | |

18-63 | |

20-1 | |

20-31 | |

20-51 | |

20-73 | |

20-93 | |

20-119 | |

Applications | 148 |

150 | |

166 | |

190 | |

214 | |

xxiv | |

xliv | |

19 | |

T-16 | |

T-46 | |

T-70 | |

T-86 | |

23 | |

49 | |

85 | |

47-15 | |

Back cover | 47-37 |

### Other editions - View all

Handbook of Parallel Computing: Models, Algorithms and Applications Sanguthevar Rajasekaran,John Reif No preview available - 2007 |

### Common terms and phrases

allocation applications architecture array bandwidth binary bound broadcast buffer buses cache cluster communication complexity components Computer Science congestion game connected connected components cycle data structure denote disk Distributed Computing dynamic edges efficient example execution Figure flow FPGAs function global graph IEEE implementation input integer International isosurface itemsets iteration keys LAPACK Lemma machine matrix membrane merge mobile multiprocessor multiprocessor scheduling multiset node number of processors O(log operations optical optimal parallel algorithms Parallel and Distributed Parallel Computing partition path performance permutation pipeline PRAM prefix sums problem Proc R-Mesh random variables randomized algorithm reconfigurable computers reconfigurable mesh Reference request resource RH element running ScaLAPACK scheduling algorithm Section segment sequence sequential server simulation solution sorting sorting algorithm spanning tree speedup stage step strategy Symposium synchronization task system technique Theorem threads vector vertex vertices

### Popular passages

Page xliv - Newton's third law of motion (for every action there is an equal and opposite reaction) is true for bodies that are free to move as well as for bodies rigidly fixed.