• ETRI Journal
• /
• v.36 no.6
• /
• pp.988-998
• /
• 2014

For memory-based big data storage, using hybrid memories consisting of both dynamic random-access memory (DRAM) and non-volatile random-access memories (NVRAMs) is a promising approach. DRAM supports low access time but consumes much energy, whereas NVRAMs have high access time but do not need energy to retain data. In this paper, we propose a new data migration method that can dynamically move data pages into the most appropriate memories to exploit their strengths and alleviate their weaknesses. We predict the access frequency values of the data pages and then measure comprehensively the gains and costs of each placement choice based on these predicted values. Next, we compute the potential benefits of all choices for each candidate page to make page migration decisions. Extensive experiments show that our method improves over the existing ones the access response time by as much as a factor of four, with similar rates of energy consumption.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.276-279
• /
• 1996

This paper deals with the method providing an exact solution to the 3-dimensional guillotine cutting stock problem. We suggest a 3-stage sutting method using the property that cubic material has to be cut into 2-dimensional planes firstly. This method requires more stocks that the general guillotine cutting methods but can save work force. By using the 1-dimensional dynamic programming, we reduce the computational time and the memory requirement in the 3-stage guillotine cutting method.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.3
• /
• pp.61-67
• /
• 2020

This paper is to propose a hybrid memory adaptor using next-generation nonvolatile memory devices such as phase-change memory to improve the performance limitations of OpenStack-based object storage systems. The proposed system aims to improve the performance of the account and container servers for object metadata management. For this, the proposed system consists of locality-based dynamic page buffer, write buffer, and nonvolatile memory modules. Experimental results show that the proposed system improves the hit rate by 5.5% compared to the conventional system.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.397-402
• /
• 2004

Location management is difficult in ad hoc networks due to many features such as the lack of a wired infrastructure, the scarce energy, memory and processing capabilities of nodes, and nodes’ movement which leads to a dynamic topology. These characteristics make the location management schemes designed for mobile cellular networks inefficient for ad hoc networks. New solutions for location management have therefore been proposed in the literature in the recent past. In this paper, a taxonomy of location management strategies is presented; some of the more interesting approaches proposed in the literature are critically discussed, highlighting their advantages and disadvantages.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.2
• /
• pp.1073-1083
• /
• 2015

As an empirical study focused on how transactive memory concept influence the four processes of knowledge growth, this study aimed at explaining the function of transactive memory in the dynamic process of knowledge growth. To verify the research model, this study carried out a path analysis of 130 team memebers and as a result, part of the team transactive memory measurements does affect the knowledge growth. Consequentially, transactive memory especially based on team level, is relevant with knowledge growth. According to team level, this study targeted at the team members, and by adopting the team transactive memory concept in Cognitive Psycology, theoretically explained and analysed how to approach personal knowledge in internal organizations. To accelerate the knowledge process, the work should be modified collaboratively by trusting the team members' duty relations more than specialized knowledge. Furthermore, managers had better assign team members the work where they can make the most of their personal knowledge, and this study presented that the whole team performance could be improved by doing that.

• Asia-Pacific Journal of Business
• /
• v.13 no.2
• /
• pp.23-37
• /
• 2022

Purpose - The purpose of this paper is to analyze the dynamic factors of the daily FX implied volatility based on the fractional integration methods focusing on long memory feature and structural changes. Design/methodology/approach - This paper uses the daily FX implied volatility data of the EUR-USD and the JPY-USD exchange rates. For the fractional integration analysis, this paper first applies the basic ARFIMA-FIGARCH model and the Local Whittle method to explore the long memory feature in the implied volatility series. Then, this paper employs the Adaptive-ARFIMA-Adaptive-FIGARCH model with a flexible Fourier form to allow for the structural changes with the long memory feature in the implied volatility series. Findings - This paper finds statistical evidence of the long memory feature in the first two moments of the implied volatility series. And, this paper shows that the structural changes appear to be an important factor and that neglecting the structural changes may lead to an upward bias in the long memory feature of the implied volatility series. Research implications or Originality - The implied volatility has widely been believed to be the market's best forecast regarding the future volatility in FX markets, and modeling the evolution of the implied volatility is quite important as it has clear implications for the behavior of the exchange rates in FX markets. The Adaptive-ARFIMA-Adaptive-FIGARCH model could be an excellent description for the FX implied volatility series

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.58-72
• /
• 2003

The objects generated by the keyword new in Java are automatically managed by the garbage collector Inside Java Virtual Machine (JVM) not like using the keywords free or delete in C or C++ programming environments. This provides a means of freedom of memory management burden to the application programmers. The garbage collector however. inherently has its own run time execution overhead. Thus it causes the performance degradation of JVM significantly. In order to mitigate the execution burden of a garbage collector, we propose a novel way of dynamic memory management scheme in Java environment. In the proposed method, the application programmers can explicitly manage the objects In a simple way, which in consequence the run-time overhead can be reduced while the garbage collector is under processing. In order to accomplish this, Java application firstly calls the APIs that arc implemented by native Jana, and then calls the subroutines depending on the JVM, which in turn support to keep the portability characteristic Java has. In this way, we can not only sustain the stability in execution environments. but also improve performance of garbage collector by simply calling the APIs. Our simulation study show that the proposed scheme improves the execution time of the garbage collector from 10.07 percent to 52.24 percent working on Mark-and-Sweep algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.9-17
• /
• 2009

In this paper, we propose a dynamic load distribution technique at the operating system level in mobile storage systems with a heterogeneous storage pair of a small form-factor and disk and a flash memory, which aims at saving energy consumption as well as enhancing I/O performance. Our proposed technique takes a combinatory approach of file placement and buffer cache management techniques to find how the load can be distributed in an energy and performance-aware way for a heterogeneous mobile storage air of a hard disk and a flash memory. We demonstrate that the proposed technique provides better experimental results with heterogeneous mobile storage devices compared with the existing techniques through extensive simulations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.147-160
• /
• 2010

The system virtualization shows interest in the consolidation of servers for the efficient utilization of system resources. There are many various researches to utilize a server machine more efficiently through the system virtualization technique, and improve performance of the virtualization software. These researches have studied with the activity to control the resource allocation of virtual machines dynamically focused on CPU, or to manage resources in the cross-machine using the migration. However, the researches of the memory management have been wholly lacking. In this respect, the use of memory is limited to allocate the memory statically to virtual machine in server consolidation. Unfortunately, the static allocation of the memory causes a great quantity of the idle memory and decreases the memory utilization. The underutilization of the memory makes other side effects such as the load of other system resources or the performance degradation of services in virtual machines. In this paper, we suggest the dynamic allocation of the memory in Xen to control the memory allocation of virtual machines for the utilization without the performance degradation. Using AR model for the prediction of the memory usage and ACO (Ant Colony Optimization) algorithm for optimizing the memory utilization, the system operates more virtual machines without the performance degradation of servers. Accordingly, we have obtained 1.4 times better utilization than the static allocation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.572-580
• /
• 2007

Wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Generally, the wireless sensor networks are composed of many deployed sensor nodes that were designed to be very cost-efficient in terms of production cost. For example, UC Berkeley's MICA motes have only 8-bit CPU, 4KB RAM, and 128KB FLASH memory space. Therefore, sensor operating systems that run on the sensor nodes should be able to operate efficiently in terms of the resource management. In this paper, we present a dynamic threads stack management scheme for space-constrained and multi-threaded sensor operating systems. In this scheme, the necessary stack space of each function is measured on compile-time. Then, the information is used to dynamically allocate and release each function's stack space on run-time. It was implemented in Nano-Qplus sensor operating system. Our experimental results show that the proposed scheme outperforms the existing fixed-size stack allocation mechanism.