• Title/Summary/Keyword: Buffer management

Search Result 628, Processing Time 0.023 seconds

Assessment of Corrosion Lifetime of a Copper Disposal Canister Based on the Finnish Posiva Methodology

  • Choi, Heui-Joo;Lee, Jongyoul;Cho, Dongkeun
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.18 no.spc
    • /
    • pp.51-62
    • /
    • 2020
  • In this paper, an approach developed by the Finnish nuclear waste management organization, Posiva, for the construction license of a geological repository was reviewed. Furthermore, a computer program based on the approach was developed. By using the computer program, the lifetime of a copper disposal canister, which was a key engineered barrier of the geological repository, was predicted under the KAERI Underground Research Tunnel (KURT) geologic conditions. The computer program was developed considering the mass transport of corroding agents, such as oxygen and sulfide, through the buffer and backfill. Shortly after the closure of the repository, the corrosion depths of a copper canister due to oxygen in the pores of the buffer and backfill were calculated. Additionally, the long-term corrosion of a copper canister due to sulfide was analyzed in two cases: intact buffer and eroded buffer. Under various conditions of the engineered barrier, the corrosion lifetimes of the copper canister due to sulfide significantly exceeded one million years. Finally, this study shows that it is necessary to carefully characterize the transmissivity of rock and sulfide concentration during site characterization to accurately predict the canister lifetime.

An Efficient Algorithm for Restriction on Duplication Caching between Buffer and Disk Caches (버퍼와 디스크 캐시 사이의 중복 캐싱을 제한하는 효율적인 알고리즘)

  • Jung, Soo-Mok
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.10 no.1
    • /
    • pp.95-105
    • /
    • 2006
  • The speed of hard disk which is based on mechanical operation is more slow than processor. The growth of processor speed is rapid by semiconductor technology, but the growth of disk speed which is based on mechanical operation is not enough. Buffer cache in main memory and disk cache in disk controller have been used in computer system to solve the speed gap between processor and I/O subsystem. In this paper, an efficient buffer cache and disk cache management scheme was proposed to restrict duplicated disk block between buffer cache and disk cache. The performance of the proposed algorithm was evaluated by simulation.

  • PDF

A Garbage Collection Method for Flash Memory Based on Block-level Buffer Management Policy

  • Li, Liangbo;Shin, Song-Sun;Li, Yan;Baek, Sung-Ha;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.12
    • /
    • pp.1710-1717
    • /
    • 2009
  • Flash memory has become the most important storage media in mobile devices along with its attractive features such as low power consumption, small size, light weight, and shock resistance. However, a flash memory can not be written before erased because of its erase-before-write characteristic, which lead to some garbage collection when there is not enough space to use. In this paper, we propose a novel garbage collection scheme, called block-level buffer garbage collection. When it is need to do merge operation during garbage collection, the proposed scheme does not merge the data block and corresponding log block but also search the block-level buffer to find the corresponding block which will be written to flash memory in the next future, and then decide whether merge it in advance or not. Our experimental results show that the proposed technique improves the flash performance up to 4.6% by reducing the unnecessary block erase numbers and page copy numbers.

  • PDF

A study on constructing SCM for supporting real time manufacturing (실시간 제조를 지원하기 위한 SCM구축에 관한 연구)

  • 심상용;박재현;강경식
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.163-163
    • /
    • 2000
  • 오늘날 기업환경은 고객의 요구에 대응하여 적시에 효율적으로 상품과 서비스를 공급하고 전체비용의 대부분을 차지하는 물류와 재고비용을 줄여 기업의 이윤을 극대화하는 것으로 변화하고 있다. 예전에 기업위주의 시장형성에서 고객위주로 시장이 변화하고 있는 것이다. 이에 따라 기업은 고객의 요구에 능동적으로 대응하기 위하여 리드타임의 단축이 필수적인 요소가 되어가고 있다. 이러한 기업환경에 변화에 따른 대안으로 나온 것이 실시간 제조와 공급사슬망관리(Supply Chain Management : SCM)이다. 본 연구는 실시간 제조를 지원하기 위하여 제조업체와 협력사간의 물류에 있어 Goldratt의 Drunm-Buffer-Rope 스케줄링을 이용하여 물류창고라는 Buffer를 두어 협력사중 재고의 부족현상이 일어날 경우에는 공급체인상의 능력제약자원(Capacity Constraint Resource: CCR)을 찾아 능력제약자원이 되는 협력사에 대하여 생산을 독촉하고 물류창고에서는 부족재고에 대한 불출을 개시하여 재고의 완충을 도모하고자 한다. 제조업체와 협력사간의 정보를 실시간 감시시스템(Real-Time Monitoring System : RTMS)를 응용하여 웹상에서 공유하며, 실시간 거래가 가능토록하는 공급사슬망 구축에 관한 연구와 이를 프로그램 구현을 통해 실제적으로 시험해 보고자 한다.

  • PDF

A Method on building SCM between manufacturer and supplier (제조업체와 협력업체간 SCM구축에 관한 방법론)

  • 심상용;박재현;김봉진
    • Journal of the Korea Safety Management & Science
    • /
    • v.3 no.1
    • /
    • pp.35-44
    • /
    • 2001
  • Today's environment of enterprise is changing. They have to face customers' demands with the right product, the right service and supply them at the right time. And aIso cut down logistics and inventory cost and bring up the Profit as much as they can. This means the change of putting enterprise first in importance to putting customer first in importance. therefore to correspond to customer's demand, shorting lead time is becoming a essential condition. The answer to this changes of environment is supply chain management In this study, we use Goldratt's drum-buffer-rope scheduling in between manufacturer and supplier. And when shortage of inventory occur, search for the supply chain's CCR. Pressing CCR for more production, and supply Inventory from logistic center to guide for inventory buffing. using logistic warehouse between manufacturer and supplier, can execute function of buffer.

  • PDF

The QoS Adaptive AQM Algorithm and Performance Evaluation for Multimedia Service (멀티미디어 서비스를 위한 QoS 적응형 AQM 알고리즘 및 성능분석)

  • Kang, Hyun-Myoung;Rhee, Woo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6B
    • /
    • pp.605-614
    • /
    • 2009
  • Existing Internet services were almost supported by the best effort service such as the data transmission service and were allowed the transmission delay and packet loss. However, recent Internet multimedia services such as Internet phone, Internet broadcasting are required a real-time processing and high bandwidth. Therefore, many studies for providing Internet QoS are performed at IETF (Internet Engineering Task Force). As the buffer management mechanism among IP QoS methods, active queue management method such as RED (Random Early Detection) algorithm has proposed. However, RED algorithm has a limitation of usage of an average buffer length and unfairness. So, many algorithms proposed as the modified algorithm of RED. But these modified algorithms also have difficulties to satisfy the requirements of various Internet user QoS. Therefore, in this paper we propose the QoS adaptive AQM (Active Queue Management) algorithm for the multimedia services that request various QoS requirements and present a performance evaluation by the simulations using the ns-2.

PMIPv6 Global Handover Mechanism using Multicast Source Based Forwarding (멀티캐스트 소스기반 포워딩을 이용한 PMIPv6 글로벌 핸드오버 메커니즘)

  • Choi, Hoan-Suk;Lee, Jang-Hyun;Rhee, Woo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.745-759
    • /
    • 2011
  • In this paper, we propose the global handover mechanism that is able to provide the unlimited range of next-generation multimedia mobile services in an integrated environment. This mechanism consists of a multicast source based forwarding scheme and a global session management scheme. Global session management scheme provides LMA session information management, global mobility and route optimization. Multicast source based forwarding scheme delivers data between previously attached LMA and newly attached LMA without packet loss. In addition, this scheme removes the redundancy of buffered data. We present a performance evaluation and features analysis by the simulations using the ns-2. Global session management scheme has a less handover latency, propagation delay and signaling cost than the conventional methods. Multicast source based forwarding scheme can deliver buffer data without loss and it has less buffer size than conventional method.

Optimal Scheduling based on Probabilitic Estimation of Construction Duration (확률적 공기산정에 의한 공정 합리화 방안)

  • Kim Sang-Joong;Lee Jae-Soeb
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.383-387
    • /
    • 2003
  • Construction project has many problem such as delay of the appointed date delivery, over budget, wether and site conditions. When several activities are influenced by the same factor, their duration may be delayed. This paper deals with the problem of construction duration estimating and schedule variation on the construction project. The theory of constraints technique for project management is referred to 'Critical Chain' technique. This paper shows optimal scheduling plan and time management technique, used probability construction duration estimating and scheduling buffer based on the critical chain project management.

  • PDF

Estimating the Optimal Buffer Size on Mobile Devices for Increasing the Quality of Video Streaming Services (동영상 재생 품질 향상을 위한 최적 버퍼 수준 결정)

  • Park, Hyun Min
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.3
    • /
    • pp.34-40
    • /
    • 2018
  • In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

An Efficient Load Balancing Technique in Cluster Based VOD Servers using the Dynamic Buffer Partitioning (동적 버퍼 분할을 이용한 클러스터 VOD 서버의 효율적 부하 분산 방법)

  • Kwon, Chun-Ja;Kim, Young-Jin;Choi, Hwang-Kyu
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.709-718
    • /
    • 2002
  • Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.