• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.327-330
• /
• 2008

It is required that a server which communicates with various client simultaneously should have an efficient data transfer model. In Windows$^{(R)}$ environment, the server was generally developed based on IOCP model. Developing the IOCP model, the server generally has one data transfer buffer per client. If the server divides a larger data than the transfer buffer into several fragments, there used to be a problem in sending it to a client, because there is a conflict in a data transfer buffer. That is, CPU requests one data-fragment transfer, then it will request the next data-fragment transfer successively before completing the previous request, owing to the property of overlapped IO model. In this paper, we proposed the transfer buffer sharing technique to solve the conflicting problem. The experimental result shows that the performance of data transfer was enhanced by 39% maximally.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.4
• /
• pp.209-218
• /
• 2016

This paper proposes a new lifetime aware buffer mapping method of a synchronous dataflow (SDF) graph on a hybrid memory system with DRAM and PRAM. Since the number of write operations on PRAM is limited, the number of written samples on PRAM is minimized to maximize the lifetime of PRAM. We improve the utilization of DRAM by mapping more buffers on DRAM through buffer sharing. The problem is formulated formally and solved by an optimal approach of an answer set programming. In experiment, the buffer mapping method with buffer sharing improves the PRAM lifetime by 63%.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.404-410
• /
• 1999

A scheme of more exact overflow probability analysis is proposed for traffic regulated by dual leaky bucket. To each regulated traffic stream is allocated bandwidth and buffer independent of other traffic stream and overflow occurs when total bandwidth or buffer allocated to each traffic exceed link capacity or physical buffer size. Ratio of buffer and bandwidth allocated to each traffic stream is assumed to be constant, and this ratio is larger than the ratio of physical buffer and bandwidth due to buffer sharing effect. Numerical experiments show that this sharing effect have significant influence on overflow probability and effective bandwidth.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.2
• /
• pp.60-69
• /
• 2010

Lookup-Table (LUT) based fuzzy controller for obstacle avoidance enhances operations faster in multiple obstacles environment. An LUT based fuzzy controller with Positive/Negative (P/N) fuzzy rule base consisting of 18 rules was introduced in our paper$^1$ and this paper shows a 50-rule P/N fuzzy controller for enhancing performance in obstacle avoidance. As a rule, the more rules are necessary, the more buffers are required. This paper suggests LUT sharing method in order to reduce LUT buffer size without significant degradation of performance. The LUT sharing method makes buffer size independent of the whole fuzzy system's complexity. Simulation using MSRDS(MicroSoft Robotics Developer Studio) evaluates the proposed method, and in order to investigate its performance, experiments are carried out to Pioneer P3-DX in the LabVIEW environment. The simulation and experiments show little difference between the fully valued LUT-based method and the LUT sharing method in operation times. On the other hand, LUT sharing method reduced its buffer size by about 95% of full valued LUT-based design.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3175-3184
• /
• 1997

To support large storage capacity and real-time characteristics of continuous media storage systems, we need to improve the performance of disk I/O subsystems. To improve the performance, we exploited buffer sharing scheme that reduces the number of disk I/Os. We utilized the advance knowledge of continuous media streams that is used to anticipate data demands, and so Promoting the sharing of blocks in buffers. In this paper, we proposed a buffer replacement algorithm that enables subsequent users requesting the same data to share buffer efficiently. The proposed algorithm manages buffers by utilizing reference interval information of blocks. In order to verify validity of the proposed algorithm, we accomplished simulation experiments and showed the results of performance improvements compared to traditional buffer replacement algorithms.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.561-566
• /
• 2000

Computer-Communication System may be classified into two kinds of systems considering connection capability among terminal and computing facility : time sharing and distributed computer systems According to the different input characteristic, the buffer behavior of two systems is quite different. Here we restrict our study to the analysis of queueing behavior of a demultiplexing buffer of time sharing systems. The analysis shows that M/G/1 queueing model can be used model such behavior.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.119-129
• /
• 2019

Although line production systems with finite buffers have been studied over several decades, except for some special cases there are no explicit expressions for system performances such as waiting times(or response time) and blocking probability. Recently, a max-plus algebraic approach for buffer-sharing systems with constant processing times was introduced and it can lead to analytic expressions for (higher) moment and tail probability of stationary waiting. Theoretically this approach can be applied to general processing times, but it cannot give a proper way for computing performance measures. To this end, in this study we developed simulation models using @RISK software and the expressions derived from max-plus algebra, and computed and compared blocking probability, waiting time (or response time) with respect to two blocking policies: communication(BBS: Blocking Before Service) and production(BAS: Blocking After Service). Moreover, an optimization problem which determines the minimum shared-buffer capacity satisfying a predetermined QoS(quality of service) is also considered.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.513-513
• /
• 1994

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.56-65
• /
• 1994

As a method to control the congestion, priority mechanism which gives two-level priority to various traffics using CLP bit in cell haeder is carried in ATM network. In this paper, we proposed PBS(partial buffer sharing) mechanism with two threshold for provide three-level priority using CLP bit and Res. bit. By performance analysis proposed mechanism, we knew that provides flexibility to satisfy requirements of various quality of service, compare to existing mechanism with two-level priority.