[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: CLN, GMP inputs
From: |
Torbjorn Granlund |
Subject: |
Re: CLN, GMP inputs |
Date: |
11 May 2001 12:58:56 +0200 |
User-agent: |
Gnus/5.0807 (Gnus v5.8.7) Emacs/20.6 |
Hans Aberg <address@hidden> writes:
At 08:24 +1000 2001/05/11, Kevin Ryde wrote:
>> If a CPU would support instructions for
>> +, -, *: 1-register x 1-register -> 2-register
>> then the small number representations could be made very fast. (But I am
>> told that many CPU's do not support that.)
>
>Overflow detection is always possible, whether it's particularly
>convenient or not is another question.
If only overflow detection is available, I think that will help a lot,
because it can help making the small nums fast. Once one gets an overflow,
one knocks on a lot of cycles because of the memory allocation, so then it
does not matter much about inconvenience (from the point of view of speed).
Memory allocation is not an issue here, is it? Just because we have
code for special-handling of single-limb numbers doesn't mean that we
will need to perform memory reallocation. We often already have
enough space.
In fact, memory management is not an issue for any properly written
GMP application.
--
Torbjörn
- Re: CLN, GMP inputs, (continued)
- Re: CLN, GMP inputs, Hans Aberg, 2001/05/03
- Re: CLN, GMP inputs, Kevin Ryde, 2001/05/05
- Re: CLN, GMP inputs, Hans Aberg, 2001/05/05
- Re: CLN, GMP inputs, Kevin Ryde, 2001/05/05
- Re: CLN, GMP inputs, Hans Aberg, 2001/05/06
- Re: CLN, GMP inputs, Hans Aberg, 2001/05/06
Re: CLN, GMP inputs, Hans Aberg, 2001/05/03
Re: CLN, GMP inputs, Hans Aberg, 2001/05/07