Sign up
Forgot password?
FAQ: Login

Rajasekaran S., Reif J. (eds.) Handbook of Parallel Computing. Models, Algorithms and Applications

  • pdf file
  • size 8,92 MB
  • added by
  • info modified
Rajasekaran S., Reif J. (eds.) Handbook of Parallel Computing. Models, Algorithms and Applications
Chapman & Hall/CRC, 2008, -1173 p.
The 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.
Part 1 Models
Evolving Computational Systems
Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation
Membrane Systems: A Natural Way of Computing with Cells
Optical Transpose Systems: Models and Algorithms
Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform
Deterministic and Randomized Sorting Algorithms for Parallel Disk Models
A Programming Model and Architectural Extensions for Fine-Grain Parallelism
Computing with Mobile Agents in Distributed Networks
Transitional Issues: Fine-Grain to Coarse-Grain Multicomputers
Distributed Computing in the Presence of Mobile Faults
A Hierarchical Performance Model for Reconfigurable Computers
Hierarchical Performance Modeling and Analysis of Distributed Software Systems
Randomized Packet Routing, Selection, and Sorting on the POPS Network
Dynamic Reconfiguration on the R-Mesh
Fundamental Algorithms on the Reconfigurable Mesh
Reconfigurable Computing with Optical Buses
Part 2 Algorithms
Distributed Peer-to-Peer Data Structures
Parallel Algorithms via the Probabilistic Method
Broadcasting on Networks of Workstations
Atomic Selfish Routing in Networks: A Survey
Scheduling in Grid Environments
QoS Scheduling in Network and Storage Systems
Optimal Parallel Scheduling Algorithms in WDM Packet Interconnects
Real-Time Scheduling Algorithms for Multiprocessor Systems
Parallel Algorithms for Maximal Independent Set and Maximal Matching
Efficient Parallel Graph Algorithms for Multicore and Multiprocessors
Parallel Algorithms for Volumetric Surface Construction
Mesh-Based Parallel Algorithms for Ultra Fast Computer Vision
Prospectus for a Dense Linear Algebra Software Library
Parallel Algorithms on Strings
Design of Multithreaded Algorithms for Combinatorial Problems
Parallel Data Mining Algorithms for Association Rules and Clustering
An Overview of Mobile Computing Algorithmics
Part 3 Applications
Using FG to Reduce the Effect of Latency in Parallel Programs Running on Clusters
High-Performance Techniques for Parallel I/O
Message Dissemination Using Modern Communication Primitives
Online Computation in Large Networks
Online Call Admission Control in Wireless Cellular Networks
Minimum Energy Communication in Ad Hoc Wireless Networks
Power Aware Mapping of Real-Time Tasks to Multiprocessors
Perspectives on Robust Resource Allocation for Heterogeneous Parallel and Distributed Systems
A Transparent Distributed Runtime for Java
Scalability of Parallel Programs
Spatial Domain Decomposition Methods in Parallel Scientific Computing
Game Theoretical Solutions for Data Replication in Distributed Computing Systems
Effectively Managing Data on a Grid
Fast and Scalable Parallel Matrix Multiplication and Its Applications on Distributed Memory Systems
  • Sign up or login using form at top of the page to download this file.
  • Sign up
Up