• Title/Summary/Keyword: Buddy System

Search Result 14, Processing Time 0.037 seconds

An Extended-Weighted Buddy System for an Object-Oriented Computer (객체지향 컴퓨터를 위한 확장-가중치 버디 시스템)

  • Kim, Kwan-Joong;Kim, Byung-Gi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1625-1635
    • /
    • 1997
  • An extension of the weighted buddy system, called the extended-weighted buddy system, for dynamic memory allocation in an object-oriented computer is presented. The extended-weighted buddy system allows block sizes of $2^k,\;3*2^k,\;5*2^k,\;7*2^k$, whereas the original weighted buddy system allowed block sizes of $2^k\;and\;3*2^k$. This extension is achieved at only the cost of additional 3 bits per block for memory management unit. Simulation results are presented which compare our method with the weighted buddy system. These results indicate that, for uniform request distributions, our system has less internal memory fragmentation than the weighted buddy system(approximately 60%). And, for exponential request distributions, it has less internal memory fragmentation than the weighted buddy method (approximately 50%). The external fragmentation is greater for this system than the weighted buddy system. But, our system has less total memory fragmentation for exponential request distributions, and two systems take a similar total memory fragmentation for uniform request distributions, so we can substitutes the extended-weighted buddy system for weighted buddy system.

  • PDF

Quick Semi-Buddy Scheme for Dynamic Storage Allocation in Real-Time Systems (실시간 시스템에서의 동적 스토리지 할당을 위한 빠른 수정 이진 버디 기법)

  • 이영재;추현승;윤희용
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.3
    • /
    • pp.23-34
    • /
    • 2002
  • Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

  • PDF

The Architectural Analysis of the Buddy System for Qualitative Risk Analysis (정성적 위험 분석을 위한 버디 시스템의 구조 분석)

  • Jeongwon Yoon;Kim, Hong-Keun
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1995.11a
    • /
    • pp.51-58
    • /
    • 1995
  • The importance of the risk analysis tool has been recognized and its use also has been emphasized by a number of researchers recently The methodology were examined but neither algorithms nor practical applications have been implemented or practiced in Korea. In this paper, the architecture of the Buddy System, one of the automated risk assessment tools. is analyzed in depth to provide the algorithmic understanding and to promote the development of the risk analysis methodology. The Buddy System mainly uses three main factors of vulnerability, threat and countermeasures as a nucleus of the qualatative analysis with the modified loss expectancy value. These factors are identified and assessed by the separation of duties between the end user and security analyst. The Buddy System uses five axioms as its bases of assessment algorithm and the assessed vulnerability level is strictly within these axioms. Since the In-place countermeasures reduce the vulnerability level up to a certain level. the security analyst may use "what if " model to examine the impact of additional countermeasures by proposing each to reduce the vulnerability level further to within the acceptable range. The emphasis on the qualitative approach on vulnerability leveling is very well balanced with the quantitative analysis that the system performance is prominent.prominent.

  • PDF

A Study of Web Forensics Algorithm that used Log History Analysis (로그 히스토리 분석을 사용한 웹 포렌식 알고리즘 연구)

  • Jeung, Jeung-Ki;Park, Dea-Woo
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.245-254
    • /
    • 2006
  • Web Forensics algorithm used to an extraction of technical Web Forensics data to be adopted to proof data regarding a crime cyber a computer at data of a great number of log History is an essential element. Propose Web Forensics algorithm, and design at these papers, and try to implement in a Web server system of an actual company. And make the Web dispatch Loging system configuration experiment that applied integrity regarding Web log History information or authentication regarding an information source. Design Web Forensics algorithm and the Flow which used for Web log History analyses at server of e-mail, webmail, HTTP (Web BBS, Blog etc.), FTP, Telnet and messengers (MSN, NateOn, Yahoo, DaumTouch. BuddyBuddy, MsLee, AOL, SoftMe) of a company, and implement through coding. Therefore have a purpose of these paper to will contribute in scientific technical development regarding a crime cyber a computer through Web Forensics.

  • PDF

A Study of Web Forensics Algorithm that used Log History Analysis (로그 히스토리 분석을 사용한 웹 포렌식 알고리즘 연구)

  • Jeung, Jeung-Ki;Park, Dea-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.117-126
    • /
    • 2007
  • Web Forensics algorithm used to an extraction of technical Web Forensics data to be adopted to proof data regarding a crime cyber a computer at data of a great number of log History is an essential element. Propose Web Forensics algorithm, and design at these papers, and try to implement in a Web server system of an actual company. And make the Web dispatch Loging system configuration experiment that applied integrity regarding Web log History information or authentication regarding an information source. Design Web Forensics algorithm and the Flow which used for Web log History analyses at server of e-mail, webmail, HTTP (Web BBs. Blog etc.), FTP, Telnet and messengers (MSN, NateOn, Yahoo, DaumTouch, BuddyBuddy, MsLee, AOL, SoftMe) of a company, and implement through coding. Therefore have a purpose of these Paper to will contribute in scientific technical development regarding a crime cyber a computer through Web Forensics.

  • PDF

Efficient Dynamic Storage Allocation Algorithm for Linux Real-time System (리눅스 실시간 시스템에서의 효율적인 동적 스토리지 할당 알고리즘)

  • Lee, Young-Jae;Choo, Hyun-Seung;Youn, Hee-Yong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.04a
    • /
    • pp.671-674
    • /
    • 2002
  • 동적 메모리 할당 방식은 사전에 그 메모리의 크기를 결정할 수 없는 경우에 효과적인 프로그래밍 기술이다. 하지만 메모리 조각화 문제와 최악의 경우 실행 시간을 예측할 수 없는 단점 때문에 실시간 시스템에는 거의 적용되지 않고 있다. 본 연구에서는 리눅스 기반의 실시간 시스템을 위한 동적 메모리 할당 알고리즘인 QB(Ouick-Buddy)를 제안한다 제안된 알고리즘은 작은 크기의 메모리 요구에 대해서 워드 크기별로 프리 리스트를 관리하고, 큰 크기의 메모리 요구에 대해서는 이진 버디 시스템을 이용하여 관리한다. 이 알고리즘에서는 작은 크기의 메모리 요구에 대해 완전-적합(exist-fit) 전략을 사용하여 메모리 이용 효율을 증가시킨다. 또한 큰 크기의 메모리 요구에 대해서 버디 시스템을 적용함으로써 외부 조각화를 제거시키고 처리량(throughput)을 증가시킨다. 제안된 알고리즘의 성능을 확인하기 위해서 제안된 알고리즘과 이진 버디 시스템(binary buddy system), 빠른-적합(quick-fit)의 메모리 이용 효율성 및 메모리 조각화 율을 비교할 것이다.

  • PDF

Method to Extract Communication History in Instant Messenger (인터넷 메신저의 통신내역 수집기술)

  • Lee, Jin-Kyung;Han, Ji-Sung;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.2
    • /
    • pp.49-60
    • /
    • 2011
  • Instant Messenger is one of the most popular communication service when translating message or data each other through Internet. For digital crime investigation, therefore, it is obviously important to obtain communication trace and contents derived from Instant Messenger. This is because that gathering traditional communication histories also have been important until now. However, extracting communication trace and contents are not easy because they are generally encrypted or obfuscated in local system, futhermore, sometimes they are located at server computer for Instant Messenger. This paper researches on extracting communication histories against NateOn, BuddyBuddy, Yahoo! messenger and Mi3 messenger, and obtaining user password or bypassing authentication system to Instant Messenger Service when a user use auto-login option.

A Unified Software Architecture for Storage Class Random Access Memory (스토리지 클래스 램을 위한 통합 소프트웨어 구조)

  • Baek, Seung-Jae;Choi, Jong-Moo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.3
    • /
    • pp.171-180
    • /
    • 2009
  • Slowly, but surely, we are seeing the emergence of a variety of embedded systems that are employing Storage Class RAM (SCRAM) such as FeRAM, MRAM and PRAM, SCRAM not only has DRAM-characteristic, that is, random byte-unit access capability, but also Disk-characteristic, that is, non-volatility. In this paper, we propose a new software architecture that allows SCRAM to be used both for main memory and for secondary storage simultaneously- The proposed software architecture has two core modules, one is a SCRAM driver and the other is a SCRAM manager. The SCRAM driver takes care of SCRAM directly and exports low level interfaces required for upper layer software modules including traditional file systems, buddy systems and our SCRAM manager. The SCRAM manager treats file objects and memory objects as a single object and deals with them in a unified way so that they can be interchanged without copy overheads. Experiments conducted on real embedded board with FeRAM have shown that the SCRAM driver indeed supports both the traditional F AT file system and buddy system seamlessly. The results also have revealed that the SCRAM manager makes effective use of both characteristics of SCRAM and performs an order of magnitude better than the traditional file system and buddy system.

Design and Implementation of Buddy System for Real-Time Operating system, CNU_RTOS (실시간 운영체제 CNU_RTOS에서 버디 시스템 메모리 기법 설계 및 구현)

  • Jeong, Seong-Hoon;Kwon, Jae-Guk;Lee, Cheol-Hoon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.01a
    • /
    • pp.33-36
    • /
    • 2012
  • 디지털 컨버젼스 시대가 도래하면서 자원이 제한된 소형기기들의 사용이 비약적으로 증가하는 추세이다. 실시간 운영체제가 탑재되는 임베디드 시스템은 특성상 제한된 메모리를 가지기 때문에 제한된 메모리를 효율적으로 사용할 수 있는 기법이 적용되어야 한다. 이러한 제한된 메모리 관리를 효율적으로 사용하도록 기존의 CNU_RTOS에서는 실시간 운영체제의 메모리 관리 기법인 메모리 풀(Pool)과 힙(Heap) 알고리즘을 사용하였다. 시간 결정성을 보장하기 위해 힙을 할당하는 방법으로 first fit 알고리즘을 사용하였지만 외부 단편화로 인한 메모리 낭비를 감수하게 되었다. 본 논문에서는 힙 스토리지 매니저에서 발생하는 외부 단편화를 최소화하기 위해 버디 시스템을 이용한 메모리 관리 기법을 설계 및 구현하였다.

  • PDF