From ff51840ca2454be13feb5748644b24dfab89e586 Mon Sep 17 00:00:00 2001 From: wisteryu098 Date: Tue, 27 Jan 2026 12:24:40 +0800 Subject: [PATCH] in the first python matrix multiplication example, the total cycles should be around 10^12(1.4G x 630), and in this case 880 cycles per multiplication could make sense(n^3) --- content/english/hpc/complexity/languages.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/english/hpc/complexity/languages.md b/content/english/hpc/complexity/languages.md index abb80979..27475839 100644 --- a/content/english/hpc/complexity/languages.md +++ b/content/english/hpc/complexity/languages.md @@ -84,7 +84,7 @@ print(duration) This code runs in 630 seconds. That's more than 10 minutes! -Let's try to put this number in perspective. The CPU that ran it has a clock frequency of 1.4GHz, meaning that it does $1.4 \cdot 10^9$ cycles per second, totaling to almost $10^{15}$ for the entire computation, and about 880 cycles per multiplication in the innermost loop. +Let's try to put this number in perspective. The CPU that ran it has a clock frequency of 1.4GHz, meaning that it does $1.4 \cdot 10^9$ cycles per second, totaling to almost $10^{12}$ for the entire computation, and about 880 cycles per multiplication in the innermost loop. This is not surprising if you consider the things that Python needs to do to figure out what the programmer meant: