• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.1
• /
• pp.80-90
• /
• 2016

Thanks to superior leakage energy efficiency compared to SRAM cells, STTRAM cells are considered as a promising alternative for a memory element in on-chip caches. However, the main disadvantage of STTRAM cells is high write energy and latency. In this paper, we propose a low-cost write filter (WF) cache which resides between the load/store queue and STTRAM-based L1 data cache. To maximize efficiency of the WF cache, the line allocation and access policies are optimized for reducing energy consumption of STTRAM-based L1 data cache. By efficiently filtering the write operations in the STTRAM-based L1 data cache, our proposed WF cache reduces energy consumption of the STTRAM-based L1 data cache by up to 43.0% compared to the case without the WF cache. In addition, thanks to the fast hit latency of the WF cache, it slightly improves performance by 0.2%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1113-1116
• /
• 2020

In the EH-WSN(Energy Harvesting Wireless Sensor Network), the routing protocol must consider the power condition of nodes such as residual power and energy harvesting rate. Many EH-WSN studies have emphasized the power aspect and make the urgency of sensed data less important. However, in applications such as environmental monitoring, stability and latency become more important issues than power efficiency for urgent data. In this paper, we designed a routing protocol that can set path according to data urgency. To this end, relay nodes are determined considering the urgency of date. Nodes with poor power do not participate in routing when normal data is generated, so that urgent data can be transmitted reliably with low latency. The performance of the proposed routing protocol is analyzed by computer simulation.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.8
• /
• pp.2436-2448
• /
• 1996

This paper presents the development of three types of network performance manager for IEEE 802.4 token bus networks that are a part of Manufacturing Automation Protocol(MAP). The performance managers attempt to keep the average data latency below a certain level specified for each priority class. All of the three performance managers are based on a set of fuzzy rules incorporating the knowledge on the relationship between data latency and parameters of the priority mechanism. These Fuzzy Network Performance Managers(FNPMs) have been evaluated via discrete event simulation to demonstrate their efficacy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.350-353
• /
• 2014

The large scale of data and operating systems in the trading environment in the cloud. However, technology is not an easy trading system of cloud-based data interoperability. Partially meets the data transfer rate and also the timeliness of the best trading system on the difficulties. Thus various techniques have been introduced for improving the throughput and low latency minimization problem. But the reality is, and the limits of speed improvements like Socket Direct Protocol, Offload Engine with TCP/IP is the hardware, the introduction effect is also low. In this paper, the proposed trading of the cloud XMDR-DAI based stock system. The proposed Safe Proper Time Method for optimal transmission speed and reliability.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.655-664
• /
• 2002

In many data-parallel applications massive parallelism can be easily extracted through data distribution. But it often causes very long communication latency. This paper shows that task parallelism, which is extracted from data-parallel programs, can be exploited to hide such communication latency Unlike the most previous researches over exploitation of task parallelism which has not been considered together with data parallelism, this paper describes exploitation of task parallelism in the context of data parallelism. PCFG(Parallel Control Flow Graph) is proposed to represent a multithreaded program consisting of a few task threads each of which can include a few data-parallel loops. It is also described how a PCFG is constructed from a source data-parallel program through HDG(Hierarchical Dependence Graph) and how the multithreaded program can be constructed from the PCFG.

• Journal of Life Science
• /
• v.12 no.4
• /
• pp.375-382
• /
• 2002

The purpose of this experiment was to examine influence of acute exercise on nocturnal sleep which had been disrupted by caffeine(400mg$\times$3) thought the daytime. Six healthy young males aged 21.0$\times$0.2 yr with a history of low caffeine use. Subjects completed three conditions in a within-subject. At three conditions Sleep EEG were investigated: (1) nocturnal following quiet rest, (2) nocturnal sleep following the consumption of 1200mg of caffeine (3) nocturnal sleep following cycling at 60 min of 60% V $O_{2peak}$ with 1200mg of caffeine consumption. Sleep data were calculated for REM sleep, REM latency, sleep onset latency, sleep efficiency, sleep stages, SWS. Those data were analyzed using repeated-measures ANOVA of change scores. A main effect to, drug(caffeine) indicated that caffeine elicited sleep disturbance that is, TST and sleep onset latency increase and sleep efficiency and stage 4 decrease. The effects of exercise on sleep following caffeine intake generally improve sleep that is, stage 2, 3 and SWS increase and sleep onset latency decrease. A condition effect for sleep indicated sleep improvement after exercise Therefore The data supported a restorative theory of slow-wave sleep and suggest that acute exercise may be useful in promoting sleep and reducing sleep disturbance elevated by a high dose of caffeine.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.68-75
• /
• 2016

As the number of cores and IPs increase in multiprocessor system-on-chip (MPSoC), network-on-chip (NoC) has emerged as a promising novel interconnection architecture for its parallelism and scalability. However, minimization of the latency in NoC with legacy bus IPs must be addressed. In this paper, we focus on the latency minimization problem in NoC which accommodates legacy bus protocol based IPs considering the trade-offs between hop counts and path collisions. To resolve this problem, we propose separated address/data network for independent address and data phases of bus protocol. Compared to Mesh and irregular topologies generated by TopGen, experimental results show that average latency and execution time are reduced by 19.46% and 10.55%, respectively.

• Journal of Advanced Navigation Technology
• /
• v.14 no.5
• /
• pp.625-631
• /
• 2010

In this paper, robustness performance of SNUR message is compared with those of existing ones, RTCM(Radio Technical Commission for Maritime Services) v2 MT(Message Type) 18/19 and MT 20/21 under a poor broadcast condition such as temporary data loss or disconnection We defined the temp oral data loss as 2 second delay and reconnection after disconnection as 7 second latency, and then evaluated its robustness for each latency case by double differentiating the observables. Our result shows that SNUR protocol method can reduce the latency error of the existing RTCM messages by 30~60%. Moreover, a rover using SNUR message, whose latency error is bounded within 1/4 L1 wave length, can figure out its own fixed position continuously in spite of 7 second disconnection, while the other using RTCM message, whose error is larger than half wave length, cannot keep its previous fixed solution.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.339-346
• /
• 2013

As the need for security of SCADA systems is increasing, significant progress has been made in research on security of control protocol. However, very few security solutions were adapted to legacy SCADA system. The reasons for non-adoption are latency, cost and key management problem. We propose a low latency, economic security Solution to solve these issues. The proposed solution performs security function in data link layer and has minimum overhead to minimize latency. Furthermore, we try to solve the key management problem by providing systematic security keys and key distribution method.