• Title/Summary/Keyword: Buffer

Search Result 6,283, Processing Time 0.037 seconds

A Study on the Loss Probability and Dimensioning of Multi-Stage Fiber Delay Line Buffer (다단 광 지연 버퍼의 손실률과 크기에 관한 연구)

  • 김홍경;이성창
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.95-102
    • /
    • 2003
  • The buffering is a promising solution to resolve the contention problem in optical network. we study the packet loss probability and the dimensioning of optical buffer using a Fiber Delay Line for variable length packet. In this paper, we study the relation between the granularity and the loss of FDL buffer in Single-Stage FDL buffer and propose the Single-Bundle Multi-Stage FDL buffer. The Multi-Stage FDL buffer is too early yet to apply to the current backbone network, considering the current technology in view of costs. but we assume that the above restriction will be resolved in these days. The appropriate number of delay and pass line for a dimensioning is based on a amount of occupied time by packets. Once more another multi-stage FDL buffer is proposed, Split-Bundle multi-stage FDL buffer. The Split-Bundle ms-FDL buffer is more feasible for a FDL buffer structure, considering not only a size of switching matrix but also a bulk of switching element. its feasibility will be demonstrated from a loss probability.

A study on the ZF-buffer algorithm for Ray-tracing Acceleration (광선추적법의 속도개선을 위한 ZF-버퍼 알고리즘 연구)

  • Kim, Sehyun;Yoon, Kyung-hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.6 no.1
    • /
    • pp.29-36
    • /
    • 2000
  • In this work, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray-tracing algorithm. ZF-buffer is used in the preprocessing of ray-tracing and records the pointer that points to a parent face of a depth value(z value) of an object determined in Z-buffer. As a result, the face which intersects with the first ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, the difference between the two methods is that what ZF-buffer records is not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the first ray to Utah teapot which consists of 9216 polygons. By comparing the elapse time of our method with vista-buffer algorithm, we can acquire improvement in speed that it is 3 times faster than vista-buffer algorithm. We expanded our algorithm to the second ray.

  • PDF

Partial Rollback in Object-Oriented Database Management Systems (객체지향 데이터베이스 관리 시스템에서의 부분 철회)

  • Kim, Won-Young;Lee, Young-Koo;Whang, Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.27 no.4
    • /
    • pp.549-561
    • /
    • 2000
  • In database management systems(DBMSs), partial rollback is a useful facility that cancels part of the executed operations upon user's requests without a total rollback. Many relational DBMSs(RDBMSs) provide this facility, However, object-orientccd DBMSs (OODBMSs) cannot utilize the previous recovery scl18lne of partial rollback usccd in (RDBMSs) since, unlike RDBMSs, they use a dual buffer consisting of an object buffer and a page buffer. Therefore, a new recovery scheme is required that rolls back the data efficiently in the dual buffer. We propose four partial rollback schemes in OODBMSs that use a dual buffer. We classify the proposed schemes into the single buffer based partial rollback scheme and the dual buffer based partial rollback scheme according to the number of buffers used for partial rollback processing. We further classify them into Uthe page buffer based partial rollback scheme, 2)the object buffccr based partial rollback scheme, 3)the dual buffer based partial rollback scheme using soft log, and 4)the dual buffer based partial rollback scheme using shadows. We evaluate the performance by mathematical analysis and experiments. The results show that the dual buffer based partial rollback scheme using shadows provides the best performance.

  • PDF

Characteristics of PZT thin films with varying the bottom-electrodes and buffer layer (PZT 박막제조시 하부전극과 buffer층에 따른 박막특성에 관한 연구)

  • 이희수;오근호
    • Journal of the Korean Crystal Growth and Crystal Technology
    • /
    • v.6 no.2
    • /
    • pp.177-184
    • /
    • 1996
  • We adopted the $Pt/SiO_{2}/Si$ and the $Ir/SiO_{2}/Si$ substrates of which buffer layer is $PbTiO_{3}$ to improve electrode and interfacial properties of PZT thin film deposited by reactive sputtering method using metal target in this study. We got PZT thin film to have highly oriented(100) structure and good crystallinity using buffer layer in Pt bottom-electrode, though randomly oriented PZT thin film was obtained without buffer layer. Although great improvement of PZT phase formation on Ir bottom-electrode with buffer layer was not observed, we observed the increase of remennant polarization and the decrease of coercive field compared with properties of PZT thin films on the Pt bottom-electrode. So we got the results of the increase of dielectric constant using buffer layer on fabrication of PZT thin film and the better dielectric properties in PZT thin film using Ir bottom-electrode compared with that using Pt bottom-electrode.

  • PDF

The Instruction Flash memory system with the high performance dual buffer system (명령어 플래시 메모리를 위한 고성능 이중 버퍼 시스템 설계)

  • Jung, Bo-Sung;Lee, Jung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.1-8
    • /
    • 2011
  • NAND type Flash memory has performing much researches for a hard disk substitution due to its low power consumption, cheap prices and a large storage. Especially, the NAND type flash memory is using general buffer systems of a cache memory for improving overall system performance, but this has shown a tendency to emphasize in terms of data. So, our research is to design a high performance instruction NAND type flash memory structure by using a buffer system. The proposed buffer system in a NAND flash memory consists of two parts, i.e., a fully associative temporal buffer for branch instruction and a fully associative spatial buffer for spatial locality. The spatial buffer with a large fetching size turns out to be effective serial instructions, and the temporal buffer with a small fetching size can achieve effective branch instructions. According to the simulation results, we can reduce average miss ratios by around 77% and the average memory access time can achieve a similar performance compared with the 2-way, victim and fully associative buffer with two or four sizes.

Pharmaceutical Study on Clonixin Argininate (Clonixin Argininate의 약제학적 연구)

  • Jee, Ung-Kil;La, Sung-Bum
    • Journal of Pharmaceutical Investigation
    • /
    • v.16 no.2
    • /
    • pp.43-54
    • /
    • 1986
  • To increase the bioavailability of clonixin, clonixin argininate was prepared and compared with clonixin by determining solubility, pKa, lipid-water partition coefficient, dissolution rate and in vivo tests. The results are summerized as followings; 1) The solubility of clonixin argininate was increased by 20 times in water, about 1.2 times in pH 1.2 and pH 8.0 buffer solution, and about 1.8 times in pH 6.8 buffer solution compared with that of clonixin. 2) pKa values of clonixin, clonixin lysinate and clonixin argininate were 6.32, 7.20 and 7.45, respectively. 3) The lipid-water partition coefficient of clonixin argininate was increased more than that of the clonixin in n-hexane, carbon tetrachloride, chloroform, methylene chloride, and n-butanol, but the partition coefficient of clonixin was increased more than that of clonixin argininate in benzene/pH 1.2 buffer solution, ether/pH 8.0 buffer solution, and 3-methylbutyl acetate/pH 1.2, pH 8.0 buffer solution. 4) The time required to dissolve 60% $(T_{60%},\;min.)$ of clonixin argininate was about 1.5 min. in water and pH 1.2 buffer solution, and about 5 min. in pH 6.8 buffer solution. $T_{60%}$ of clonixin lysinate was about 1.5 min. in water, about 1.8 min. in pH 6.8 buffer solution, and about 8 min. in pH 1.2 buffer solution. But $T_{60%}$ of clonixin was about 96 min. in pH 6.8 buffer solution, over 2 hours in water and pH 1.2 buffer solution. 5) Anti-inflammatory effect of clonixin argininate was increased more than that of clonixin over 6 hours, and that of clonixin lysinate was followed by lapse of time. 6) Analgesic effect of clonixin argininate was increased by 1.5 times more than that of clonixin and the effect of clonixin argininate was nearly identical with that of clonixin lysinate. 7) The absorption rates (Ka) of clonixin, clonixin lysinate and clonixin argininate were $0.169\;hr^{-1},\;0.652\;hr^{-1}$ and $0.723\;hr^{-1}$ in situ, respectively.

  • PDF

The Study of Different Buffer Structure on Ni-W Tape for SmBCO Coated Conductor

  • Kim, T.H.;Kim, H.S.;Oh, S.S.;Ko, R.K.;Ha, D.W.;Song, K.J.;Lee, N.J.;Yang, J.S.;Jung, Y.H.;Youm, D.J.;Park, K.C.
    • Progress in Superconductivity and Cryogenics
    • /
    • v.8 no.4
    • /
    • pp.8-11
    • /
    • 2006
  • High temperature superconducting coated conductor has various buffer structures on Ni-W alloy. We comparatively studied the growth conditions of a multi buffer layer $(CeO_2/YSZ/CeO_2)$ and a single buffer layer$(CeO_2)$ on textured Ni-W alloy tapes. XRD data showed that the qualities of in-plane and out-of-plane textures of the two type buffer structures were good. Also, we investigated the properties of SmBCO superconducting layer that was deposited on the two type buffer structure. The SmBCO superconducting properties on the single and multi buffer structure showed different critical current values and surface morphologies. FWHM of In-plane and out-of-plane textures were $7.4^{\circ},\;5.0^{\circ}$ in the top CeO2 layer of the multi-buffer layers of $CeO_2/YSZ/CeO_2$, and $7.3^{\circ},\;5.1^{\circ}$ in the $CeO_2$ single buffer layer. $1{\mu}m-thick$ SmBCO superconducting layers were deposited on two type buffer layer. $I_c$ of SmBCO deposited on single and multi buffer were 90 A/cm, 150 A/cm and corresponding $J_c$ were $0.9MA/cm^2,\;1.5MA/cm^2$ at 77K in self-field, respectively.

Lightweight FPGA Implementation of Symmetric Buffer-based Active Noise Canceller with On-Chip Convolution Acceleration Units (온칩 컨볼루션 가속기를 포함한 대칭적 버퍼 기반 액티브 노이즈 캔슬러의 경량화된 FPGA 구현)

  • Park, Seunghyun;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.11
    • /
    • pp.1713-1719
    • /
    • 2022
  • As the noise canceler with a small processing delay increases the sampling frequency, a better-quality output can be obtained. For a single buffer, processing delay occurs because it is impossible to write new data while the processor is processing the data. When synthesizing with anti-noise and output signal, this processing delay creates additional buffering overhead to match the phase. In this paper, we propose an accelerator structure that minimizes processing delay and increases processing speed by alternately performing read and write operations using the Symmetric Even-Odd-buffer. In addition, we compare the structural differences between the two methods of noise cancellation (Fast Fourier Transform noise cancellation and adaptive Least Mean Square algorithm). As a result, using an Symmetric Even-Odd-buffer the processing delay was reduced by 29.2% compared to a single buffer. The proposed Symmetric Even-Odd-buffer structure has the advantage that it can be applied to various canceling algorithms.

Parallel Generation of NC Tool Paths for Subdivision Surfaces

  • Dai Junfu;Wang Huawei;Qin Kaihuai
    • International Journal of CAD/CAM
    • /
    • v.4 no.1
    • /
    • pp.47-53
    • /
    • 2004
  • The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.

A Novel Bit Rate Adaptation using Buffer Size Optimization for Video Streaming

  • Kang, Young-myoung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.166-172
    • /
    • 2020
  • Video streaming application such as YouTube is one of the most popular mobile applications. To adjust the quality of video for available network bandwidth, a streaming server provides multiple representations of video of which bit rate has different bandwidth requirements. A streaming client utilizes an adaptive bit rate scheme to select a proper video representation that the network can support. The download behavior of video streaming client player is governed by several parameters such as maximum buffer size. Especially, the size of the maximum playback buffer in the client player can greatly affect the user experience. To tackle this problem, in this paper, we propose the maximum buffer size optimization according to available network bandwidth and buffer status. Our simulation study shows that our proposed buffer size optimization scheme successfully mitigates playback stalls while preserving the similar quality of streaming video compared to existing ABR schemes.