• Title/Summary/Keyword: 컴퓨터 집약적 방법

Search Result 22, Processing Time 0.035 seconds

Computer intensive method for extended Euclidean algorithm (확장 유클리드 알고리즘에 대한 컴퓨터 집약적 방법에 대한 연구)

  • Kim, Daehak;Oh, Kwang Sik
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.6
    • /
    • pp.1467-1474
    • /
    • 2014
  • In this paper, we consider the two computer intensive methods for extended Euclidean algdrithm. Two methods we propose are C-programming based approach and Microsoft excel based method, respectively. Thses methods are applied to the derivation of greatest commnon devisor, multiplicative inverse for modular operation and the solution of diophantine equation. Concrete investigation for extended Euclidean algorithm with the computer intensive process is given. For the application of extended Euclidean algorithm, we consider the RSA encrytion method which is still popular recently.

The Study of Computer Game Classification (컴퓨터 게임의 분류 기법에 관한 연구)

  • 김진용;이성환;황치정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.679-681
    • /
    • 2001
  • 컴퓨터 게임은 고부가가치를 올릴 수 있는 두뇌집약형 산업을 최근에는 게임을 하나의 학문으로 정립하여 이를 체계적으로 연구하여 정립하려는 노력이 활발히 진행중이다. 본 논문에서는 게임을 하나의 학문으로 정립시키기 위한 조사 논문으로 게임 분야에서 가장 기본적인 게임 분류 방법을 제시한다. 게임을 분류하기 위해서는 먼저 게임이 작동하는 플랫폼, 컨텐츠, 관측 시점으로 나누어 게임을 분류하고, 이를 근간으로 세분화하는 방법을 제시한다. 게임 분류 방법은 컴퓨터 게임의 정보검색, 데이터베이스 등에서 활용될 수 있다.

  • PDF

Generic Scheduling Method for Distributed Parallel Systems (분산병렬 시스템에서 유전자 알고리즘을 이용한 스케쥴링 방법)

  • Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.27-32
    • /
    • 2003
  • This paper presents the Genetic Algorithm based Task Scheduling (GATS) method for the scheduling of programs with diverse embedded parallelism types in Distributed Parallel Systems, which consist of a set of loosely coupled parallel and vector machines connected via high speed networks The distributed parallel processing tries to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. When scheduling in distributed parallel systems, the matching of the parallelism characteristics between tasks and parallel machines rather than load balancing should be carefully handled with the minimization of communication cost in order to obtain more speedup. This paper proposes the based initialization methods for an initial population and the knowledge-based mutation methods to accommodate the parallelism type matching in genetic algorithms.

Distributed In-Memory Caching Method for ML Workload in Kubernetes (쿠버네티스에서 ML 워크로드를 위한 분산 인-메모리 캐싱 방법)

  • Dong-Hyeon Youn;Seokil Song
    • Journal of Platform Technology
    • /
    • v.11 no.4
    • /
    • pp.71-79
    • /
    • 2023
  • In this paper, we analyze the characteristics of machine learning workloads and, based on them, propose a distributed in-memory caching technique to improve the performance of machine learning workloads. The core of machine learning workload is model training, and model training is a computationally intensive task. Performing machine learning workloads in a Kubernetes-based cloud environment in which the computing framework and storage are separated can effectively allocate resources, but delays can occur because IO must be performed through network communication. In this paper, we propose a distributed in-memory caching technique to improve the performance of machine learning workloads performed in such an environment. In particular, we propose a new method of precaching data required for machine learning workloads into the distributed in-memory cache by considering Kubflow pipelines, a Kubernetes-based machine learning pipeline management tool.

  • PDF

A Study on the Values and Practices of the Extreme Programming for Its Adoption (극한프로그래밍 방법론 도입을 위한 가치와 실천에 대한 연구)

  • Lee, Sang-Hyun;Lee, Sang-Joon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.7
    • /
    • pp.269-280
    • /
    • 2008
  • The choice of appropriate methodologies has always been a challenge. It is time to find obstacles when Extreme programming(XP) is adopted. In this paper, we invest status of adoption of XP methodology which is more popularized. We survey how the Values and the Practices of XP can be adopted to developer in terms of the usefulness and the easy of use of XP. As a result, it is regarded as a successful one in improving quality and timeliness through software development process. The Values and Practices, a basis of XP philosophy and its adoption, could be easily accomplished, but other elements - communication, feedback. collective ownership, pair programming, simple design and customer participation - which do not depend on technology could not be accomplished easily. To introduce XP easily in the creative and labor intensive software development fields, the managers and the educators have to make efforts to apply these Values and Practices based on humane characteristics as well as technical elements.

  • PDF

An Improvement of Finding Neighbors in Flocking Behaviors by Using a Simple Heuristic (단순한 휴리스틱을 사용하여 무리 짓기에서 이웃 에이전트 탐색방법의 성능 개선)

  • Jiang, Zi Shun;Lee, Jae-Moon
    • Journal of Korea Game Society
    • /
    • v.11 no.5
    • /
    • pp.23-30
    • /
    • 2011
  • Flocking behaviors are frequently used in games and computer graphics for realistic simulation of massive crowds. Since simulation of massive crowds in real time is a computationally intensive task, there were many researches on efficient algorithm. In this paper, we find experimentally the fact that there are unnecessary computations in the previous efficient flocking algorithm, and propose a noble algorithm that overcomes the weakness of the previous algorithm with a simple heuristic. A number of experiments were conducted to evaluate the performance of the proposed algorithm. The experimental results showed that the proposed algorithm outperformed the previous efficient algorithm by about 21% on average.

Speedup Analysis Model for High Speed Network based Distributed Parallel Systems (고속 네트웍 기반의 분산병렬시스템에서의 성능 향상 분석 모델)

  • 김화성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12C
    • /
    • pp.218-224
    • /
    • 2001
  • The objective of Distributed Parallel Computing is to solve the computationally intensive problems, which have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. In this paper, we propose a computational model including the generalized graph representation method of distributed parallel systems for speedup analysis, and analyze how the super-linear speedup is achieved when scheduling of programs with diverse embedded parallelism modes onto a distributed heterogeneous supercomputing network environment. The proposed representation method can also be applied to simple homogeneous or heterogeneous systems whose components are heterogeneous only in terms of the processor speed. In order to obtain the core speedup, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled while minimizing the communication overhead.

  • PDF

Implementation of Monte Carlo estimation of Pi based on UPMEM PIM (UPMEM PIM 기반 원주율의 몬테카를로 추정 구현)

  • Jae-Hyuck Kwak;Kwang Jin Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.27-29
    • /
    • 2023
  • 폰노이만 구조를 따르는 기존의 컴퓨터 시스템은 프로세서와 메모리의 역할이 구분되어 있으며 프로세서는 메모리에 저장된 명령어와 데이터를 불러와 실행한다. 이 과정에서 메모리와 프로세서 간에 발생하는 데이터 이동은 메모리 집약적인 응용을 처리하는데 있어서 심각한 오버헤드를 야기할수 있다. PIM(Processing-In-Memory)은 데이터 이동 병목을 해결하기 위해서 메모리에 프로세서의 능력을 통합하는 기술로서 최근의 메모리 기술의 발전으로 주목받고 있다. 본 논문에서는 UPMEM사의 상용 PIM 제품을 기반으로 몬테카를로 방법을 이용한 원주율 추정을 구현하고 성능 확장성을 분석하였다.

Real-time Processing of Manufacturing Facility Data based on Big Data for Smart-Factory (스마트팩토리를 위한 빅데이터 기반 실시간 제조설비 데이터 처리)

  • Hwang, Seung-Yeon;Shin, Dong-Jin;Kwak, Kwang-Jin;Kim, Jeong-Joon;Park, Jeong-Min
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.219-227
    • /
    • 2019
  • Manufacturing methods have been changed from labor-intensive methods to technological intensive methods centered on manufacturing facilities. As manufacturing facilities replace human labour, the importance of monitoring and managing manufacturing facilities is emphasized. In addition, Big Data technology has recently emerged as an important technology to discover new value from limited data. Therefore, changes in manufacturing industries have increased the need for smart factory that combines IoT, information and communication technologies, sensor data, and big data. In this paper, we present strategies for existing domestic manufacturing factory to becom big data based smart-factory through technologies for distributed storage and processing of manufacturing facility data in MongoDB in real time and visualization using R programming.

The Study on Vehicle Radar Technology Trends (차량 레이더 기술 동향 연구)

  • Bae, C.H.
    • Electronics and Telecommunications Trends
    • /
    • v.21 no.4 s.100
    • /
    • pp.142-151
    • /
    • 2006
  • ITU-R은 권고 M.1310에서 교통정보 및 제어 시스템(TICS)과 관련된 여러 가지 항목을 권고하고 있다. TICS는 지상 교통 시스템의 안전과 효율성 및 관리방법을 향상시키기 위해 컴퓨터, 통신, 위치정보 그리고 차량기술이 집약된 시스템으로 TICS 중 차량의 직접적인 주행과 관련된 차량 제어 시스템(AVCS)은 충돌 방지를 위해 요구되는 몇가지 사항을 포함하고 있으며 그 가운데 차량 레이더는 운전자의 보조를 통한 안전한 차량 운행을 위해 적용 가능한 기술 중의 하나이다. 본 논문에서는 차량 레이더의 국제표준화 동향, 제외국의 차량 레이더 법규 동향 및 개발동향에 대하여 살펴볼 것이다.