MARC 닫기
00000cam u2200205Mi 4500
000000529996
20220218142615
m d
cr |n|||||||||
210110s2019 maua ob 001 0 engd
▼a 9780262359184
▼q (electronic bk.)
▼a 0262359189
▼q (electronic bk.)
▼z 9780262538862
▼z 0262538865
▼a 2720022
▼b (N$T)
▼a (OCoLC)1229972481
▼a YDX
▼b eng
▼c YDX
▼d OCLCO
▼d EBLCP
▼d UKAHL
▼d N$T
▼d 248023
▼a MAIN
▼a QA76.642
▼a 005.2/75
▼2 23
▼a Mattson, Timothy G.,
▼d 1958-,
▼e author.
▼a The OpenMP common core
▼h [electronic resource]:
▼b making OpenMP simple again /
▼c Timothy G. Mattson, Yun (Helen) He, and Alice E. Koniges.
▼a Cambridge, Massachusetts:
▼b The MIT Press,
▼c [2019].
▼a 1 online resource.
▼a Scientific and engineering computation
▼a Intro -- Copyright -- Contents -- Series Foreword -- Foreword -- Preface -- I Setting the Stage -- 1 Parallel Computing -- 1.1 Fundamental Concepts of Parallel Computing -- 1.2 The Rise of Concurrency -- 1.3 Parallel Hardware -- 1.3.1 Multiprocessor Systems -- 1.3.2 Graphics Processing Units (GPU) -- 1.3.3 Distributed Memory Clusters -- 1.4 Parallel Software for Multiprocessor Computers -- 2 The Language of Performance -- 2.1 The Basics: FLOPS, Speedup, and Parallel Efficiency -- 2.2 Amdahl's Law -- 2.3 Parallel Overhead -- 2.4 Strong Scaling vs. Weak Scaling -- 2.5 Load Balancing
▼a 2.6 Understanding Hardware with the Roofline Model -- 3 What is OpenMP? -- 3.1 OpenMP History -- 3.2 The Common Core -- 3.3 Major Components of OpenMP -- II The OpenMP Common Core -- 4 Threads and the OpenMP Programming Model -- 4.1 Overview of OpenMP -- 4.2 The Structure of OpenMP Programs -- 4.3 Threads and the Fork Join Pattern -- 4.4 Working with Threads -- 4.4.1 The SPMD Design Pattern -- 4.4.2 False Sharing -- 4.4.3 Synchronization -- 4.4.3.1 Critical -- 4.4.3.2 Barrier -- 4.5 Closing Comments -- 5 Parallel Loops -- 5.1 Worksharing-Loop Construct
▼a 5.2 Combined Parallel Worksharing-Loop Construct -- 5.3 Reductions -- 5.4 Loop Schedules -- 5.4.1 The Static Schedule -- 5.4.2 The Dynamic Schedule -- 5.4.3 Choosing a Schedule -- 5.5 Implicit Barriers and the Nowait Clause -- 5.6 Pi Program with Parallel Loop Worksharing -- 5.7 A Loop-Level Parallelism Strategy -- 5.8 Closing Comments -- 6 OpenMP Data Environment -- 6.1 Default Storage Attributes -- 6.2 Modifying Storage Attributes -- 6.2.1 The Shared Clause -- 6.2.2 The Private Clause -- 6.2.3 The Firstprivate Clause -- 6.2.4 The Default Clause -- 6.3 Data Environment Examples
▼a 6.3.1 A Data Scope Test -- 6.3.2 Mandelbrot Set Area -- 6.3.3 Pi Loop Example Revisited -- 6.4 Arrays and Pointers -- 6.5 Closing Comments -- 7 Tasks in OpenMP -- 7.1 The Need for Tasks -- 7.2 Explicit Tasks -- 7.3 Our First Example: Schrödinger's Program -- 7.4 The Single Construct -- 7.5 Working with Tasks -- 7.5.1 When Do Tasks Complete? -- 7.6 Task Data Environment -- 7.6.1 Default Data Scoping for Tasks -- 7.6.2 Linked List Program Revisited with Tasks -- 7.7 Fundamental Design Patterns with Tasks -- 7.7.1 Divide and Conquer Pattern -- 7.8 Closing Comments -- 8 OpenMP Memory Model
▼a 8.1 Memory Hierarchies Revisited -- 8.2 The OpenMP Common Core Memory Model -- 8.3 Working with Shared Memory -- 8.4 Closing Comments -- 9 Common Core Recap -- 9.1 Managing Threads -- 9.2 Worksharing Constructs -- 9.3 Parallel Worksharing-Loop Combined Construct -- 9.4 OpenMP Tasks -- 9.5 Synchronization and Memory Consistency Models -- 9.6 Data Environment Clauses -- 9.7 The Reduction Clause -- 9.8 Environment Variables and Runtime Library Routines -- III Beyond the Common Core -- 10 Multithreading beyond the Common Core -- 10.1 Additional Clauses for OpenMP Common Core Constructs
▼a Added to collection customer.56279.3
▼a OpenMP (Application program interface)
▼a Parallel programming (Computer science)
▼a Application program interfaces (Computer software)
▼a Electronic books.
▼a He, Yun,
▼c (Computer scientist),
▼e author.
▼a Koniges, Alice Evelyn,
▼e author.
▼i Print version:,
▼z 9780262538862,
▼z 0262538865
▼w (DLC) 2019033350
▼w (OCoLC)1112790688
▼a Scientific and engineering computation.
▼a NA000000
▼b 00000140
▼3 EBSCOhost
▼u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2720022
▼a Askews and Holts Library Services
▼b ASKH
▼n AH38230606
▼a ProQuest Ebook Central
▼b EBLB
▼n EBL6451981
▼a YBP Library Services
▼b YANK
▼n 301863968
▼a EBSCOhost
▼b EBSC
▼n 2720022
▼a 최영란
▼a eBook
▼a 92
▼b N$T
| 자료유형 : | eBook |
|---|---|
| ISBN : | 9780262359184 |
| ISBN : | 0262359189 |
| ISBN : | |
| ISBN : | |
| 개인저자 : | Mattson, Timothy G., 1958-, author. |
| 서명/저자사항 : | The OpenMP common core [electronic resource]: making OpenMP simple again / Timothy G. Mattson, Yun (Helen) He, and Alice E. Koniges. |
| 발행사항 : | Cambridge, Massachusetts: The MIT Press, [2019]. |
| 형태사항 : | 1 online resource. |
| 총서사항 : | Scientific and engineering computation |
| 내용주기 : | Intro -- Copyright -- Contents -- Series Foreword -- Foreword -- Preface -- I Setting the Stage -- 1 Parallel Computing -- 1.1 Fundamental Concepts of Parallel Computing -- 1.2 The Rise of Concurrency -- 1.3 Parallel Hardware -- 1.3.1 Multiprocessor Systems -- 1.3.2 Graphics Processing Units (GPU) -- 1.3.3 Distributed Memory Clusters -- 1.4 Parallel Software for Multiprocessor Computers -- 2 The Language of Performance -- 2.1 The Basics: FLOPS, Speedup, and Parallel Efficiency -- 2.2 Amdahl's Law -- 2.3 Parallel Overhead -- 2.4 Strong Scaling vs. Weak Scaling -- 2.5 Load Balancing |
| 내용주기 : | 2.6 Understanding Hardware with the Roofline Model -- 3 What is OpenMP? -- 3.1 OpenMP History -- 3.2 The Common Core -- 3.3 Major Components of OpenMP -- II The OpenMP Common Core -- 4 Threads and the OpenMP Programming Model -- 4.1 Overview of OpenMP -- 4.2 The Structure of OpenMP Programs -- 4.3 Threads and the Fork Join Pattern -- 4.4 Working with Threads -- 4.4.1 The SPMD Design Pattern -- 4.4.2 False Sharing -- 4.4.3 Synchronization -- 4.4.3.1 Critical -- 4.4.3.2 Barrier -- 4.5 Closing Comments -- 5 Parallel Loops -- 5.1 Worksharing-Loop Construct |
| 내용주기 : | 5.2 Combined Parallel Worksharing-Loop Construct -- 5.3 Reductions -- 5.4 Loop Schedules -- 5.4.1 The Static Schedule -- 5.4.2 The Dynamic Schedule -- 5.4.3 Choosing a Schedule -- 5.5 Implicit Barriers and the Nowait Clause -- 5.6 Pi Program with Parallel Loop Worksharing -- 5.7 A Loop-Level Parallelism Strategy -- 5.8 Closing Comments -- 6 OpenMP Data Environment -- 6.1 Default Storage Attributes -- 6.2 Modifying Storage Attributes -- 6.2.1 The Shared Clause -- 6.2.2 The Private Clause -- 6.2.3 The Firstprivate Clause -- 6.2.4 The Default Clause -- 6.3 Data Environment Examples |
| 내용주기 : | 6.3.1 A Data Scope Test -- 6.3.2 Mandelbrot Set Area -- 6.3.3 Pi Loop Example Revisited -- 6.4 Arrays and Pointers -- 6.5 Closing Comments -- 7 Tasks in OpenMP -- 7.1 The Need for Tasks -- 7.2 Explicit Tasks -- 7.3 Our First Example: Schrödinger's Program -- 7.4 The Single Construct -- 7.5 Working with Tasks -- 7.5.1 When Do Tasks Complete? -- 7.6 Task Data Environment -- 7.6.1 Default Data Scoping for Tasks -- 7.6.2 Linked List Program Revisited with Tasks -- 7.7 Fundamental Design Patterns with Tasks -- 7.7.1 Divide and Conquer Pattern -- 7.8 Closing Comments -- 8 OpenMP Memory Model |
| 내용주기 : | 8.1 Memory Hierarchies Revisited -- 8.2 The OpenMP Common Core Memory Model -- 8.3 Working with Shared Memory -- 8.4 Closing Comments -- 9 Common Core Recap -- 9.1 Managing Threads -- 9.2 Worksharing Constructs -- 9.3 Parallel Worksharing-Loop Combined Construct -- 9.4 OpenMP Tasks -- 9.5 Synchronization and Memory Consistency Models -- 9.6 Data Environment Clauses -- 9.7 The Reduction Clause -- 9.8 Environment Variables and Runtime Library Routines -- III Beyond the Common Core -- 10 Multithreading beyond the Common Core -- 10.1 Additional Clauses for OpenMP Common Core Constructs |
| 주제명(통일서명) : | OpenMP (Application program interface) -- |
| 일반주제명 : | Parallel programming (Computer science) -- |
| 일반주제명 : | Application program interfaces (Computer software) -- |
| 개인저자 : | He, Yun, (Computer scientist), author. |
| 개인저자 : | Koniges, Alice Evelyn, author. |
| 기타형태 저록 : | Print version:, 9780262538862, 0262538865 |
| 언어 | 영어 |
| URL : |
|---|
서평쓰기