Ramdan Hours:
Sun - Thu
9.30 AM - 2.30 PM
Iftar in --:--:--
🌙 Maghrib: --:--

Structured parallel programing : (Record no. 7273)

MARC details
000 -LEADER
fixed length control field 04557cam a2200337 i 4500
001 - CONTROL NUMBER
control field 17412814
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20201015135453.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120802s2012 ne a b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2012023085
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780124159938
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency DLC
Description conventions rda
Modifying agency DLC
-- EG-NcFUE
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.76.P37
Item number M34 2012
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
Item number M.M.S
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name McCool, Michael D.
9 (RLIN) 33250
245 10 - TITLE STATEMENT
Title Structured parallel programing :
Remainder of title patterns for efficient computation /
Statement of responsibility, etc Michael McCool, Arch D. Robison, James Reinders.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc San Francisco, Calif. :
Name of publisher, distributor, etc Morgan Kaufmann ;
Place of publication, distribution, etc Oxford :
Name of publisher, distributor, etc Elsevier Science [distributor],
Date of publication, distribution, etc 2012.
300 ## - PHYSICAL DESCRIPTION
Extent xxvi, 406 pages :
Other physical details illustrations ;
Dimensions 24 cm
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references (pages 391-396) and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note <br/>Chapter 1. Introduction<br/>1.1 Think Parallel<br/>1.2 Performance<br/>1.3 Motivation: Pervasive Parallelism<br/>1.4 Structured Pattern-Based Programming<br/>1.5 Parallel Programming Models<br/>1.6 Organization of this Book<br/>1.7 Summary<br/>Chapter 2. Background<br/>2.1 Vocabulary and Notation<br/>2.2 Strategies<br/>2.3 Mechanisms<br/>2.4 Machine Models<br/>2.5 Performance Theory<br/>2.6 Pitfalls<br/>2.7 Summary<br/>PART I. Patterns<br/>Chapter 3. Patterns<br/>3.1 Nesting Pattern<br/>3.2 Structured Serial Control Flow Patterns<br/>3.3 Parallel Control Patterns<br/>3.4 Serial Data Management Patterns<br/>3.5 Parallel Data Management Patterns<br/>3.6 Other Parallel Patterns<br/>3.7 Non-Deterministic Patterns<br/>3.8 Programming Model Support for Patterns<br/>3.9 Summary<br/>Chapter 4. Map<br/>4.1 Map<br/>4.2 Scaled Vector Addition (SAXPY)<br/>4.3 Mandelbrot<br/>4.4 Sequence of Maps versus Map of Sequence<br/>4.5 Comparison of Parallel Models<br/>4.6 Related Patterns<br/>4.7 Summary<br/>Chapter 5. Collectives<br/>5.1 Reduce<br/>5.2 Fusing Map and Reduce<br/>5.3 Dot Product<br/>5.4 Scan<br/>5.5 Fusing Map and Scan<br/>5.6 Integration<br/>5.7 Summary<br/>Chapter 6. Data Reorganization<br/>6.1 Gather<br/>6.2 Scatter<br/>6.3 Converting Scatter to Gather<br/>6.4 Pack<br/>6.5 Fusing Map and Pack<br/>6.6 Geometric Decomposition and Partition<br/>6.7 Array of Structures vs. Structures of Arrays<br/>6.8 Summary<br/>Chapter 7. Stencil and Recurrence<br/>7.1 Stencil<br/>7.2 Implementing Stencil with Shift<br/>7.3 Tiling Stencils for Cache<br/>7.4 Optimizing Stencils for Communication<br/>7.5 Recurrence<br/>7.6 Summary<br/>Chapter 8. Fork–Join<br/>8.1 Definition<br/>8.2 Programming Model Support for Fork–Join<br/>8.3 Recursive Implementation of Map<br/>8.4 Choosing Base Cases<br/>8.5 Load Balancing<br/>8.6 Complexity of Parallel Divide-and-Conquer<br/>8.7 Karatsuba Multiplication of Polynomials<br/>8.8 Cache Locality and Cache-Oblivious Algorithms<br/>8.9 Quicksort<br/>8.10 Reductions and Hyperobjects<br/>8.11 Implementing Scan with Fork–Join<br/>8.12 Applying Fork–Join to Recurrences<br/>8.13 Summary<br/>Chapter 9. Pipeline<br/>9.1 Basic Pipeline<br/>9.2 Pipeline with Parallel Stages<br/>9.3 Implementation of a Pipeline<br/>9.4 Programming Model Support for Pipelines<br/>9.5 More General Topologies<br/>9.6 Mandatory versus Optional Parallelism<br/>9.7 Summary<br/>PART II. Examples<br/>Chapter 10. Forward Seismic Simulation<br/>10.1 Background<br/>10.2 Stencil Computation<br/>10.3 Impact of Caches on Arithmetic Intensity<br/>10.4 Raising Arithmetic Intensity with Space–Time Tiling<br/>10.5 Cilk Plus Code<br/>10.6 ArBB Implementation<br/>10.7 Summary<br/>Chapter 11. K-Means Clustering<br/>11.1 Algorithm<br/>11.2 K-Means with Cilk Plus<br/>11.3 K-Means with TBB<br/>11.4 Summary<br/>Chapter 12. Bzip2 Data Compression<br/>12.1 The Bzip2 Algorithm<br/>12.2 Three-Stage Pipeline Using TBB<br/>12.3 Four-Stage Pipeline Using TBB<br/>12.4 Three-Stage Pipeline Using Cilk Plus<br/>12.5 Summary<br/>Chapter 13. Merge Sort<br/>13.1 Parallel Merge<br/>13.2 Parallel Merge Sort<br/>13.3 Summary<br/>Chapter 14. Sample Sort<br/>14.1 Overall Structure<br/>14.2 Choosing the Number of Bins<br/>14.3 Binning<br/>14.4 Repacking and Subsorting<br/>14.5 Performance Analysis of Sample Sort<br/>14.6 For C++ Experts<br/>14.7 Summary<br/>Chapter 15. Cholesky Factorization<br/>15.1 Fortran Rules!<br/>15.2 Recursive Cholesky Decomposition<br/>15.3 Triangular Solve<br/>15.4 Symmetric Rank Update<br/>15.5 Where is the Time Spent?<br/>15.6 Summary<br/>APPENDIX A. Further Reading<br/>APPENDIX B. Cilk Plus<br/>APPENDIX C. TBB<br/>APPENDIX D. C++11<br/>APPENDIX E. Glossary<br/>Bibliography
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software patterns.
9 (RLIN) 33251
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Structured programming.
9 (RLIN) 33252
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Robison, Arch D.
9 (RLIN) 33253
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Reinders, James.
9 (RLIN) 33254
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Abstract
Uniform Resource Identifier <a href="http://repository.fue.edu.eg/xmlui/handle/123456789/3502">http://repository.fue.edu.eg/xmlui/handle/123456789/3502</a>
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Source of classification or shelving scheme Dewey Decimal Classification
Holdings
Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Inventory number Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type
  Dewey Decimal Classification     Computers & Information Technology ( Computer Science ) Main library Main library A1 27/12/2012 Al Fagr Publishing 366.00 PU   005.1 M.M.S 00009636 18/02/2025 27/12/2012 Books