Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Lawrence D'Oliveiro <ldo@nz.invalid>
Newsgroups: comp.arch
Subject: Re: Array vs. Linked List Traversal
Date: Thu, 1 Aug 2024 23:14:40 -0000 (UTC)
Organization: A noiseless patient Spider
Lines: 9
Message-ID: <v8h4t0$2e5g0$5@dont-email.me>
References: <v8g7lr$27dq5$1@dont-email.me>
	<785fcf1ed0f5cd2700c9fd4970b4ef79@www.novabbs.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 02 Aug 2024 01:14:41 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="480e27b3b4cc073acc0e6062d3b4dc69";
	logging-data="2561536"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19wkk8B9p6MpW+WtjpaVScp"
User-Agent: Pan/0.159 (Vovchansk; )
Cancel-Lock: sha1:2NTCi9+LD6WcfBKvgmJOzYF88Pk=
Bytes: 1258

On Thu, 1 Aug 2024 15:49:35 +0000, MitchAlsup1 wrote:

> The next element address in an array can be found by addition
> The next element address in a linked list can be found by a load
> 
> With cache hits, add is 1 cycle
> With cache hits, load is 3-4 cycles

Hence the term, “pointer-chasing”.