• 제목/요약/키워드: Parallel Process

Search Result 1,456, Processing Time 0.07 seconds

Customer Order Scheduling Problems with a Fixed Machine-Job Assignment

  • Yang, Jae-Hwan;Rho, Yoo-Mi
    • Management Science and Financial Engineering
    • /
    • v.11 no.2
    • /
    • pp.19-43
    • /
    • 2005
  • This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

The Effective Parallel Processing Method for an Enhanced Digital Image of Skeleton Line (향상된 영상 골격화를 위한 효과적인 병렬 처리 방법)

  • 신충호;오무송
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.459-466
    • /
    • 2004
  • In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The binary image using the threshold values is applied in the preprocessing stage and then the modified parallel processing method is applied to obtain the improved image of skeleton line. The existing skeleton methods are Rutovitz, Steiabelli and other five skeleton methods. In the digital process of skeleton line, the major problem caused by these methods is elongated lines and noise branches of the processed image. In this study, however, such noises are deleted first by the modified parallel processing step of the proposed method. Then a pixel is compared to its eight neighbor pixels. if its neighbor pixels are in one of the eight conditions, the central pixel is deleted. As a result, the quality of the skeleton is better then those produced by the existing skeleton methods.

  • PDF

DESIGN OF PARALLEL COOLING CHANNELS IN A PLASTIC INJECTION MOLD (사출 금형의 병렬 냉각 채널 설계 방법)

  • Kim, H.S.;Jung, H.K.;Han, B.Y.;Kim, Y.M.;Park, H.K.
    • Journal of computational fluids engineering
    • /
    • v.17 no.3
    • /
    • pp.93-98
    • /
    • 2012
  • The injection molding process is suitable for manufacturing complicated plastic products. As the customer request higher quality products increase, realization of the precise dimensional and shape controls is getting more important. For this purpose it is important to obtain uniform cooling procedure over the whole surface of the high temperature molded plastic. Failure to this may lead to different shrinkage speed, internal stresses and unwanted shape deformations. It is necessary to distribute coolant flow rates to the main channel and to the sub-channels properly to insure uniform cooling process when there are parallel cooling channels. In this study, three-dimensional turbulent flow simulations for representative parallel cooling channels were performed. To insure the intended flow rate to each sub-channels, various shape designs for the channel system were investigated. The results show that as the Reynolds number increases the effect of shape design is more profound. Through the proper flow distribution, uniform cooling effects would be expected.

ANSYS®-Based Gear Stress Analysis of a Lightweight 3-DOF Wrist Mechanism for a Parallel Robot with Expanded Workspace (고속 확장된 작업공간을 가진 병렬 로봇을 위한 경량 3-DOF 손목 메커니즘의 ANSYS 기반 응력해석)

  • Park, Sang Hyeok;Chung, Won Jee;Hwang, Hui Geon;Kim, Hong Rok;Choi, Se Woong;Jee, Myeong Jun;Hong, Woo Cheol
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.21 no.2
    • /
    • pp.116-122
    • /
    • 2022
  • This study proposed a method of testing the stability when selecting gears to reduce the weight of a 3-DOF wrist mechanism for a pick-and-place 3-DOF parallel robot with an increased workspace by using an additional straight axis at its top. We performed SolidWorks® modeling- and ANSYS®-based structural analysis of a pinion gear, which is most vulnerable to the force from a 3-DOF wrist mechanism, to lighten the robot weight for performing various tasks. When the initial analysis results considerably differed from the theoretical values calculated in advance, we checked and identified the errors in the contact conditions or input values. Ultimately, it is believed that the methodology presented in this paper will help in mitigating errors during analysis and determine the accurate values for a lightweight 3-DOF wrist mechanism for a parallel robot with an expanded workspace.

Improved Disparity Map Computation on Stereoscopic Streaming Video with Multi-core Parallel Implementation

  • Kim, Cheong Ghil;Choi, Yong Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.728-741
    • /
    • 2015
  • Stereo vision has become an important technical issue in the field of 3D imaging, machine vision, robotics, image analysis, and so on. The depth map extraction from stereo video is a key technology of stereoscopic 3D video requiring stereo correspondence algorithms. This is the matching process of the similarity measure for each disparity value, followed by an aggregation and optimization step. Since it requires a lot of computational power, there are significant speed-performance advantages when exploiting parallel processing available on processors. In this situation, multi-core CPU may allow many parallel programming technologies to be realized in users computing devices. This paper proposes parallel implementations for calculating disparity map using a shared memory programming and exploiting the streaming SIMD extension technology. By doing so, we can take advantage both of the hardware and software features of multi-core processor. For the performance evaluation, we implemented a parallel SAD algorithm with OpenMP and SSE2. Their processing speeds are compared with non parallel version on stereoscopic streaming video. The experimental results show that both technologies have a significant effect on the performance and achieve great improvements on processing speed.

Debugging of Parallel Programs using Distributed Cooperating Components

  • Mrayyan, Reema Mohammad;Al Rababah, Ahmad AbdulQadir
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.570-578
    • /
    • 2021
  • Recently, in the field of engineering and scientific and technical calculations, problems of mathematical modeling, real-time problems, there has been a tendency towards rejection of sequential solutions for single-processor computers. Almost all modern application packages created in the above areas are focused on a parallel or distributed computing environment. This is primarily due to the ever-increasing requirements for the reliability of the results obtained and the accuracy of calculations, and hence the multiply increasing volumes of processed data [2,17,41]. In addition, new methods and algorithms for solving problems appear, the implementation of which on single-processor systems would be simply impossible due to increased requirements for the performance of the computing system. The ubiquity of various types of parallel systems also plays a positive role in this process. Simultaneously with the growing demand for parallel programs and the proliferation of multiprocessor, multicore and cluster technologies, the development of parallel programs is becoming more and more urgent, since program users want to make the most of the capabilities of their modern computing equipment[14,39]. The high complexity of the development of parallel programs, which often does not allow the efficient use of the capabilities of high-performance computers, is a generally accepted fact[23,31].

Systems Engineering Approach to Develop Intelligent Production Planning Scheduling Model linked to Machine and Quality Data (설비 및 품질 데이터 연계 지능형 생산계획 스케줄링 모델 개발을 위한 시스템엔지니어링 접근 방법)

  • Park, Jong Hee;Kim, Jin Young;Hong, Dae Geun
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.17 no.2
    • /
    • pp.1-8
    • /
    • 2021
  • This study proposes a systems engineering approach for the development of an advanced planning & scheduling (APS) system for a cosmetic case manufacturing factory. The APS system makes production plans and schedules based on the injection process, which consists of 27 plastic injection machines in parallel to control recommended inventory of products. The system uses machine operation/failure information and defective product/work-in-process tracking information to support intelligent scheduling. Furthermore, a genetic algorithm model is applied to handle the complexity of heuristic rules and machine/quality constraints in this process. As a result of the development, the recommended inventory compliance rate is improved by scheduling the 30-day production plan for 15 main products.

Massive Parallel Processing Algorithm for Semiconductor Process Simulation (반도체 공정 시뮬레이션을 위한 초고속 병렬 연산 알고리즘)

  • 이제희;반용찬;원태영
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.36D no.3
    • /
    • pp.48-58
    • /
    • 1999
  • In this paper, a new parallel computation method, which fully utilize the parallel processors both in mesh generation and FEM calculation for 2D/3D process simulation, is presented. High performance parallel FEM and parallel linear algebra solving technique was showed that excessive computational requirement of memory size and CPU time for the three-dimensional simulation could be treated successively. Our parallelized numerical solver successfully interpreted the transient enhanced diffusion (TED) phenomena of dopant diffusion and irregular shape of R-LOCOS within 15 minutes. Monte Carlo technique requires excessive computational requirement of CPU time. Therefore high performance parallel solving technique were employed to our cascade sputter simulation. The simulation results of Our sputter simulator allowed the calculation time of 520 sec and speedup of 25 using 30 processors. We found the optimized number of ion injection of our MC sputter simulation is 30,000.

  • PDF

Acceleration for Removing Sea-fog using Graphic Processors and Parallel Processing (그래픽 프로세서를 이용한 병렬연산 기반 해무 제거 고속화)

  • Kim, Young-doo;Kwak, Jae-min;Seo, Young-ho;Choi, Hyun-jun
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.5
    • /
    • pp.485-490
    • /
    • 2017
  • In this paper, we propose a technique for high speed removal of sea-fog using a graphic processor. This technique uses a host processor(CPU) and several graphics processors(GPU) capable of parallel processing to remove sea-fog from the input image. In the process of removing sea-fog, the dark channel extraction, the maximum brightness channel extraction, and the calculation of the transmission are performed by the host processor, and the process of refining the transmission by applying the bidirectional filter is performed in parallel through the graphic processor. To verify the proposed parallel processing method, three NVIDIA GTX 1070 GPUs were used to construct the verification environment. As a result, it takes about 140ms when implemented with one graphics processor, and 26ms when implemented using OpenMP and multiple GPGPUs. The proposed a parallel processing algorithm based on the graphics processor unit can be used for safe navigation, port control and monitoring system.

Application of Parallel Processing System for free drop simulation of IT-related modules (IT 모듈의 자유 낙하 모사를 위한 병렬처리시스템의 적용)

  • Park Y.J.;Lee J.S.;Ko H.O.;Chang Y.S.;Choi J.B.;Kim Y.J.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.405-406
    • /
    • 2006
  • Recently, the flat display modules such as plasma or TFT-LCD employ thin crystallized panels which are normally weak to high level transient mechanical energy inputs. As a result, anti-shock performance is one of the most important design specifications for TFT-LCD modules. However, most of large display module designs are generated based on engineers own experiences. Also, a large-scale analysis to evaluate complex material and structural behaviors is one of interesting topic in diverse engineering and scientific fields. The utilization of massively parallel processors has also been a recent trend of high performance computing. The objective of this paper is to introduce a parallel process system which consists of general purpose finite element analysis solver as well as parallelized PC cluster. The parallel processing system is constructed using thirty-two processing elements and the finite element program is developed by adopting hierarchical domain decomposition method. In order to verify the efficiency of the established system, an impact analysis on thin and complex sub-parts of flat display modules is performed. The evaluation results showed a good agreement with the corresponding reference solutions, and thus, the parallel process system seems to be a useful tool fur the complex structural analysis such as IT related products.

  • PDF