Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!cbatt!cbosgd!ulysses!ucbvax!HARVARD.HARVARD.EDU!sasaki
From: sasaki@HARVARD.HARVARD.EDU.UUCP
Newsgroups: mod.computers.vax
Subject: Sizes of look-aside lists
Message-ID: <8702100443.AA01125@ucbvax.Berkeley.EDU>
Date: Sun, 8-Feb-87 13:50:09 EST
Article-I.D.: ucbvax.8702100443.AA01125
Posted: Sun Feb  8 13:50:09 1987
Date-Received: Wed, 11-Feb-87 07:30:23 EST
References: <870203045308.602434@HI-MULTICS.ARPA>
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 10
Approved: info-vax@sri-kl.arpa

Pool fragmentation can be a problem with buffered i/o operations. If
the pool is fragmented and you need to allocate a page, then you have
to search longer to find that page. Usually the allocation comes out
of the lookaside lists, but if the pre-allocated list is used up, the
generic pool searching is done.
----------------
  Marty Sasaki				uucp:   harvard!sasaki
  Ziff Davis Technical Information Co.	arpa:	sasaki@harvard.harvard.edu
  80 Blanchard Road			bitnet: sasaki@harvunxh
  Burlington, MA 01803			phone:	617-273-5500