#history and downfall of #Tera in #HPC.
on 02026-04-14#Myrinet history 01994–02004 (it died about 02005) #HPC #supercomputers #Beowulf
on 02024-11-03Hmm, in shuffle-exchange #graphs, each node can transmit to the node whose ID number has the lowest bit flipped, or the node whose ID number is rotated one bit to the left from its own. So each node has degree 3 (or directed degree 2), which is the smallest node degree a nontrivial network can have, but the longest path length (diameter?) in a shuffle-exchange graph of 2^N nodes is only 2N, because the path from node 1111...111 to 0000...000 involves N rotation links and N bit-flipping links. Tomas Lang and Harold Stone, 01976. Relevant to #HPC #topomania, because its diameter is worse than a hypercube’s only by a factor of 2, but has only 2 outgoing links per node instead of N.
on 02023-10-21Jack Dongarra’s report on the new Fugaku 400-petaflop supercomputer (3.9 theoretical peak exa-int-ops-per-second for ANN inference), now #1 on the TOP500 list; ORNL University of Tennessee Tech Report No. ICL-UT-20-06 #HPC
on 02020-06-23apparently #APL, R, Matlab, #Numpy, etc., are now all part of a new field called "array programming" that started in 2013. Keynoted by Morten Kromberg from Dyalog. #HPC focus.
on 02016-06-28Using #Guix for #HPC environments for #reproducible-research.
on 02015-08-06