• Journal of Korea Water Resources Association
• /
• v.47 no.7
• /
• pp.599-614
• /
• 2014

In this study, two dimensional finite volume model was parallelized to improve computing time, which has been developed to be able to apply for the mixed meshes of triangle and quadrilateral. MPI scheme which is free from limitation of the number of cores was applied, and non-blocking point-to-point communication was used for fluxes and time steps calculation domain. The developed model is applied to analyze dam break in a L-shaped experimental channel with $90^{\circ}$ bend and Malpasset dam breach event to calibrate the consistency between parallelized model and existing model and examine the speed-up and efficiency of computing time. Computational speed-up about the size of the input data was considered by simulating 4 cases classified by the number of meshes, Consequently, the simulation results reached a satisfactory accuracy compared to measured data and the results from existing model, and achieved more than 3 times benefit of computational speed-up against computing time of existing model. Simulation results of 3 cases classified by the size of input data lead us to the conclusion that it is important to use proper size of input data and the number of process in order to minimize the communication overhead.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.120-134
• /
• 2000

In this paper we present a Distributed Object oriented Virtual computing Environment, called DOVE which consists of autonomous distributed objects interacting with one another via method invocations based on a distributed object model. DOVE appears to a user logically as a single virtual computer for a set of heterogeneous hosts connected by a network as if objects in remote site reside in one virtual computer. By supporting efficient parallelism, heterogeneity, group communication, single global name service and fault-tolerance, it provides a transparent and easy-to-use programming environment for parallel applications. Efficient parallelism is supported by diverse remote method invocation, multiple method invocation for object group, multi-threaded architecture and synchronization schemes. Heterogeneity is achieved by automatic data arshalling and unmarshalling, and an easy-to-use and transparent programming environment is provided by stub and skeleton objects generated by DOVE IDL compiler, object life control and naming service of object manager. Autonomy of distributed objects, multi-layered architecture and decentralized approaches in hierarchical naming service and object management make DOVE more extensible and scalable. Also,fault tolerance is provided by fault detection in object using a timeout mechanism, and fault notification using asynchronous exception handling methods

• The Korean Journal of Applied Statistics
• /
• v.29 no.6
• /
• pp.1077-1094
• /
• 2016

Apache Spark is a fast and general-purpose cluster computing package. It provides a new abstraction named resilient distributed dataset, which is capable of support for fault tolerance while keeping data in memory. This type of abstraction results in a significant speedup compared to legacy large-scale data framework, MapReduce. In particular, Spark framework is suitable for iterative machine learning applications such as logistic regression and K-means clustering, and interactive data querying. Spark also supports high level libraries for various applications such as machine learning, streaming data processing, database querying and graph data mining thanks to its versatility. In this work, we introduce the concept and programming model of Spark as well as show some implementations of simple statistical computing applications. We also review the machine learning package MLlib, and the R language interface SparkR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4C
• /
• pp.277-282
• /
• 2012

In this paper, we present a real-time eye contact system for realistic telepresence using a Kinect depth camera. In order to generate the eye contact image, we capture a pair of color and depth video. Then, the foreground single user is separated from the background. Since the raw depth data includes several types of noises, we perform a joint bilateral filtering method. We apply the discontinuity-adaptive depth filter to the filtered depth map to reduce the disocclusion area. From the color image and the preprocessed depth map, we construct a user mesh model at the virtual viewpoint. The entire system is implemented through GPU-based parallel programming for real-time processing. Experimental results have shown that the proposed eye contact system is efficient in realizing eye contact, providing the realistic telepresence.

• KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
• /
• v.28 no.3
• /
• pp.183-192
• /
• 2022

With the growth of the packaging industry, demand on the packaging printing comes in various forms. Customers' orders are diversifying and the standards for quality are increasing. Offset printing is mainly used in the packaging printing since it is easy to print in large quantities. However, productivity of the offset printing decreases when printing various order. This is because it takes time to change colors for each printing unit. Therefore, scheduling that minimizes the color replacement time and shortens the overall makespan is required. By the existing manual method based on workers' experience or intuition, scheduling results may vary for workers and this uncertainty increase the production cost. In this study, we propose an automated scheduling method of parallel offset printing process for packaging printing. We decompose the original problem into assigning and sequencing orders, and ink arrangement for printing problems. Vehicle routing problem and assignment problem are applied to each part. Mixed integer programming is used to model the problem mathematically. But it needs a lot of computational time to solve as the size of the problem grows. So guided local search algorithm is used to solve the problem. Through actual data experiments, we reviewed our method's applicability and role in the field.

• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.59-69
• /
• 1999

A Freeway corridor is a network consisting of a few Primary longitudinal roadways (freeway or major arterial) carrying a major traffic movement with interconnecting roads which offer the motorist alternative paths to his/her destination. Control measures introduced to ameliorate traffic performance in freeway corridors typically include ramp metering at the freeway entrances, and signal control at each intersections. During a severe freeway incident, on-ramp metering usually is not adequate to relieve congestion effectively. Diverting some traffic to the Parallel surface street to make full use of available corridor capacity will be necessary. This is the purpose of the traffic management system. So, an integrated traffic control scheme should include three elements. (a)on-ramp metering, (b)off-ramp diversion and (c)signal timing at surface street intersections. The purpose of this study is to develop an integrated optimal control model in a freeway corridor. By approximating the flow-density relation with a two-segment linear function. the nonlinear optimal control problem can be simplified into a set of Piecewise linear programming models. The formulated optimal-control Problem can be solved in real time using common linear program. In this study, program MPL(ver 4.0) is used to solve the formulated optimal-control problem. Simulation results with TSIS(ver 4.01) for a sample network have demonstrated the merits of the Proposed model and a1gorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.429-440
• /
• 2008

As embedded system becomes more complex, software development becomes more important in the entire design process. Most embedded applications consist of multi -tasks, that are executed in parallel. So, dataflow model that expresses concurrency naturally is preferred than sequential programming language to develop multitask software. For the execution of multitasking codes, operating system is essential to schedule multi-tasks and to deal with the communication between tasks. But, it is needed to execute multitasking code without as when the target hardware platform cannot execute as or target platforms are candidates of design space exploration, because it is very costly to port as for all candidate platforms of DSE. For this reason, we propose the serialized multitasking code generation technique from dataflow specification. In the proposed technique, a task is specified with dataflow model, and generated as a C code. Code generation consists of two steps: First, a block in a task is generated as a separate function. Second, generated functions are scheduled by a multitasking scheduler that is also generated automatically. To make it easy to write customized scheduler manually, the data structure and information of each task are defined. With the preliminary experiment of DivX player, it is confirmed that the generated code from the proposed framework is efficiently and correctly executed on the target system.