• Journal of Digital Convergence
• /
• v.20 no.3
• /
• pp.343-348
• /
• 2022

Recently, With the recent rapid development of technology, the amount of data generated by various systems is increasing, and enterprise servers and data centers that have to handle large amounts of big data need to apply high-stability and high-performance storage devices even if costs increase. In such systems, SSD(solid state disk) that provide high performance of read/write are often used as storage devices. However, due to the characteristics of reading and writing on a page-by-page basis, erasing operations on a block basis, and erassing-before-writing, there is a problem that performance is degraded when duplicate writes occur. Therefore, in order to delay this performance degradation problem, over-provision technology of SSD has been applied internally. However, since over-provided technologies have the disadvantage of consuming a lot of storage space instead of performance, the application of inefficient technologies above the right performance has a problem of over-costing. In this paper, we proposed a method of measuring the performance and cost incurred when various over-provisions are applied in an SSD and predicting the system-optimized over-provided ratio based on this. Through this research, we expect to find a trade-off with costs to meet the performance requirements in systems that process big data.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1817-1818
• /
• 2007

무선센서네트워크는 컴퓨텅 기술능력과 무선 통신 능력을 지닌 센서 노드들을 이용하여 자율적으로 네트워크를 형성하고 상호간에 정보를 전달한다. 최근 무선센서네트워크 기술이 유비쿼터스 사회의 핵심 기술로 부각되면서 넓은 범위의 지역에서 센싱된 데이터를 활용하는 부분에 많은 연구가 진행되고 있다. 이러한 센서네트워크에서 확장성을 고려하기 위하여 위치기반의 라우팅 기법이 사용된다. 실제위치를 이용한 방법은 GPS를 사용하여 노드의 위치를 파악한다. 그러나 이 방법은 센서노드의 프로세서 및 메모리의 용량을 초과하고, 실내에서 사용할 수 없다는 단점이 있다. 따라서 본 논문에서는 가상좌표(Virtual coordinates) 개념을 이용하여 특정 비콘노드로 부터의 홉수를 계산하여 센서노드의 위치를 계산하고, Greedy 방식의 라우팅을 통하여 실제 위치를 이용한 방법과 비교한다.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.319-330
• /
• 2001

In virtual memory system, when a process attempts to access a page that is not resident in memory, the system generates and handles a page fault that causes unpredictable delay. So virtual memory system is not appropriate for the real-time system, because it can increase the deadline miss ratio of real-time task. In multimedia system, virtual memory system may degrade the QoS(quality of service) of multimedia application. Furthermore, in general-purpose operating system, whenever a new task is dynamically loaded, virtual memory system suffers from extensive page fault that cause transient overloading state. In this paper, we present efficient overloading control mechanism called RBPFH (Rate-Based Page Fault Handling). A significant feature of the RBPFH algorithm is page fault dispersion that keeps page fault ratio from exceeding available bound by monitoring current system resources. Furthermore, whenever the amount of available system resource is changed, the RBPFH algorithm dynamically adjusts the page fault handling rate. The RBPFH algorithm is implemented in the Linux operating system and its performance measured. The results demonstrate RBPFH\`s superior performance in supporting multimedia applications. Experiment result shows that RBPFH could achieve 10%∼20% reduction in deadline miss ratio and 50%∼60% reduction in average delay.

• Journal of Korea Game Society
• /
• v.11 no.1
• /
• pp.131-138
• /
• 2011

Recently in terrain rendeing, most researches introduce mipmap-based out-of-core methods for handling large sized DEM data which does not fit in main memory of general computer. However, mipmap-based LOD(level-of-detail) methods occur geometric errors which appear in data simplifying the higher LOD level. These geometric errors cause geometric popping effects where LOD level changes when viewpoint moves. In this paper, we propose vertex cohesion map for reducing geometric error. In preprocessing step, we generate vertex cohesion map, which is a texture that stores the vectors. By these vectors, each vertex will be cohered into the position in which the difference of gradient value is bigger than others. Therefore in terrain rendering, using vertex cohesion map can dramatically reduce the geometry popping effects rather than using mipmap.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.401-405
• /
• 1999

본 논문은 실시간성 서비스인 버스트 트래픽을 갖는 ATM(Asynchronous Transfer Mode)망에서 실시간 연결 수락 제어를 위한 종단간의 지연보장을 알고리즘을 이용하여 실시간 서비스 트래픽 서비스 품질의 성능에 대해 분석하였다. 셀 손실 확률은 QoS(Quality of Service)의 기준이 되므로 제안된 실시간 알고리즘은 일정한 버퍼 메모리 크기와 연결 요청에 대한 수락 여부 즉, 연결 수락 여부의 결정을 위한 하나의 큐잉 서비스를 필요로 한다. 이러한 트래픽 소스 각 타입에 대한 초과된 셀에 대한 셀 손실 확률은 트래픽 소스 타입 전체에 하나만 존재하더라도 요구를 충족시킬 수 없으므로, 본 논문에서 제안된 버스트 트래픽 특성에 따라 지연보장 알고리즘을 이용한 큐 서비스 방식은 기존의 종단간 지연 보장 알고리즘들에서 사용하던 씬 정렬을 이용하지 않고 몇 개의 FIFO 큐로 구성된 라운드로빈 큐를 이용하여 복잡성을 크게 감소시켰으며 실시간 서비스와 비실시간 서비스의 서비스방식을 효과적으로 결합하여 다양한 QoS를 보장해야 하는 ATM망에 효과적으로 적용할 수 있고 제안된 알고리즘에 산출되는 각각의 셀 손실 확률에 충분한 상한선을 제공하는 전형적인 매개변수를 사용하여 성능을 분석한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.1
• /
• pp.475-481
• /
• 2014

Recently, it is used to apply various improved methods to determine the cause of traffic accidents. However, most of vehicle black box usually start to store the video information by an event trigger in case that the impact value at that time exceeds the threshold impact value as compared the threshold impact value saved in advance with the current impact value. there are problems with above method that a lot video information should be saved in the memory card of the vehicle black box, and the user should delete the unwanted video information every time because of unclassified video store. In this paper, we propose the ontology-based context aware algorithm that the vehicle black box recognize the situation, and then remove the video data with a low weighting factor by itself for efficient memory management.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.2
• /
• pp.87-94
• /
• 2007

In active sonar system, aspect angle and length of a target can be estimated by calculating the cross-correlation between left and right split-beams of a LFM(Linear Frequency Modulated) signal. However, high-resolution performances in bearing and range are required to estimate the information of a remote target. Because a certain higher sampling frequency than the Nyquist sampling frequency is required in this performance, an over-sampling process through interpolation method should be required. However, real-time implementation of split-beam processing with over-sampled split-beam outputs on a COTS(commercial off-the-shelf) DSP platform limits its performance because of given throughput and memory capacity. This paper proposes a cumulative processing algorithm for split-beam processing to solve the problems. The performance of the proposed method was verified through some simulation tests. Also, the proposed method was implemented as a real-time system using an ADSP-TS101.

• Journal of Internet Computing and Services
• /
• v.17 no.2
• /
• pp.1-9
• /
• 2016

Users are provided infrastructure such as CPU, memory, network, and storage as IaaS (Infrastructure as a Service) service on cloud computing environments. However storage instances cannot support the maximum storage capacity that SQL servers can use, because the capacity of instances provided by service providers is usually limited. In this paper, we propose a method of securing mass storage capacity for SQL servers by sharing network disks with limited storage capacity. We confirmed through experiments that it is possible to secure mass storage capacity, which exceeds the maximum storage capacity provided by an instance with Amazon EBS on Amazon EC2 Windows environments, and it is possible to improve the overall performance of the SQL servers by increasing the disk capacity and performance.

• The Journal of Korean Association of Computer Education
• /
• v.18 no.2
• /
• pp.83-90
• /
• 2015

In an virtualization environment, several virtual machines use physical resources together. If a specific virtual machine uses to much of the computing resources, other machines may not be working properly. There are various method to solve this problem. Most representative study is to migrate a specified virtual machines to a different server, a target server. In this study, server load can be transferred to a target server by the remigrate of the load imposed on virtual machine. It is still problematic that virtual machine has to remigrate to a different server. This thesis has proposed the algorithm determining the remigration targets by applying dynamic thresholds to solve those problems. The migration algorithm applies dynamic thresholds according to the following criteria. Firstly, the usage of CPU, network and memory; secondly, decide the set of artificial machine and the target server based on the resources surpassed thresholds; thirdly, determine artificial machines based on the resource usage in the target server.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.1-11
• /
• 2010

Recently, there has been a growing interest in the processing of continuous queries over multiple data streams. When the arrival rates of tuples exceed the memory capacity of the system, a load shedding technique is used to avoid the system becoming overloaded by dropping some subset of input tuples. In this paper, we propose an effective load shedding algorithm for multi-way windowed joins over multiple data streams. Most previous load shedding algorithms estimate the productivity of each tuple, i.e., the number of join output tuples produced by the tuple, based on its "join attribute value" and drop tuples with the lowest productivity. However, the productivity of a tuple cannot be accurately estimated from its join attribute value when the join attribute values are unique and do not repeat, or the distribution of the join attribute values changes over time. For these cases, we estimate the productivity of a tuple based on its "arrival order" on data streams, rather than its join attribute value. The proposed method can effectively estimate the productivity of a tuple even when the productivity of a tuple cannot be accurately estimated from its join attribute value. Through extensive experiments and analysis, we show that our proposed method outperforms the previous methods in terms of effectiveness and efficiency.