• Title/Summary/Keyword: free block allocation policy

Search Result 4, Processing Time 0.02 seconds

A Real-time Dynamic Storage Allocation Algorithm Supporting Various Allocation Policies (다양한 할당 정책을 지원하는 실시간 동적 메모리 할당 알고리즘)

  • 정성무
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10B
    • /
    • pp.1648-1664
    • /
    • 2000
  • This paper proposes a real-time dynamic storage allocation algorithm QSHF(quick-segregated-half-fit) that provides various memory allocation policies. that manages a free block list per each word size for memory requests of small size good(segregated)-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per each power of 2 size for large size requests. The proposed algorithm has the time complexit O(1) and makes us able to easily estimate the worst case execution time(WCET). This paper also suggests two algorithm that finds the proper free list for the requested memory size in predictable time and if the found list is empty then finds next available non-empty free list in fixed time. In order to confirm efficiency of the proposed algorithm we simulated the memory utilization of each memory allocation policy. The simulation result showed that each policy guarantees the constant WCET regardless of memory size but they have trade-off between memory utilization and list management overhead.

  • PDF

A Dynamic Storage Allocation Algorithm with Predictable Execution Time (예측 가능한 실행 시간을 가진 동적 메모리 할당 알고리즘)

  • Jeong, Seong-Mu;Yu, Hae-Yeong;Sim, Jae-Hong;Kim, Ha-Jin;Choe, Gyeong-Hui;Jeong, Gi-Hyeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.2204-2218
    • /
    • 2000
  • This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

  • PDF

EPET-WL: Enhanced Prediction and Elapsed Time-based Wear Leveling Technique for NAND Flash Memory in Portable Devices

  • Kim, Sung Ho;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.5
    • /
    • pp.1-10
    • /
    • 2016
  • Magnetic disks have been used for decades in auxiliary storage devices of computer systems. In recent years, the use of NAND flash memory, which is called SSD, is increased as auxiliary storage devices. However, NAND flash memory, unlike traditional magnetic disks, necessarily performs the erase operation before the write operation in order to overwrite data and this leads to degrade the system lifetime and performance of overall NAND flash memory system. Moreover, NAND flash memory has the lower endurance, compared to traditional magnetic disks. To overcome this problem, this paper proposes EPET (Enhanced Prediction and Elapsed Time) wear leveling technique, which is especially efficient to portable devices. EPET wear leveling uses the advantage of PET (Prediction of Elapsed Time) wear leveling and solves long-term system failure time problem. Moreover, EPET wear leveling further improves space efficiency. In our experiments, EPET wear leveling prolonged the first bad time up to 328.9% and prolonged the system lifetime up to 305.9%, compared to other techniques.

Study on the Improvement of Korean Broadcasting Advertising System (방송광고 판매제도 개선방안 연구: 경쟁도입의 효과분석과 보완장치 모색을 중심으로)

  • Shin, Tae-Sub
    • Korean journal of communication and information
    • /
    • v.33
    • /
    • pp.169-191
    • /
    • 2006
  • Changing our monopoly broadcasting advertising system into free competition system may give rise to serious troubles that intensify commercialism of broadcasting and reduce diversity of public opinion. In the boundaries of public interest out of danger, korean broadcasting system should adopt a system that partially adopts the principle of free market. Broadcasting advertising sale system affect the whole broadcasting system because it functions as an effective capital-resource provider. Thus, it affects the broadcasting policies' righteousness and efficiency. Due to the non-elastic nature of the total advertising market, broadcasting advertising's size affects other media's capital allocation process. Therefore, broadcasting advertising sales system not only affects broadcast's social duty and public interest, but also affects the whole media industry. First, provide fair and open-competitive measures to support broadcast sales policy so that the market-based system can be run smoothly. Second, block any un-due influence from advertisers by separating production/programming and advertising sales. Third, sustain public broadcast system, not based on the advertising sales but based on the subscription fee. Fourth, social intervention of the advertising market. Fifth, provide policies that can set up multiple media channels/outlets and public opinion. By providing the minimum capital resources to the public broadcasting system, the broadcasting system can act on its public-interest duty and support the people's right-to-know rights.

  • PDF