• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.8
• /
• pp.301-307
• /
• 1985

The first four generations of computers are all based on a single basic design: the Von Neuman Processor, which is sequential and does one operation at a time. Efforts to develop concurrent or parallel computers have been carried on for many years. Data flow approach is significant in these efforts to make high speed parallel machines and expected a great deal of parallelism. In this paper we propose a preliminary data Flow Machine Model operating asynchronously on the base of Node Labelling. We introduce a concept of Node Labeling for this purpose which is relevant to the Data dependency and Parallelism. And we explain how the Node Tokens are fired in the proposed system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.213-217
• /
• 1990

Neural networks are a class of systems that have many simple processors (neurons) which are highly interconnected. The function of each neuron is simple, and the behavior is determined predominately by the set of interconnections. Thus, a neural network is a special form of parallel computer. Although a major impetus for using neural networks is that they may be able to "learn" the solution to the problem that they are to solve, we argue that another, perhaps even stronger, impetus is that they provide a framework for designing massively parallel machines. The highly interconnected architecture of switching networks suggests similarities to neural networks. Here, we present two switching applications in which neural networks can solve the problems efficiently. We also show that a computational advantage can be gained by using nonuniform time delays in the network.e network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.183-192
• /
• 2000

This paper considers the problem of scheduling a set of n jobs on m parallel machines to minimize total weighted tardiness. For the problem a genetic algorithm is proposed, in which solutions are encoded using the random key method suggested by Bean and new crossover operators are employed to increase performance of the algorithm. The algorithm is compared with the Modified Due-Date (MDD) algorithm after series of tests to find appropriate values for genetic parameters. Results of computational tests on randomly generated test problems show that the suggested algorithm performs better than the MDD algorithm and gives good solutions in a reasonable amount of computation time.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.314-317
• /
• 2000

Cluster system provides attractive scalability in terms of computation power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive parallel machines. In parallel processing program, each task load is difficult to predict before running the program and each task is interdependent each other in many ways. Load imbalancing induces an obstacle to system performance. Most of researches in load balancing were concerned with distributed system but researches in cluster system are few. In cluster system, the dynamic load balancing algorithm which evaluates each processor's load in runtime is purpose that the load of each node are evenly distributed. But, if communication cost or node complexity becomes high, it is not effective method for all nodes to attend load balancing process. In that circumstances, it is good to reduce the number of node which attend to load balancing process. We have modeled cluster systems and proposed marginal dynamic load balancing algorithms suitable for that circumstances.

• IE interfaces
• /
• v.7 no.3
• /
• pp.171-180
• /
• 1994

Defined is a Multi-level Parallel Machine Flow-Shop (MPMFS) which reflects some real world manufacturing situations. Just-In-Time (JIT) philosophy is applied to the MPMFS scheduling in order to achieve lowering work-in-process inventory level as well as meeting due dates. A schedule generating simulator is developed. The latest start time of each operation is determined by a backward simulation followed by another forward simulation to analyze the schedule feasibility and actual inventory level. Reasonable schedules are available through adjusting some parameters for allowance factors such as set-up times of machines and other environmental changes. The SLAMSYSTEM under Window is employed for this processing with some input/output data handling processes devised under DOS.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.1095-1100
• /
• 2010

Customer satisfaction is a main issue in the modern competitive industrial environment. So quality and productivity are the most important requisites. This paper presents a method for effective real time dispatching for parallel machines with multi product that minimizes mean tardiness and maximizes the quality of the product. In this paper, the effectiveness of the method has been examined in the simulation and compared with other dispatching methods. Using this method presented in this paper, companies can improve customer satisfaction.

• 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.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.94-99
• /
• 2006

As part of a Department of Defense Grand Challenge Project, advanced high performance computing (HPC) time-accurate computational fluid dynamics (CFD) techniques have been developed and applied to a new area of aerodynamic research on microjets for control of small and medium caliber projectiles. This paper describes a computational study undertaken to determine the aerodynamic effect of flow control in the afterbody regions of spin-stabilyzed projectiles at subsonic and low transonic speeds using an advanced scalable unstructured flow solver in various parallel computers such as the IBM SP4 and Linux Cluster. High efficiency is achieved for both steady and time-accurate unsteady flow field simulations using advanced scalable Navier-Stokes computational techniques. Results relating to the code's portability and its performance on the Linux clusters are also addressed. Numerical simulations with the unsteady microjets show the jets to substantially alter the flow field both near the jet and the base region of the projectile that in turn affects the forces and moments even at zero degree angle of attack. The results have shown the potential of HPC CFD simulations on parallel machines to provide to provide insight into the jet interaction flow fields leading to improve designs.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.4
• /
• pp.155-170
• /
• 2004

Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.9
• /
• pp.971-977
• /
• 2012

Redundant actuated parallel kinematic machines (PKMs) have been widely researched to increase stiffness of PKMs. This paper presents theoretical analyses on the stiffness of non-redundant and redundant actuated PKM. Stiffness of each mechanism is defined by summation of actuator and structural stiffness; the actuator stiffness is determined from displacements of actuators, and the structural stiffness is determined from deformations of links by external forces. Calculated actuator and structural stiffness of non-redundant PKM show same distribution in entire workspace. On the contrary, the actuator and the structural stiffness of a redundant PKM has very different distribution in the workspace; so, we conclude the structural stiffness of redundant PKM should be considered to design the redundant PKM. The results can be used to design and analyze non-redundant and redundant PKMs.