• Title/Summary/Keyword: latency reduction

Search Result 152, Processing Time 0.021 seconds

An Improved Way of Remote Storage Service based on iSCSI for Mobile Device using Intermediate Server (모바일 디바이스를 위한 iSCSI 기반의 원격 스토리지 서비스에서 중간 서버를 이용한 성능 개선 방안)

  • Kim Daegeun;Park Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.11C no.6 s.95
    • /
    • pp.843-850
    • /
    • 2004
  • As mobile devices prevail, requests for various services using mobile devices have increased. Requests for application services that require large data space such as multimedia, game and database [1] specifically have greatly increased. However, mobile appliances have difficulty in applying various services like a wire environment, because the storage capacity of one is not enough. Therefore, research (5) which provides remote storage service for mobile appliances using iSCSI is being conducted to overcome storage space limitations in mobile appliances. But, when iSCSI is applied to mobile appliances, iSCSI I/O performance drops rapidly if a iSCSI client moves from the server to a far away position. In the case of write operation, $28\%$ reduction of I/O performance occurred when the latency of network is 64ms. This is because the iSCSI has a structural quality that is very .sensitive to delay time. In this paper, we will introduce an intermediate target server and localize iSCSI target to improve the shortcomings of iSCSI performance dropping sharply as latency increases when mobile appliances recede from a storage server.

Variable Sampling Window Flip-Flops for High-Speed Low-Power VLSI (고속 저전력 VLSI를 위한 가변 샘플링 윈도우 플립-플롭의 설계)

  • Shin Sang-Dae;Kong Bai-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.8 s.338
    • /
    • pp.35-42
    • /
    • 2005
  • This paper describes novel flip-flops with improved robustness and reduced power consumption. Variable sampling window flip-flop (VSWFF) adjusts the width of the sampling window according to input data, providing robust data latching as well as shorter hold time. The flip-flop also reduces power consumption for higher input switching activities as compared to the conventional low-power flip-flop. Clock swing-reduced variable sampling window flip-flop (CSR-VSWFF) reduces clock power consumption by allowing the use of a small swing clock. Unlike conventional reduced clock swing flip-flops, it requires no additional voltage higher than the supply voltage, eliminating design overhead related to the generation and distribution of this voltage. Simulation results indicate that the proposed flip-flops provide uniform latency for narrower sampling window and improved power-delay product as compared to conventional flip-flops. To evaluate the performance of the proposed flip-flops, test structures were designed and implemented in a $0.3\mu m$ CMOS process technology. Experimental result indicates that VSWFF yields power reduction for the maximum input switching activity, and a synchronous counter designed with CSR-VSWFF improves performance in terms of power consumption with no use of extra voltage higher than the supply voltage.

An Exponential Indexing Scheme for Broadcast Disk Program in a Single Wireless Channel (단일 무선 채널에서 브로드캐스트 디스크 프로그램을 위한 지수 인덱스 기법)

  • Park, Ki-Young;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.35 no.6
    • /
    • pp.518-532
    • /
    • 2008
  • Broadcast scheme has been widely researched for efficient data delivery in the mobile environment because the downlink capacity of a mobile client is much greater than the uplink capacity, and the power of a mobile client is limited. In the proposed scheme, the index lets the client know when data items would be broadcasted and enables the client to minimize the tuning time and power consumption. Single channel index schemes are fit to flat broadcast that performs well when all the broadcasted data items are accessed with the same probability whereas the multi-disk broadcast scheme is proper when the data access distribution is skewed. The existing index schemes, however, cannot work on the Multi-disk broadcast scheme because they cannot point the replicating data items in a broadcast cycle. This paper proposes a Multi-disk Exponential Index (MDEI) which is a single channel index scheme fit to Multi-disk broadcast scheme. Because MDEI scheme organizes a separate index for each disk, it functions with multi-disk broadcast, resulting in a greater reduction of average access latency than that of other flat-broadcast index schemes when the data access distribution is skewed. The performance evaluation showed that MDEI has a good performance when data access distribution is skewed. MDEI has short average access latency and not much average tuning time when the data access distribution is skewed.

Nocturnal Sleep Fragmentation in Narcoleptics and Its Clinical Implications (기면병(嗜眠炳)의 야간(夜間) 수면분절(睡眠分節) 및 임상적(臨床的) 의미(意味))

  • Park, Doo-Heum;Sohn, Chang-Ho;Jeong, Do-Un
    • Sleep Medicine and Psychophysiology
    • /
    • v.3 no.1
    • /
    • pp.47-55
    • /
    • 1996
  • Narcolepsy is characterized by sleep attack with excessive daytime sleepiness(EDS), cataplexy, sleep paralysis, and hypnagogic hallucination. Paradoxically, narcoleptics tend to complain of frequent arousals and shallow sleep during the night time despite their excessive sleepiness. However, nocturnal sleep fragmentation in narcoleptics is relatively ignored in treatment strategies, compared with sleep attack/EDS and cataplexy. In our paper, we attempted to investigate further on the poor nocturnal sleep in narcoleptics and to discuss possible treatment interventions. Out of consecutively seen patients at Seoul National University Sleep Disorders Clinic and Division of Sleep Studies, we recruited 57 patients, clinically assessed as having sleep attack and/or EDS. Nocturnal polysomnography and multiple sleep latency test(MSLT) were done in each of the subjects. We selected 19 subjects finally diagnosed as narcolepsy(mean age $26.0{\pm}18.3$ years, 16 men and 3 women) for this study, depending on the nocturnal polysomnographic and MSLT findings as well as clinical history and symptomatology. Any subject co-morbid with other hypersomnic sleep disorders such as sleep apnea or periodic limb movements during sleep was excluded. Sleep staging was done using Rechtschaffen and Kales criteria. Sleep parameters were calculated using PSDENT program(Stanford Sleep Clinic, version 1.2) and were compared with the age-matched normal values provided in the program. In narcoleptics, compared with the normal controls, total wake time was found to be significantly increased with significantly decreased sleep efficiency(p<.01, p<.05, respectively), despite no difference of sleep period time and total sleep time between the two groups. Stage 2 sleep%(p<.05), slow wave sleep%(p<.05), and REM sleep%(p<.01) were found to be significantly decreased in narcoleptics compared with normal controls, accompanied by the significant increase of stage 1 sleep%(p<.01). Age showed negative correlation with slow wave sleep%(p<.05). The findings in the present study indicate significant fragmentation of nocturnal sleep in narcoleptics. Reduction of REM sleep% and the total number of REM sleep periods suggests the disturbance of nocturnal REM sleep distribution in narcoleptics. No significant correlations between nocturnal polysomnographic and MSLT variables in narcoleptics suggest that nocturnal sleep disturbance in narcoleptics may be dealt with, in itself, in diagnosing and managing narcolepsy. With the objective demonstration of qualitative and quantitative characteristics of nocturnal and daytime sleep in narcoleptics, we suggest that more attention be paid to the nocturnal sleep fragmentation in narcoleptics and that appropriate treatment interventions such as active drug therapy and/or circadian rhythm-oriented sleep hygiene education be applied as needed.

  • PDF

Implementation of a Mesh Router Supporting Multi-path Routing based on IEEE 802.11s (다중 경로 라우팅을 지원하는 IEEE 802.11s기반 메쉬 라우터 구현)

  • Kim, Jeong-Soo;Chung, Sang-Hwa;Choi, Hee-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12A
    • /
    • pp.950-958
    • /
    • 2011
  • This paper focuses in the implementation of mesh router supporting multi-path routing based on IEEE 802.11s. In HWMP of IEEE 802.11s, the single path routing just was defined. So, in this work, we implemented not only the single path routing defined in IEEE 802.11s, but also a multipath routing based on AOMDV which extended the standard. A multi-channel multi-interface technology that can transmit and receive simultaneously and lower bandwidth reduction caused by interferences than a single-channel single-interface was implemented in our mesh router. We also developed an outdoor test bed with the mesh routers. The bandwidth of the mesh router and a real-time video streaming service were verified using the test bed. And, the single path and multipath routing algorithms are also compared. In this test bed, The average TCP bandwidth was 23.77 Mbps and the latency was 2.4 ms in five hops. The test bed could service real-time streaming with an average jitter of 0.547 ms in five hops. The mesh router that used the multipath routing path reduced the path recovery time by 12.73% on average.

Edge to Edge Model and Delay Performance Evaluation for Autonomous Driving (자율 주행을 위한 Edge to Edge 모델 및 지연 성능 평가)

  • Cho, Moon Ki;Bae, Kyoung Yul
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.191-207
    • /
    • 2021
  • Up to this day, mobile communications have evolved rapidly over the decades, mainly focusing on speed-up to meet the growing data demands of 2G to 5G. And with the start of the 5G era, efforts are being made to provide such various services to customers, as IoT, V2X, robots, artificial intelligence, augmented virtual reality, and smart cities, which are expected to change the environment of our lives and industries as a whole. In a bid to provide those services, on top of high speed data, reduced latency and reliability are critical for real-time services. Thus, 5G has paved the way for service delivery through maximum speed of 20Gbps, a delay of 1ms, and a connecting device of 106/㎢ In particular, in intelligent traffic control systems and services using various vehicle-based Vehicle to X (V2X), such as traffic control, in addition to high-speed data speed, reduction of delay and reliability for real-time services are very important. 5G communication uses high frequencies of 3.5Ghz and 28Ghz. These high-frequency waves can go with high-speed thanks to their straightness while their short wavelength and small diffraction angle limit their reach to distance and prevent them from penetrating walls, causing restrictions on their use indoors. Therefore, under existing networks it's difficult to overcome these constraints. The underlying centralized SDN also has a limited capability in offering delay-sensitive services because communication with many nodes creates overload in its processing. Basically, SDN, which means a structure that separates signals from the control plane from packets in the data plane, requires control of the delay-related tree structure available in the event of an emergency during autonomous driving. In these scenarios, the network architecture that handles in-vehicle information is a major variable of delay. Since SDNs in general centralized structures are difficult to meet the desired delay level, studies on the optimal size of SDNs for information processing should be conducted. Thus, SDNs need to be separated on a certain scale and construct a new type of network, which can efficiently respond to dynamically changing traffic and provide high-quality, flexible services. Moreover, the structure of these networks is closely related to ultra-low latency, high confidence, and hyper-connectivity and should be based on a new form of split SDN rather than an existing centralized SDN structure, even in the case of the worst condition. And in these SDN structural networks, where automobiles pass through small 5G cells very quickly, the information change cycle, round trip delay (RTD), and the data processing time of SDN are highly correlated with the delay. Of these, RDT is not a significant factor because it has sufficient speed and less than 1 ms of delay, but the information change cycle and data processing time of SDN are factors that greatly affect the delay. Especially, in an emergency of self-driving environment linked to an ITS(Intelligent Traffic System) that requires low latency and high reliability, information should be transmitted and processed very quickly. That is a case in point where delay plays a very sensitive role. In this paper, we study the SDN architecture in emergencies during autonomous driving and conduct analysis through simulation of the correlation with the cell layer in which the vehicle should request relevant information according to the information flow. For simulation: As the Data Rate of 5G is high enough, we can assume the information for neighbor vehicle support to the car without errors. Furthermore, we assumed 5G small cells within 50 ~ 250 m in cell radius, and the maximum speed of the vehicle was considered as a 30km ~ 200 km/hour in order to examine the network architecture to minimize the delay.

Effective Motion Compensation Method of H.264 on Multimedia Mobile System (멀티미디어 모바일 시스템에서의 효율적인 H.264 움직임 보간법)

  • Jeong, Dae-Young;Ji, Shin-Haeng;Park, Jung-Wook;Kim, Shin-Dug
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.467-473
    • /
    • 2007
  • Power-aware design is one of the most important areas to be emphasized in multimedia mobile systems, in which data transfers dominate the power consumption. In this paper, we propose a new architecture for motion compensation (MC) of H.264/AVC with power reduction by decreasing the data transfers. For this purpose, a reconfigurable microarchitecture based on data type is proposed for interpolation and it is mapped onto the dedicated motion compensation IP (intellectual property) effectively without sacrificing the performance or the system latency. The original quarter-pel interpolation equation that consists of one or two half-pel interpolations and one averaging operation is designed to have different execution control modes, which result in decreasing memory accesses greatly and maintaining the system efficiency. The simulation result shows that the proposed method could reduce up to 87% of power consumption caused by data transfers over the conventional method in MC module.

Design and Performance Evaluation of Expansion Buffer Cache (확장 버퍼 캐쉬의 설계 및 성능 평가)

  • Hong Won-Kee
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.489-498
    • /
    • 2004
  • VLIW processor is considered to be an appropriate processor for the embedded system, provided with high performance and low power con-sumption due to its simple hardware structure. Unfortunately, the VLIW processor often suffers from high memory access latency due to the variable length of I-packets, which consist of independent instructions to be issued in parallel. It is because of the variable I-packet length that some I-packets must be placed over two cache blocks, which are called straddle I-packets, so that two cache accesses are required to fetch such I-packets. In this paper, an expansion buffer cache is proposed to improve not only the instruction fetch bandwidth, but also the power consumption of the I-cache with moderate hardware cost. The expansion buffer cache has a small expansion buffer containing a fraction of a straddle packet along with the main cache to reduce the additional cache accesses due to the straddle I-packets. With a great reduction in the cache accesses due to the straddle packets, the expansion buffer cache can achieve $5{\~}9{\%}$improvement over the conventional I-caches in the $Delay{\cdot}Power{\cdot}Area$ metric.

LEFT INFERIOR FRONTAL GYRUS RELATED TO REPETITION PRIMING: LORETA IMAGING WITH 128-CHANNEL EEG AND INDIVIDUAL MRI

  • Kim, Young-Youn;Kim, Eun-Nam;Roh, Ah-Young;Goong, Yoon-Nam;Kim, Myung-Sun;Kwon, Jun-Soo
    • Proceedings of the Korean Society for Cognitive Science Conference
    • /
    • 2005.05a
    • /
    • pp.151-153
    • /
    • 2005
  • We investigated the brain substrate of repetition priming on the implicit memory taskusing low-resolution electromagnetic tomography (LORETA) with high-density 128 channel EEG and individual MRI as a realistic head model. Thirteen right-handed, healthy subjects performed a word/nonword discrimination task, in which the words and nonwords were presented visually,and some of the words appeared twice with a lag of one or five items. All of the subjects exhibited repetition priming with respect to the behavioral data, in which a faster reaction time was observed to the repeated word (old word) than to the first presentation of the word (new word). The old words elicited more positive-going potentials than the new words, beginning at 200 ms and lasting until 500 ms post-stimulus. We conducted source reconstruction using LORETA at a latency of 400 ms with the peak mean global field potentials and used statistical parametric mapping for the statistical analysis. We found that the source elicited by the old words exhibited a statistically significant current density reduction in the left inferior frontal gyrus. This is the first study to investigate the generators of repetition priming using voxel-by-voxel statistical mapping of the current density with individual MRI and high-density EEG.

  • PDF

A Data Prefetching Scheme Exploiting the Grain Size in Parallel Programs using Data Arrays (데이타 배열을 사용하는 병렬 프로그램에서 그레인 크기를 이용한 데이타 선인출 기법)

  • Jung, In-Bum;Lee, Joon-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.101-108
    • /
    • 2000
  • The data prefetching scheme is an effective technique to reduce the main memory access latency by exploiting the overlap of processor computations with data accesses. However, if the prefetched data replicate the useful existing data in the cache memory and they are not being used in computations. performances of programs are aggravated. This phenomenon results from the lack of correct predictions for data being used in the future. When parallel programs exploit the data arrays for computations, the grain size is useful information for data prefetching scheme because it implies the range of data using in computations. Based on this information, we suggest a new data prefetching scheme exploited by the grain size of the parallel program. Simulation results show that the suggested prefetching scheme improves the performance of the simulated parallel programs due to the reduction of bus transactions as well as useful prefetching operations.

  • PDF