High Performance Computing (HPC) Basics

A computer with a high level of performance as compared to a general-purpose computer.

Floating-point operations per second, a measure of a computer's performance.

Hundreds of gigaFLOPS (10^11) to tens of teraFLOPS (10^13)

<p>A group of two or more computers that run in parallel to achieve a common goal.</p> Signup and view all the answers

<p>Algorithms, software system (OS/compiler), and the computer executing the machine instructions (processor and memory) and I/O systems.</p> Signup and view all the answers

<p>A step-wise representation of a solution to a given problem.</p> Signup and view all the answers

<p>The basics of computer architecture, operating systems, and programming languages, particularly those commonly used for HPC.</p> Signup and view all the answers

<p>To process data and perform complex calculations efficiently, reliably, and at high speeds.</p> Signup and view all the answers

<p>Supercomputers and computer clusters.</p> Signup and view all the answers

<p>HPC is important for handling the growing amount of data from technologies like IoT, AI, and 3-D imaging.</p> Signup and view all the answers

<p>Improved computing performance and ability to perform complex calculations.</p> Signup and view all the answers

<p>Healthcare, Engineering, Aerospace, Urban planning, and Finance and business.</p> Signup and view all the answers

<p>Traversing the array from the starting till the desired element or value is found</p> Signup and view all the answers

<p>The target array must be sorted</p> Signup and view all the answers

<p>mid = low + (high - low) / 2</p> Signup and view all the answers

<p>We know that the target value must be in the upper portion of the array</p> Signup and view all the answers

<p>We change our low to mid + 1</p> Signup and view all the answers

<p>We know that the target value must be in the lower part from this location</p> Signup and view all the answers

<p>Looking for the largest value in each pass and placing it in the proper location.</p> Signup and view all the answers

<p>Implementation is easy, it's fast for finding smallest or largest numbers, suitable for small lists, and it's an in-place sort that doesn't need extra memory.</p> Signup and view all the answers

<p>It's slow and blind, meaning it doesn't terminate early even if the list is already sorted.</p> Signup and view all the answers

<p>It makes multiple passes through the list, comparing adjacent items and exchanging those that are out of order, placing the next largest value in its proper place.</p> Signup and view all the answers

<p>It's simple and suitable for small lists, and it's an in-place sort that doesn't need extra memory.</p> Signup and view all the answers

<p>Both are in-place sorts that don't need extra memory, and they are suitable for small lists.</p> Signup and view all the answers