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

It has been reported and verified in many design experiences that a judicious utilization of the page and burst access modes supported by DRAMs contributes a great reduction in not only the DRAM access latency but also DRAM's energy consumption. Recently, researchers showed that a careful arrangement of data variables in memory directly leads to a maximum utilization of the page and burst access modes for the variable accesses, but unfortunately, found that the problems are not tractable, consequently, resorting to simple (e.g., greedy) heuristic solutions to the problems. In this parer, to improve the quality of existing solutions, we propose 0-1 ILP-based techniques which produce optimal or near-optimal solution depending on the formulation parameters. It is shown that the proposed techniques use on average 32.2%, l5.1% and 3.5% more page accesses, and 84.0%, 113.5% and 10.1% more burst accesses compared to OFU (the order of first use) and the technique in [l, 2] and the technique in [3], respectively.

• Journal of Oriental Neuropsychiatry
• /
• v.28 no.4
• /
• pp.419-429
• /
• 2017

Objectives: We conducted a public health promotion program in Korean medicine for participants suffering from chronic insomnia in 2016~2017. A significant improvement effect was obtained through the 8-week herbal medicine treatment program. The object of this study is to report the results of this public health promotion program. Methods: Seventy patients diagnosed with chronic insomnia participated in the program, 49 of whom completed the program. Participants were treated with the herbal medicine for insomnia treatment for 8 weeks. A sleep diary was used to assess the total sleep time, sleep latency, and number of times the participants woke. The treatment satisfaction was then evaluated. Results: Through the 8-week herbal medicine treatment program, the total sleep time was significantly increased by $109.59{\pm}70.77$ minutes, the sleep latency was significantly decreased by $63.53{\pm}47.79$ minutes, and the number of times the participants woke was significantly decreased by $1.54{\pm}1.19$ times compared to the baseline (all, p=0.000). Among the 24 patients who were examined for the treatment satisfaction, the average score was 4.33 points of a total of 5 points. Six patients had adverse events. Except for one patient, the symptoms of other patients were mitigated by changing or discontinuing the herbal medicine. Conclusions: For patients with chronic insomnia, the 8-week herbal medicine treatment program was effective, with few side effects and high treatment satisfaction. This study has significance as this is the first report in Korea on the effect of a herbal medicine treatment program for chronic insomnia through Korean medicine public health promotion.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.551-560
• /
• 2005

To reduce the amount of the signaling messages occurred in movement, HMIPv6 has been introduced as the hierarchical mobility management architecture tor MIPv6 by regarding the locality of movements. When approaching the visited link, the authentication procedure should be done successfully prior to any motility support message exchanges. The AAA(Authentication, Authorization and Account) authentication service is applied gradually to the wireless LAN and Cellular networks. However, It may bring about the service latency for the sessions of requiring the real-time processing due to not providing the optimized signaling in local and frequent movements. In this paper, we propose the authentication architecture with 'delegation' scheme to reduce the amount of signaling message and latency to resume for local movements by integrating it with HMIPv6 architecture. We provide the integrated authentication model and analyze the performance and effectivity of our proposal and finally offer the analysis materials comparing to the exiting authentication scheme. It cuts down the cost to $33.6\%$ at average measurement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.33-38
• /
• 2016

In Android platform, as applications invoke various service functions through IPC (Inter-Process Communication), IPC performance is critical to the responsiveness in Android. However, Android offers long IPC latency of hundreds of micro-seconds due to complicated software stacks between the kernel Binder and the user-level process Context Manager. This separation provides modularity and flexibility, but degrades the responsiveness of services owing to additional context switching and inefficient request handling. In this paper, we anatomize Android IPC mechanisms and observe that 55% of IPC latency comes from the communication overhead between Binder and Context Manager. Based on this observation, this paper proposes a kernel Binder cache that retains a popular subset of service function mappings, thereby reducing the requests transferred to the user-level daemon. The proposed Binder cache is implemented in Android 5.0 and experimental results with various benchmarks show that the proposed cache architecture improves performance by 52.9% on average.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.493-501
• /
• 2013

A key challenge in massively multiplayer on-line game(MMOG) systems is providing real-time response latencies to the large number of concurrent game players. MMOG systems are a kind of soft real-time systems because requests from many players should be responded within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In order to meet their timing constraints, we propose priority scheduling methods that attempt to allocate preferentially more CPU bandwidth to serve an task with the higher priority level in the presence of transient overloading. The proposed scheduling methods are capable of enhancing real-time performance of MMOG system by maximizing the number of tasks with higher priority completed successfully within their deadlines while minimizing total average latency of tasks finished after given deadlines. The performance of these scheduling methods is evaluated through extensive simulation experiments.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2014

Data fusion techniques combine data from multiple radars and related information to achieve more accurate estimations than could be achieved by a single, independent radar. In this paper, we analyze delay and loss of packets to be processed by multiple radar and minimize data processing interval from centralized data processing operation as fusing multiple radar data. Therefore, we model radar network about central data fusion, and analyze delay and loss of packets inside queues on assuming queues respectively as the M/M/1/K using NS-2. We confirmed average delay time, processing fused multiple radar data, through the analysis data. And then, this delay time can be used as a reference time for radar data latency in fusion center.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.678-682
• /
• 2010

Compressed filesystem is frequently used in the embedded system to increase cost efficiency. One of the drawbacks of compressed filesystem is low read performance. Moreover, read-ahead mechanism that improves the read throughput of storage device has negative effect on the read performance of compressed filesystem, increasing read latency. Main reason is that compressed filesystem has too big read-ahead miss penalty due to decompression overhead. To solve this problem, this paper proposes new read technique considering kernel read-ahead mechanism for compressed filesystem. Proposed technique improves read throughput of device by bulk read from device and reduces decompression overhead of compressed filesystem by selective decompression. We implement proposed technique by modifying CramFS and evaluate our implementation in the Linux kernel 2.6.21. Performance evaluation results show that proposed technique reduces the average major page fault handling latency by 28%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4268-4290
• /
• 2015

Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.698-706
• /
• 2016

Orthogonal frequency division multiplexing (OFDM) has high peak to power ratio (PAPR). High PAPR makes problems such as signal distortion and circuit cost increasing. To solve the problemsm several PAPR reduction methods have been proposed. However, synchronization and orthogonality in OFDM systems may be a limitation to reduce latency for 5G networks. Generalized frequency division multiplexing (GFDM) is one of the possible solutions for asynchronous and non-orthogonal systems, which are more preferable to reduce the latency. However, multiple subsymbols in GFDM result in more superposition in time domain, GFDM has higher PAPR. Selective mapping (SLM) is one of PAPR reduction techniques in OFDM, which uses phase shift. The PAPR of GFDM SLM is compared to conventional GFDM and OFDM SLM in terms of PAPR reduction enhancement via numerical simulations. In addition, the out-of-band performance is analyzed in the aspect of asynchronous condition interference.