High performance computing

OpenStax

@

Introduction to the connexions edition

0.1 Introduction to the connexions edition

1 Introduction to high performance computing

Modern computer architectures

1.1 Memory technology

1.4 Cache organization

1.5 Virtual memory

1.6 Improving memory performance

1.7 Closing notes

2 Floating-point numbers

2.2 Representation

2.3 Effects of floating-point representation

2.4 More algebra that doesn't work

2.5 Improving accuracy using guard digits

2.6 History of ieee floating-point format

2.7 Ieee operations

2.8 Special values

2.9 Exceptions and traps

2.10 Compiler issues

2.11 Closing notes

Programming and tuning software

3 What a compiler does

3.1 History of compilers

3.2 Which language to optimize

3.3 Optimizing compiler tour

3.4 Optimization levels

3.5 Classical optimizations

3.6 Closing notes

4 Timing and profiling

4.2 Subroutine profiling

4.3 Basic block profilers

4.4 Virtual memory

4.5 Closing notes

5 Eliminating clutter

5.1 Subroutine calls

5.3 Branches with loops

5.4 Other clutter

5.5 Closing notes

6 Loop optimizations

6.1 Operation counting

6.2 Basic loop unrolling

6.3 Qualifying candidates for loop unrolling up one level

6.4 Nested loops

6.5 Loop interchange

6.6 Memory access patterns

6.7 When interchange won't work

6.8 Blocking to ease memory access patterns

6.9 Programs that require more memory than you have

6.10 Closing notes

Shared-memory parallel processors

7 Understanding parallelism

7.1 Dependencies

7.3 Loop-carried dependencies

7.4 Ambiguous references

7.5 Closing notes

8 Shared-memory multiprocessors

8.1 Symmetric multiprocessing hardware

8.2 Multiprocessor software concepts

8.3 Techniques for multithreaded programs

8.4 A real example

8.5 Closing notes

9 Programming shared-memory multiprocessors

9.1 Automatic parallelization

9.2 Assisting the compiler

9.3 Closing notes

Scalable parallel processing

10 Language support for performance

10.1 Data-parallel problem: heat flow

10.2 Explicity parallel languages

10.3 Fortran 90

10.4 Problem decomposition

10.5 High performance fortran (hpf)

10.6 Closing notes

11 Message-passing environments

11.1 Parallel virtual machine

11.2 Message-passing interface

11.3 Closing notes

12 Appendix c: high performance microprocessors

12.2 Fundamental of risc

12.3 Second-generation risc processors

12.4 Risc means fast

12.5 Out-of-order execution: the post-risc architecture

12.6 Closing notes

13 Appendix b: looking at assembly language

Assembly language

Source: OpenStax, High performance computing. OpenStax CNX. Aug 25, 2010 Download for free at http://cnx.org/content/col11136/1.5

©flickr: Abraham	3 Biology 3 By Sarah Warren Start Test
	2 Week 2 Social Psych By Yacoub Jayoghli Start Quiz
	Cardiac Electrophysiology Basic By Mistry Bhavesh Start Quiz
	Microeconomics Practice MCQ By Frank Levy Start Test
	25 AP 25 Urinary System Essay By OpenStax Start Flashcards
	3 Neuroanatomy 03 Ventricular System By Stephen Voron Start Quiz
	9 Sociology 09 Social Stratification in the US MCQ By OpenStax Start Quiz
	29 Biology 29 Vertebrates MCQ By OpenStax Start Quiz
©flickr: Steve	C Programming Language By JavaChamp Team Start Quiz
	7 Physiotherapy Flashcards Set 7 By Rhodes Start Flashcards