Home Glossary Page 25

Glossary

A category used for the Blocks & Files Glossary document.

Cache

0
Cache - A high-speed memory device that is faster than the memory or storage device otherwise used. For example, main memory can be used to cache data from SSDs...

LBA

0
LBA – Logical Block Address – used in a hard disk drive (HDD) addressing scheme to identify blocks on the drive and so read data from or write data to...

CHS

0
CHS – Cylinder Head Sector – addressing scheme for hard disk drives. Data is written in sectors on tracks (cylinders) on one side of a platter which is indicated by...

Byte

0
Byte - A computing unit consisting of 8 bits and used to encode letters or numbers. Capital C is written as 01000011. A word is 2 bytes (16 bits),...

Bounce Buffer

0
Bounce buffer - High-speed memory resource used as a cache to temporarily store some data. For example, until recently a GPU was fed with data by the host server’s CPU,...

Blockchain

0
Blockchain - A blockchain is a decentralized ledger of transactions across a peer-to-peer network. Each transaction is recorded in an immutable and date/timestamped way and cannot be overwritten. All...

Block

0
Block – Data is stored in bit areas on storage media. The bits are grouped into blocks and the blocks numbered sequentially from the start of the disk, thus providing...

Bit Line

0
Bit Line - Cells in a memory array, such as DRAM, are laid out in rows and a row is called a bit line (as in line of bits)....

MR-MUF

0
MR-MUF - Mass Reflow Molded Underfill - A method used by SK hynix in its HBM semiconductor manufacturing process. It involves the placing of multiple chips on the lower...

Bit

0
Bit – The smallest element of data in an IT system. It has a value of 1 or 0 and eight of them make up a byte. The letter A...

Log-Structured Merge Tree

0
Log-Structured Merge Tree – The Log-Structured Merge Tree concept is used for ingesting and indexing data and persisting it to storage by application storage engines. It has ordered key:value pairs...

Binary Search Tree

0
Binary Search Tree – see B-Tree.