• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.90-102
• /
• 2010

Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.5
• /
• pp.737-748
• /
• 1995

In this paper, we studyed the variables in the design of multichip memory modules with 4M$\times$1bit DRAM chips to construct high capacity and high speed memory modules. The configuration of the module was 8 bit, 16 bit, and 32 bit DRAM modules with employing 0.6 W, 70 nsec 4M$\times$1 bit DRAM chips. We optimized routing area and wiring density by performing the routing experiment with the variables of the chip allocation, module I/O terminal, the number of wiring, and the number of mounting side of the chips. The multichip module was designed to be able to accept MCM-L techiques and low cost PCB materials. The module routing experiment showed that it was an efficient way to align chip I/O terminals and module I/O terminals in parallel when mounting bare chips, and in perpendicular when mounting packaged chips, to set module I/O terminals in two sides, to use double sided substrates, and to allocate chips in a row. The efficient number of wiring layer was 4 layers when designing single sided bare chip mounting modules and 6 layers when constructing double sided bare chip mounting modules whereas the number of wiring layer was 3 layers when using single sided packaged chip mounting substrates and 5 layers when constructing double sided packaged chip mounting substrates. The most efficient configuration was to mount bare chips on doubled substrates and also to increase the number of mounting chips. The fabrication of memory multichip module showed that the modules with bare chips can be reduced to a half in volume and one third in weight comparing to the module with packaged chips. The signal propagation delay time on module substrate was reduced to 0.5-1 nsec.

• International Area Studies Review
• /
• v.14 no.3
• /
• pp.62-84
• /
• 2010

Accurate forecasting of volatility is of considerable interest in financial volatility research, particularly in regard to portfolio allocation, option pricing and risk management because volatility is equal to market risk. So, we attempted to delineate a model with good ability to forecast and identified stylized features of volatility, with a focus on volatility persistence or long memory in the Australian futures market. In this context, we assessed the long-memory property in the volatility of index futures contracts using three conditional volatility models, namely the GARCH, IGARCH and FIGARCH models. We found that the FIGARCH model better captures the long-memory property than do the GARCH and IGARCH models. Additionally, we found that the FIGARCH model provides superior performance in one-day-ahead volatility forecasts. As discussed in this paper, the FIGARCH model should prove a useful technique in forecasting the long-memory volatility in the Australian index futures market.

• Science of Emotion and Sensibility
• /
• v.22 no.4
• /
• pp.31-44
• /
• 2019

This study intended to investigate the effects of the subtitle location on the decreased working memory abilities caused by aging. A junior group (average age: 26, SD: 3.06, N=27) and a senior group (average age: 61.69, SD=4.18, N=26) participated in this study and they all performed N-back tasks which measured the working memory ability of the participants and video subtitle recognition tasks that assessed the most effectively recognized subtitle locations in the video. The results of the N-back task revealed slower response times and low accuracy rates in the senior group in comparison to the junior group, suggesting lower working memory abilities in the senior group vis-à-vis the junior group. The deterioration of working memory due to aging also negatively influenced the 'left-bottom' subtitle location in the video subtitle recognition task and positively influenced the 'left-center' location of the screen. The deterioration of working memory ability did not affect other subtitle locations. By examining the positive or negative effects of the deterioration of working memory ability as a function of age on subtitle locations, the present study suggests that the selection of suitable subtitle locations taking into account the ages of video viewers would cause information to be more effectively displayed on screen.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.642-648
• /
• 2006

In this paper, I have proposed a secure dynamic ID allocation protocol using mutual authentication on the RFID tag. Currently, there are many security protocols focused on the low-price RFID tag. The conventional low-price tags have limitation of computing power and rewritability of memory. The proposed secure dynamic ID allocation protocol targets to the high-performance RFID tags which have more powerful performance than conventional low-price tag by allocating a dynamic ID to RFID using mutual authentication based on symmetric encryption algorithm. This protocol can be used as a partial solution for ID tracing and forgery.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1461-1470
• /
• 1998

Bit allocation or quantizer assigning problem is a basic and essential issue in lossy picture coding. It could be represented as minimizing overall distortion with the given constraint that total bits should not exceed allowed bit-budget. Optimal solution can be found by Lagrangian method. However this method needs much computational time and memory. This paper presents an approximation method that uses the activity measure. The comparison between the existing activity measuring techniques are made, and mapping function from activity value to the quantizer is proposed. Under MPEG-1 Intra coding situation, simulations show almost identical results compared to the optimal ones obtained by Lagrangian method with reduced computational time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.136-140
• /
• 2015

Linux environment that is commonly used at embedded systems supports various file systems as Ext2, FAT, NTFS, etc. The file system that is equiped on the embedded system is mostly implemented on mini hard disk or flash memory. The types of the file system of the system make an effect on the performance of a application programs. The factors of file system performance on a same media are block read, block write and block free time. On these factors, block read and block free time are not so different according to the type of file systems. This paper evaluates the performance benchmark of file systems supported by linux about block allocation and write performance. The results obtained from various experiments shows the characteristics of each file system.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.140-149
• /
• 2018

Social data such as users' comments are unstructured in nature and up-to-date technologies for analyzing such data are constrained by the available storage space and processing time when fast storing and processing is required. On the other hand, it is even difficult in using a huge amount of dynamically generated social data to analyze the user features in a high speed. To solve this problem, we design and implement a topic association analysis system based on the latent Dirichlet allocation (LDA) model. The LDA does not require the training process and thus can analyze the social users' hourly interests on different topics in an easy way. The proposed system is constructed based on the Spark framework that is located on top of Hadoop cluster. It is advantageous of high-speed processing owing to that minimized access to hard disk is required and all the intermediately generated data are processed in the main memory. In the performance evaluation, it requires about 5 hours to analyze the topics for about 1 TB test social data (SNS comments). Moreover, through analyzing the association among topics, we can track the hourly change of social users' interests on different topics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.689-692
• /
• 2021

This paper is a prior study to improve the efficiency of offloading based on mobile agents to optimize allocation of computing resources and reduce latency that support user proximity of application services in a Fog/Edge Computing (FEC) environment. We propose an algorithm that effectively reduces the execution time and the amount of memory required when extracting optimal moving patterns from the vast set of spatio-temporal movement history data of moving objects. The proposed algorithm can be useful for the distribution and deployment of computing resources for computation offloading in future FEC environments through frequency-based optimal path extraction.