Lynne cyanreg
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| static void fft8(FFTComplex *z) | |
| { | |
| FFTSample r1 = z[0].re - z[4].re; | |
| FFTSample r2 = z[0].im - z[4].im; | |
| FFTSample r3 = z[1].re - z[5].re; | |
| FFTSample r4 = z[1].im - z[5].im; | |
| FFTSample r5 = z[2].re - z[6].re; | |
| FFTSample r6 = z[2].im - z[6].im; | |
| FFTSample r7 = z[3].re - z[7].re; |
cyanreg
/ latency.txt
Last active
December 13, 2020 15:58
— forked from jboner/latency.txt
Latency Numbers Every Programmer Should Know
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Latency Comparison Numbers (~2012) | |
| ---------------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns 3 us | |
| Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
| Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |
NewerOlder