• 한국콘텐츠학회논문지
• /
• 제10권10호
• /
• pp.78-85
• /
• 2010

Map/Reduce 는 최근에 많은 주목을 받고 있는 클라우드 컴퓨팅을 구현하는 프로그래밍 모델이다. 이 모델은 여러 대의 컴퓨터를 이용해서 규모가 큰 데이터를 처리하는 어플리케이션에서 사용된다. 따라서 구성된 컴퓨터들을 효율적으로 사용하기 위해서 데이터를 적당한 크기로 나눈 다음 각각의 컴퓨터에 효율적으로 분배시키는 과정을 결정하는 것이 중요하다. 또한 모델을 구성하고 있는 Map 단계와 Reduce 단계를 실행하는 계획도 성능에 많은 영향을 줄 수 있다. 본 논문에서는 대용량의 데이터를 분리해서 Map 태스크를 실행하는 클라우드 컴퓨팅 노드의 성능과 네트워크의 상태를 고려한 후 각각의 컴퓨팅 노드에게 효율적으로 분배하는 방법을 제안한다. 그리고 Map 단계와 Reduce 단계에서 진행하는 방식을 튜닝하여 Reduce 작업의 처리속도를 향상시켰다. 제안된 방법은 대표적인 두 개의 Map/Reduce 어플리케이션을 이용하여 실험하고 조건에 따라 성능에 어떠한 결과를 미치는지 평가했다.

• 인터넷정보학회논문지
• /
• 제18권1호
• /
• pp.1-9
• /
• 2017

클라우드 컴퓨팅에서 바이오 영감 컴퓨팅 기술과 같은 연구들을 통해, 오프로딩 기법에서 새로운 차원의 솔루션이 개발되고 있다. 모바일 장비 사용의 증가 추세에 따라, 바이오 영감 기술은 모바일 클라우드 컴퓨팅의 발전에 기여하고 있다. 모바일 클라우드 컴퓨팅에서의 에너지효율적인 기법은 총 에너지 소비를 줄이기 위해 필요하지만, 지금까지의 연구는 태스크 분산을 위한 의사결정과정에서 에너지 소비에 관해 고려하지 않고 있다. 본 논문에서는 클라우드렛에서 데이터센터로의 오프로딩 전략으로 Particle Swarm Optimization (PSO) 방법을 제안하며, 이 과정에서 각 태스크는 입자(particle)로 표현된다. 입자의 수를 줄이기 위해 PSO를 적용하기 전에 K-means 클러스터링을 사용하여 수집한 태스크를 클라우드렛 상에서 분류하며, PSO 처리과정 중에는 모든 태스크를 대상으로 하지 않고 분류된 태스크에 따라 최적의 데이터 센터를 찾는다. 시뮬레이션 결과, 제안한 PSO기법이 처리 시간 관점에서는 전통적인 방법에 비해 조금 늦지만, 에너지 관점의 데이터 센터 선택에서는 우수함을 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3516-3541
• /
• 2018

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

• 인터넷정보학회논문지
• /
• 제20권1호
• /
• pp.25-37
• /
• 2019

심층 학습 및 온라인 생체 인식 기반 인증의 급속한 개발에 영감을 받아, 본 논문에서는 심층 학습을 기반으로 필체 인식 및 작성자 검증을 수행하는 수기 일회성 암호 인증 시스템을 제안한다. 본 논문에서는 수기로 작성된 숫자를 인식할 수 있는 합성곱 신경망과, 입력된 필체와 실제 사용자의 필체 사이 유사성을 계산할 수 있는 Siamese 신경망을 설계한다. 본 논문에서는 작성자 검증을 위한 NIST Speical Database 19 제 2판의 첫 번째 응용 사례를 제시한다. 본 논문이 제안하는 시스템은 네 장의 입력 이미지를 기반으로 한 숫자 인식 작업에서 98.58%, 작성자 검증 작업에서 93%의 정확도를 달성했다. 본 논문의 저자들은 제안한 필체 기반 생체 인식기술이 FIDO 프레임워크 기반의 다양한 온라인 인증 서비스에 활용될 수 있을 것이라 예상한다.

• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.987-992
• /
• 2016

This study introduces an example environment where wireless devices are mobile, devices use dynamic voltage scaling, devices and tasks are heterogeneous, tasks have deadline, and the computation and communication power is dynamically changed for energy saving. For this type of environment, the efficient system-level energy management and resource management for task completion can be an essential part of the operation and design of such systems. Therefore, the resources are assigned to tasks and the tasks may be scheduled to maximize a goal which is to minimize energy usage while trying to complete as many tasks as possible by their deadlines. This paper also introduces mobility of nodes and variable transmission power for communication which complicates the resource management/task scheduling problem further.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2021년도 추계학술발표대회
• /
• pp.128-130
• /
• 2021

Smart cities collect data from thousands of IoT-based sensor devices for intelligent application-based services. Centralized cloud servers support application tasks with higher computation resources but introduce network latency. Fog layer-based data centers bring data processing at the edge, but fewer available computation resources and poor task allocation strategy prevent real-time data analysis. In this paper, tasks generated from devices are distributed as high resource and low resource intensity tasks. The novelty of this research lies in deploying a virtual node assigned to each cluster of IoT sensor machines serving a joint application. The node allocates tasks based on the task intensity to either cloud-computing or fog computing resources. The proposed Task Allocation Strategy provides seamless allocation of jobs based on process requirements.

• ETRI Journal
• /
• 제37권2호
• /
• pp.212-221
• /
• 2015

As the amount of re-sequencing genome data grows, minimizing the execution time of an analysis is required. For this purpose, recent computing systems have been adopting both high-performance coprocessors and host processors. However, there are few applications that efficiently utilize these heterogeneous computing resources. This problem equally refers to the work of single nucleotide polymorphism (SNP) detection, which is one of the bottlenecks in genome data processing. In this paper, we propose a method for speeding up an SNP detection by enhancing the utilization of heterogeneous computing resources often used in recent high-performance computing systems. Through the measurement of workload in the detection procedure, we divide the SNP detection into several task groups suitable for each computing resource. These task groups are scheduled using a window overlapping method. As a result, we improved upon the speedup achieved by previous open source applications by a magnitude of 10.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5780-5802
• /
• 2017

Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4025-4041
• /
• 2020

Mobile edge computing (MEC) is capable of providing services to smart devices nearby through radio access networks and thus improving service experience of users. In this paper, an offloading strategy for the joint optimization of computing and communication resources in multi-user and multi-MEC overlapping scene was proposed. In addition, under the condition that wireless transmission resources and MEC computing resources were limited and task completion delay was within the maximum tolerance time, the optimization problem of minimizing energy consumption of all users was created, which was then further divided into two subproblems, i.e. offloading strategy and resource allocation. These two subproblems were then solved by the game theory and Lagrangian function to obtain the optimal task offloading strategy and resource allocation plan, and the Nash equilibrium of user offloading strategy games and convex optimization of resource allocation were proved. The simulation results showed that the proposed algorithm could effectively reduce the energy consumption of users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.2952-2971
• /
• 2016

Outsourcing jobs to a public cloud is a cost-effective way to address the problem of satisfying the peak resource demand when the local cloud has insufficient resources. In this paper, we studied the management of deadline-constrained bag-of-tasks jobs on hybrid clouds. We presented a binary nonlinear programming (BNP) problem to model the hybrid cloud management which minimizes rent cost from the public cloud while completes the jobs within their respective deadlines. To solve this BNP problem in polynomial time, we proposed a heuristic algorithm. The main idea is assigning the task closest to its deadline to current core until the core cannot finish any task within its deadline. When there is no available core, the algorithm adds an available physical machine (PM) with most capacity or rents a new virtual machine (VM) with highest cost-performance ratio. As there may be a workload imbalance between/among cores on a PM/VM after task assigning, we propose a task reassigning algorithm to balance them. Extensive experimental results show that our heuristic algorithm saves 16.2%-76% rent cost and improves 47.3%-182.8% resource utilizations satisfying deadline constraints, compared with first fit decreasing algorithm, and that our task reassigning algorithm improves the makespan of tasks up to 47.6%.