In <[email protected]>, on 11/12/2013
at 10:34 PM, Kenneth Wilkerson <[email protected]> said:
>Actually, the algorithm performs well for read-often, write-rarely
>list because the active chain count does not change and therefore
>there are relatively infrequent re-drives.
What happens if the is an intervening add and also an intervening
remove, leaving no net change in the active chain count even though
the chain itself has changed?
--
Shmuel (Seymour J.) Metz, SysProg and JOAT
ISO position; see <http://patriot.net/~shmuel/resume/brief.html>
We don't care. We don't have to care, we're Congress.
(S877: The Shut up and Eat Your spam act of 2003)
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
