buddy algorithm is one of the classical algorithms for Linux Memory Management. In buddy algorithm, free memory blocks, even if they have the same size and consecutive address, they can't be combined into a larger...
详细信息
ISBN:
(纸本)9783037858882
buddy algorithm is one of the classical algorithms for Linux Memory Management. In buddy algorithm, free memory blocks, even if they have the same size and consecutive address, they can't be combined into a larger memory space because they don't have a partnership. For these shortcomings of the algorithm, this paper proposes an improved buddy algorithm which mainly include in the main data structure adding an array and a variable respectively to record the starting address and the number of two adjacent free memory blocks which are in the linked list of last order and do not meet the partnership, at the same time, improving memory allocation management and memory recovery *** experiment, when the memory space is insufficient and memory allocation request is frequent, the improved algorithm can effectively reduce the number of failed memory requests and improve the memory utilization.
We present a new buddy system for memory allocation that we call the lazy ibuddy system. This system is motivated by two observations of the widely used lazy buddy system on multi-core systems. First, most memory requ...
详细信息
We present a new buddy system for memory allocation that we call the lazy ibuddy system. This system is motivated by two observations of the widely used lazy buddy system on multi-core systems. First, most memory requests are for single page frames. However, the lazy buddy algorithm used in Linux continuously splits and coalesces memory blocks for single page frame requests even though the lazy layer is employed. Second, on multi-core systems, responses to bursty memory requests are delayed by lock contention caused by concurrent accesses of the multi-cores. The lazy ibuddy system overcomes the first problem by managing each page frame individually and coalescing pages only when an allocation of multiple page frames is requested. We devise the lazy ibuddy algorithm so that single page frame allocation can be done in O(1). The second problem is alleviated by dividing main memory into multiple buddy spaces and applying a fine-grained locking mechanism. Performance evaluation results based on various workloads on the XEON 16core with 32 GB main memory show that the lazy ibuddy system can improve memory allocation/deallocation time by up to 47 percent with an average of 35 percent compared with the lazy buddy system for the various configurations that we considered.
When nodes left Mobile Ad Hoc Networks(MANET)abruptly in buddy algorithm,address pool leak will *** solve this problem,this paper presents the Synchronous monitoring mechanism to optimize buddy,which can recover leake...
详细信息
When nodes left Mobile Ad Hoc Networks(MANET)abruptly in buddy algorithm,address pool leak will *** solve this problem,this paper presents the Synchronous monitoring mechanism to optimize buddy,which can recover leaked address pool by the methods of synchronous backup address pool and monitoring agent *** it prevents use flooding to recycle after losing a large number of address pools, and reduces the spending of ***2 simulation platform is used to simulate *** results show that the improved algorithm can recover leaked address pools,and reduce the impact of the number of nodes simultaneously and the cost of synchronous communication.
This paper expounds a predictable and adaptive management of the embedded system dynamic *** solution puts the survivable design in a memory static area and partitions in dynamic area *** puts those similar objects in...
详细信息
This paper expounds a predictable and adaptive management of the embedded system dynamic *** solution puts the survivable design in a memory static area and partitions in dynamic area *** puts those similar objects in the object pool subarea,and the other applicants are distributed in normal *** subareas adjust the size by transmitting *** normal subarea,the paper puts forward predictable mechanism for the first ***,by introducing a new data structure and combining classic buddy algorithm,it improves the adaptive algorithm of delay recovery with statistical data and applicant time *** the solution is confirmed more safely and efficiently by simulation experiments.
Modern embedded systems are increasingly likely to be distributed across multiple devices and platforms that must interact with high precision across wireless networks. Traditional ways of managing the wireless radio ...
详细信息
ISBN:
(纸本)9780769544397
Modern embedded systems are increasingly likely to be distributed across multiple devices and platforms that must interact with high precision across wireless networks. Traditional ways of managing the wireless radio spectrum suffer from two fundamental limitations, which the research presented in this paper addresses: (1) spectrum is divided a priori into static coarse-grained partitions without reference to details of particular applications;and (2) partitions are non-overlapping, which although beneficial to reduce interference prevents a much greater utilization of the spectrum through carefully allowing overlap of spectrum allocations. To overcome these limitations, we propose an approach to spectrum allocation based on dynamic allocation of diverse portions of the overall spectrum and overlapping allocations to increase utilization. This paper makes three main contributions to the state of the art in spectrum management for embedded systems: (1) it examines how memory management techniques such as Knuth's buddy algorithm can be applied to spectrum management, in the face of transmission failures that may arise from the physical environment;(2) it extends that approach to consider transmission failures resulting from interference, when overlapping regions of spectrum are allocated to increase utilization;and (3) it presents results of simulation experiments we conducted to evaluate those approaches, which demonstrate their efficacy and suggest future extensions based on them.
This paper studies the basic requirements of embedded operating system memory management and the key problems in memory management, via analyze the advantages and disadvantages of different memory management algorithm...
详细信息
ISBN:
(纸本)9780769535579
This paper studies the basic requirements of embedded operating system memory management and the key problems in memory management, via analyze the advantages and disadvantages of different memory management algorithm, according to the features of the embedded system such as the mount of the memory is few, and has no MMU, and has real-time requirements usually, Then proposed a method that can distribute and recycle the memory swiftly, and the operation time to the memory is certain, so It's able to meet the needs of embedded operating system's real-time performance requirements effectively, moreover use this approach to manage memory can avoid excessive memory fragments.
暂无评论