• 제목/요약/키워드: Buffer Size

검색결과 628건 처리시간 0.026초

PCI 익스프레스의 데이터 연결 계층에서 송신단 버퍼 관리를 위한 효과적인 방법 (An Effective Method to Manage the Transmitter's Buffer in the Data Link Layer of the PCI Express)

  • 현유진;성광수
    • 전자공학회논문지CI
    • /
    • 제41권5호
    • /
    • pp.9-16
    • /
    • 2004
  • PCI 익스프레스 디바이스의 데이터 연결 계층은 전송할 패킷을 저장하고 있는 송신 버퍼와 전송하였지만 아직 타겟 디바이스로부터 승인 받지 못한 패킷을 저장하고 있는 재전송 버퍼를 가지고 있어야 한다. 이렇게 전송 버퍼와 재전송 버퍼를 구분하여 구현할 경우 전송할 패킷이 전송 버퍼에 있다 하더라도 재전송 버퍼에 여유 공간이 없다면 더 이상 패킷을 전송 할 수 없다는 단점이 있다. 본 논문에서는 한 개의 버퍼로 전송 버퍼와 재전송 버퍼를 구현하는 방법을 제안한다. 제안된 버퍼 구조에서는 필요에 따라 버퍼의 공간을 유연하게 사용할 수 있기 때문에 버퍼 사용 및 데이터 전송 효율을 향상시킬 수 있다. 모의 실험 결과 버퍼의 전체 크기가 8K 바이트일 경우 제안된 방법이 버퍼를 분리하여 사용하는 방법에 비해 데이터 전송 효율이 평균 39% 향상되었다.

$CeO_2$/$BaTiO_3$이중완충막을 이용한 YBCO 박막 제작 (Fabrication of YBCO Superconducting Film with $CeO_2$/$BaTiO_3$Double Buffer Layer)

  • 김성민;이상렬
    • 한국전기전자재료학회논문지
    • /
    • 제13권11호
    • /
    • pp.959-962
    • /
    • 2000
  • We have fabricated good quality superconducting YBa$_2$Cu$_3$$O_{7-x}$(YBCO) thin films on Hastelloy(Ni-Cr-Mo alloys) metallic substrates with CeO$_2$and BaTiO$_3$buffer layers in-situ by pulsed laser deposition in a multi-target processing chamber. YBCO film with CeO$_2$single buffer layer shows T$_{c}$ of 71.64 K and the grain size less than 0.1${\mu}{\textrm}{m}$. When BaTiO$_3$ is used as a single buffer layer, the grain size of YBCO is observed to be larger than that of YBCO/CeO$_2$by 200 times and the transition temperature of the film is enhanced to be about 84 K. CeO$_2$/BaTiO$_3$double buffer layer has been adopted to enhance the superconducting properties, which results in the enhancement of the critical temperature and the critical current density to be about 85 K and 8.4$\times$10$^4$ A/$\textrm{cm}^2$ at 77 K, respectively mainly due to the enlargement of the grain size of YBCO film.ilm.

  • PDF

Optimal buffer size control of serial production lines with quality inspection machines

  • Han, Man-Soo;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
    • /
    • pp.350-353
    • /
    • 1996
  • In this paper, based on the performance analysis of serial production lines with quality inspection machines, we develope an buffer size optimization method to maximize the production rate. The total sum of buffer sizes are given and a constant, and under this constraint, using the linear approximation method, we suggest a closed form solution for the optimization problem with an acceptable error. Also, we show that the upstream and downstream buffers of the worst performance machine have a significant effect on the production rate. Finally, the suggested methods are validated by simulations.

  • PDF

공유 버퍼형 순서 재정렬 ATM스위치에 관한 연구 (A Study on the Cell Resequence Method at the ATM Switch)

  • 박성헌;전용일박광채
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • pp.273-276
    • /
    • 1998
  • This paper proposes a new Asynchronous Transfer Mode(ATM) switch architecture for the Broadband ISDN. The proposed switch has the architecture to prohibit the out-of-sequence in shared buffer switch system with being fixed buffer size in the out-buffered large scale ATM Switch System. then in this paper proposes cell resequence algorithm to decrease the out-of-sequence problem. also, we studied the out-of-sequence problem that was occurred by the cell transfer delay and the cell overflow due to the fixed buffer size when cell resequenced and we propose to implement optimal ACFIFO(Address Counter First In First Out) buffer size which has the minimized cell loss.

  • PDF

무선 랜 고속전송을 위한 최대버퍼한계 기반 TCP 버퍼튜닝 (TCP Buffer Tuning based on MBT for High-Speed Transmissions in Wireless LAN)

  • 문성곤;이홍석;추현승;공원영
    • 인터넷정보학회논문지
    • /
    • 제8권1호
    • /
    • pp.15-23
    • /
    • 2007
  • 무선 랜(IEEE 802,11)은 신뢰적인 데이터 전송을 위해 기존 TCP를 사용하고 무선 신호의 단절, 간섭, 감쇠 영향으로 인하여 혼잡하지 않은 상태에서 의도하지 않은 패킷손실을 유발한다. 무선 랜에서의 TCP는 패킷손실을 혼잡으로 판단하고, 혼잡제어 알고리즘을 작동하므로 전반적인 전송률이 감소된다. 본 논문은 무선 랜에서의 전송률 증가를 위해 유선 네트워크 고속전송 기법인 TCP 버퍼튜닝을 적용하여 TCP 버퍼크기와 전송률과의 상관관계를 분석한다. 분석을 통해 버퍼크기 증가에 관계없이 더 이상의 전송률이 증가되지 않는 특정 버퍼 한계점을 찾고, 이를 우리는 최대버퍼한계(Maximum Buffer Threshold, MBT)라 정의한다. 최대버퍼한계를 산출하기 위해 실제 연주를 통해 음악파일을 생성한 후 이를 이용하여 실험을 한다. 최대 버퍼한계 기반 TCP 버퍼튜닝은 운영체제 기본 버퍼크기에서의 무선 전송률과 비교하여 송수신간 RTT가 5ms 구간에서 20.3%, RTT 10ms에서 21.4%, RTT 20ms에서 45.4% 전송률이 향상된다. 또한 특정 RTT 구간에서 최대 전송률을 97%의 정확도로 예측하고, 최대버퍼한계 이상으로 TCP 버퍼크기를 설정하는 것은 전송률 증가에 영향이 없음을 확인한다.

  • PDF

Batch Size Distribution in Input Flow to Queues with Finite Buffer

  • Kim, Che-Soong;Kim, Ji-Seung
    • 한국정보기술응용학회:학술대회논문집
    • /
    • 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
    • /
    • pp.271-275
    • /
    • 2005
  • Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

  • PDF

Batch Size Distribution in Input Flow to Queues with Finite Buffer Affects the Loss Probability

  • 김제숭;오영진
    • 한국산업정보학회논문지
    • /
    • 제11권1호
    • /
    • pp.1-6
    • /
    • 2006
  • Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

  • PDF

Fluid Flow Analysis of the Threshold based Leaky Bucket Scheme

  • Park, Chul-Geun
    • Journal of Electrical Engineering and information Science
    • /
    • 제3권2호
    • /
    • pp.274-279
    • /
    • 1998
  • We investigate a Leaky Bucket(LB) scheme with a threshold in the data buffer, where leaky rate changes depending on the contents of data buffer. We use the fluid flow model for the analysis of the LB scheme with a threshold. We model the bursty input source as markov modulated fluid flow(MMFF) As performance measures we obtain loss probability and mean delay. We present some numerical results to show the effects of the level of a threshold, the rate of token generation, the size of token pool, and the size the data buffer on the performances of the LB scheme with a threshold.

  • PDF

표면반응법을 이용한 자동화 컨테이너 터미널의 버퍼 장치장에서의 장비 규모 결정 (Determination of Fleet Size of Equipment in Buffer Yard of an Automated Container Terminal by using a Response Surface Methodology)

  • 배종욱;양창호;김갑환
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2000년도 추계학술대회논문집
    • /
    • pp.121-129
    • /
    • 2000
  • In this paper, we discuss how to operate a buffer yard in an automated container terminal, which will be used for resolving the difficulties to which the interaction between external manned trucks and internal unmanned equipment led. The determination of fleet size of material handling equipment is an important issue in designing of buffer yard in automated container terminals. This research also addresses the issue of determining buffer capacities through simulation. By using response surface methodology (RSM) for efficient experimentation, the optimal combination of design parameters under applicable operational strategies is obtained.

  • PDF

DCAR: Dynamic Congestion Aware Routing Protocol in Mobile Ad Hoc Networks

  • Kim, Young-Duk;Lee, Sang-Heon;Lee, Dong-Ha
    • 대한임베디드공학회논문지
    • /
    • 제1권1호
    • /
    • pp.8-13
    • /
    • 2006
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

  • PDF