Shared-memory parallelism can be simple, fast, and scalable (Record no. 29104)

000 -LEADER
fixed length control field nam a22 7a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180820b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781970001884
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.275
Item number SHU
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Shun, Julian
245 ## - TITLE STATEMENT
Title Shared-memory parallelism can be simple, fast, and scalable
250 ## - EDITION STATEMENT
Edition statement 1st ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Morgan & Claypool,
Date of publication, distribution, etc 2017
Place of publication, distribution, etc UK:
300 ## - PHYSICAL DESCRIPTION
Extent xv, 426 p. :
Other physical details col. ill.;
Dimensions 23.5 cm.
365 ## - TRADE PRICE
Price type code US$
Price amount 99.95
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.,
"This is a revised version of the thesis that won the 2015 ACM Doctoral Dissertation Award."--Back cover.
520 ## - 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 thesis 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. The thesis 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 developed in this thesis serve to ease the transition into the multicore era
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms
Topical term or geographic name as entry element Hash table
Topical term or geographic name as entry element Parallel string Algorithms
Topical term or geographic name as entry element Analysis tools
Topical term or geographic name as entry element Priority Updates
Topical term or geographic name as entry element Parallel graph Algorithms
Topical term or geographic name as entry element Linear-work parallel graph connectivity
Topical term or geographic name as entry element Parallel wavelet tree construction
Topical term or geographic name as entry element Parallel Lempel-Ziv factorization
Topical term or geographic name as entry element Parallel computation
Topical term or geographic name as entry element Parallel cartesian tree
Topical term or geographic name as entry element Cache-oblivious triangle computations
Topical term or geographic name as entry element Ligra
Topical term or geographic name as entry element Parallel programming
Topical term or geographic name as entry element Ligra++
Topical term or geographic name as entry element Mehrkernprozessor
Topical term or geographic name as entry element Parallel computers
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Source of acquisition Cost, normal purchase price Full call number Barcode Date last seen Koha item type
          DAIICT DAIICT 2018-08-20 Kushal Books 7206.40 005.275 SHU 031615 2018-08-20 Books

Powered by Koha