Appearances of the Birthday Paradox in High Performance Computing

dc.creatorEijkhout, Victor
dc.creatorMyers, Margaret
dc.creatorMcCalpin, John
dc.date.accessioned2020-01-15T21:46:38Z
dc.date.available2020-01-15T21:46:38Z
dc.date.issued2019
dc.description.abstractWe 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.
dc.description.departmentTexas Advanced Computing Center (TACC)
dc.identifier.urihttps://hdl.handle.net/2152/79821
dc.identifier.urihttp://dx.doi.org/10.26153/tsw/6847
dc.language.isoeng
dc.relation.ispartofTACCSTER 2019 Proceedings
dc.relation.ispartofseriesTACCSTER Proceedings 2019
dc.rights.restrictionOpen
dc.subjectprocessor cache mapping
dc.subjectnetwork port mapping
dc.titleAppearances of the Birthday Paradox in High Performance Computing
dc.typePoster

Access full-text files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Eijkhout_Poster.pdf
Size:
3.9 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Eijkhout_SLA.pdf
Size:
102.91 KB
Format:
Adobe Portable Document Format
Description:
TSW License Agreement