Deutsch   English   Français   Italiano  
<vp61i2$2hd06$1@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Robert Finch <robfi680@gmail.com>
Newsgroups: comp.arch
Subject: Re: Cost of handling misaligned access
Date: Wed, 19 Feb 2025 20:46:39 -0500
Organization: A noiseless patient Spider
Lines: 18
Message-ID: <vp61i2$2hd06$1@dont-email.me>
References: <5lNnP.1313925$2xE6.991023@fx18.iad> <vnosj6$t5o0$1@dont-email.me>
 <2025Feb3.075550@mips.complang.tuwien.ac.at> <volg1m$31ca1$1@dont-email.me>
 <voobnc$3l2dl$1@dont-email.me>
 <0fc4cc997441e25330ff5c8735247b54@www.novabbs.org>
 <vp0m3f$1cth6$1@dont-email.me>
 <74142fbdc017bc560d75541f3f3c5118@www.novabbs.org>
 <20250218150739.0000192a@yahoo.com>
 <0357b097bbbf6b87de9bc91dd16757e3@www.novabbs.org>
 <vp2sv2$1skve$1@dont-email.me>
 <a34ce3b43fab761d13b2432f9e255fab@www.novabbs.org>
 <vp518t$2bhib$1@dont-email.me>
 <a56e446b2e2df9f01eb558aa68279d35@www.novabbs.org>
 <vp5mnu$2fjhi$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 20 Feb 2025 02:46:42 +0100 (CET)
Injection-Info: dont-email.me; posting-host="7ecefa82ddb74768a6045fff50dd5746";
	logging-data="2667526"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/7EYOr7dmzh1+qKis1bcmRDE786lwQ7mg="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:ENk2acclZPfovW9ftoMp8IpDJqo=
In-Reply-To: <vp5mnu$2fjhi$1@dont-email.me>
Content-Language: en-US
Bytes: 2337

> But, for a 64-bit adder, still basically need to give it a clock-cycle 
> to do its thing. Though, not like 32 is particularly fast either; hence 
> part of the whole 2 cycle latency on ALU ops thing. Mostly has to do 
> with ADD/SUB (and CMP, which is based on SUB).

> 
> 
> Admittedly part of why I have such mixed feelings on full compare-and- 
> branch:
>    Pro: It can offer a performance advantage (in terms of per-clock);
>    Con: Branch is now beholden to the latency of a Subtract.
> 
CMP can be implemented without a SUB using the '<' and '>' operators 
which I think work left to right. It should give a little better timing.
I have not found the compare-and-branch operation to be on the critical 
timing path.