• 제목/요약/키워드: Efficient Execution System

검색결과 300건 처리시간 0.03초

모바일 환경에서의 지식기반 서비스제공을 위한 모바일 서비스 아키텍처 설계 (A Mobile Service Architecture for Knowledge-Based Services in Mobile Environments)

  • 오지훈;이재호
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제8권7호
    • /
    • pp.303-310
    • /
    • 2019
  • 우리의 생활과 밀접한 관계를 맺고 있는 모바일 환경은 다양한 사용자 요구사항과 맞물려 새로운 비즈니스 모델을 만들어 내고 있다. 이와 같은 시장 변화에 따라 구글의 Google NOW와 애플의 Siri와 같은 개인 비서와 같은 서비스가 탄생하였고, 우리나라에서도 사용자 모델을 기반으로 한 다양한 서비스를 통합하여 제공하기 위한 기술적 연구가 이루어지고 있다. 기술적 요구사항으로서 첫째, 여러 서비스 간의 데이터 공유가 가능해야 하고, 둘째, 서비스의 실행이 데이터 변화에 따른 비동기성을 지녀야 하며, 셋째, 서비스의 확장이 용이해야 한다는 점이다. 본 논문에서는 이러한 요구사항을 충족하기 위한 방안으로 블랙보드 아키텍처를 모바일 환경에 적용하여 지식기반 서비스제공을 위한 모바일 서비스 아키텍처로서 제시한다. 이를 통해 모바일 환경에서 다양한 서비스를 통합하고, 서비스 간의 데이터를 공유 관리하며, 비동기적으로 기능을 수행할 수 있도록 한다.

MLPPI Wizard: An Automated Multi-level Partitioning Tool on Analytical Workloads

  • Suh, Young-Kyoon;Crolotte, Alain;Kostamaa, Pekka
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권4호
    • /
    • pp.1693-1713
    • /
    • 2018
  • An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

An Efficient FPGA based Real-Time Implementation Shunt Active Power Filter for Current Harmonic Elimination and Reactive Power Compensation

  • Charles, S.;Vivekanandan, C.
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권4호
    • /
    • pp.1655-1666
    • /
    • 2015
  • This paper proposes a new approach of Field Programmable Gate Array (FPGA) controlled digital implementation of shunt active power filter (SAPF) under steady state and dynamic operations. Typical implementations of SAPF uses microprocessor and digital signal processor (DSP) but it limited for complex algorithm structure, absence of feedback loop delays and their cost can be exceed the benefit they bring. In this paper, the hardware resources of an FPGA are configured and implemented in order to overcome conventional microcontroller or digital signal processor implementations. This proposed FPGA digital implementation scheme has very less execution time and boosts the overall performance of the system. The FPGA controller integrates the entire control algorithm of an SAPF, including synchronous reference frame transformation, phase locked loop, low pass filter and inverter current controller etc. All these required algorithms are implemented with a single all-on chip FPGA module which provides freedom to reconfigure for any other applications. The entire algorithm is coded, processed and simulated using Xilinx 12.1 ISE suite to estimate the advantages of the proposed system. The coded algorithm is also defused on a single all-on-chip Xilinx Spartan 3A DSP-XC3SD1800 laboratory prototype and experimental results thus obtained match with simulated counterparts under the dynamic state and steady state operating conditions.

GSI(Global Single Instance)기반의 Global ERP 구축 방법론 및 적용 사례 (A Methodology for Global ERP Implementation Based on GSI(Global Single Instance) and Its Application)

  • 이재광;조민호
    • 한국IT서비스학회지
    • /
    • 제7권3호
    • /
    • pp.97-114
    • /
    • 2008
  • Many companies have implemented ERP systems to enhance their process competitiveness. Since most ERP systems down to date are implemented and managed on each separated business-unit or company level, such systems run short of the consideration about global business processes and global system managements. In order to integrate a successful global ERP, it is essential to apply the well-systematic implementation methodology which considers global standardization and global IT requirements. It is, however, the actual circumstance that such well-structured methodologies for global ERP implementation are hardly shown not only from domestic site but from foreign one. This paper indicates the global ERP implementation guideline with integrated approach including; the standard process design for efficient execution of global business; the ERP implementation method considering global IT requirements; and, the management method for global system operation. GSI ERP methodology is composed of 3 Phase:Global Strategy Planning, Global Template Construction and Global Roll-Out. Phase1; Global Strategy Planning contains Environment Analysis, GSI direction and Implementation Plan. Phase2; Global Template Construction contains Business blueprint, GSI operation design and Global template implementation. Phase3; Global Roll-out contains local business analysis, local ERP implementation and Global ERP Operation.

Sim-Hadoop : 신뢰성 있고 효율적인 N-body 시뮬레이션을 위한 Hadoop 분산 파일 시스템과 병렬 I / O (Sim-Hadoop : Leveraging Hadoop Distributed File System and Parallel I/O for Reliable and Efficient N-body Simulations)

  • 아마드;이승룡;정태충
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2013년도 춘계학술발표대회
    • /
    • pp.476-477
    • /
    • 2013
  • Gadget-2 is a scientific simulation code has been used for many different types of simulations like, Colliding Galaxies, Cluster Formation and the popular Millennium Simulation. The code is parallelized with Message Passing Interface (MPI) and is written in C language. There is also a Java adaptation of the original code written using MPJ Express called Java Gadget. Java Gadget writes a lot of checkpoint data which may or may not use the HDF-5 file format. Since, HDF-5 is MPI-IO compliant, we can use our MPJ-IO library to perform parallel reading and writing of the checkpoint files and improve I/O performance. Additionally, to add reliability to the code execution, we propose the usage of Hadoop Distributed File System (HDFS) for writing the intermediate (checkpoint files) and final data (output files). The current code writes and reads the input, output and checkpoint files sequentially which can easily become bottleneck for large scale simulations. In this paper, we propose Sim-Hadoop, a framework to leverage HDFS and MPJ-IO for improving the I/O performance of Java Gadget code.

저부하 멀티코어 프로세서에서 주기적 실시간 작업들의 저전력 스케쥴링 (Power-efficient Scheduling of Periodic Real-time Tasks on Lightly Loaded Multicore Processors)

  • 이완연
    • 한국컴퓨터정보학회논문지
    • /
    • 제17권8호
    • /
    • pp.11-19
    • /
    • 2012
  • 본 논문에서는 작업 개수보다 프로세싱 코어 개수가 많은 저부하 멀티코어 프로세서에 적합한 실시간 작업용 저전력 스케쥴링 기법을 제안하였다. 제시된 기법을 시스템상에 존재하는 모든 프로세싱 코어들을 사용하지 않고, 주어진 작업들의 전체 계산량을 고려하여 일부의 프로세싱 코어들만을 사용하고 나머지 사용하지 않는 코어들의 전원을 소등하여 전력소모량을 줄였다. 또한 휴리스틱 기법을 사용하여 주어진 작업들을 프로세싱 코어들에게 빠르게 배치하였다. 마지막을 각각의 프로세싱 코어는 배치된 작업들의 데드라인 모두 만족하면서 전력소모량을 최소화하도록 프로세싱 코어에 적용되는 최적의 클락 주파수를 선택하여 사용하였다. 제시된 스케쥴링 기법과 기존의 프로세싱 코어들을 최대한 많이 사용하는 방법을 비교하는 실험에서, 제시된 기법이 기존 방법의 전력소모량을 최대 78%까지 감소시킴을 확인하였다.

효율적인 유전 알고리즘을 활용한 요격미사일 할당 및 교전 일정계획의 최적화 (An Efficient Genetic Algorithm for the Allocation and Engagement Scheduling of Interceptor Missiles)

  • 이대력;양재환
    • 산업경영시스템학회지
    • /
    • 제39권2호
    • /
    • pp.88-102
    • /
    • 2016
  • This paper considers the allocation and engagement scheduling problem of interceptor missiles, and the problem was formulated by using MIP (mixed integer programming) in the previous research. The objective of the model is the maximization of total intercept altitude instead of the more conventional objective such as the minimization of surviving target value. The concept of the time window was used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. The MIP formulation of the problem is very complex due to the complexity of the real problem itself. Hence, the finding of an efficient optimal solution procedure seems to be difficult. In this paper, an efficient genetic algorithm is developed by improving a general genetic algorithm. The improvement is achieved by carefully analyzing the structure of the formulation. Specifically, the new algorithm includes an enhanced repair process and a crossover operation which utilizes the idea of the PSO (particle swarm optimization). Then, the algorithm is throughly tested on 50 randomly generated engagement scenarios, and its performance is compared with that of a commercial package and a more general genetic algorithm, respectively. The results indicate that the new algorithm consistently performs better than a general genetic algorithm. Also, the new algorithm generates much better results than those by the commercial package on several test cases when the execution time of the commercial package is limited to 8,000 seconds, which is about two hours and 13 minutes. Moreover, it obtains a solution within 0.13~33.34 seconds depending on the size of scenarios.

병렬 공간 조인 시 정적 부하 균등화를 위한 작업 생성 및 할당 방법 ((Task Creation and Allocation for Static Load Balancing in Parallel Spatial Join)

  • 박윤필;염근혁
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제28권3호
    • /
    • pp.418-429
    • /
    • 2001
  • 현재의 지리 정보 시스템(GIS : Geographical Information System)은 컴퓨터 응용 시스템의 중요한 분야로서 도시 정보 시스템, 교통 정보 시스템 등에 활용되고 있다. 이들 응용 분야 는 대용량의 공간 데이터를 다루기 때문에 효율적인 공간 연산 수행을 위한 기본 연산자를 필요로 한다. 특히, 기본 연산자 중에서 공간 조인은 연산에 참여하는 객체의 수가 증가함에 따라 수행 시간이 지수적으로 증가하는 특성을 가지고 있으므로 빠른 응답 시간을 요구하는 시스템에는 부적합하다. 따라서 이러한 요구 사항을 만족시키기 위해서는 공간 조인의 효율 적인 병렬 수행이 필요하다. 본 논문에서는 공간 조인의 효율적인 병렬수행을 위하여 정적 부하 균등화를 위한 작업 생성 및 할당 방법을 제시한다. 이 방법은 공간 지역성을 고려하 여 작업을 생성하고, 비용 모댈을 통하여 작업량을 예측하여 표현한 뒤 작업 그래프로 나타 낸다. 그리고 생성된 작업 그래프를 그래프 분할 알고리즘을 통하여 균등하게 할당한다. 본 논문에서 제시된 방법은 독일 Parsytec 사의 CC16 병렬머쉰에서 실험한 결과로 볼 때, 기 존의 정적 할당을 통한 작업 생성 및 할당 방법에 비하여 각 프로세서간의 작업 수행시간의 편차를 줄임으로써 부하 균등화의 효과를 가져온다.

  • PDF

분산 슈퍼컴퓨팅 기술에 기반한 신약재창출 시뮬레이션 사례 연구 (A Case Study of Drug Repositioning Simulation based on Distributed Supercomputing Technology)

  • 김직수;노승우;이민호;김서영;김상완;황순욱
    • 정보과학회 논문지
    • /
    • 제42권1호
    • /
    • pp.15-22
    • /
    • 2015
  • 본 논문에서는 대규모의 계산 작업을 고성능으로 처리해야 하는 신약재창출 시뮬레이션 분야에 분산 슈퍼컴퓨팅 기술을 적용한 사례에 대해 논의하고자 한다. 신약재창출이란 기존에 알려진 약물의 새로운 적응증을 규명하는 것을 의미하며, 이러한 신약재창출은 비교적 짧은 수행시간을 갖는 대규모의 도킹(docking) 연산들을 고성능으로 처리해야한다는 점에서 Many-Task Computing (MTC) 성격을 지니고 있다. 이러한 MTC 응용들의 대표 사례로서 신약재창출 시뮬레이션을 분산 슈퍼컴퓨팅 환경 기반의 HTCaaS 시스템에 적용하였으며, 이를 통해 효율적인 작업 배포, 동적인 자원 할당 및 로드 밸런싱, 안정성 및 다양한 자원들의 효율적인 통합 등이 이러한 과학 응용들을 지원하는 데 있어 필수적인 기능임을 확인할 수 있었다.

ADR제도 활성화를 위한 효율적인 교육프로그램에 관한 연구 (The Efficient Education Program for the Activation of the ADR System)

  • 이강빈
    • 한국중재학회지:중재연구
    • /
    • 제18권1호
    • /
    • pp.3-30
    • /
    • 2008
  • This paper is to research the current status of ADR in Korea, the qualifications of mediator (or conciliator) and arbitrator, the ADR education program of major foreign arbitration-related institutions and the efficient management device of ADR education program for the activation of the ADR system. In 2007, arbitration applications received at the Korean Commercial Arbitration Board numbered 320 and the amount involved those cases was US$ 216 millions. Mediation applications received at the KCAB numbered 552 and the amount involved those cases US$ 29millions. As of December 2007, the total numbers of arbitrators on the KCAB Panel of Arbitrators was 978. There are no provisions for the qualification of arbitrator in the UNCITRAL Model Law on International Commercial Arbitration and Arbitration Act of Korea. The KCAB has the consolidation regulation of the Panel of Arbitrator of which purpose is to regulate the criteria and procedure regarding the drawing up and maintenance of the panel of arbitrators. The UK Chartered Institute of Arbitrators has the criteria and qualifications for membership of which three grades are associate, member and fellow. The American Arbitration Association has the qualification criteria for admittance to the AAA National Roster of Arbitrators and Mediators. The Japan Association of Arbitrators has the official authorization regulation for membership of which three grades are special associate, ordinary associate and fellow. The UK Chartered Institute of Arbitrators has the ADR education programs which are composed of the mediation courses and arbitration courses. The American arbitrators Association has the ADR education programs which are composed of in-person training and online training. The Japan Association of Arbitrators has the ADR education programs which are composed of the cultivation courses of conciliator and the practical training courses of arbitrator. The efficient management devices of ADR education program are as follows: the execution of official authorization system of arbitrator, the establishment of specialized division for training and official authorization, the establishment of ADR regular training courses, the publication of ADR training texts and obtaining of instructors, and the consolidation of regulations related to the official authorization of arbitrator and ADR training. In conclusion, for the activation of ADR system, the KCAB and Korean Association of Arbitrators should make further effort to provide the ADR regular education and training programs for potential and practicing conciliators and arbitrators.

  • PDF