• 한국정보처리학회논문지
• /
• 제6권5호
• /
• pp.1373-1384
• /
• 1999

This paper describes the design and implementation of MAX(Management and Administration of spaX). MAX is the system management tool for XPAX(Scalable Parallel Architecture computer based on X-bar network) developed by highly parallel computer IV project. System manager and users can perform system management job easily using MAX which has GUI(Graphical User Interface). MAX contains most of all functions of system management-related commands provided by operating system of SPAX and consists of 10 sub tools.

• Industrial Engineering and Management Systems
• /
• 제4권2호
• /
• pp.117-122
• /
• 2005

An assembly system (AS), a valuable tool for mass production, is generally composed of a number of workstations and a transport system. While the workstations perform some preplanned operations, the transport system moves the assemblies by special designed pallets from one station to another. One common problem associated with automatic assembly systems is that some assembly operations may have relatively long cycle times. As a consequence, the productivity, as determined by the operations with the longest cycle time, can be reduced significantly. Therefore, special forms of parallel workstations were developed to improve the performance of an assembly system. In this paper, three most commonly used parallel stations: on-line, off-line and tunnel-gated stations in a free transfer assembly system are studied via discrete event simulation. Our findings revealed that the off-line parallel system has the best performance because the two independent parallel stations can lower the buffer requirement; reduce the sensitivity to variability of processing time and balance of a line. On-line parallel systems were found to have a relatively poor performance, because the operations of two parallel stations block each other, and higher buffer capacity is required to achieve similar capacity. The tunnel-gated system was more efficient than the on-line system since the first parallel station can operate independently. More importantly, we have quantified the productivity of the three different strategies mentioned. Engineers can choose the optimal strategies for installing parallel stations under their working environment.

• 지능정보연구
• /
• 제6권1호
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• 실천공학교육논문지
• /
• 제10권2호
• /
• pp.139-148
• /
• 2018

본 연구는 대학연계형 일학습병행제도 하에서 경영학 이론교육의 방향성을 제안하고자 한다. 사회과학으로서 경영학 교육은 본질적으로 기술습득 중심의 교육보다는 사회현상(기업경영의 현실) 속에서 올바른 의사결정을 할 수 있는 인재를 양성하는데 있다. 동시에 일학습병행제도는 현장직무를 온전히 수행하는데 도움이 되는 인재를 양성하는데 그 목적이 있다. 따라서 실무중심의 교육과 이론 중심의 교육은 유기적으로 연계되어야 하고, 그 이론 교육은 계층화되어야 한다. 또한 경영학 교육은 시의성이 보장되고 융합적 사고를 배양해야 한다. 이러한 배경을 바탕으로 본 연구는 현재 일학습병행제 틀에서 운영되고 있는 국내 대학의 경영학과의 교육과정을 검토하고 발전방향을 제시함으로써 향후 동 제도와 교육수준을 한 단계 업그레이드 시키는데 기여할 것으로 기대된다.

• Communications for Statistical Applications and Methods
• /
• 제19권3호
• /
• pp.459-469
• /
• 2012

본 연구에서는 자기조직화 신경망이 필요한 노드만을 가지고 최적화하여 정규혼합분포를 추정하는 모형(Ahn과 Kim, 2011)을 Java언어에서 제공하는 스레드(thread)를 기반으로, 멀티코어 컴퓨팅환경에서 병렬처리방식으로 구현하여 순차처리방식에 비해 짧은 연산시간으로 정규혼합모형의 추정이 가능함을 보이려고 한다. 이를 위하여 Ahn과 Kim이 제안한 모형을 바탕으로 두 가지의 병렬처리 방법을 제안하고 그 성능을 평가하였다. 병렬처리 방법은 Java의 멀티스레드를 이용하여 구현되었으며, 모의실험을 통하여 제안한 모형이 순차처리방식과 비교하여 수렴속도가 빠름을 확인하였다.

• 대한한의학방제학회지
• /
• 제31권3호
• /
• pp.193-201
• /
• 2023

본 증례에서 기형정자증과 난관 주위 유착이 동시에 있는 난임(難姙) 부부에게 각각 투여한 한약의 임신 효과가 확인되었다. 이 결과는 남녀 한편으로 원인을 특정하기 어려운 난임(難姙)의 진단상황에서 남녀 모두에게 한약의 병행(竝行) 투여는 남녀 생식 생리 기능을 보완하거나 배가하여 임신 효과를 나타낼 수 있는 적절한 치료방식이 될 수 있다는 것을 시사한다.

• 한국환경과학회:학술대회논문집
• /
• 한국환경과학회 2003년도 International Symposium on Clean Environment
• /
• pp.73-78
• /
• 2003

In this research, we implement Realtime Air Diffusion Prediction System which is a parallel Fortran model running on distributed-memory parallel computers. The system is designed for air diffusion simulations with four-dimensional data assimilation. For regional air quality forecasting a series of dynamic downscaling technique is adopted using the NCAR/Penn. State MM5 model which is an atmospheric model. The realtime initial data have been provided daily from the KMA (Korean Meteorological Administration) global spectral model output. It takes huge resources of computation to get 24 hour air quality forecast with this four step dynamic downscaling (27km, 9km, 3km, and lkm). Parallel implementation of the realtime system is imperative to achieve increased throughput since the realtime system have to be performed which correct timing behavior and the sequential code requires a large amount of CPU time for typical simulations. The parallel system uses MPI (Message Passing Interface), a standard library to support high-level routines for message passing. We validate the parallel model by comparing it with the sequential model. For realtime running, we implement a cluster computer which is a distributed-memory parallel computer that links high-performance PCs with high-speed interconnection networks. We use 32 2-CPU nodes and a Myrinet network for the cluster. Since cluster computers more cost effective than conventional distributed parallel computers, we can build a dedicated realtime computer. The system also includes web based Gill (Graphic User Interface) for convenient system management and performance monitoring so that end-users can restart the system easily when the system faults. Performance of the parallel model is analyzed by comparing its execution time with the sequential model, and by calculating communication overhead and load imbalance, which are common problems in parallel processing. Performance analysis is carried out on our cluster which has 32 2-CPU nodes.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• 한국경영과학회지
• /
• 제39권3호
• /
• pp.83-91
• /
• 2014

We consider the problem of scheduling identical jobs with sequence-independent setup times on parallel machines. The objective is to minimize total completion times. We present the pseudopolynomial-time algorithm for the case with a fixed number of machines and an efficient approximation algorithm for our problem with identical setup times, which is known to be NP-hard even for the two-machine case.

• Journal of applied mathematics & informatics
• /
• 제36권5_6호
• /
• pp.381-396
• /
• 2018

In this paper we have considered a system of mixed generalized variational inequality problems defined on two different domains in a Hilbert space. It has been shown that the solution of a system of mixed generalized variational inequality problems is equivalent to altering point formulation of some mappings. A new parallel S-iteration type process has been considered which converges strongly to the solution of a system of mixed generalized variational inequality problems.