• Title/Summary/Keyword: Data transfer time

Search Result 1,290, Processing Time 0.028 seconds

Eager Data Transfer Mechanism for Reducing Communication Latency in User-Level Network Protocols

  • Won, Chul-Ho;Lee, Ben;Park, Kyoung;Kim, Myung-Joon
    • Journal of Information Processing Systems
    • /
    • v.4 no.4
    • /
    • pp.133-144
    • /
    • 2008
  • Clusters have become a popular alternative for building high-performance parallel computing systems. Today's high-performance system area network (SAN) protocols such as VIA and IBA significantly reduce user-to-user communication latency by implementing protocol stacks outside of operating system kernel. However, emerging parallel applications require a significant improvement in communication latency. Since the time required for transferring data between host memory and network interface (NI) make up a large portion of overall communication latency, the reduction of data transfer time is crucial for achieving low-latency communication. In this paper, Eager Data Transfer (EDT) mechanism is proposed to reduce the time for data transfers between the host and network interface. The EDT employs cache coherence interface hardware to directly transfer data between the host and NI. An EDT-based network interface was modeled and simulated on the Linux-based, complete system simulation environment, Linux/SimOS. Our simulation results show that the EDT approach significantly reduces the data transfer time compared to DMA-based approaches. The EDTbased NI attains 17% to 38% reduction in user-to-user message time compared to the cache-coherent DMA-based NIs for a range of message sizes (64 bytes${\sim}$4 Kbytes) in a SAN environment.

Design of Variable Data Transfer Rate Asymmetric TDD System Using Turbo Decoder with Double Buffer Controller (이중 버퍼 제어기 구조의 터보 복호기를 사용한 전송률 가변 비대칭 TDD 시스템 설계)

  • Park, Byeung-Kwan;Kim, Mi-Rae;Kim, Hyo-Jong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.2
    • /
    • pp.161-168
    • /
    • 2019
  • This paper proposes a variable data transfer asymmetric TDD(Time Division Duplex) system for small UAV(Unmanned Aerial Vehicle) data link system. In the proposed method, a turbo decoder with a double buffer controller is proposed to apply turbo decoder with long decoding time to asymmetric TDD system. The proposed method achieves variable data transfer rate and maximum data transfer rate. The advantage of the proposed method is demonstrated by its data transfer rate. The measured data transfer rate is more than 1.8 times than that of symmetric TDD system. In addition, PER(Packet Error Rate) performance is the same and data transfer rate is variable.

Evaluation of Transfer Services based on Transit Smart Card Data (스마트카드 데이터를 활용한 역사별 연계 환승시간 서비스 평가)

  • Choi, Myoung-Hun;Eom, Jin-Ki;Lee, Jun;Kim, Dae-Sung
    • Proceedings of the KSR Conference
    • /
    • 2011.10a
    • /
    • pp.1699-1706
    • /
    • 2011
  • This study analyzed the level of service on passenger transfer between metro and bus based on transit smart card data obtained in 2010. In order to evaluate the level of service on transfer, we defined the service level specially on transfer time at metro stations. The data of passenger transfer time were used in cluster analysis to classify the service level from A to F. The results show that the average transfer time from metro to bus was 6.45 minutes. The number of stations with level of service A(approximately less than 7 minutes) and B(less than 16minutes) were found to be 215 and 227stations respectively. Also, the number of stations with the level of service C and D (greater than 20 minutes for transfer) were found to be 6 stations where any type of improvement on transfer facilities is required.

  • PDF

Multicast Algorithm of Multimedia data over Heterogeneous User Environment (상이한 사용자 환경을 고려한 멀티미디어 데이터의 멀티캐스트 알고리즘)

  • Lee, Seung-Ha;Na, Yun-Ju;Kim, Sung;Nam, Ji-Seung;Jun, Hyung-Kook;Jo, Chang-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.125-128
    • /
    • 2001
  • Nowadays, Internet users are widespread internationally. Fallowing the users requirements, server has to transfer real-time multimedia data to many clients. Multicast can significantly reduce the system overhead and the network resource waste, so it supports efficient mechanism when server has to transfer same data to many clients. We can deliver multimedia data transfer in real-time using Patching Algorithm which has no delay for service request. And multicast algorithm can support different network bandwidth using Receiver driven Layered Multicast under heterogeneous environment network. The purpose of this paper is to suggest an algorithm that can create new multicast group adequately and transfer real-time multimedia data efficiently under heterogeneous environment.

  • PDF

Mean Transfer Time for SCTP in Initial Slow Start Phase (초기 슬로우 스타트 단계에서 SCTP의 평균 전송 시간)

  • Kim, Ju-Hyun;Lee, Yong-Jin
    • 대한공업교육학회지
    • /
    • v.32 no.2
    • /
    • pp.199-216
    • /
    • 2007
  • Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

Determination of Transfer Ratio According to Transfer Time Reflecting Passenger Attributes (대중교통 이용자 속성을 고려한 환승시간별 환승률 결정모형의 개발)

  • Song, Ki-Tae;Park, Jun-Sik;Kho, Seung-Young;Kim, Jum-San;Rhee, Sung-Mo
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.4
    • /
    • pp.217-227
    • /
    • 2008
  • The purpose of this research is the estimation of a transfer ratio according to transfer time reflecting passenger attributes such as sex, age, income, job, the car ownership, and other variables with the assumption that a transfer ratio would be different depending on each passenger attribute. This research tested transfer time through a question-survey, estimated transfer time according to the passenger attributes using a data sample, and presented some applicable models about marginal transfer time for the case of the determination of transfer ratios according to transfer time. In this research the sample which had been surveyed for passengers walking to access a transfer station was used to test and estimate and the question was present walking time to the transfer time and the marginal transfer walking time.

A Study on the Real-Time Monitoring System of Wind Power in Jeju (제주지역 풍력발전량 실시간 감시 시스템 구축에 관한 연구)

  • Kim, Kyoung-Bo;Yang, Kyung-Bu;Park, Yun-Ho;Mun, Chang-Eun;Park, Jeong-Keun;Huh, Jong-Chul
    • Journal of the Korean Solar Energy Society
    • /
    • v.30 no.3
    • /
    • pp.25-32
    • /
    • 2010
  • A real-time monitoring system was developed for transfer, receive, backup and analysis of wind power data at three wind farm(Hang won, Hankyung and Sung san) in Jeju. For this monitoring system a communication system analysis, a collection of data and transmission module development, data base construction and data analysis and management module was developed, respectively. These modules deal with mechanical, electrical and environmental problem. Especially, time series graphic is supported by the data analysis and management module automatically. The time series graphic make easier to raw data analysis. Also, the real-time monitoring system is connected with wind power forecasting system through internet web for data transfer to wind power forecasting system's data base.

A Fast Route Selection Mechanism Considering Channel Statuses in Wireless Sensor Networks (무선 센서 네트워크에서 채널 상태를 고려하여 빠른 경로를 선택하는 기법)

  • Choi, Jae-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.7
    • /
    • pp.45-51
    • /
    • 2009
  • We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

Dynamic QoS Control Algorithm of Real-time Transfer Protocol based on Delay and Loss Priority (지연과 손실우선순위에 따른 실시간 멀티미디어 전송 프로토콜의 동적 QoS 제어 알고리즘)

  • 김정철;이성섭;김체훤;남지승
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.149-152
    • /
    • 2000
  • In the Internet, multimedia data transfer is hard to guarantee the characteristics of the Real-Time because of the Best-Effort of the nature of IP, then additional mechanism is applied to multimedia application for real-time data. In this paper, we introduce the nature of multimedia and the necessary facility for real-time protocol. We propose protocol layer, which has necessary function above mentioned and offer the end-to-end transfer far real-time data. Also, the proposed protocol perform a next low operation: 1) a required information for QoS control by using Feedback mechanism is obtained from sender, 2) divided a transferred packet by delay and loss priority. 3) recognized the low service models, and 4) decided a bandwidth and QoS according to a network state

  • PDF

Analysis of Data Transfer Overhead Among Memory Regions in Java Program (자바 프로그램에서 메모리 영역 간 자료 이동에 따른 부담 분석)

  • Yang, Hee-Jae
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.5
    • /
    • pp.281-287
    • /
    • 2008
  • Data transfers occur during the execution time of a Java program, from constant to variable, from variable to other variable and so on. Data are located in memory and hence data transfer requires access to memory. As memory access generates both time delay and energy consumption it is absolutely necessary to know the data transfer overheads incurred among different paths not only to write an efficient program but also to build a high-performance Java virtual machine. In this paper we classify Java memory into three different regions, constant, local variable, and field, and then investigate data transfer overheads among these regions. The result says that the transfer between local variables incur the least overhead usually, while the transfer between fields incur the most. The difference of overheads reaches up to a double. Optimization techniques like JIT reduces the data transfer overhead dramatically. It is observed that the overhead is reduced from 14 to 27 times for the case of Hotspot JVM.