• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.168-169
• /
• 2017

모바일 디바이스는 제한된 프로세서 및 저장 공간, 배터리 수명의 문제로 인해 새로운 대안으로 모바일 엣지 컴퓨팅이 연구되고 있다. 그러나 모바일 디바이스는 제한된 자원을 활용하기 때문에 전력 공급에 제약이 따른다. 모바일 엣지 컴퓨팅의 자원으로 활용 되려면 전력 소비량에 대한 관리가 필요하다. 본 논문에서는 모바일 엣지 컴퓨팅 기반 모바일 디바이스의 전력 소비량 감소를 위한 작업 할당 알고리즘을 제안한다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.6
• /
• pp.669-676
• /
• 2008

The adaptive resource optimization problem in multi-input multi-output orthogonal frequency division multiple access (MIMO-OFDMA) systems is addressed. This paper, adaptive modulation and coding(AMC) and power control algorithms is proposed with SFC(Space-Frequency Coding), which aims to maximize the system capacity based on the CQI(Channel Quality Information). Firstly, power level is decided to each sub-channels with received feedback signal to noise ratio(SNR). In the second step, sub-carriers are allocated according to modulation type. Simulation results show that the proposed algorithm achieves a better performance than conventional algorithm in terms of capacity.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.82-91
• /
• 2009

Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1138-1147
• /
• 2012

In this paper, an efficient power control based MF-TDMA resource allocation scheme is proposed for next generation military satellite communication systems. The proposed scheme has the flexibility is used to support heterogeneous terminals with differ in transmission capabilities. The method can be divided into two parts : burst size calculation and burst structure determination. At first, we estimate the link budget taken into account a dynamic satellite link state variation. Then, applicable ACM level and burst size is chosen. In burst structure determination phase, we reorganize the burst structure in time-frequency domain by controlling limited power, bandwidth, time resources. In particular, we compensate the power spectral density among different terminals to integrate them in same transponder, Furthermore, we increase the packing efficiency by controlling the ACM level of the burst in applicable power spectral density range. Simulation results show that the method increase the spectral efficiency and burst packing efficiency. In addition, slot allocation rejection ratio is successfully reduced.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.52-57
• /
• 2007

한정된 자원을 효율적으로 사용해야하는 이동통신망에서 멀티미디어 서비스 요구에 따른 무선 트래픽 채널을 할당하는 기법은 무선이라는 특수 환경으로 인해 제약을 받을 수밖에 없다. 이동망의 기지국의 경우 여러 무선 가입자 보드로부터 요구되는 서비스별 트래픽요구에 대한 채널 할당과 이에 대한 메인보드에서 처리해야 하는 작업 스케줄링은 무선과 CPU라는 서로 다른 환경을 잘 매핑하는 과제를 안고 있다. 본 논문에서는 음성과 데이터 호를 동시에 서비스하는 셀룰러 시스템에서 멀티미디어 서비스 트래픽 특성을 고려한 주파수할당과 작업 스케줄링이라는 두 가지 요소를 접목할 때 인공지능알고리즘인 유전자알고리즘을 이용하는 방법과 이에 적합한 작업 스케줄링 방식을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.470-473
• /
• 2000

차세대 셀룰라 이동 통신 시스템에서는 멀티미디어 서비스를 지원 할 수 있는 충분한 대역폭이 제공되어야 하며 QoS(Quality-of-Service)를 보장해야 한다. 본 논문에서는 셀 내에서의 호발생 위치를 추정하여 인접셀을 나누어 대역폭 할당을 하므로써 자원의 낭비를 줄이고 신규호와 핸드오프 호의 공유 대역폭을 두어 Blocking확률과 Dropping확률을 감소시키는 새로운 무선 대역폭 할당 알고리즘을 제안하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1120-1127
• /
• 2007

In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.577-582
• /
• 2012

If the mobile station requests the channel allocation in mobile networks, switching center is assigned a channel to mobile station that belong to each base station. Channel allocation schemes is a fixed channel allocation, dynamic channel allocation and a hybrid approach that combines the two forms. To assign a frequency well to use resources efficiently to provide quality service to our customers. In this paper, we proposed method to assign frequencies to minimize interference between channels and to minimizes the number of searching time. The proposed method by the genetic algorithm to improve accuracy and efficiency of the verification steps and reproduction stages were used. In addition, the proposed method by comparing with other methods showed that proposed method is better through the simulations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.45-47
• /
• 2012

응용 프로그램의 QoS를 보장하기 위하여 태스크들에게 지분을 부여하고 단위 시간동안 각 태스크에게 주어진 지분만큼의 CPU 자원을 할당하는 비례 지분 알고리즘들이 많이 연구되었다. 대부분 비례 지분 알고리즘들은 태스크 수, 지분 분포 등의 다양한 환경에 따라 동작 방식이 다르기 때문에 이러한 인자들은 시스템의 공정한 자원 할당에 많은 영향을 준다. 본 논문에서는 비례 지분 알고리즘을 동작 방식에 따라서 분류한 후, 태스크의 수와 더불어 지분의 편향성, 즉 지분 분포에 따라 QoS 공정성 결과를 분석한다. 분석결과, 비례 지분 알고리즘에서는 태스크의 수 뿐 만 아니라 지분의 분포 역시 QoS 공정성에 많은 영향을 주며, 각 환경에 따라 효율적인 최적의 알고리즘들이 존재함을 확인하였다. 제안된 분석 결과는 QoS를 지원하는 다양한 시스템에서 효율적인 비례 지분 알고리즘을 선택하여 시스템의 신뢰성을 향상시킬 수 있다.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.439-448
• /
• 2017

The workloads of large high-performance computing (HPC) scientific applications are steadily becoming "bursty" due to variable resource demands throughout their execution life-cycles. However, the over-provisioning of virtual resources for optimal performance during execution remains a key challenge in the scheduling of scientific HPC applications. While over-provisioning of virtual resources guarantees peak performance of scientific application in virtualized environments, it results in increased amounts of idle resources that are unavailable for use by other applications. Herein, we proposed a memory resource reconfiguration approach that allows the quick release of idle memory resources for new applications in OS-level virtualized systems, based on the applications resource-usage pattern profile data. We deployed a scientific workflow application in Docker, a light-weight OS-level virtualized system. In the proposed approach, memory allocation is fine-tuned to containers at each stage of the workflows execution life-cycle. Thus, overall memory resource utilization is improved.