• The Transactions of the Korea Information Processing Society
• /
• v.6 no.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
• /
• v.4 no.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.

• Journal of Intelligence and Information Systems
• /
• v.6 no.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.

• Journal of Practical Engineering Education
• /
• v.10 no.2
• /
• pp.139-148
• /
• 2018

This study suggests the direction of management theory education in business administration under the university-linked program of Korean work and study in parallel policy. As a social science, business education is essentially to cultivate people of talent capable of making the right decisions in the social phenomenon (business practices) rather than educate skills for solving a specific issue. At the same time, the parallel system is aimed at cultivating talented people who can work practically in the real field. Therefore, practical education and theoretical education should be linked organically, and the theoretical education should be layered. Also, management education should be guaranteed to be timely and cultivate fusion thinking. Based on this background, this study is expected to contribute to the upgrading of the parallel system and education level in the future by reviewing the curriculum of the business administration department of domestic universities.

• Communications for Statistical Applications and Methods
• /
• v.19 no.3
• /
• pp.459-469
• /
• 2012

This article proposes a couple of parallel implementations of the self-organizing network for normal mixtures. In principle, self-organizing networks should be able to be implemented in a parallel computing environment without issue. However, the network for normal mixtures has inherent problem in being operated parallel in pure sense due to estimating conditional expectations of the mixing proportion in each iteration. This article shows the result of the parallel implementations of the network using Java. According to the results, both of the implementations achieved a faster execution without any performance degradation.

• Herbal Formula Science
• /
• v.31 no.3
• /
• pp.193-201
• /
• 2023

Objective : The purpose of this study is to report that herbal medicine administration has a pregnancy effect on infertility with both male and female factors. Methods : Jogyeongjongok-tang and Cheongshimyeonja-eum were administered to infertile couples who had no experience of pregnancy before and after marriage and who were diagnosed with right peritubal adhesion and teratospermia on examination. Herbal prescriptions were administered 30 minutes after meals, twice a day for 6 months. Result : A gestational sac was observed on ultrasonography 6 months after administration of herbal medicine prescription. Conclution : Jogyeongjongok-tang and Cheongsimyeonja-eum have been shown to have the effect of leading to pregnancy without harming infertile women, men and fetuses, so they are effective in women and men with peritubal adhesion and teratospermia. It shows that it is a prescription that can be used in parallel with infertility.

• Proceedings of the Korean Environmental Sciences Society Conference
• /
• 2003.11a
• /
• 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
• /
• v.13 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.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
• /
• v.36 no.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.