• 제목/요약/키워드: parallel algorithms

검색결과 653건 처리시간 0.024초

A Parallel Algorithm for Image Segmentation on Mesh-connected MIMD System

  • Jeon, Byeong-Moon;Jeong, Chang-Sung
    • 한국산업정보학회논문지
    • /
    • 제3권1호
    • /
    • pp.258-268
    • /
    • 1998
  • This paper presents two sequential advanced split and merge algorithms and a parallel image segmentation algorithm based on them. First, the two advanced methods are obtained from the combination of edge detection and classic split and merge to solve the inherent problems of the classical method. Besides, the parallel image segmentation algorithm on mesh-connected MIMD system considers three types in the merge stage to reduce the communication overhead between processors, such as intraprocessor merge, interprocessor with boundary merge, and interprocessor without boundary merge. Finally , we prove that the proposed algorithms achieve the improved performance by implementing them.

Rate-Modifying 활동이 있는 병렬기계의 Makespan 최소화를 위한 일정 계획 (Parallel Machines Scheduling with Rate-Modifying Activities to Minimize Makespan)

  • 조항민;임승빈;정인재
    • 산업경영시스템학회지
    • /
    • 제30권2호
    • /
    • pp.44-50
    • /
    • 2007
  • This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

다중 DSP 프로세서 기반의 병렬 수중정합장처리 알고리즘 설계 (Design of Parallel Algorithms for Conventional Matched-Field Processing over Array of DSP Processors)

  • 김건욱
    • 대한전자공학회논문지SP
    • /
    • 제44권4호통권316호
    • /
    • pp.101-108
    • /
    • 2007
  • 고성능 네트워크와 분산처리구조가 병렬처리와 함께 결합되면, 전체적인 디지털 신호처리 시스템의 계산능력, 신뢰도, 다양성을 향상시킨다. 본 논문에서는, 발전된 형태의 수중레이더 (sonar) 알고리즘인 수중정합장처리 (Matched-Field Processing MFP)를 위한 병렬처리 알고리즘을 디자인하고 다중 DSP 프로세서 기반의 병렬처리 시스템 상에서 성능분석과 함께 최적의 병렬처리 솔루션을 제안한다. 각각의 병렬 알고리즘은 특정한 도메인에서 주어진 계산량을 분산시키며 이를 통한 속도향상을 추구한다. 필요한 연산량과 형태에 따라서 병렬 알고리즘은 각기 다른 성능향상을 보여준다. 또한, 알고리즘의 계산량 분산방식 프로세서간의 통신방식, 알고리즘의 복잡도, 프로세서의 속도, 목적하는 시스템의 구성에 따라서 다양한 성능지표를 보여준다. 제안하는 주파수와 출력값 기반의 병렬 알고리즘은 상당한 계산량을 요구하는 수중정합처리 알고리즘을 적절히 다중 프로세서에 균형 있게 분산시켜 프로세서의 개수와 비례하는 성능향상을 보여주고 있다.

CPU와 GPU의 병렬 처리를 이용한 고속 물체 인식 알고리즘 구현 (The Implementation of Fast Object Recognition Using Parallel Processing on CPU and GPU)

  • 김준철;정용한;박은수;최학남;김학일;허욱렬
    • 제어로봇시스템학회논문지
    • /
    • 제15권5호
    • /
    • pp.488-495
    • /
    • 2009
  • This paper presents a fast feature extraction method for autonomous mobile robots utilizing parallel processing and based on OpenMP, SSE (Streaming SIMD Extension) and CUDA programming. In the first step on CPU version, the algorithms and codes are optimized and then implemented by parallel processing. The parallel algorithms are debugged to maintain the same level of performance and the process for extracting key points and obtaining dominant orientation with respect to key points is parallelized. After extraction, a parallel descriptor via SSE instructions is constructed. And the GPU version also implemented by parallel processing using CUDA based on the SIFT. The GPU-Parallel descriptor achieves an acceleration up to five times compared with the CPU-Parallel descriptor, but it shows the lower performance than CPU version. CPU version also speed-up the four and half times compared with the original SIFT while maintaining robust performance.

가중치를 이용한 병렬 세선화 알고리즘 (Parallel Thinniing Algorithm using Weighted-Value)

  • 한낙희;이필규
    • 인지과학
    • /
    • 제7권1호
    • /
    • pp.5-35
    • /
    • 1996
  • 본 논문은 문자인식,문자검색,도형인식 등에 있어서 필수 과정인 세선화 알고리즘에 대하여 논하였다.접근방법으로는 외곽선으로부터 특정 조건을 만족시키는 화소들을 동시에 제거해 가는 병렬 세선화 방법을 취했다.제안된 알고리즘은 가중치 개념을 도입하여 기존의 알고리즘보다 정확성 및 수행속도의 향상을 성취하였다.실험은 스캐너로 입력된 숫자, 영문자,도형 등을 기준으로 했으며 특히 다른 알고리즘에서 정확하게 세선화 하지 못하는 데이타들을 사용하였다. 실험결과 모양이나 토폴로지를 잃지 않고 정확히 세선화가 가능했으며 잡음으로부터라도 영향을 받지 않았다.

  • PDF

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

  • LEE, CHANG-OCK;PARK, JONGHO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제24권2호
    • /
    • pp.161-197
    • /
    • 2020
  • Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

계층적 경쟁기반 병렬 유전자 알고리즘을 이용한 퍼지집합 퍼지모델의 최적화 (Optimization of Fuzzy Set Fuzzy Model by Means of Hierarchical Fair Competition-based Parallel Genetic Algorithms)

  • 최정내;오성권;황형수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 제37회 하계학술대회 논문집 D
    • /
    • pp.2097-2098
    • /
    • 2006
  • In this study, we introduce the hybrid optimization of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA). HFCGA is a kind of multi-populations of Parallel Genetic Algorithms(PGA), and it is used for structure optimization and parameter identification of fuzzy set model. It concerns the fuzzy model-related parameters as the number of input variables, a collection of specific subset of input variables, the number of membership functions, and the apexes of the membership function. In the hybrid optimization process, two general optimization mechanisms are explored. The structural optimization is realized via HFCGA method whereas in case of the parametric optimization we proceed with a standard least square method as well as HFCGA method as well. A comparative analysis demonstrates that the proposed algorithm is superior to the conventional methods.

  • PDF

작업순서 의존형 준비시간을 갖는 이종병렬기계의 휴리스틱 일정계획 (Heuristics for Non-Identical Parallel Machine Scheduling with Sequence Dependent Setup Times)

  • 고시근
    • 대한산업공학회지
    • /
    • 제40권3호
    • /
    • pp.305-312
    • /
    • 2014
  • This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

Non-Identical Parallel Machine Scheduling with Sequence and Machine Dependent Setup Times Using Meta-Heuristic Algorithms

  • Joo, Cheol-Min;Kim, Byung-Soo
    • Industrial Engineering and Management Systems
    • /
    • 제11권1호
    • /
    • pp.114-122
    • /
    • 2012
  • This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, two meta-heuristics, genetic algorithm (GA) and a new population-based evolutionary meta-heuristic called self-evolution algorithm (SEA), are proposed. The performances of the meta-heuristic algorithms are evaluated through compare with optimal solutions using randomly generated several examples.