Handbook of Parallel Computing: Models, Algorithms and ApplicationsSanguthevar Rajasekaran, John Reif CRC Press, 2007. gada 20. dec. - 1224 lappuses 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 a |
Saturs
| 1-1 | |
| 2-1 | |
| 3-1 | |
| 4-1 | |
| 5-1 | |
Chapter 6 Deterministic and Randomized Sorting Algorithms for Parallel Disk Models | 6-1 |
Chapter 7 A Programming Model and Architectural Extensions for FineGrain Parallelism | 7-1 |
Chapter 8 Computing with Mobile Agents in Distributed Networks | 8-1 |
Chapter 26 Efficient Parallel Graph Algorithms for Multicore and Multiprocessors | 26-1 |
Chapter 27 Parallel Algorithms for Volumetric Surface Construction | 27-1 |
Chapter 28 MeshBased Parallel Algorithms for Ultra Fast Computer Vision | 28-1 |
Chapter 29 Prospectus for a Dense Linear Algebra Software Library | 29-1 |
Chapter 30 Parallel Algorithms on Strings | 30-1 |
Chapter 31 Design of Multithreaded Algorithms for Combinatorial Problems | 31-1 |
Chapter 32 Parallel Data Mining Algorithms for Association Rules and Clustering | 32-1 |
Chapter 33 An Overview of Mobile Computing Algorithmics | 33-1 |
FineGrain Multicomputers | 9-1 |
Chapter 10 Distributed Computing in the Presence of Mobile Faults | 10-1 |
Chapter 11 A Hierarchical Peformance Model for Reconfigurable Computers | 11-1 |
Chapter 12 Hierarchical Performance Modeling and Analysis of Distributed Software Systems | 12-1 |
Chapter 13 Randomized Packet Routing Selection and Sorting on the POPS Network | 13-1 |
Chapter 14 Dynamic Reconfiguration on the RMesh | 14-1 |
Chapter 15 Fundamental Algorithms on the Reconfigurable Mesh | 15-1 |
Chapter 16 Reconfigurable Computing with Optical Buses | 16-1 |
Alogorithms | 16-23 |
Chapter 17 Distributed PeertoPeer Data Structures | 17-1 |
Chapter 18 Parallel Algorithms via the Probabilistic Method | 18-1 |
Chapter 19 Broadcasting on Networks of Workstations | 19-1 |
A Survey | 20-1 |
Chapter 21 Scheduling in Grid Environments | 21-1 |
Chapter 22 QoS Scheduling in Network and Stroage Systems | 22-1 |
Chapter 23 Optimal Parallel Scheduling Algorithms in WDM Packet Interconnects | 23-1 |
Chapter 24 RealTime Scheduling Algorithms for Multiprocessor Systems | 24-1 |
Chapter 25 Parallel Algorithms for Maximal Independent Set and Maximal Matching | 25-1 |
Applications | 33-33 |
Chapter 34 Using FG to Reduce the Effect of Latency in Parallel Programs Running on Clusters | 34-1 |
Chapter 35 HighPerformance Techniques for Parallel IO | 35-1 |
Chapter 36 Message Dissemination Using Modern Communiation Primitives | 36-1 |
Chapter 37 Online Computation in Large Networks | 37-1 |
Chapter 38 Online Call Admission Control in Wireless Cellular Networks | 38-1 |
Chapter 39 Minimum Energy Communication in Ad Hoc Wireless Networks | 39-1 |
Chapter 40 Power Aware Mapping of RealTime Tasks to Multiprocessors | 40-1 |
Chapter 41 Perspectives on Robust Resource Allocation for Heterogeneous Parallel and Distributed Systems | 41-1 |
Chapter 42 A Transparent Distributed Runtime for Java | 42-1 |
Chapter 43 Scalability of Parallel Programs | 43-1 |
Chapter 44 Spatial Domain Decomposition Methods in Parallel Scientific Computing | 44-1 |
Chapter 45 Game Theoretical Solutions for Data Replication in Distributed Computing Systems | 45-1 |
Chapter 46 Effectively Managing Data on a Grid | 46-1 |
Chapter 47 Fast and Scalable Parallel Matrix Multiplication and Its Applications on Distributed Memory Systems | 47-1 |
Index | 1-1 |
Back cover | 1-23 |
Citi izdevumi - Skatīt visu
Handbook of Parallel Computing: Models, Algorithms and Applications Sanguthevar Rajasekaran,John Reif Priekšskatījums nav pieejams - 2007 |
Bieži izmantoti vārdi un frāzes
addition algorithm applications approach architecture array assigned assume bits block bound broadcast buffer called cell cluster communication complexity components computation conditional connected consider constant construction corresponding cost cycle data structure defined delay denote described determine distributed edges efficient element example execution Figure flow function given graph grid IEEE implementation independent input International Lemma machine matching membrane memory mesh mobile multiset node Note objects operations optimal parallel parallel algorithms partitioned path performance pipeline possible present probability problem Proc processors programming random receive reconfigurable Reference request resource respectively rules running scheduling Science shared simulation solution sorting stage step structure takes task technique Theorem threads tree units University variables vertex vertices write
Populāri fragmenti
1-14. lappuse - 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.
17-17. lappuse - A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems.
17-17. lappuse - Zhao, J. Kubiatowicz. and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing.
6-16. lappuse - References 1. A. Aggarwal and JS Vitter. The input/output complexity of sorting and related problems.
17-16. lappuse - NJA Harvey. MB Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A scalable overlay network with practical locality properties.
22-21. lappuse - A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm,
5-58. lappuse - GE Blelloch, CE Leiserson, BM Maggs, CG Plaxton, SJ Smith, and M. Zagha. A comparison of sorting algorithms for the Connection Machine CM2.
19-30. lappuse - R. Karp, A. Sahay, E. Santos, and KE Schauser, Optimal broadcast and summation in the logp model, in "Proceedings of 5th Annual Symposium on Parallel Algorithms and Architectures,