• Journal of Digital Contents Society
• /
• v.5 no.3
• /
• pp.176-179
• /
• 2004

Superquadrics can represent various and complex 3D object with only wome parameters(size, position, deformation etc). So if we use both superquadrics and deformed superquadrics, we can reoresent more realistic 3D object which are existed in real world. In this paper we use the Z-buffer algorithm and stencil buffer together because this is very useful when the wuperquadric primitives are combined. The fundamental ideas are illustrated with a number of tables and figures.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.1088-1091
• /
• 2000

Superquadrics can represent various and complex 3D objects with only some parameters(size, position, deformation etc.). So if we use both superquadrics and deformed superquadrics, we can also represent more realistic 3D objects which are existed in real world. In this paper we use the z-buffer algorithm and stencil buffer together because this is very useful when the superquadric primitives are combined. The fundamental ideas are illustrated with a number of tables and figures.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.24-27
• /
• 2019

Meltdown, Spectre 등 하드웨어의 취약점을 이용하는 side-channel 공격이 주목을 받으면서 주요 microarchitecture 구조에 대한 철저한 이해의 필요성이 커지고 있다. 현대 마이크로프로세서에서 branch prediction이 갖는 중요성에도 불구하고 세부적인 사항은 거의 알려지지 않았으며 잠재적 공격에 대비하기 위해서는 반드시 현재 드러난 정보 이상의 detail을 탐구하기 위한 시도가 필요하다. 본 연구에서는 Performance Monitor Counter를 이용해 branch 명령어를 포함한 프로그램이 실행되는 동안 Branch Prediction Unit에 의한 misprediction 이벤트가 발생하는 횟수를 체크하여 인텔 하스웰, 스카이레이크에서 사용되는 branch target buffer의 구조를 파악하기 위한 실험을 수행하였다. 연구를 통해 해당 프로세서의 BTB의 size, number of way를 추정할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.30-39
• /
• 1999

In this paper, the size of IWU frame cell buffer is analyzed that receives FR frame cells from other FR networks through ATM backbone network. The frame cell buffer receives multiplexed ATM cells from other IWUs that provide interworking with ATM network for other FR networks A receiving IWU reassembles frames from multiplexed ATM cells by identifying the VPI/VCIs. The reassembled frames are transmitted on FR network links according to their destination. Therefore, IWU needs sufficient amount of buffers for the assembly of the frames and for providing the assembled frames with the queue to wait until the frame is transmitted by FR network link. In this paper, the probability of frame loss at the frame cell buffer is derived in terms of traffic parameters, the number of multiplexed FR connections, the number of FR links and the transmission capacity. By applying the derived results, we analyzed the required buffer size for a given probability of frame loss. Also, it is presented that how the probability and the required size are effected by the number of multiplexed FR connections and FR transmission links.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.974-981
• /
• 2014

These days, use of multimedia streaming service and demand of QoS (Quality of Service) improvement have been increased because of development of network. QoS of streaming service is influenced by a jitter, delay, throughput, and loss rate. For guaranteeing these factors which are influencing QoS, the role of transport layer is very important. But existing TCP which is a typical transport layer protocol increases the size of congestion window slowly and decreases the size of a congestion window drastically. These TCP characteristic have a problem which cannot guarantee the QoS of UHD multimedia streaming service. In this paper, we propose a router buffer based congestion control method for improving the QoS of UHD streaming services. Our proposed scheme applies congestion window growth rate differentially according to a degree of congestion for preventing an excess of available bandwidth and maintaining a high bandwidth occupied. Also, our proposed scheme can control the size of congestion window according to a change of delay. After comparing with other congestion control protocols in the jitter, throughput, and loss rate, we found that our proposed scheme can offer a service which is suitable for the UDH streaming service.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.65-68
• /
• 2003

3GPP's RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In 3GPP ARQ, distinctive windows are provide at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at reordering buffer, which results in a long reordering time. Aiming at suppressing the occupancy at reordering buffer, we propose a occupancy control scheme in this paper. In this scheme, a threshold is created in the receiving station's window and a data PDU out of the threshold (but within the window) is treated according to go back N ARQ. By the employment of the occupancy control scheme, the occupancy at the reordering buffer is apparently reduced, while the delay performance may be degraded due to the properties of go back N ARQ. We, thus, investigate the peak occupancy and mean delay performance by a simulation method. From numerical examples, we observe a trade-off in both performance measures and conclude that the peak occupancy is effectively reduced by setting a proper threshold under a constraint on mean delay performance.

• Journal of Power System Engineering
• /
• v.11 no.4
• /
• pp.38-43
• /
• 2007

Pulsation is an inherent phenomenon in reciprocating compressors. It interacts with piping to cause vibrations and performance problems. Indiscriminately connecting to a compressor can be dangerous and cost money in the form of broken equipment and piping, poor performance, inaccurate metering, unwanted vibration, and sometimes noise. Piping connected to a compressor can materially affect the performance and response. To minimize these detrimental effects, reciprocating compressor system should be equipped by pulsation suppression system. The system usually comprises bottle volume, called snubber. Snubber is one of the most important parts in hydrogen compressing system. It has installed reciprocating hydrogen compressor. One of these components is snubber which has function to reduce pulsation waveform and to remove the impurities in the hydrogen gas. A snubber has an inclined plate as a buffer, which is installed inside snubber. When the pressure loss and the pulsation of pressure within a snubber is minimized, the snubber could get more applicability. Therefore, a study to find an optimum geometric size on a several snubbers which have different buffer width, has been conducted using a numerical analysis.

• Mass Spectrometry Letters
• /
• v.6 no.4
• /
• pp.112-115
• /
• 2015

In this article, we examine the influences of Ne and He buffer gases under confined Ar⁺ ion cloud in a homemade Paul ion trap in various pressures and confinement times. The trap is of small size (r₀ = 1 cm) operating in a radio frequency (rf) voltage only mode, and has limited accuracy of 13 V. The electron impact and ionization process take place inside the trap and a Faraday cup has been used for the detection. Although the experimental results show that the Ar⁺ ion FWHM with Ne buffer gas is wider than the He buffer gas at the same pressure (1×10^-1 mbar) and confinement time is about 1000 μs, nevertheless, a faster cooling was found with He buffer gas with 500 μs. ultimetly, the obtanied results performed an average cloud tempertures reduced from 1777 K to 448.3 K for Ne (1000 μs) and from 1787.9 K to 469.4 K for He (500 μs)

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.5
• /
• pp.285-291
• /
• 2010

Flash memory has many good features such as small size, shock-resistance, and low power consumption, but the cost of flash memory is still high to substitute for hard disk entirely. Recently, some mobile devices, such as laptops, attempt to use both flash memory and hard disk together for taking advantages of merits of them. However, existing OSs (Operating Systems) are not optimized to use the heterogeneous storage media. This paper presents a new buffer cache management scheme. First, we allocate buffer cache space according to access patterns of block references and the characteristics of storage media. Second, we prefetch data blocks selectively according to the location of them and access patterns of them. Third, we moves destaged data from buffer cache to hard disk or flash memory considering the access patterns of block references. Trace-driven simulation shows that the proposed schemes enhance the buffer cache hit ratio by up to 29.9% and reduce the total I/O elapsed time by up to 49.5%.