• 제목/요약/키워드: Resource Placement

검색결과 60건 처리시간 0.025초

동적 부하 분산 시스템에서 효율적인 작업 크기 계산을 통한 성능 개선 (Performance Improvement using Effective Task Size Calculation in Dynamic Load Balancing Systems)

  • 최민;김남기
    • 정보처리학회논문지A
    • /
    • 제14A권6호
    • /
    • pp.357-362
    • /
    • 2007
  • 클러스터와 같은 분산 시스템에서 초기 작업 배치 시, 할당할 프로세스의 자원 요구량을 정확히 예측하여 작업을 분배할 수 있다면 보다 나은 시스템 성능을 얻을 수 있게 된다. 이 때 임의의 작업을 적절한 호스트에 배치하기 위해서 자원 기반 초기 작업 배치 (resource-based initial job placement) 기법은 그 작업의 자원 사용량을 미리 예측할 필요가 있다. 하지만 잘못된 자원 예측은 동적 부하 분산 시스템의 성능을 크게 떨어뜨리는 원인이 된다. 따라서 본 논문에서는 잘못된 예측에 의한 문제를 해결하기 위해 새로운 부하 기준을 제안한다. 새로운 부하 기준을 사용한 자원 기반 초기 작업 배치 기법은 프로세스의 유형에 관한 사전 지식 없이도 동작하는 장점을 가진다. 실험을 통해 본 논문은 동적 부하 분산 시스템에서 제안하는 방식이 기존의 방식에 비해 향상된 성능을 가짐을 보인다.

지식베이스 시스템과 형식 방법을 이용한 효과적인 인적자원 관리 (Effective Human Resource Management through knowledge based systems and formal methods)

  • 서의호;변대호
    • 경영과학
    • /
    • 제10권2호
    • /
    • pp.145-161
    • /
    • 1993
  • Human Resource Management (HRM) performs numerous activities in organizations including employee recruitment, selection, placement, job analysis, training and development, and labor relations. POSCO (Pohang Steel Company) has concerned with employee management related to job placement and analysis among these activities because of the problems of over-complexity of placement precedures for the variety of recruits, the frequency of selection, a large amount of job descriptions / specifications, and their changes. This study, as a phase of developing the entire HRM systems in the organization, briefly summarizes the preliminary information related and describes an implementation of expert system as a means for effective job placement based on the principle of right-person-in-right-place with identifying aptitudes and personalities of employees. Thus, a new approach for developing a job description/specification using a formal specification language like Z is also proposed. The result of this study will cultivate the performance of personnel, prevent conflicts between labor and management, promote overall productivity of organization, as well as helpfully verify job analysis.

  • PDF

인공어초의 최적 배치모델 구축에 관한 연구 (A study on the optimal placement model building of artificial reef)

  • 손병규;정성재
    • 수산해양기술연구
    • /
    • 제53권2호
    • /
    • pp.160-168
    • /
    • 2017
  • In this study, we propose a method of optimal placement technique of artificial reef considering characteristics of sea areas and provide basic data for efficient budget execution. In addition, we will contribute to increasing the economic efficiency by improving the fisheries productivity by suggesting the scientific basis for the policy data and the increase of the catch through the resource creation based on the ecological information about the biology. Especially, in order to establish the effective disposition (optimum separation distance) of artificial reef considering characteristics of biological and engineering factors, it is necessary to review the artificial reef installation management regulations and investigate the biological effects of artificial reef facilities, is needed. Through this, it is expected that the ground data of the direction of the policy promotion will be derived by suggesting the placement condition of the artificial reef complex which can maximize the resource composition effect according to the target fish species.

위치기반의 드라마 콘텐츠서비스용 스마트 플랫폼 설계 (Smart Platform Design for Location based Drama Contents Services)

  • 최영호
    • 인터넷정보학회논문지
    • /
    • 제18권1호
    • /
    • pp.37-41
    • /
    • 2017
  • 본 논문에서는 PPL(Product Placement)을 변경할 수 있는 위치기반 실시간 비디오 클립을 스트리밍하는 스마트 플랫폼을 제안한다. 제안하는 플랫폼은 LTE 위치인식 기반의 GPS 좌표 값과 비콘 기술을 활용하여 Active Push형태로 사용자에게 촬영지의 드라마 영상을 제공한다. 또한 비디오 클립 내의 PPL 객체에 대한 사진, 동영상, 음악, URI(Uniform Resource Identifier) 형태의 DB를 구성하였다. 제안한 플랫폼에서는 비디오 클립 스트리밍 서비스 상황에서 PPL 객체 DB에 대한 인터액티브 태그 동기화를 통해 PPL 객체의 색깔과 모양을 변경할 수 있도록 하였다. 제안하는 플랫폼에서는 서비스 제공자의 요구에 따라 PPL 변경이 가능한 위치 기반 실시간 비디오 스트리밍을 가능하게 한다.

Virtual Machine Placement Methods using Metaheuristic Algorithms in a Cloud Environment - A Comprehensive Review

  • Alsadie, Deafallah
    • International Journal of Computer Science & Network Security
    • /
    • 제22권4호
    • /
    • pp.147-158
    • /
    • 2022
  • Cloud Computing offers flexible, on demand, ubiquitous resources for cloud users. Cloud users are provided computing resources in a virtualized environment. In order to meet the growing demands for computing resources, data centres contain a large number of physical machines accommodating multiple virtual machines. However, cloud data centres cannot utilize their computing resources to their total capacity. Several policies have been proposed for improving energy proficiency and computing resource utilization in cloud data centres. Virtual machine placement is an effective method involving efficient mapping of virtual machines to physical machines. However, the availability of many physical machines accommodating multiple virtual machines in a data centre has made the virtual machine placement problem a non deterministic polynomial time hard (NP hard) problem. Metaheuristic algorithms have been widely used to solve the NP hard problems of multiple and conflicting objectives, such as the virtual machine placement problem. In this context, we presented essential concepts regarding virtual machine placement and objective functions for optimizing different parameters. This paper provides a taxonomy of metaheuristic algorithms for the virtual machine placement method. It is followed by a review of prominent research of virtual machine placement methods using meta heuristic algorithms and comparing them. Finally, this paper provides a conclusion and future research directions in virtual machine placement of cloud computing.

A Network Load Sensitive Block Placement Strategy of HDFS

  • Meng, Lingjun;Zhao, Wentao;Zhao, Haohao;Ding, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권9호
    • /
    • pp.3539-3558
    • /
    • 2015
  • This paper investigates and analyzes the default block placement strategy of HDFS. HDFS is a typical representative distributed file system to stream vast amount of data effectively at high bandwidth to user applications. However, the default HDFS block placement policy assumes that all nodes in the cluster are homogeneous, and places blocks with a simple RoundRobin strategy without considering any nodes' resource characteristics, which decreases self-adaptability of the system. The primary contribution of this paper is the proposition of a network load sensitive block placement strategy. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results indicate that our work not only performs much better in the data distribution but also improves write performance more significantly than the others.

A Classification-Based Virtual Machine Placement Algorithm in Mobile Cloud Computing

  • Tang, Yuli;Hu, Yao;Zhang, Lianming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.1998-2014
    • /
    • 2016
  • In recent years, cloud computing services based on smart phones and other mobile terminals have been a rapid development. Cloud computing has the advantages of mass storage capacity and high-speed computing power, and it can meet the needs of different types of users, and under the background, mobile cloud computing (MCC) is now booming. In this paper, we have put forward a new classification-based virtual machine placement (CBVMP) algorithm for MCC, and it aims at improving the efficiency of virtual machine (VM) allocation and the disequilibrium utilization of underlying physical resources in large cloud data center. By simulation experiments based on CloudSim cloud platform, the experimental results show that the new algorithm can improve the efficiency of the VM placement and the utilization rate of underlying physical resources.

Scalable Service Placement in the Fog Computing Environment for the IoT-Based Smart City

  • Choi, Jonghwa;Ahn, Sanghyun
    • Journal of Information Processing Systems
    • /
    • 제15권2호
    • /
    • pp.440-448
    • /
    • 2019
  • The Internet of Things (IoT) is one of the main enablers for situation awareness needed in accomplishing smart cities. IoT devices, especially for monitoring purposes, have stringent timing requirements which may not be met by cloud computing. This deficiency of cloud computing can be overcome by fog computing for which fog nodes are placed close to IoT devices. Because of low capabilities of fog nodes compared to cloud data centers, fog nodes may not be deployed with all the services required by IoT devices. Thus, in this article, we focus on the issue of fog service placement and present the recent research trends in this issue. Most of the literature on fog service placement deals with determining an appropriate fog node satisfying the various requirements like delay from the perspective of one or more service requests. In this article, we aim to effectively place fog services in accordance with the pre-obtained service demands, which may have been collected during the prior time interval, instead of on-demand service placement for one or more service requests. The concept of the logical fog network is newly presented for the sake of the scalability of fog service placement in a large-scale smart city. The logical fog network is formed in a tree topology rooted at the cloud data center. Based on the logical fog network, a service placement approach is proposed so that services can be placed on fog nodes in a resource-effective way.

병렬 및 분산 시스템에서의 최적 고장 허용 자원 배치 (Optimal Fault-Tolerant Resource Placement in Parallel and Distributed Systems)

  • 김종훈;이철훈
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제27권6호
    • /
    • pp.608-618
    • /
    • 2000
  • 본 논문에서는 병렬 및 분산 시스템에서 자원을 배치함에 있어서 최소한의 자원 복사(copy)만을 사용하면서 임의의 노드 및 링크 상에서 고장이 발생하더라도 주어진 성능 요건을 만족하게 하는 자원의 최적 배치 방법을 모색하고자 한다. 이러한 성능 요건의 만족과 시스템의 고가용성을 위하여, 모든 노드들에 대하여 최소한의 자원 복사를 사용하여 그 노드나 혹은 인접한 노드 중 적어도 두 개 이상에 자원 복사가 존재해야 하는데, 이것을 본 논문에서는 고장 허용 자원 배치 문제라고 부른다. 병렬 및 분산 시스템은 그래프로 표현할 수가 있다. 여기에서 고장 허용 자원 배치 문제는 그래프 상에서 가장 작은 고장 허용 dominating set을 찾는 문제로 변환이 된다. Dominating set 문제는 NP-complete로 증명이 되어 있으며, 본 논문에서는 A* 알고리즘을 사용하여 상태 공간 탐색 방법으로 최적 배치를 구한다. 또한, 최적 배치를 찾는 데에 걸리는 시간을 단축시키기 위하여, 고장 허용 dominating set의 특성들을 분석하여 유용한 휴리스틱 정보들을 도출한다. 또한 여러가지 정형 그래프와 임의 그래프 상에서의 실험을 통하여, 이들 휴리스틱 정보들을 사용하여 최적 고장 허용 자원 배치를 찾는 데에 걸리는 시간을 상당히 줄일 수 있음을 보인다.

  • PDF

ASTAS: Architecture for Scalable and Transparent Anycast Services

  • Stevens, Tim;De Leenheer, Marc;Develder, Chris;De Turck, Filip;Dhoedt, Bart;Demeester, Piet
    • Journal of Communications and Networks
    • /
    • 제9권4호
    • /
    • pp.457-465
    • /
    • 2007
  • Native information provider(IP) anycast suffers from routing scalability issues and the lack of stateful communication support. For this reason, we propose architecture for scalable and transparent anycast services(ASTAS), a proxy-based architecture that provides support for stateful anycast communications, while retaining the transparency offered by native anycast. Dynamic resource assignment for each initiated session guarantees that a connection is established with the most suitable target server, based on network and server conditions. Traffic engineering in the overlay can be realized in an effective way due to the dissemination of aggregated state information in the anycast overlay. To minimize the total deployment cost for ASTAS architectures, we propose optimized proxy placement and path finding heuristics based on look-ahead information gathered in network nodes. Contrary to a regular integer linear program(ILP) formulation, these heuristics allow to optimize proxy placement in large networks. A use case on a European reference network illustrates that lower proxy costs enable proxy deployment closer to the end-users, resulting in a reduced network load.