• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.841-843
• /
• 2005

최근 64비트 CPU의 시장 출시가 활발해지고 있으며, 메모리 모듈 또한 대용화가 이루어지고 있다. 이에 대용량 메모리를 64비트 CPU 플랫폼에서 효과적으로 테스트하는 방법을 개발할 필요성이 대두되고 있다. 본 논문에서는 x86-64 기반 리눅스 2.6.11 커널에서 물리 메모리의 테스트 영역을 확장하는 기법을 제안한다. 제안된 기법에는 응용이나 커널에서 물리 메모리에 대한 직접 접근, 프로그램을 사용자가 원하는 물리 메모리로 배치, 프로그램의 동적 재배치 등의 방법을 통해 테스트 영역을 확장 한다. 현재 64 비트 CPU를 지원하는 OS는 리눅스와 윈도우즈 64비트 에디션 등이 있다. 기존 리눅스 커널을 그대로 사용하였을 때 프로그램 등이 이미 사용 중인 물리 메모리에 대해서는 메모리 테스트를 수행 할 수 없었으나, 각 프로그램들을 물리 메모리에서 재배치하여, 원하는 곳의 메모리를 테스트 할 수 있도록 커널 수정을 통하여 구현하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.12
• /
• pp.568-575
• /
• 2008

Server consolidation by sever virtualization can make one physical machine(PM) to run several virtual machines simultaneously. Although It is attractive in cost, it has complex workload behaviors. For that reason, efficient resource management method is required. Dynamic relocation of virtual machine(VM)[3,4] by live migration[1,2] is one of resource management methods. We proposed SCOA(Server Consolidation Optimizing Algorithm) : a fine-grained load balancing mechanism worked on this dynamic relocation mechanism. We could obtain accurate resource distribution information through pointed physical machines on multi dimensional resource usage coordination, so we could maintain more balanced resource state. In this paper, we show the effectiveness of our algorithm by comparison of experimental results between SCOA and sandpiper[3] by software simulation.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.53-61
• /
• 2002

This paper propose an dynamic load balancing algorithm for heterogeneous distributed systems. The algorithm allows this tasks to be relocated. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. This paper also propose a load state measurement scheme which is designed particularly for heterogeneous systems. This results of the study show that the proposed algorithm outperforms the existing algorithms and is stable over a range of system attributes.

• Journal of Korean Society of Transportation
• /
• v.32 no.3
• /
• pp.239-247
• /
• 2014

In modern society, the transportation sector is having difficulties with mobility, safety, energy and environment issues so that solutions should be prepared progressively. Recently developed countries are paying greater attention to car-sharing systems as alternatives for relieving problems caused by increasing number of vehicles. Car-sharing systems are believed to keep the number of personal vehicles down and traffic congestion due to the fact that this system induces efficiency of vehicle operation. In this study, authors focused on solving the imbalance problem of car-sharing systems dynamically, to specifically improve one-way car sharing service. Therefore vehicle relocation algorithm was designed for maximizing profit of car sharing operators. For the application of the vehicle relocation algorithm among rental offices, we selected Haeundae-gu, Busan as the area of study. Rental offices have been designated to the zone centroid and we calculated the shortest path between rental offices by using TransCAD. In the study, we adapted MATLAB for the application of vehicle relocation algorithm. As the results, the total vehicle relocation time was estimated as 59.9 minutes. In addition, vehicle relocation algorithm was verified successfully by using Decision Tree method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.349-350
• /
• 2008

• Journal of the Korean Society for information Management
• /
• v.32 no.1
• /
• pp.153-169
• /
• 2015

The combined approach of using ego-centric network analysis and dynamic citation network analysis for refining the result of LDA-based topic modeling was suggested and examined in this study. Tow datasets were constructed by collecting Web of Science bibliographic records of White LED and topic modeling was performed by setting a different number of topics on each dataset. The multi-assigned top keywords of each topic were re-assigned to one specific topic by applying an ego-centric network analysis algorithm. It was found that the topical cohesion of the result of topic modeling with the number of topic corresponding to the lowest value of perplexity to the dataset extracted by SPLC network analysis was the strongest with the best values of internal clustering evaluation indices. Furthermore, it demonstrates the possibility of developing the suggested approach as a method of multi-faceted research trend detection.

• Annual Conference of KIPS
• /
• 2008.05a
• /
• pp.971-974
• /
• 2008

오늘날 네트워크는 장비의 발달로 인해 패킷 재배치(packet reordering)가 빈번히 일어나고 있다. 패킷 재배치는 TCP의 성능을 저하시키는 문제점을 가지는데, 이러한 문제점을 해결하기 위해 TCPDAD 메커니즘이 제안되었다. TCP-DAD는 중복 응답 임계값을 동적으로 조절함으로써, TCP의 패킷 재배치 문제를 완화하는 메커니즘이다. 하지만 TCP-DAD는 중복 응답 임계값을 조절하는 메커니즘에 문제가 있어 패킷 손실이 일어날 경우, 패킷 손실에 대한 복구가 늦어지고 심지어 재전송 타이머가 불필요하게 종료되어 TCP의 성능저하를 야기하기도 한다. 본 논문에서는 이러한 TCP-DAD의 문제점을 해결하기 위해 새로운 중복 응답 임계값 조절 기법으로 Smooth-dupthresh를 제안한다. NS-2를 이용한 시뮬레이션을 통해 Smooth-dupthresh 기법을 적용한 TCP-DAD가 기존의 TCP-DAD 보다 평균적으로 약 8% 향상된 성능을 보임을 증명하였다.

• 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.

• Proceedings of the Korea Database Society Conference
• /
• 1995.12a
• /
• pp.117-126
• /
• 1995

본 논문에서는 분산 환경에서 멀티미디어 문서를 공동 저작하는 시스템을 설계하는 데 있어서 고려해야 할 요구 사항들을 분석하였다. 또한 이들 요구 사항을 만족시키는 문서 구조 DMDA (Distributed Multimedia Document Architecture)의 기본 개념을 소개하였다. DMDA는 논리 구조 지향적이다. 표현 객체와 상대공간 합성의 도움으로 동적인 재배치가 가능하다. 또한 사용자 관점에 따를 문서 출력이 가능하고 버전 관리가 쉬운 구조로 되어 있다. 공동 작업 중에 문서 위에 행해진 표시나 주석은 표시객체에 담겨 분산된다 분산 멀티미디어 환경에서 문서를 편집 또는 공동 저작하는 시스템은 분산 객체들을 조합하여 하나의 문서를 만들 수 있기 위하여 논리 구조 지향적이고 구조 편집 지향적이어야 한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.62-68
• /
• 1983

We suggest a Quasi- dual graph model in consideration of dynamic module assignment and relocation to assign task optimally to two processors that have different processing abilities. An optimal module partitioning and allocation to minimize total processing cost can be achieved by applying shortest-path algorithm with time complexity 0(n2) on this graph model.