Re: Keep a file in memory an any cost

On 05/11/11 11:19, Alain Spineux wrote:
Hello I have a file, that is an index, it is open all the time by the
application,
but sometime the access are slow because the file was moved out of the cache.

How can I keep it in memory all the time ?
I can read it at regular interval, but this is a little over kill ?

Any idea

thanks.


There is a kernel facility that nails pages to memory so that
they are not paged out (such as for DMA purposes).
But I do not know if such a facility is accessible directly from
any userland calls via libc.
BSD used to have a vadvise() call to accomplish such a feat.

--
users mailing list
users@xxxxxxxxxxxxxxxxxxxxxxx
To unsubscribe or change subscription options:
https://admin.fedoraproject.org/mailman/listinfo/users
Guidelines: http://fedoraproject.org/wiki/Mailing_list_guidelines

Relevant Pages

  • Re: Keep a file in memory an any cost
    ... but sometime the access are slow because the file was moved out of the cache. ... How can I keep it in memory all the time? ... There is a kernel facility that nails pages to memory so that ... any userland calls via libc. ...
    (Fedora)
  • Re: Cached memory never gets released
    ... Stock linux 2.4.26 kernel. ... Due to flash bug 3M of memory gets lost due to font memory getting lost ... The output of "free" cache number steadily grows. ... longer to exhaust all of system memory with the cache. ...
    (Linux-Kernel)
  • Re: Problem: Creating a raw binary string
    ... > While its true that a 64-bit cpu will move twice the data per instruction it ... > Memory bus width plays an important role here and unless it too is widened / ... You are forgetting the two levels of cache in the processor. ... The memory chips are addressed in Row col fashion. ...
    (alt.comp.lang.borland-delphi)
  • Re: Is Greenspun enough?
    ... Most OSes memory map executables directly from the file system so code doesn't pollute the file cache or swap space. ...
    (comp.lang.lisp)
  • Re: Superstitious learning in Computer Architecture
    ... Without a LOT of logic or some other better approach, re-executing the instructions requires re-decoding and it ties up the cache memory bus transferring more data as instructions than the instructions are working on. ... The concept of cache is fundamentally flawed in that it STILL restricts access to one word per clock cycle, when a single modern ALU can easily use 5 plus whatever is eaten up with instruction accesses. ... The size of an optimizing compiler is proportional to the SQUARE of the size of the language times the SQUARE of the complexity of the machine - because all interactions must be considered. ...
    (comp.arch.arithmetic)