• Title/Summary/Keyword: 호출 delay time

Search Result 9, Processing Time 0.027 seconds

Analysis of Arduino Timer Callback for IoT Devices (IoT 디바이스를 위한 아두이노 타이머 콜백 분석)

  • Gong, Dong-Hwan;Shin, Seung-Jung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.139-143
    • /
    • 2018
  • Arduino, based on open source hardware, is used in many IoT devices, and IoT devices require multitasking for various inputs and outputs. Among the several methods used for multitasking based on Arduino, we compare three methods: Timing Call by using millis(), Simple Timer library method, and Timer library method. In order to measure the execution error caused by measurement and time delay of each method, two situations are created and analyzed. In the first case, 10 random tasks of a certain size are generated to measure the time delay of each method. In the second situation, 10 random tasks of a certain size are generated to compare execution errors caused by the time lag of the Timer library. In the first case, the millis() timing call method and the Simple Timer library method have a similar time delay and the Timer library method has more time delay. In the second situation, an execution error occurred in which small-size tasks were not called back at the correct timing due to the time delay.

A Study on the radio protocol for the Maritime Data Communications in HF band (HF대 해상 데이터통신을 위한 무선프로토콜 연구)

  • Jin, Hyong-Du;Im, Mu-Heyk;Choi, Jo-Cheon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.1003-1007
    • /
    • 2008
  • Even if the HF band SSB maritime data communications service company has operating a target Of the member ship, because of unprepared. the radio link protocol that has been question accordance with increase of calling redundancy at traffic overload. Although free signal has operating for traffic of the next ship, but cannot avoid the collision in mutual calling ships. In feature of HF band SSB channel that radio link must be established by automatical, stability and adaptive at over load. In this factor, this paper is studied the new radio protocol by 3 step sequency driving of free access, group free access and polling access.

  • PDF

A Scheduling method of Real-Time Database for an Effective Transaction Processing on Networks (통신망 상의 효과적인 트랜잭션 처리를 위한 시시간 데이터베이스 스케줄링 기법)

  • 안우영;임해철
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10b
    • /
    • pp.214-216
    • /
    • 1998
  • 최근에, 많은 트래픽이 발생하는 통신망 환경에서의 실시간 데이터베이스를 위한 효율적인 트랜잭션 스케줄링과 다양한 동시성 제어 프로토콜들이 제안되고 있다. 그러나 이 연구들은 통신망 자체를 단순한 불변 지연 서버(constant-delay-server)로 모델 하거나 또는 기존의 데이터베이스 시스템을 통신망 환경하의 실시간 데이터베이스 시스템으로 단순하게 확장함으로써 여러 문제점을 갖고 있다. 본 논문에서는 응용 서비스들의 부하에 E라 다양하게 변화되는 통신망의 상태와 성능을 사전에 감지할 수 있도록 하기 위한 트래픽 감시자(traffic monitor)를 두어, 이 트래픽 감시자로부터 얻어지는 정보를 트랜잭션 스케줄링에서 활용할 수 있도록 데이터베이스 모듈들을 구성하여 미래의 통신망 환경에 적절하게 대처할 수 있는 실시간 데이터베이스(RTDB: Real-Time DataBase)를 구축한다. 본 논문에서 제안된 실시간 데이터베이스의 트랜잭션 스케줄링 기법은 통신망에서의 트랜잭션 예상 실행시간을 보다 더 정확하고 빠르게 예측 할 수 있다. 따라서 통신망의 서로 다른 사이트에 분할, 저장되어 있는 데이터베이스 정보를 호출하려는 많은 트랜잭션들이 데이터-일관성(data-consistency)을 유지하면서도 마감시간 이내에 완료될 수 있다. 또한 이미 마감시간을 초과한 트랜잭션들은 예상 실행시간이 작은 것부터 처리하도록 함으로써 시스템 전체의 트랜잭션 처리율(throughput)을 향상시킨다.

Java Garbage Collection for a Small Interactive System (소규모 대화형 시스템을 위한 자바 가비지 콜렉션)

  • 권혜은;김상훈
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.12
    • /
    • pp.957-965
    • /
    • 2002
  • Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

Congestion Control with Multiple Time Scale under Self-Similar Traffic (자기유사성 트래픽 조건에서 다중 시간 간격을 이용한 혼잡제어)

  • Park, Dong-Suk;Ra, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.65-75
    • /
    • 2005
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

A Study on the Performance Improvements of Congestion Control of Multiple Time Scale Under in TCP-MT network (TCP-MT네트워크에서 다중 시간 간격을 이용한 혼잡제어 성능 개선에 관한 연구)

  • Cho, Hyun-Seob;Oh, Myoung-Kwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.1
    • /
    • pp.75-80
    • /
    • 2008
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

TRS Network Design and Inspection by Shared Network in Subway (지하철에서의 공용망을 이용한 TRS 망 설계 및 검증에 관한 연구)

  • Kim, hak-yeoul;Kim, Seong-Cheol
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.3
    • /
    • pp.231-238
    • /
    • 2021
  • In addition to individual calls and group calls, the Trunked Radio System (TRS), which belongs to a group, can make calls simultaneously, and many users can use it within a limited time by adjusting the call time. Also, the LCX infrastructure network of the subway Most of the FM, firefighting radio, TRS of the National Police Agency and the terrestrial DMB service built in 2005 are commonly connected to the network for service and operation. In connection with the analysis, call reception sensitivity, handoff, interference with other signals, time delay, etc. were analyzed, and tests such as reception field strength for each output of the repeater and the success rate of the call terminal were conducted and the test results were analyzed. In addition, it will help TRS cell design and network construction by predicting equipment output capacity and service coverage based on test results.

Sound Engine for Korean Traditional Instruments Using General Purpose Digital Signal Processor (범용 디지털 신호처리기를 이용한 국악기 사운드 엔진 개발)

  • Kang, Myeong-Su;Cho, Sang-Jin;Kwon, Sun-Deok;Chong, Ui-Pil
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.3
    • /
    • pp.229-238
    • /
    • 2009
  • This paper describes a sound engine of Korean traditional instruments, which are the Gayageum and Taepyeongso, by using a TMS320F2812. The Gayageum and Taepyeongso models based on commuted waveguide synthesis (CWS) are required to synthesize each sound. There is an instrument selection button to choose one of instruments in the proposed sound engine, and thus a corresponding sound is produced by the relative model at every certain time. Every synthesized sound sample is transmitted to a DAC (TLV5638) using SPI communication, and it is played through a speaker via an audio interface. The length of the delay line determines a fundamental frequency of a desired sound. In order to determine the length of the delay line, it is needed that the time for synthesizing a sound sample should be checked by using a GPIO. It takes $28.6{\mu}s$ for the Gayageum and $21{\mu}s$ for the Taepyeongso, respectively. It happens that each sound sample is synthesized and transferred to the DAC in an interrupt service routine (ISR) of the proposed sound engine. A timer of the TMS320F2812 has four events for generating interrupts. In this paper, the interrupt is happened by using the period matching event of it, and the ISR is called whenever the interrupt happens, $60{\mu}s$. Compared to original sounds with their spectra, the results are good enough to represent timbres of instruments except 'Mu, Hwang, Tae, Joong' of the Taepyeongso. Moreover, only one sound is produced when playing the Taepyeongso and it takes $21{\mu}s$ for the real-time playing. In the case of the Gayageum, players usually use their two fingers (thumb and middle finger or thumb and index finger), so it takes $57.2{\mu}s$ for the real-time playing.

A Service Push System Based on JXTA (JXTA 기반 서비스 푸시 시스템)

  • Cho, Yoon-Sik;Jung, In-Hwan;Hwang, Ki-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.56-66
    • /
    • 2009
  • In the traditional Server/Client architecture, the client connects to the known servers and gets information through web searching. However, nowadays, diverse internet devices providing services (get) working on internet easily. The update interval of the services or information provided by the devices is relatively short. And also they tend to be both a server and a client. In this situation, the way of the traditional information searching such as web searching is not appropriate. In this paper we propose a service push model, where it pushes its service profiles to all the other network devices by broadcasting them on the network. When a device connects to the network newly, it can get all service profiles in the network and it gets service profiles newly pushed by service providers in prompt. Also it can call any service among the service profiles within itself. We implemented a prototype system for the service push model on the JXTA platform based on P2P network. Also we measured the service profile pushing delay, the service discovery time, and the response time of service execution by running test applications written on the prototype system.