• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.582-591
• /
• 2015

A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.49-54
• /
• 2005

This Paper Presents a non-blocking deadlock detection scheme with immediate cycle detection in multiprocessing systems. We assume an expedient state and a special case where each type of resource has one unit and each request is limited to one resource unit at a time. Unlike the previous deadlock detection schemes, this new method takes O(1) time for detecting a cycle and O(n+m) time for blocking or handling resource release where n and m are the number of processes and that of resources in the system. The deadlock detection latency is thus minimized and is constant regardless of n and m. However, in a multiprocessing system, the operating system can handle the blocking or release on-the-fly running on a separate processor, thus not interfering with user process execution. To some applications where deadlock is concerned, a predictable and zero-latency deadlock detection scheme could be very useful.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.3
• /
• pp.473-482
• /
• 2017

Hand gesture recognition is regarded as new Human Computer Interaction (HCI) technologies for the next generation of mobile devices. Previous hand gesture implementation requires a large memory and computation power for hand segmentation, which fails to give real-time interaction with mobile devices to users. Therefore, in this paper, we presents a low latency and memory-efficient hand segmentation architecture for natural hand gesture recognition. To obtain both high memory-efficiency and low latency, we propose a streaming hand contour tracing unit and a fast contour filling unit. As a result, it achieves 7.14 ms latency with only 34.8 KB on-chip memory, which are 1.65 times less latency and 1.68 times less on-chip memory, respectively, compare to the best-in-class.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.2
• /
• pp.47-51
• /
• 2009

The low latency encoder for high data rate duo-binary turbo codes with tail biting trellises is considered. Encoder hardware architecture is proposed using inherent encoding property of duo-binary turbo codes. And we showed that half of execution time as well as the energy can be reduced with the proposed architecture.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3221-3223
• /
• 1999

OAEs are low-level sounds produced by cochlea as part of the normal hearing process. OAEs can be measured with a microphone placed in the outer ear-cannel. We can diagnose cochlea's condition by using OAEs. To diagonose it's condition, however, is difficult by reason of OAEs' tiny. Thus, It need to a method using latency which essential diagnosing a time-element of OAEs. This study proposes a latency detection algorithm using 7-QMF for more effective detection of latency, 7-QMF designed by wavelet theory can process signal without a losses of information. The latency-detector based on 7-QMF is superior to former method.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.1-9
• /
• 2019

LRR(Loose Round Robin) warp scheduling policy for GPU architecture results in high warp-level parallelism and balanced loads across multiple warps. However, traditional LRR policy makes multiple warps execute long latency operations at the same time. In cases that no more warps to be issued under long latency, the throughput of GPUs may be degraded significantly. In this paper, we propose a new warp scheduling policy which utilizes latency hiding, leading to more utilized memory resources in high performance GPUs. The proposed warp scheduler prioritizes memory instruction based on GTO(Greedy Then Oldest) policy in order to provide reduced memory stalls. When no warps can execute memory instruction any more, the warp scheduler selects a warp for computation instruction by round robin manner. Furthermore, our proposed technique achieves high performance by using additional information about recently committed warps. According to our experimental results, our proposed technique improves GPU performance by 12.7% and 5.6% over LRR and GTO on average, respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.79-81
• /
• 2009

NEMO is technique to support mobility of a network, not a node, and ensures session continuity for all the nodes in a Mobile Network. However NEMO basic support protocol causes high handover latency, thus it is incongruent real-time services such as VoIP. One of schemes to reduce handover latency is FNEMO. FNEMO that combines conventional NEMO and FMIPv6, reduces latency during the handover, thus it supports fast handover. In this paper, we compare/analyze handover of FNEMO in heterogeneous/homogeneous network, and propose schemes to reduce handover latency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.79-89
• /
• 2004

Mobile IP Low Latency Handoffs allow greater support for real-time services on a Mobile W network by minimizing the period of time when a mobile node is unable to send or receive IP packets due to the delay in the Mobile IP Registration process. However, on Mobile IP network with AAA servers that are capable of performing Authentication, Authorization, and Accounting(AAA) services, every Registration has to be traversed to the home network to achieve new session keys, that are distributed by home AAA server, for a new Mobile IP session. This communication delay is the time taken to re-authenticate the mobile node and to traverse between foreign and home network even if the mobile node has been previously authorized to old foreign agent. In order to reduce these extra time overheads, we present a method that performs Low Latency Handoffs without requiring funker involvement by home AAA server. The method re-uses the previously assigned session keys. To provide confidentiality and integrity of session keys in the phase of key exchange between agents, it uses a key sharing method by gateway foreign agent that Performs a ousted thirty party. The Proposed method allows the mobile node to perform Low Latency Handoffs with fast as well as secure operation

• Journal of Ginseng Research
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1996

This study was performed to examine the effect of red ginseng total saponin and extract on memory in mice using one trial step-down type passive avoidance method. Red ginseng total saponins (No. 1: PD/PT ratio=1.24, No. 2: PD/PT ratio=1.47) were prepared with the different mixing ratio by using the parts of red ginseng. In single administration of total saponin No. 1 (100 mg/ kg, bw) or No. 2 (50 mg/kg, bw) increased the latency time as compared with control group but was not statistically significant. Treatment of total saponin No. 1 (50 mg/kg, bw) for 10 days produced an increase of latency time but was not statistically significant. In scopolamine-induced memory deficient mice total saponin No. 1 (50 mg/kg, bw) and No. 2 (100 mg/kg, bw) significantly improved the latency time. These results show that red ginseng total saponin may improve the memory of sco-polamine-induced memory deficient mice and have nootropic activity.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.11
• /
• pp.1590-1594
• /
• 2012

Depend on delay latency rule for message transmission defined in IEC 61850 standard, the fastest message has to be transferred within 3us. This paper suggests how to structure the real time message transmit test environment of IEC 61850 and develope how to securing IEC 61850 communication performance based on IEC 61850 by measuring delay latency of message transfer on embeded linux system.