arXiv Open Access 2019

Appearances of the Birthday Paradox in High Performance Computing

Victor Eijkhout Margaret Myers John McCalpin

Lihat Sumber

Abstrak

We give an elementary statistical analysis of two High Performance Computing issues, processor cache mapping and network port mapping. In both cases we find that, as in the birthday paradox, random assignment leads to more frequent coincidences than one expects a priori. Since these correspond to contention for limited resources, this phenomenon has important consequences for performance.

Topik & Kata Kunci

cs.AR

Penulis (3)

Victor Eijkhout

Margaret Myers

John McCalpin

Format Sitasi

APA MLA BibTeX

Eijkhout, V., Myers, M., McCalpin, J. (2019). Appearances of the Birthday Paradox in High Performance Computing. https://arxiv.org/abs/1909.12195

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓