NDLI: A lazy buddy system bounded by two coalescing delays

Please wait, while we are loading the content...

A logic of authentication

Reducing risks from poorly chosen keys

Simple but effective techniques for NUMA memory management

The implementation of a coherent memory abstraction on a NUMA multiprocessor: experiences with platinum

Spritely NFS: experiments with cache-consistency protocols

Exploiting read-mostly workloads in the FileNet file system

Improving the efficiency of UNIX buffer caches

Performance of Firefly RPC

RPC in the x-Kernel: evaluating new design techniques

Lightweight remote procedure call

The portable common runtime approach to interoperability

Generic virtual memory management for operating system kernels

Low-synchronization translation lookaside buffer consistency in large-scale shared-memory multiprocessors

The Amber system: parallel programming on a network of multiprocessors

Process control and scheduling issues for multiprogrammed shared-memory multiprocessors

A lazy buddy system bounded by two coalescing delays

Analysis of transaction management performance

Threads and input/output in the synthesis kernal

Leases: an efficient fault-tolerant mechanism for distributed file cache consistency

Mirage: a coherent distributed shared memory design

A lazy buddy system bounded by two coalescing delays

Content Provider	ACM Digital Library
Author	Lee, T. Barkley, R.
Abstract	The watermark-based lazy buddy system for dynamic memory management uses lazy coalescing rules controlled by watermark parameters to achieve low operational costs. The correctness of the watermark-based lazy buddy system is shown by defining a space of legal states called the lazy space and proving that the watermark-based lazy coalescing rules always keep the memory state within that space. In this paper we describe a different lazy coalescing policy, called the DELAY-2 algorithm, that focuses directly on keeping the memory state within the lazy space. The resulting implementation is simpler, and experimental data shows it to be up to 12% faster than the watermark-based buddy system and about 33% faster than the standard buddy system. Inexpensive operations make the DELAY-2 algorithm attractive as a memory manager for an operating system.The watermark-based lazy buddy policy offers fine control over the coalescing policy of the buddy system. However, applications such as the UNIX System kernel memory manager do not need such fine control. For these applications, the DELAY-2 buddy system provides an efficient memory manager with low operational costs and low request blocking probability. In the DELAY-2 buddy system, the worst-case time for a free operation is bounded by two coalescing delays per class, and when all blocks are returned to the system, the system memory is coalesced back to its original state. This ensures that the memory space can be completely shared.
Starting Page	167
Ending Page	176
Page Count	10
File Format	PDF
ISBN	0897913388
DOI	10.1145/74850.74867
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-11-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A lazy buddy system bounded by two coalescing delays

A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system

Internal Fragmentation in a Class of Buddy Systems

Variations on the binary buddy system for dynamic memory management

Hazard detection by a quinary simulation of logic devices with bounded propagation delays

Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs

An Enhanced 2D Buddy Strategy for Submesh Allocation in Mesh Networks

The world as it is improving the buddy system.

A Lazy Language Needs a Lazy Type System: Introducing Polymorphic Contexts

A lazy buddy system bounded by two coalescing delays

Similar Documents

A lazy buddy system bounded by two coalescing delays

A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system

Internal Fragmentation in a Class of Buddy Systems

Variations on the binary buddy system for dynamic memory management

Hazard detection by a quinary simulation of logic devices with bounded propagation delays

Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs

An Enhanced 2D Buddy Strategy for Submesh Allocation in Mesh Networks

The world as it is improving the buddy system.

A Lazy Language Needs a Lazy Type System: Introducing Polymorphic Contexts

A lazy buddy system bounded by two coalescing delays