[17557] in Kerberos_V5_Development
Re: KDC performance test - lookaside cache impact, testing framework
daemon@ATHENA.MIT.EDU (Tom Yu)
Thu Apr 5 18:13:33 2012
To: Greg Hudson <ghudson@mit.edu>
From: Tom Yu <tlyu@mit.edu>
Date: Thu, 05 Apr 2012 18:13:20 -0400
In-Reply-To: <4F7E1404.7000503@mit.edu> (Greg Hudson's message of "Thu,
05 Apr 2012 17:52:04 -0400")
Message-ID: <ldvpqblhlof.fsf@cathode-dark-space.mit.edu>
MIME-Version: 1.0
Cc: krbdev@mit.edu
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Errors-To: krbdev-bounces@mit.edu
Greg Hudson <ghudson@MIT.EDU> writes:
> However, the current lookaside cache is a linked list. If the KDC is
> loaded enough to take almost a full second to answer a request, there
> are likely to be hundreds or thousands of entries in the cache.
> Searching a linked list of that size will probably take longer than
> processing a request--and, of course, that cost is paid for every
> request, not just the retransmits.
>
> It would be a fairly simple matter to make a hash table for the
> lookaside cache, which should reduce its cost to much less than the cost
> of processing a request, making it potentially worthwhile.
A while ago, someone (Mark Eichin, maybe?) implemented an array-based
lookaside cache, which allegedly produced measurable speed
improvements compared to the linked list cache.
_______________________________________________
krbdev mailing list krbdev@mit.edu
https://mailman.mit.edu/mailman/listinfo/krbdev
