|
|
Glas :Re: [glas] introducing the storage concept, a first interface specification |
From: Karl Meerbergen (Karl.Meerbergen_at_[hidden])
Date: 2005-01-20 08:34:52
Patrick Kowalzick wrote:
>> One of the reasons we want to have this discussion now is that
>> algorithms may be (and usually are) different for different forms of
>> storage. For example, when data are stored on disk or distributed on
>> a network, the algorithms change. So, algorithms may have to know how
>> data are stored in order to optimize data access.
>
>
> Do you have an example for that?
>
> E.g. when a matrix is too big to fit in memory, it is not the
> algorithm which selects to save parts of the data on disk. IMO it is
> the operating system which swaps out data.
Well, it is usually more efficient to 'swap' yourself. It is used in
out-of-core linear system solvers for example.
Karl