Shared-memory parallelism can be simple, fast, and scalable / (Record no. 884)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 07371nam a2200709 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 011453018787 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | MOCL |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260609132937.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS | |
| fixed length control field | m eo d |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cn |||m|||a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 170810s2017 nyua fob 001 0deng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781970001891 |
| Qualifying information | ebook |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Canceled/invalid ISBN | 9781970001907 |
| Qualifying information | ePub |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Canceled/invalid ISBN | 9781970001884 |
| Qualifying information | paperback |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Canceled/invalid ISBN | 9781970001914 |
| Qualifying information | hardcover |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1145/3018787 |
| Source of number or code | doi |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (CaBNVSL)swl00407729 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)1000387316 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | CaBNVSL |
| Language of cataloging | eng |
| Description conventions | rda |
| Transcribing agency | CaBNVSL |
| Modifying agency | CaBNVSL |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.642 |
| Item number | .S587 2017 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.275 |
| Edition information | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Shun, Julian, |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Shared-memory parallelism can be simple, fast, and scalable / |
| Statement of responsibility, etc. | Julian Shun. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | First edition. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | [New York] : |
| Name of producer, publisher, distributor, manufacturer | Association for Computing Machinery ; |
| Place of production, publication, distribution, manufacture | [San Rafael, California] : |
| Name of producer, publisher, distributor, manufacturer | Morgan & Claypool, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2017. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 PDF (xv, 426 pages) : |
| Other physical details | illustrations. |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | electronic |
| Source | isbdmedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Source | rdacarrier |
| 490 1# - SERIES STATEMENT | |
| Series statement | ACM books, |
| International Standard Serial Number | 2374-6777 ; |
| Volume/sequential designation | #15 |
| 538 ## - SYSTEM DETAILS NOTE | |
| System details note | Mode of access: World Wide Web. |
| 538 ## - SYSTEM DETAILS NOTE | |
| System details note | System requirements: Adobe Acrobat Reader. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes bibliographical references (pages 379-412) and index. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1. Introduction -- 1.1 Shared-memory programming -- 1.2 Shared-memory algorithm design -- 1.3 Shared-memory performance -- 1.4 The problem based benchmark suite -- 1.5 Contributions of this book -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 2. Preliminaries and notation -- 2.1 Parallel programming model -- 2.2 Algorithmic complexity model -- 2.3 Parallel primitives -- 2.4 Graphs -- 2.5 Strings -- 2.6 Problem definitions -- 2.7 Experimental environment -- Part I. Programming techniques for deterministic parallelism -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 3. Internally deterministic parallelism: techniques and algorithms -- 3.1 Introduction -- 3.2 Programming model -- 3.3 Commutative building blocks -- 3.4 Internally deterministic parallel algorithms -- 3.5 Experimental results -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 4. Deterministic parallelism in sequential iterative algorithms -- 4.1 Introduction -- 4.2 Analysis tools -- 4.3 Algorithmic design techniques -- 4.4 Maximal independent set -- 4.5 Maximal matching -- 4.6 Random permutation -- 4.7 List contraction -- 4.8 Tree contraction -- 4.9 Limited randomness -- 4.10 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 5. A deterministic phase-concurrent parallel hash table -- 5.1 Introduction -- 5.2 Related work -- 5.3 Preliminaries -- 5.4 Deterministic phase-concurrent hash table -- 5.5 Applications -- 5.6 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 6. Priority updates: a contention-reducing primitive for deterministic programming -- 6.1 Introduction -- 6.2 Priority updates -- 6.3 Contention in shared memory operations -- 6.4 Applications of priority update -- 6.5 Experiment study: applications -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part II. Large-scale shared-memory graph analytics -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 7. Ligra: a lightweight graph processing framework for shared memory -- 7.1 Introduction -- 7.2 Related work -- 7.3 Framework -- 7.4 Applications -- 7.5 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 8. Ligra+: adding compression to Ligra -- 8.1 Introduction -- 8.2 Previous work -- 8.3 Ligra+ implementation -- 8.4 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part III. Parallel graph algorithms -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 9. Linear-work parallel graph connectivity -- 9.1 Introduction -- 9.2 Linear-work low-diameter decomposition -- 9.3 Linear-work connectivity -- 9.4 Implementation details -- 9.5 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 10. Parallel and cache-oblivious triangle computations -- 10.1 Introduction -- 10.2 Preliminaries -- 10.3 Triangle counting -- 10.4 Exact triangle counting -- 10.5 Approximate triangle counting -- 10.6 Extensions -- 10.7 Evaluation -- 10.8 Parallelization of the Pagh-Silvestri algorithm -- 10.9 Prior and related work -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part IV. Parallel string algorithms -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 11. Parallel Cartesian tree and suffix tree construction -- 11.1 Introduction -- 11.2 Preliminaries -- 11.3 Parallel Cartesian trees -- 11.4 Cartesian trees and the ANSV problem -- 11.5 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 12. Parallel computation of longest common prefixes -- 12.1 Introduction -- 12.2 Preliminaries -- 12.3 Algorithms and analysis -- 12.4 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 13. Parallel Lempel-Ziv factorization -- 13.1 Introduction -- 13.2 Preliminaries -- 13.3 Parallel Lempel-Ziv factorization algorithm -- 13.4 Implementations -- 13.5 Experiments -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 14. Parallel wavelet tree construction -- 14.1 Introduction -- 14.2 Preliminaries -- 14.3 Related work -- 14.4 Parallel wavelet tree construction -- 14.5 Experiments -- 14.6 Parallel construction of rank/select structures -- 14.7 Extensions -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 15. Conclusion and future work -- 15.1 Summary -- 15.2 Future work -- |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | References -- Index -- Author's biography. |
| 520 3# - SUMMARY, ETC. | |
| Summary, etc. | Parallelism is the key to achieving high performance in computing. However, writing efficient and scalable parallel programs is notoriously difficult, and often requires significant expertise. To address this challenge, it is crucial to provide programmers with high-level tools to enable them to develop solutions easily, and at the same time emphasize the theoretical and practical aspects of algorithm design to allow the solutions developed to run efficiently under many different settings. This book, a revised version of the thesis that won the 2015 ACM Doctoral Dissertation Award, addresses this challenge using a three-pronged approach consisting of the design of shared-memory programming techniques, frameworks, and algorithms for important problems in computing. It provides evidence that with appropriate programming techniques, frameworks, and algorithms, shared-memory programs can be simple, fast, and scalable, both in theory and in practice. The results serve to ease the transition into the multicore era. The book starts by introducing tools and techniques for deterministic parallel programming, including means for encapsulating nondeterminism via powerful commutative building blocks, as well as a novel framework for executing sequential iterative loops in parallel, which lead to deterministic parallel algorithms that are efficient both in theory and in practice. The book then introduces Ligra, the first high-level shared-memory framework for parallel graph traversal algorithms. The framework enables short and concise implementations that deliver performance competitive with that of highly optimized code and up to orders of magnitude faster than previous systems designed for distributed memory. Finally, the book bridges the gap between theory and practice in parallel algorithm design by introducing the first algorithms for a variety of important problems on graphs and strings that are both practical and theoretically efficient. |
| 530 ## - ADDITIONAL PHYSICAL FORM AVAILABLE NOTE | |
| Additional physical form available note | Also available in print. |
| 588 ## - SOURCE OF DESCRIPTION NOTE | |
| Source of description note | Title from PDF title page (viewed on August 10, 2017). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Parallel programming (Computer science) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Parallel computers |
| General subdivision | Programming. |
| 655 #0 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Print version: |
| International Standard Book Number | 9781970001914 |
| -- | 9781970001884 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | ACM books ; |
| Volume/sequential designation | #15. |
| International Standard Serial Number | 2374-6777 |
| 856 48 - ELECTRONIC LOCATION AND ACCESS | |
| Materials specified | Abstract with links to full text |
| Uniform Resource Identifier | <a href="http://dx.doi.org/10.1145/3018787">http://dx.doi.org/10.1145/3018787</a> |
No items available.