• Title/Summary/Keyword: Resource Optimization Technique

Search Result 72, Processing Time 0.024 seconds

A Study on Scalability of Profiling Method Based on Hardware Performance Counter for Optimal Execution of Supercomputer (슈퍼컴퓨터 최적 실행 지원을 위한 하드웨어 성능 카운터 기반 프로파일링 기법의 확장성 연구)

  • Choi, Jieun;Park, Guenchul;Rho, Seungwoo;Park, Chan-Yeol
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.10
    • /
    • pp.221-230
    • /
    • 2020
  • Supercomputer that shares limited resources to multiple users needs a way to optimize the execution of application. For this, it is useful for system administrators to get prior information and hint about the applications to be executed. In most high-performance computing system operations, system administrators strive to increase system productivity by receiving information about execution duration and resource requirements from users when executing tasks. They are also using profiling techniques that generates the necessary information using statistics such as system usage to increase system utilization. In a previous study, we have proposed a scheduling optimization technique by developing a hardware performance counter-based profiling technique that enables characterization of applications without further understanding of the source code. In this paper, we constructed a profiling testbed cluster to support optimal execution of the supercomputer and experimented with the scalability of the profiling method to analyze application characteristics in the built cluster environment. Also, we experimented that the profiling method can be utilized in actual scheduling optimization with scalability even if the application class is reduced or the number of nodes for profiling is minimized. Even though the number of nodes used for profiling was reduced to 1/4, the execution time of the application increased by 1.08% compared to profiling using all nodes, and the scheduling optimization performance improved by up to 37% compared to sequential execution. In addition, profiling by reducing the size of the problem resulted in a quarter of the cost of collecting profiling data and a performance improvement of up to 35%.

A Study on the Optimal Allocation of Maintenance Personnel in the Naval Ship Maintenance System (해군 함정 정비체계 최적 정비인력 할당 모형 연구)

  • Kim, Seong-Woo;Yoon, Bong-Kyoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.3
    • /
    • pp.1853-1862
    • /
    • 2015
  • Naval maintenance system carries out repairs of battle ships. Korean Navy has four maintenance stations to maximize the readiness of the battle ships. Since each station can provide different services according to characteristics(specific size of ships, type of maintenances) and the maintenance ability of stations is predetermined, it has been one of complex problems for the Korean Navy to find the optimal resource allocation. We investigate the operation of the stations from the perspective of the human resource allocation which plays crucial role in the performance of the maintenance stations. Using a queueing model and optimization technique, we present a way to derive the optimal personnel allocation which minimize the waiting number of battle ships at each station, leading to the improvement of the military readiness in the Korean Navy.

Coalition based Optimization of Resource Allocation with Malicious User Detection in Cognitive Radio Networks

  • Huang, Xiaoge;Chen, Liping;Chen, Qianbin;Shen, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4661-4680
    • /
    • 2016
  • Cognitive radio (CR) technology is an effective solution to the spectrum scarcity issue. Collaborative spectrum sensing is known as a promising technique to improve the performance of spectrum sensing in cognitive radio networks (CRNs). However, collaborative spectrum sensing is vulnerable to spectrum data falsification (SSDF) attack, where malicious users (MUs) may send false sensing data to mislead other secondary users (SUs) to make an incorrect decision about primary user (PUs) activity, which is one of the key adversaries to the performance of CRNs. In this paper, we propose a coalition based malicious users detection (CMD) algorithm to detect the malicious user in CRNs. The proposed CMD algorithm can efficiently detect MUs base on the Geary'C theory and be modeled as a coalition formation game. Specifically, SSDF attack is one of the key issues to affect the resource allocation process. Focusing on the security issues, in this paper, we analyze the power allocation problem with MUs, and propose MUs detection based power allocation (MPA) algorithm. The MPA algorithm is divided into two steps: the MUs detection step and the optimal power allocation step. Firstly, in the MUs detection step, by the CMD algorithm we can obtain the MUs detection probability and the energy consumption of MUs detection. Secondly, in the optimal power allocation step, we use the Lagrange dual decomposition method to obtain the optimal transmission power of each SU and achieve the maximum utility of the whole CRN. Numerical simulation results show that the proposed CMD and MPA scheme can achieve a considerable performance improvement in MUs detection and power allocation.

Using Importance-Performance Analysis to Improve Traffic Information Disseminating Strategies on VMS (IPA를 이용한 VMS 서비스 평가와 정보제공 개선전략)

  • Choi, Keechoo;Choi, Yoon-Hyuk;Oh, Seung Hwoon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.5D
    • /
    • pp.747-754
    • /
    • 2006
  • Real-time traffic information disseminated through VMS is known to have effects not only on driver to plan a route choice, detour the congestion, and cope with incident, but also on VMS operator to manage the traffic volume indirectly. But, the dissemination of traffic information is operated in the side of provider, not of user. Importance-Performance analysis (IPA) offers a simple, useful method for simultaneously considering both the importance and performance dimensions when evaluating or improving strategy. This technique has been successfully used in a variety of settings to define priorities and guide resource optimization decisions. This study uses IPA to evaluate traffic information strategies through VMS to make resource improvement recommendations. It gained 760 samples by field surveys, which are conducted in Korean Thanksgiving Day, weekday and weekend at the service areas of expressways. The results indicate that the motivations in quadrant I (concentrate here) are dissemination of exactly information and quick transmission, while distance of VMS, most drivers are not satisfied with that is located in quadrant III (low priority).

Location-based Area Setup Method and Optimization Technique for Deviation Detection (위치기반 영역 설정 방법 및 이탈 검출의 최적화 기법)

  • Choi, Jae-Hyun;Lim, Yang-Won;Lim, Han-Kyu
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.4
    • /
    • pp.19-28
    • /
    • 2014
  • Recent advancements in the IT industry have made daily life more convenient than ever before. In particular, studies have focused on the position detection of individuals using the GPS in smartphones, and this application has been utilized actively in emergency rescue organizations. However, existing methods send the location information of a user to a predetermined guardian set by the user or to a control center when the user enters into or deviates from a predetermined space. Such spaces are created by an arbitrary radius, thereby making it difficult to set a detailed area by using an existing radius-area creation method in an unstructured space and path with a specific road, such as for trekking, amusement parks, or mountaineering. This study proposes a novel method for setting up an area by connecting multiple radii to improve the existing radius-area creation method in order to easily set a detailed area in smart devices or on the Internet. In addition, an optimization method for resource use is proposed by comparing the operation results in which a user's location is detected by using the proposed location-based area setup method and deviation detection.

Optimization of Data Placement using Principal Component Analysis based Pareto-optimal method for Multi-Cloud Storage Environment

  • Latha, V.L. Padma;Reddy, N. Sudhakar;Babu, A. Suresh
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.248-256
    • /
    • 2021
  • Now that we're in the big data era, data has taken on a new significance as the storage capacity has exploded from trillion bytes to petabytes at breakneck pace. As the use of cloud computing expands and becomes more commonly accepted, several businesses and institutions are opting to store their requests and data there. Cloud storage's concept of a nearly infinite storage resource pool makes data storage and access scalable and readily available. The majority of them, on the other hand, favour a single cloud because of the simplicity and inexpensive storage costs it offers in the near run. Cloud-based data storage, on the other hand, has concerns such as vendor lock-in, privacy leakage and unavailability. With geographically dispersed cloud storage providers, multicloud storage can alleviate these dangers. One of the key challenges in this storage system is to arrange user data in a cost-effective and high-availability manner. A multicloud storage architecture is given in this study. Next, a multi-objective optimization problem is defined to minimise total costs and maximise data availability at the same time, which can be solved using a technique based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions known as the Pareto-optimal set.. When consumers can't pick from the Pareto-optimal set directly, a method based on Principal Component Analysis (PCA) is presented to find the best answer. To sum it all up, thorough tests based on a variety of real-world cloud storage scenarios have proven that the proposed method performs as expected.

Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs

  • Kumar, Adarsh;Gopal, Krishna;Aggarwal, Alok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.1119-1143
    • /
    • 2014
  • Lightweight trust mechanism with lightweight cryptographic primitives has emerged as an important mechanism in resource constraint wireless sensor based mobile devices. In this work, outlier detection in lightweight Mobile Ad-hoc NETworks (MANETs) is extended to create the space of reliable trust cycle with anomaly detection mechanism and minimum energy losses [1]. Further, system is tested against outliers through detection ratios and anomaly scores before incorporating virtual programmable nodes to increase the efficiency. Security in proposed system is verified through ProVerif automated toolkit and mathematical analysis shows that it is strong against bad mouthing and on-off attacks. Performance of proposed technique is analyzed over different MANET routing protocols with variations in number of nodes and it is observed that system provide good amount of throughput with maximum of 20% increase in delay on increase of maximum of 100 nodes. System is reflecting good amount of scalability, optimization of resources and security. Lightweight modeling and policy analysis with lightweight cryptographic primitives shows that the intruders can be detection in few milliseconds without any conflicts in access rights.

Security Constrained Optimal Power Flow Incorporating Load Curtailment Schedule (부하차단량을 고려한 상정사고 절약 최적조류계산 알고리즘 개발)

  • Chung, Koo-Hyung;Kang, Dong-Joo;Kim, Bal-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2005.07a
    • /
    • pp.801-803
    • /
    • 2005
  • Fundamentally, success of the competitive electricity market is dependent on efficient market design. However, since electricity incorporates various physical constraints as other commodities, the resource assignment (i.e., dispatch scheduling) is also one of requisites for the successful operation of electricity market. Therefore, efficient dispatch scheduling is an important issue to succeed in the deregulated electricity market and the efficiency of this electricity market may be considerably increased by systematic studies on dispatch scheduling algorithm and corresponding constraints, especially system security. Moreover, contrary to traditional vertically-integrated electric power industry condition, since various decision-makings in deregulated electricity market are directly connected with market participants' benefits, only rational dispatch scheduling algorithm can convince these participants. Therefore, it can provide a basis of grievance prevention. In this paper, we propose an algorithm for security constrained dispatch scheduling with respect to load curtailment. Proposed algorithm decomposes the dispatch problem into a master problem corresponding to basecase optimal power flow (OPF) and several subproblems corresponding a series of contingencies using two-stage optimization technique.

  • PDF

External Context-Based Selective Resource Utilization Control Technique for Reducing Boot Time of Linux-Based Robot System (리눅스 기반 로봇 시스템의 부트 시간 단축을 위한 외부 컨텍스트 기반 선별적 자원 사용률 조정 기법)

  • Lee, Eunseong;Kim, Jungho;Yang, Beomjoon;Hong, Seongsoo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2017.01a
    • /
    • pp.147-150
    • /
    • 2017
  • 지능형 로봇의 사용자 품질을 결정하는 주요 요소들 중 하나는 짧은 부트 시간이다. 로봇 시스템에서는 부팅 과정 중에 침입자인지, 자택 순찰, 개인 비서, 엔터테인먼트와 같은 다수의 응용들이 동시에 초기화되는데, 고품질의 사용자 경험을 제공하기 위해서는 사용자 응답성이 중요한 응용들이 우선적으로 초기화되어야한다. 이를 위해 리눅스 기반 로봇 시스템에서 부트 시간을 단축하기 위한 다양한 연구들이 진행되어 왔다. 하지만 이들은 단일 응용 각각에 대한 초기화 시간을 단축하는 연구들이며, 응용들 간에 CPU, 메모리, I/O와 같은 자원 경쟁에 의한 지연 요소를 고려하지 않고 있다. 본 논문에서는 응용들 간의 각종 자원경쟁들을 고려하여 사용자 응답성이 중요한 응용을 우선적으로 초기화하기 위한 외부 컨텍스트 기반 선별적 자원 사용률 조정기법을 제안한다. 이를 리눅스 기반 시스템 상에 구현하여 검증한 결과 응용의 부트 시간이 기존 대비 33.02% 단축됨을 확인했다.

  • PDF

Runoff estimation using modified adaptive neuro-fuzzy inference system

  • Nath, Amitabha;Mthethwa, Fisokuhle;Saha, Goutam
    • Environmental Engineering Research
    • /
    • v.25 no.4
    • /
    • pp.545-553
    • /
    • 2020
  • Rainfall-Runoff modeling plays a crucial role in various aspects of water resource management. It helps significantly in resolving the issues related to flood control, protection of agricultural lands, etc. Various Machine learning and statistical-based algorithms have been used for this purpose. These techniques resulted in outcomes with an acceptable rate of success. One of the pertinent machine learning algorithms namely Adaptive Neuro Fuzzy Inference System (ANFIS) has been reported to be a very effective tool for the purpose. However, the computational complexity of ANFIS is a major hindrance in its application. In this paper, we resolved this problem of ANFIS by incorporating one of the evolutionary algorithms known as Particle Swarm Optimization (PSO) which was used in estimating the parameters pertaining to ANFIS. The results of the modified ANFIS were found to be satisfactory. The performance of this modified ANFIS is then compared with conventional ANFIS and another popular statistical modeling technique namely ARIMA model with respect to the forecasting of runoff. In the present investigation, it was found that proposed PSO-ANFIS performed better than ARIMA and conventional ANFIS with respect to the prediction accuracy of runoff.