Lines Matching full:two
251 consider the case of two subsystems that need memory.
253 the amount of memory tied up in the two lists will be the
255 the two subsystems has ever used.
268 The fastest memory allocator in the survey by nearly a factor of two
276 that are ordered by increasing powers of two.
279 the size of the request is rounded up to the next power of two.
281 to the specified power of two and returned to the requester.
371 Small allocations are done using the 4.2BSD power-of-two list strategy;
391 Because of the inefficiency of power-of-two allocation strategies
393 a different strategy is used for allocations larger than two kilobytes.
394 The selection of two kilobytes is derived from our statistics on
406 observes that the power-of-two algorithm yields sizes of 1, 2, 4, 8, \&...
409 Thus for allocations of sizes between one and two pages
410 both algorithms use two pages;
411 it is not until allocations of sizes between two and three pages
412 that a difference emerges where the power-of-two algorithm will use
416 so two kilobytes is the smallest logical cutoff.
423 the power-of-two allocation strategy.
432 When a list for a power-of-two allocation is empty,
445 require a power-of-two-sized block.
456 memory whose size is exactly a power of two.
552 Making these tables dynamic will have two benefits.