• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.529-539
• /
• 2000

This paper proposes a prefetch-based disk buffer management algorithm, which we call W2R (Veighingjwaiting Room). Instead of using elaborate prefetching schemes to decide which blockto prefetch and when, we simply follow the LRU-OBL (One Block Lookahead) approach and prefetchthe logical next block along with the block that is being referenced. The basic difference is that theW2R algorithm logically partitions the buffer into two rooms, namely, the Weighing Room and theWaiting Room. The referenced, hence fetched block is placed in the Weighing Room, while theprefetched logical next block is placed in the Waiting Room. By so doing, we alleviate some inherentdeficiencies of blindly prefetching the logical next block of a referenced block. Specifically, a prefetchedblock that is never used may replace a possibly valuable block and a prefetched block, thoughreferenced in the future, may replace a block that is used earlier than itself. We show through tracedriven simulation that for the workloads and the environments considered the W2R algorithm improvesthe hit rate by a maximum of 23.19 percentage points compared to the 2Q algorithm and a maximumof 10,25 percentage feints compared to the LRU-OBL algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.7
• /
• pp.57-64
• /
• 2011

To adjust the difference of bandwidth between host interface and NAND flash memory, DRAM is adopted as the buffer management in SSD (Solid-state Disk). In this paper, we propose cost-effective techniques to enhance SSD performance instead of using expensive high bandwidth DRAM. The SSD data can be classified into three groups such as user data, meta data for handling user data, and FEC(Forward Error Correction) parity/ CRC(Cyclic Redundancy Check) for error control. In order to improve the performance by considering the features of each data, we devise a flexible burst control method through monitoring system and a page based FEC parity/CRC application. Experimental results show that proposed methods enhance the SSD performance up to 25.9% with a negligible 0.07% increase in chip size.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.71-80
• /
• 2004

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced buffer to the idle node on buffers replacement in order to maintain the replaced cache in the cache field. However the wrong approximate information deteriorates the performance, the consistency maintenance goes to great expense to exchange messages and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintenance cost for consistency and the management cost for buffer Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.79-85
• /
• 2008

The middleware that provides RFID-based ubiquitous application service should process the data inputted constantly in real time, and acquire and deliver the answers of the questions in the application service. Studies for developing a Data Stream Management System(DSMS) has been performed in order to process a large amount of data stream inputted constantly in this way. Previous algorithms on data stream were mostly focused on reducing the average error between the answers of the successive questions and abandon the data according to the priority of them when a load occurs. This article is composed of presenting the necessity of the studies on the DSMS and speedy data processing, suggesting an algorithm to make Possible the speedy data processing using buffers and prompt questions and answers, and testing the performance of the data processing rate and whether a buffer is generated correspondingly to the algorithm suggested, in either a single or a multiple buffer, through simulations.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.70-70
• /
• 2004

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.105-108
• /
• 1999

In this paper, we define the high-speed router as a router, which can support aggregated ports over 25Gbps, and provide issues and trends in high-speed router design. We propose design considerations on IP packet forwarding, switching fabric, packet scheduling and buffer management, network resource reservation, and router operation and administration.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.923-934
• /
• 2000

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.248-254
• /
• 2005

본 논문에서는 대화형 GEO 위성 네트워크에서 패킷 손실량 기대값의 총합을 최소화하는 최적 버퍼 및 타임슬롯 할당 체계를 제시한다. 이를 위해 각 단말에서의 패킷 손실량 기대값을 분석하고, 최적 버퍼 및 타임슬롯 할당 방법을 구하기 위한 최적화 모형을 정형화하고, 정형화된 모형을 빠른 시간 내에 해결할 수 있는 방법을 제시한다. 실험을 통해 제시한 방법이 기존 방법에 비해 패킷 손실량 기대값의 총합을 의미 있게 감소시킴을 보인다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.107-118
• /
• 1994

This research is concerned with production scheduling for a flexible manufacturing cell which consists of two machine centers with unlimited buffer space and a single automatic guided vehicle. The objective is to develop and evaluate heuristic scheduling procedures that minimize maximum completion time. A numerical example illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions than Johnson's. It also gets good solutions to minimize mean flowtime.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.517-521
• /
• 2000

현대의 생산환경에서 널리 사용되고 있는 생산시스템의 형태는 FMS(Flexible Manufacturing System, 유연생산 시스템)로, FMS 는 다품종 소량생산과 생산성 향상이라는 두 가지 목표에 가장 적합한 형태라고 할 수 있다. 하지만 FMS에는 시스템의 효율을 저하시키는 blocking, starving, deadlock 등이 존재하며 이들의 영향을 줄이고자 재공재고의 일시적 저장공간인 버퍼를 설치하게 된다. 시스템내의 제약으로 인해 버퍼의 총 용량은 제한적이므로, 효율적인 버퍼관리는 시스템 성능 향상을 가능하게 할 수 있다. 본 연구에서는 FMS의 각 Workstation의 작업량을 고려한 버퍼 할당을 통해 시스템 효율 향상을 추구하고, 시뮬레이션 과정을 통해 검증해 보고자 한다.