• Korean Institute of Interior Design Journal
• /
• v.25 no.2
• /
• pp.41-49
• /
• 2016

The purpose of this study is to analyze the change and to compare to the difference of 'selective elements' and 'space-memory' focusing on the theory, 'selective attention' through the survey results. In this study, In this study, the lighting is considered a important factor in the change of 'selective elements'. this survey is to find the selective elements of participants and to measure the spatial sensitivity of respondents through 'self- test'. The analysis in this study is conducted by descriptive statistics, t-test and one way ANOVA by SPSS program 22. The results of this study are as following; Firstly, 'attention-element' could be classified with 4 types, 'shape', 'material', 'contrast' and 'combination'. 'shape' could divide into 'structure' and' furniture and object'. In case of 'material', it could section with 'pattern' and 'color'. Secondly, through the results of study, 'attention-element' is different each space during the day in detail. But we could know that 'shape' is the important element of the 'attention-elements' during the day through comparison of this result. That means users consider this as a important factor when they evaluate the space. Therefore, it is effective way designers to consider 'shape' as the first element when they want to conduct the special sensitivity of users in the space through planning. On the other hand, what selective elements of users are different by the lighting situation should be acknowledged by designers. And they should think the kinds of selective elements are more various when lighting turns on than turns off.. Thirdly, through the results such as the meaningful difference of space-memory of users according to the change of 'attention-elements', designers should judge about which kind of feeling of users to the space do you want lead in the design process. For the effective feedback between spaces and users to induce the same emotion of users, designers need to consider the unified design and the individual design both. Also, we will regard the differences in the users' emotion to the space according to the lighting situation when we design the space.

• KIISE Transactions on Computing Practices
• /
• v.20 no.9
• /
• pp.519-524
• /
• 2014

The operating systems in the system architecture, which is integrated several applications and modular electronic devices in the same computing device, demand partitioning technology for safety. Thus, operation system requires partition scheduler for partition scheduling. When we design partition scheduler in embedded system, which has small memory and low performance, such as space system, we must consider not only performance but also memory. In this paper, we introduces a linux-based memory efficient partition scheduler using partition bitmap. This partition scheduler demands small memory space and produce low partition switching overhead. The prototype was executed on a LEON4 processor, which is the Next Generation Multicore Processor (NGMP) in the space sector. In evaluation, this prototype shows accuracy, additional memory space and low partition switching overhead.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.760-767
• /
• 2010

There are many memory leak detection tools. However, programmers, who develop very large programs, tend to avoid testing their programs with memory leak detection tools since these tools require runtime and space overheads. Thus, we present a memory leak detection technique which enables programmers to test their modules in their unit test phase with low overheads. To achieve this goal, we extend the existing cyclic memory allocation technique and evaluate our memory leak detection technique on a tiny DBMS. In our experiments, we find our tool has reasonably low runtime and space overheads and it reports only a small number of false positives.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.1-8
• /
• 2015

Flash memory has advantages in that it is fast access speed, low-power, and low-price. Therefore, they are widely used in electronics industry sectors. However, the flash memory has weak points, which are the limited number of erase operations and non-in-place update problem. To overcome the limited number of erase operations, many wear leveling techniques are studied. They use many tables storing information such as erase count of blocks, hot and cold block indicators, reference count of pages, and so on. These tables occupy some space of main memory for the wear leveling techniques. Accordingly, they are not appropriate for low-power devices limited main memory. In order to resolve it, a wear leveling technique using bit array and Bit Set Threshold (BST) for flash memory. The proposing technique reduces the used space of main memory using a bit array table, which saves the history of block erase operations. To enhance accuracy of cold block information, we use BST, which is calculated by using the number of invalid pages of the blocks in a one-to-many mode, where one bit is related to many blocks. The performance results illustrate that the proposed wear leveling technique improve life time of flash memory to about 6%, compared with previous wear leveling techniques using a bit array table in our experiment.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2009

Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

• Proceedings of the IEEK Conference
• /
• 2001.06e
• /
• pp.39-42
• /
• 2001

This paper proposes the design technique of memory sparing to overcome memory hard error Memory Sparing is used to increase the reliability and availability of commercial, military and space computer such as a Data Server, Communication Server, Flight Computer in airplane and On-Board Computer in spacecraft. But the documents about this technique are rare and hard to find. This paper has some useful information about memory error correction and memory error management.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.632-638
• /
• 2005

This paper describes a new data-handing, based on a Spatial Human Interface as human indicator, to the Spatial-Knowledge-Tags (SKT) in the spatial memory the Spatial Human Interface (SHI) is a new system that enables us to facilitate human activity in a working environment. The SHI stores human activity data as knowledge and activity history of human into the Spatial Memory in a working environment as three-dimensional space where one acts, and loads them with the Spatial-Knowledge-Tags(SKT) by supporting the enhancement of human activity. To realize this, the purpose of SHI is to construct new relationship among human and distributed networks computers and sensors that is based on intuitive and simultaneous interactions. In this paper, the specified functions of SKT and the realization method of SKT are explained. The utility of SKT is demonstrated in designing a robot motion control.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2002.11a
• /
• pp.243-246
• /
• 2002

We proposed a new spatio-angularly multiplexed holographic memory system using moving windows and double-focusing lens, which can eleminate crosstalk due to two neighboring moving windows(MW) in the vertical direction of the conventional MW holographic memory system and demonstated its feasibility through optical experiments.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.151-158
• /
• 2019

With the recent advances of memory technologies, high-performance non-volatile memories such as non-volatile dual in-line memory module (NVDIMM) have begun to be used as an addition or an alternative to server-side storages. When these memory bus-connected storages (MBSs) are installed over non-uniform memory access (NUMA) servers, the distance between NUMA nodes and MBSs is one of the crucial factors that influence file processing performance, because the access latency of a NUMA system varies depending on its distance from the NUMA nodes. This paper presents the design and implementation of a high-performance logical volume manager for MBSs, called MBS-LVM, when multiple MBSs are scattered over a NUMA server. The MBS-LVM consolidates the address space of each MBS into a single global address space and dynamically utilizes storage spaces such that each thread can access an MBS with the lowest latency possible. We implemented the MBS-LVM in the Linux kernel and evaluated its performance by porting it over the tmpfs, a memory-based file system widely used in Linux. The results of the benchmarking show that the write performance of the tmpfs using MBS-LVM has been improved by up to twenty times against the original tmpfs over a NUMA server with four nodes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.5
• /
• pp.1036-1042
• /
• 2011

This paper presents an algorithm that conducts automatic memory scrubbing operated by dedicated hardwares. The proposed algorithm is designed so that it can scrub entire memory in a given scrub period, while minimally affecting the execution of flight softwares. The scrub controller is constructed in a form of state machines, which have two execution modes - normal mode and burst mode. The deadline event generator and period tick generator are designed in a separate way to support the behavior of the scrub controller. The proposed controller is implemented in VHDL code to validate its applicability. A simple version of the controller is also applied to mass memory modules used in STSAT-3.