By: hobold (hobold.delete@this.vectorizer.org), October 11, 2020 2:22 pm
Room: Moderated Discussions
anon (anon.delete@this.ymous.org) on October 11, 2020 1:07 pm wrote:
[...]
> What difference do you make between "unseen before" and "unknown"?
I am not sure if I can come up on the spot with a proper definition, but maybe two examples can illustrate the difference (and a third example will illustrate the difficulty of defining things).
1. The stream prefetcher mentioned before requires very little information: a current address and a stride. This information completely determines the next and all future addresses that will be (pre-)fetched. So those addresses are known, but still unseen by, say, some physical probe on some physical address bus. The pattern is easy to predict, and there are practical computational shortcuts to find, say, the seventh address from now (without needing to compute the six addresses inbetween).
2. Unknowable, in contrast, are chaotic things like Newton's three body problem, or the double pendulum, or the weather. One can argue that the information content here is infinite, as real numbers describing the system's state require unlimited precision. The future configuration of such a system, beyond a brief window of short term immediate future, is unknown.
3. The grey area is something like a picture of the Mandelbrot set. You give the computer a finite set of parameters and let it churn out pixels (using finite precision). The final picture is entirely determined by the parameters. However, certain parts of the resulting picture cannot be guessed beforehand, other than actually performing the full chain of computations. There are no general shortcuts, there is no method of prediction that could save work on all pixels. Many clever optimizations have been devised, and many pixels can be accurately generated with less effort. But not all. So are these problematic pixels known or unknown beforehand? They are fully determined from the start. On the other hand they are not predictable (in the sense of saving effort to obtain them, one cannot "skip ahead" to them).
[...]
> What difference do you make between "unseen before" and "unknown"?
I am not sure if I can come up on the spot with a proper definition, but maybe two examples can illustrate the difference (and a third example will illustrate the difficulty of defining things).
1. The stream prefetcher mentioned before requires very little information: a current address and a stride. This information completely determines the next and all future addresses that will be (pre-)fetched. So those addresses are known, but still unseen by, say, some physical probe on some physical address bus. The pattern is easy to predict, and there are practical computational shortcuts to find, say, the seventh address from now (without needing to compute the six addresses inbetween).
2. Unknowable, in contrast, are chaotic things like Newton's three body problem, or the double pendulum, or the weather. One can argue that the information content here is infinite, as real numbers describing the system's state require unlimited precision. The future configuration of such a system, beyond a brief window of short term immediate future, is unknown.
3. The grey area is something like a picture of the Mandelbrot set. You give the computer a finite set of parameters and let it churn out pixels (using finite precision). The final picture is entirely determined by the parameters. However, certain parts of the resulting picture cannot be guessed beforehand, other than actually performing the full chain of computations. There are no general shortcuts, there is no method of prediction that could save work on all pixels. Many clever optimizations have been devised, and many pixels can be accurately generated with less effort. But not all. So are these problematic pixels known or unknown beforehand? They are fully determined from the start. On the other hand they are not predictable (in the sense of saving effort to obtain them, one cannot "skip ahead" to them).
Topic | Posted By | Date |
---|---|---|
Zen 3 | Blue | 2020/10/08 09:58 AM |
Zen 3 | Rayla | 2020/10/08 10:10 AM |
Zen 3 | Adrian | 2020/10/08 10:13 AM |
Does anyone know whether Zen 3 has AVX-512? (NT) | Foo_ | 2020/10/08 11:54 AM |
Does anyone know whether Zen 3 has AVX-512? | Adrian | 2020/10/08 12:11 PM |
Zen 3 - Number of load/store units | ⚛ | 2020/10/08 10:21 AM |
Zen 3 - Number of load/store units | Rayla | 2020/10/08 10:28 AM |
Zen 3 - Number of load/store units | ⚛ | 2020/10/08 11:22 AM |
Zen 3 - Number of load/store units | Adrian | 2020/10/08 11:53 AM |
Zen 3 - Number of load/store units | Travis Downs | 2020/10/08 09:45 PM |
Zen 3 - CAD benchmark | Per Hesselgren | 2020/10/09 07:29 AM |
Zen 3 - CAD benchmark | Adrian | 2020/10/09 09:27 AM |
Zen 3 - Number of load/store units | itsmydamnation | 2020/10/08 02:38 PM |
Zen 3 - Number of load/store units | Groo | 2020/10/08 02:48 PM |
Zen 3 - Number of load/store units | Wilco | 2020/10/08 03:02 PM |
Zen 3 - Number of load/store units | Dummond D. Slow | 2020/10/08 04:39 PM |
Zen 3 - Number of load/store units | Doug S | 2020/10/09 08:11 AM |
Zen 3 - Number of load/store units | Dummond D. Slow | 2020/10/09 09:43 AM |
Zen 3 - Number of load/store units | Doug S | 2020/10/09 01:43 PM |
N7 and N7P are not load/Store units - please fix the topic in your replies (NT) | Heikki Kultala | 2020/10/10 07:37 AM |
Zen 3 | Jeff S. | 2020/10/08 12:16 PM |
Zen 3 | anon | 2020/10/08 01:57 PM |
Disappointing opening line in paper | Paul A. Clayton | 2020/10/11 06:16 AM |
Thoughts on "Improving the Utilization of µop Caches..." | Paul A. Clayton | 2020/10/14 12:11 PM |
Thoughts on "Improving the Utilization of µop Caches..." | anon | 2020/10/15 11:56 AM |
Thoughts on "Improving the Utilization of µop Caches..." | anon | 2020/10/15 11:57 AM |
Sorry about the mess | anon | 2020/10/15 11:58 AM |
Sorry about the mess | Brett | 2020/10/16 03:22 AM |
Caching dependence info in µop cache | Paul A. Clayton | 2020/10/16 06:20 AM |
Caching dependence info in µop cache | anon | 2020/10/16 12:36 PM |
Caching dependence info in µop cache | Paul A. Clayton | 2020/10/18 01:28 PM |
Zen 3 | juanrga | 2020/10/09 10:12 AM |
Zen 3 | Mr. Camel | 2020/10/09 06:30 PM |
Zen 3 | anon.1 | 2020/10/10 12:44 AM |
Cinebench is terrible benchmark | David Kanter | 2020/10/10 10:36 AM |
Cinebench is terrible benchmark | anon.1 | 2020/10/10 12:06 PM |
Cinebench is terrible benchmark | hobold | 2020/10/10 12:33 PM |
Some comments on benchmarks | Paul A. Clayton | 2020/10/14 12:11 PM |
Some comments on benchmarks | Mark Roulo | 2020/10/14 03:21 PM |
Zen 3 | Adrian | 2020/10/10 01:59 AM |
Zen 3 | Adrian | 2020/10/10 02:18 AM |
Zen 3 | majord | 2020/10/15 04:02 AM |
Zen 3 | hobold | 2020/10/10 08:58 AM |
Zen 3 | Maynard Handley | 2020/10/10 10:36 AM |
Zen 3 | hobold | 2020/10/10 12:19 PM |
Zen 3 | anon | 2020/10/11 02:58 AM |
Zen 3 | hobold | 2020/10/11 12:32 PM |
Zen 3 | anon | 2020/10/11 01:07 PM |
Zen 3 | hobold | 2020/10/11 02:22 PM |
Zen 3 | anon | 2020/10/10 11:51 AM |
Zen 3 | Michael S | 2020/10/11 01:16 AM |
Zen 3 | hobold | 2020/10/11 02:13 AM |
Zen 3 | Michael S | 2020/10/11 02:18 AM |
Zen 3 | anon.1 | 2020/10/11 12:17 PM |
Zen 3 | David Hess | 2020/10/12 06:43 AM |
more power? (NT) | anonymous2 | 2020/10/12 01:26 PM |
I think he's comparing 65W 3700X vs 105W 5800X (NT) | John H | 2020/10/12 04:33 PM |
?! Those are apples and oranges! (NT) | anon | 2020/10/12 04:49 PM |