• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.9-12
• /
• 2011

가상화 기술은 물리적 컴퓨팅 자원의 추상화를 통해 다수의 운영 체제나 응용 프로그램이 물리적 서버의 자원을 공유하게 함으로써 소요비용을 절감하고 자원을 통합 관리할 수 있는 기술이다. 그러나 가상화 기반 클러스터에서는 클러스터를 이루는 물리적 서버들이 균형적으로 자원을 활용하지 못하고 특정 서버로 자원 활용률이 집중되는 현상(hotspot)이 발생 할 수 있다. 이에 본 논문에서는 Live migration 기술을 이용하여 가상화 클러스터의 자원 효율을 높이는 알고리즘을 제안한다. 제안 알고리즘은 hotspot의 원인이 되는 자원의 우선순위를 기반으로 가장 적합한 대상을 선정하여 가상머신을 이동시켜 클러스터의 자원 활용률의 균형을 도모하고 추가적인 hotspot의 발생을 최소화고 불필요한 Live migration을 방지하여 migration시에 발생하는 로드를 줄일 수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.293-298
• /
• 2004

To satisfy the requirements for QoS and acceptance ratio of the users using multimedia content service, it is required to control mechanism for QoS assurance and allocation of the stream server' resources based on CoS(Class of Service). To compare performance of the algorithm, we have classified the user by two classes (super class, base class) and control the acceptance ratio of user's requests by user's class information. We have experimented the test of network resources and test of processing time under server/client environment and agent environment. MA-URFA based on agent increases the acceptance ratio of super class and utilization ratio of network resources.

• Tunnel and Underground Space
• /
• v.32 no.5
• /
• pp.327-343
• /
• 2022

The standard work report for trucks was developed that records data on truck haulage operations in open-pit and underground mines, and to evaluate the performance of haulage operations. Work reports used in 5 mines in Korea was secured and analyzed, and items to be included in the standard work report were determined. By analyzing the formulas for key performance indicators (KPIs) proposed by the Global Mining Guidelines Group (GMG), it was possible to determine how to record time-related data. After selecting a limestone underground mine as a research area, the performance of haulage operations was evaluated using a standard work report. As a result, in terms of truck availability, uptime was 46.7%, and both physical and mechanical availability were 100%. In the case of utilization, use of availability was 88.2%, the asset utilization was 41.1%, and operating and effective utilization were 88.2% and 79.2%, respectively. Also, in terms of efficiency, operating efficiency was found to be 89.9%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.123-124
• /
• 2013

비용대비 작업 처리의 효율을 위해서는 사용자들의 작업 요구사항에 적절한 자원을 선택하고 요구 작업을 적절한 할당된 자원에 스케쥴링하는 플랫폼이 필수적이다. 또한 이러한 플랫폼은 사용자의 SLA 에 따라 작업 처리 기한 안에 요구 비용 이내로 작업을 처리할 수 있도록 결정을 내릴 수 있어야 하고 요구 작업량의 변화에 따라 즉각 대응을 하기 위하여 실시간적인 결정을 내릴 수 있어야 한다. 이러한 복잡한 결정 사항들을 최적 판단으로 대신 처리해주는 미들웨어로 클라우드 자원 브로커 시스템을 사용할 수 있다. 클라우드 자원 브로커 시스템은 작업 스케쥴링과 자원 프로비저닝 등이 가격, 처리시간에 중요한 선택 및 수행을 한다. 기존의 많은 논문들에서의 작업 스케줄링은 다중 테넌트 정책의 클라우드가 제공하는 사용자들간의 가상 머신 독립에 초점을 두어 하나의 가상 머신이 하나의 작업에 한정되도록 처리하는 방식이었다. 이는 병렬화의 정도가 낮은 어플리케이션의 경우 시스템 활용률이 낮아 자원 활용율이 떨어진다. 이를 다수의 작업을 멀티 태스킹, 멀티 스레드의 방법으로 하나의 가상 머신에서 처리하도록 하여 스레드 레벨 병렬화의 이점을 이용해 자원 이용률을 높임으로 효율을 높이고자 한다.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.69-76
• /
• 2005

To effectively use limited resources in wireless cellular networks it is necessary to predict exactly the amount of resources required by handoff calls at a future time. In this paper we propose a method which predicts the amount of resources needed by handoff calls more accurately than the existing method based on Wiener processes. The existing method uses the current demands to predict future demands. Although this method is much simpler than using traffic information from neighbor cells, its prediction error increases as time elapses, leading to waste of wireless resources. By using an exponential parameter to decrease the magnitude of error over time, we show in simulation how to outperform the existing method in resource utilization as well as in prediction of resource demands.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.146-153
• /
• 2006

It is required to have researches on efficient resource allocation schemes in an integrated voice and data CDMA system with the spreading of high-speed wireless internets. In this paper, we proposed a efficient resouce allocation scheme for providing a high speed data service in an integrated CDMA system. In an integrated voice/data CDMA system, resources for voice users are allocated with high priority and residual resources are allocated to the data service. In this case, it is necessary to use a resource allocation scheme for minimizing interference. In this paper, we first explain about a interference minimizing method and define QoS requirements. Based on the method, we proposed a efficient resource allocation scheme which satisfy the QoS requirements. The proposed scheme controls the transmission rate and delay of data users with a priority information such as the number of packets in a queue. From the simulation results, we show that the proposed scheme reduce the blocking probability and delay and improve the performance.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.119-122
• /
• 2000

차세대 네트워크인 MPLS 망에서 기존의 하드웨어 기반의 스위칭 방식인 ATM 스위치를 이용하여 MPLS 라우터, 즉 ATM LSR(Label Switching Router)를 구현 할 경우 ATM 스위치 상에서 MPLS 서비스와 ATM 서비스를 동시에 지원하기 위해서는 두 자원을 공유해야 하는 문제점이 발생한다. 본 연구에서는 두 가지의 자원을 동적으로 할당하기 위하여 ATM 스위치를 제어하는 GSMP를 이용하여 망 초기에는 Static 방식으로 라우팅을 되게 하고, 특정 링크상에 폭주가 발생할 때 Dynamic 요청신호를 GSMP에 전달해 링크 이용률이 가장 적은 포트를 이용함으로서 서비스의 효율을 향상 시켰다.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.297-306
• /
• 2002

Continuous multimedia applications require a guaranteed retricval and transfer rate of streaming data, which conventional file server mechanism generally does not provide. In this paper we describe a dynamic negotiated admission control and dick bandwidth scheduling framework for Continuous Media (CM : e.g., video) servers. The framework consists of two parts. One is a reserve-based admission control mechanism and the other part is a scheduler for continuous media streams with dynamic resource allocation to achieve higher utilization than non-dynamic scheduler by effectively sharing available resources among contending streams to improve overall QoS. Using our policy, we could increase the number of simultaneously running: clients that coo]d be supported and cot]d ensure a good response ratio and better resource utilization under heavy traffic requirements.

• Resources Recycling
• /
• v.31 no.2
• /
• pp.49-55
• /
• 2022

In the present study, the thermodynamic evaluation of the sulfate-roasting process was conducted to extract vanadium from the Korean vanadium titano-magnetite ore. The leaching efficiency of vanadium and other impurities was analyzed for varying roasting temperatures and addition of Na₂SO₄. In the case of sulfate roasting, the roasting temperature was 200 ℃ higher than that previously observed Na₂CO₃ roasting. However, the higher leaching efficiency of vanadium and lower leaching efficiency of other impurities, such as aluminum and silicon, were observed. The high selectivity for the extraction of vanadium in sulfate roasting would result from the reaction mechanism between SO₂ gas and vanadium concentrate.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.59-70
• /
• 2003

Proposed CCRSVP (Candidate Casting RSVP) algorithm is a new fast handoff method which uses advanced multicasting method and RSVP for IEEE 802.11 Wireless LAN (WLAN) environments. The proposed algorithm shows good performance in the handoff latency and the B/W efficiency aspect and guarantees QoS because it uses L2 information (BSSID) of WLAN and starts to reserve resources and multicast packets before L2 handoff completes. We also propose a Markov chain performance analysis model in which we can analyze the handoff performance of various handoff algorithms. Using the model, we compare bandwidth efficiency of the proposed algorithm with existing handoff algorithms which use RSVP by analyzing blocking probability of session, resource usage, and the average number of ongoing session in a cell. The results show that the proposed algorithm shows better performance than the existing algorithms in the above three performance aspects.