lkml.org 
[lkml]   [2002]   [May]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: discontiguous memory platforms
    Hi,

    Daniel Phillips wrote:

    > > Most of the time there are only a few nodes, I just don't know where and
    > > how big they are, so I don't think a hash based approach will be a lot
    > > faster. When I'm going to change this, I'd rather try the dynamic table
    > > approach.
    >
    > Which dynamic table approach is that?

    I mean calculating the lookup table and patching the kernel at startup.
    Anyway, I agree with Andrea, that another mapping isn't really needed.
    Clever use of the mmu should give you almost the same result.

    bye, Roman
    -
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to majordomo@vger.kernel.org
    More majordomo info at http://vger.kernel.org/majordomo-info.html
    Please read the FAQ at http://www.tux.org/lkml/

    \
     
     \ /
      Last update: 2005-03-22 13:25    [W:3.712 / U:0.072 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site