Re: Good explanation of Recursive Ascent Parsing wanted

On 2022-10-06, antispam@math.uni.wroc.pl <antispam@math.uni.wroc.pl> wrote:
> Of couse, modern machines tend to have larger caches than the
> old ones. But also modern machines are throughput oriented
> and my suffer more from latency.


But that's the latency of a single instruction you're talking about,
right?. E.g. a deeper pipeline can worsen the time from instruction
fetch to completion, if the clock isn't jacked up and propagation
delays reduced to compensate.


When do you care about single-instruction-level latency, other than if
concerned about pipeline stalls in some scenarios?


Throughput translates to low latency at the level of blocks of
instructions or procedures. The procedure call returns a result faster
due to throughput, which is less latency.


The latency you perceive on modern machines as an interactive user is
due to cra^H^H^Hrichly functional software stacks.

Return to the comp.compilers page.
Search the comp.compilers archives again.