• Journal of Korean Society for Quality Management
• /
• v.20 no.2
• /
• pp.118-128
• /
• 1992

The determination of appropriate buffer capacity is an important issue in the design of the advanced manufacturing systems and closely related to the system efficiency and flexibility. Work-in-process is usually not desirable. However, in reality, maintaining some capacity of buffer storage is inevitable in compensation for the machine blocking and break down. The objective of this paper is to present analytical methods and tools for the buffer capacity planning in the Flexible Manufacturing System Environments. The effects when machine blocking is critical factor are also discussed.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.212-214
• /
• 2004

Hardware implemented ring buffer systems and methods are presented for the effective management of the ring buffer in TCP/IP communication. The layer interface of the ring buffer systems transfer free buffer and used buffer size information to the TCP/IP stack upper or low layer. The pointer updation interface calculates a temporary pointer from the data size which is needed by the present pointer of the ring buffer and upper or lowyer layer. The pointer manager of the ring buffer systems is responsible for saving the present pointer of the ring buffer, updating the ring buffer pointer to the new pointer, calculating the free buffer size and used buffer size of the ring buffer, and transferring the information to the upper layer. The ring buffer systems help the TCP/IP layer and TCP/IP upper or lower layer to decide the sending or receiving data size effectively. The delay of transferring data can be lowered by the ring buffer system.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.12
• /
• pp.377-384
• /
• 2020

Banking is very regulated by the government and even has to follow regulations issued by the Basel Committee on Banking Supervision, which regulates banking in the world. According to Basel III, banks must provide capital reserves called capital buffers. The purpose of this study is to examine the factors that determine capital buffer. Factors thought to affect the capital buffer studied consisted of profitability (ROA), credit risk (NPL), liquidity risk (LDR), capital adequacy in the previous period (CARt-1), management risk (NIM), and ratio of operating risk (OER). The population in this study is conventional banks listed on the Indonesia Stock Exchange, as many as 42 banks, with a sample of 40 banks taken by purposive sampling method with an observation period of four years with quarterly data (2016-2019). To test the hypotheses, regression panel data is used. After being tested, it turns out that the fixed effect model is better than the common effect and random effect. The results of the study with fixed effect models show that ROA, NPL, and OER significantly and negatively affect capital buffer. CAR_t-1 has a positive and significant effect on capital buffer, while LDR and NIM do not affect capital buffer.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.327-335
• /
• 2016

In this paper, we propose a buffer management scheme suitable for interactive multimedia services. We consider a typical delay optimization environment so that receiver buffer lengths vary according to the round trip time estimation. In this environment, we propose an optimization technique for minimizing the loss of information that may occur when a reduced buffer length forces I/P/B frames in the buffer to drop. We modeled our problem as a Knapsack Problem for which we used dynamic programing in order to find an approximate solution. The proposed technique is compared with the existing buffer management techniques. Through simulation studies, we found that our approach could increase PSNR, which is important to video quality.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.257-260
• /
• 2001

Buffers, on which much research is being done, are being used as a means to alleviate impacts in processes. Impacts occur from variation which is caused by uncertainty. Current buffers just accept variation as it comes and have just been used as a means to reduce impact. The purpose of this research try to understand the assorted variations which arise from limited resources and information and then we present a division of buffers as the way to overcome these variations. Through the process of dividing buffers into screening buffers, pulling buffers, shielding buffers, and working buffers, we try to make the process more compact, eliminate unnecessary reduction, speed up the decision making process by excluding excessive information, and improve the reliability of work.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.815-817
• /
• 2000

근래 Web Server의 안정된 운용의 중요성이 급증하는 Network Traffic과 더불어 점차 증대되고 있다. 기본적인 Network 구성망은 Ethernet으로 표준적인 프로토콜은 TCP/IP로 기반을 잡고 있다. 날로 증가하는 Network Traffic을 효과적으로 처리하기 위해서는 Network의 bandwidth 및 서버가 처리할 수 있는 데이터 양을 분석하여 병목현상을 줄이고 데이터의 흐름을 원활히 하기 위한 데이터 buffer들의 설치와 적절한 운영 방법에 관한 연구가 필요하다. 본 논문에서는 Web Server로부터 image 데이터를 전송 받아 이를 원활히 display하기 위한 Application Layer에서의 buffer 크기 및 제어방법에 관한 연구를 수행하고 특히 연속적인 이미지의 전송과 재생에 관한 buffer management에 관하여 고찰한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.314-314
• /
• 1996

We investigate the scheduling problem for periodic job shops with blocking. We develop Petri net models for periodic job shops with finite buffers. A buffer control method would allow the jobs to enter the input buffer of the next machine in the order for which they are completed. We discuss difficulties in using such a random order buffer control method and random access buffers. We thus propose an alternative buffer control policy that restricts the jobs to enter the input buffer of the next machine in a predetermined order. The buffer control method simplifies job flows and control systems. Further, it requires only a cost-effective simple sequential buffer. We show that the periodic scheduling model with finite buffers using the buffer control policy can be transformed into an equivalent periodic scheduling model with no buffer, which is modeled as a timed marked graph. We characterize the structural properties for deadlock detection. Finally, we develop a mixed integer programming model for the no buffer problem that finds a deadlock-free optimal sequence that minimizes the cycle time.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.3
• /
• pp.386-392
• /
• 2002

Internet telephony is an application that transmits voice data for conversation. Therefore it must provide high sound quality. However while audio packets are transferred through the network, they are affected by delay variations and jitters, which could result in poor sound quality of the receiving end does not have an appropriate jitter buffer to overcome network factors. This thesis introduces a buffer management algorithm that could be used to provide better sound quality for Internet phone terminals. This algorithm actively responds to both the compression algorithms that are used by the terminals, as well as to the received data to provide an improvement in sound quality. In order to verify the effectiveness of the proposed algorithm, we experimented in variance network settings. The results show that the proposed algorithm improves on the performance of the conventional buffer management algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.155-160
• /
• 2018

In this paper, we found that buffer cache in general systems does not perform well in rendering software, and presented a new buffer cache management scheme that resolves this problem. To do so, we collected various file I/O traces of rending software and analyzed their characteristics. From this analysis, we observed that file I/Os in rendering consist of long loops, short loops, random accesses, and write-once accesses. Based on this observation, we presented a buffer cache management scheme that allocates cache space to each access types and manages them appropriately, thereby improving the buffer cache performances by 19% on average and up to 55%.