Muutke küpsiste eelistusi

Handbook of Parallel Computing: Models, Algorithms and Applications [Kõva köide]

Edited by (University of Connecticut, Storrs, USA), Edited by (Duke University, Durham, North Carolina, USA)
  • Formaat: Hardback, 1224 pages, kõrgus x laius: 254x178 mm, kaal: 2199 g, 64 Tables, black and white; 463 Illustrations, black and white
  • Sari: Chapman & Hall/CRC Computer and Information Science Series
  • Ilmumisaeg: 20-Dec-2007
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 1584886234
  • ISBN-13: 9781584886235
Teised raamatud teemal:
  • Kõva köide
  • Hind: 266,50 €*
  • * saadame teile pakkumise kasutatud raamatule, mille hind võib erineda kodulehel olevast hinnast
  • See raamat on trükist otsas, kuid me saadame teile pakkumise kasutatud raamatule.
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Lisa soovinimekirja
  • Raamatukogudele
  • Formaat: Hardback, 1224 pages, kõrgus x laius: 254x178 mm, kaal: 2199 g, 64 Tables, black and white; 463 Illustrations, black and white
  • Sari: Chapman & Hall/CRC Computer and Information Science Series
  • Ilmumisaeg: 20-Dec-2007
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 1584886234
  • ISBN-13: 9781584886235
Teised raamatud teemal:
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.
Preface xiii
Acknowledgments xxi
Editors xxiii
Contributors xxv
Models
Evolving Computational Systems
1(1)
Selim G. Akl
Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation
1(1)
Gianfranco Bilardi
Andrea Pietracaprina
Geppino Pucci
Membrane Systems: A ``Natural'' Way of Computing with Cells
1(1)
Oscar H. Ibarra
Andrei Paun
Optical Transpose Systems: Models and Algorithms
1(1)
Chih-Fang Wang
Sartaj Sahni
Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform
1(1)
Uzi Vishkin
George C. Caragea
Bryant C. Lee
Deterministic and Randomized Sorting Algorithms for Parallel Disk Models
1(1)
Sanguthevar Rajasekaran
A Programming Model and Architectural Extensions for Fine-Grain Parallelism
1(1)
Alex Gontmakher
Assaf Schuster
Gregory Shklover
Avi Mendelson
Computing with Mobile Agents in Distributed Networks
1(1)
Evangelos Kranakis
Danny Krizanc
Sergio Rajsbaum
Transitional Issues: Fine-Grain to Coarse-Grain Multicomputers
1(1)
Stephan Olariu
Distributed Computing in the Presence of Mobile Faults
1(1)
Nicola Santoro
Peter Widmayer
A Hierarchical Performance Model for Reconfigurable Computers
1(1)
Ronald Scrofano
Viktor K. Prasanna
Hierarchical Performance Modeling and Analysis of Distributed Software Systems
1(1)
Reda A. Ammar
Randomized Packet Routing, Selection and Sorting on the POPS Network
1(1)
Jaime Davila
Sanguthevar Rajasekaran
Dynamic Reconfiguration on the R-Mesh
1(1)
Ramachandran Vaidyanathan
Jerry L. Trahan
Fundamental Algorithms on the Reconfigurable Mesh
1(1)
Koji Nakano
Reconfigurable Computing with Optical Buses
1(1)
Anu G. Bourgeois
Algorithms
Distributed Peer-to-Peer Data Structures
1(1)
Michael T. Goodrich
Michael J. Nelson
Parallel Algorithms via the Probabilistic Method
1(1)
Lasse Kliemann
Anand Srivastav
Broadcasting on Networks of Workstations
1(1)
Samir Khuller
Yoo-Ah Kim
Yung-Chun (Justin) Wan
Atomic Selfish Routing in Networks: A Survey
1(1)
Spyros Kontogiannis
Paul G. Spirakis
Scheduling in Grid Environments
1(1)
Young Choon Lee
Albert Y. Zomaya
QoS Scheduling in Network and Storage Systems
1(1)
Peter J. Varman
Ajay Gulati
Optimal Parallel Scheduling Algorithms in WDM Packet Interconnects
1(1)
Zhenghao Zhang
Yuanyuan Yang
Real-Time Scheduling Algorithms for Multiprocessor Systems
1(1)
Michael A. Palis
Parallel Algorithms for Maximal Independent Set and Maximal Matching
1(1)
Yijie Han
Efficient Parallel Graph Algorithms for Multicore and Multiprocessors
1(1)
David A. Bader
Guojing Cong
Parallel Algorithms for Volumetric Surface Construction
1(1)
Joseph Jaja
Amitabh Varshney
Qingmin Shi
Mesh-Based Parallel Algorithms for Ultra Fast Computer Vision
1(1)
Stephan Olariu
Prospectus for a Dense Linear Algebra Software Library
1(1)
James Demmel
Beresford Parlett
William Kahan
Ming Gu
David Bindel
Yozo Hida
E. Jason Riedy
Christof Voemel
Jakub Kurzak
Alfredo Buttari
Julie Langou
Stanimire Tomov
Jack Dongarra
Xiaoye Li
Osni Marques
Julien Langou
Piotr Luszczek
Parallel Algorithms on Strings
1(1)
Wojciech Rytter
Design of Multithreaded Algorithms for Combinatorial Problems
1(1)
David A. Bader
Kamesh Madduri
Guojing Cong
John Feo
Parallel Data Mining Algorithms for Association Rules and Clustering
1(1)
Jianwei Li
Wei-keng Liao
Alok Choudhary
Ying Liu
An Overview of Mobile Computing Algorithmics
1(1)
Stephan Olariu
Albert Y. Zomaya
Applications
Using FG to Reduce the Effect of Latency in Parallel Programs Running on Clusters
1(1)
Thomas H. Cormen
Elena Riccio Davidson
High-Performance Techniques for Parallel I/O
1(1)
Avery Ching
Kenin Coloma
Jianwei Li
Wei-keng Liao
Alok Choudhary
Message Dissemination Using Modern Communication Primitives
1(1)
Teofilo F. Gonzalez
Online Computation in Large Networks
1(1)
Susanne Albers
Online Call Admission Control in Wireless Cellular Networks
1(1)
Ioannis Caragiannis
Christos Kaklamanis
Evi Papaioannou
Minimum Energy Communication in Ad Hoc Wireless Networks
1(1)
Ioannis Caragiannis
Christos Kaklamanis
Panagiotis Kanellopoulos
Power Aware Mapping of Real-Time Tasks to Multiprocessors
1(1)
Dakai Zhu
Bruce R. Childers
Daniel Mosse
Rami Melhem
Perspectives on Robust Resource Allocation for Heterogeneous Parallel and Distributed Systems
1(1)
Shoukat Ali
Howard Jay Siegel
Anthony A. Maciejewski
A Transparent Distributed Runtime for Java
1(1)
Michael Factor
Assaf Schuster
Konstantin Shagin
Scalability of Parallel Programs
1(1)
Ananth Grama
Vipin Kumar
Spatial Domain Decomposition Methods in Parallel Scientific Computing
1(1)
Sudip Seal
Srinivas Aluru
Game Theoretical Solutions for Data Replication in Distributed Computing Systems
1(1)
Samee Ullah Khan
Ishfaq Ahmad
Effectively Managing Data on a Grid
1(1)
Catherine L. Ruby
Russ Miller
Fast and Scalable Parallel Matrix Multiplication and Its Applications on Distributed Memory Systems
1(1)
Keqin Li
Index 1


University of Connecticut, Storrs, USA Duke University, Durham, North Carolina, USA