• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.357-362
• /
• 2007

In distributed systems like cluster systems, in order to get more performance improvement, the initial task placement system precisely estimates and correctly assigns the resource requirement by the process. The resource-based initial job placement scheme needs the prediction of resource usage of a task in order to fit it to the most suitable hosts. However, the wrong prediction of resource usage causes serious performance degradation in dynamic load balancing systems. Therefore, in this paper, to resolve the problem due to the wrong prediction, we propose a new load metric. By the new load metric, the resource-based initial job placement scheme can work without priori knowledge about the type of process. Simulation results show that the dynamic load balancing system using the proposed approach achieves shorter execution times than the conventional approaches.

• Korean Management Science Review
• /
• v.10 no.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.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.53 no.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.

• Journal of Internet Computing and Services
• /
• v.18 no.1
• /
• pp.37-41
• /
• 2017

In this paper, a platform was proposed that can service the streaming of location based real-time video-clip for smart-travel-services to work with PPL(Product Placement). The location information of drama like as LTE GPS and Beacon were used to provide the drama video with the PUSH service. And PPL DB with the attributes like as picture, video, music and URI(Uniform resource Identifier) was designed. As a result, this platform could provide the location based video streaming service that could replace the original PPL properties, color or shape, with the other properties by the interactive tagging the PPL DB in drama scenes. The proposed platform could provide the location based real-time video streaming service that can alter the PPL properties with the request of service provider.

• International Journal of Computer Science & Network Security
• /
• v.22 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• Journal of Information Processing Systems
• /
• v.15 no.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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• Journal of Communications and Networks
• /
• v.9 no.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.