• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.655-664
• /
• 2002

In many data-parallel applications massive parallelism can be easily extracted through data distribution. But it often causes very long communication latency. This paper shows that task parallelism, which is extracted from data-parallel programs, can be exploited to hide such communication latency Unlike the most previous researches over exploitation of task parallelism which has not been considered together with data parallelism, this paper describes exploitation of task parallelism in the context of data parallelism. PCFG(Parallel Control Flow Graph) is proposed to represent a multithreaded program consisting of a few task threads each of which can include a few data-parallel loops. It is also described how a PCFG is constructed from a source data-parallel program through HDG(Hierarchical Dependence Graph) and how the multithreaded program can be constructed from the PCFG.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.23 no.6
• /
• pp.642-646
• /
• 2014

This research describes the measurement of roll parallelism by a laser interferometer. Parallelism among rolls is an important factor for improving the precision of printing devices. A laser interferometer, which is a device for the precise measurement of distance, can be utilized to measure parallelisms between rolls. To measure distance between two rolls by using a laser interferometer, the laser must not be severed during measurement. To achieve this condition, a linear motion guide was installed to each roll being measured, and continuous measurement of distance between two rolls was implemented by the simultaneous control of two mirrors installed on the guides. The method to measure parallelism between two rolls presented in this research can be utilized to improve printing precision by enhancing parallelism between rolls in printing devices.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.249-258
• /
• 2002

One of the jai or purposes of multiprocessor system is to get a high efficiency in performance improvement. But in most cases, it is unavoidable to use some special programming languages or tools for full use of multiprocessor system. In general, loop and recursive call statements of algorithms are considered as typical parts for parallelization. Especially, recursive call statements are easy to parallelize conceptually without support of any special languages or tools. But it is difficult to control the degree of parallelism caused by high depth of recursive call leading to execution crash. This paper proposes a device to control Parallelism in the process of POSIX thread bated parallelization of recursive algorithms. For this, we define the concept of thread and process in UNIX system, and analyze the results of experimental application of the device to quick sorting algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1355-1358
• /
• 2003

This paper presents performance analysis of the embedded application, called EEMBC consisting of 5 categories and total 34 applications. We measured various performance metrics, such as code sizes, TLP(Thread Level Parallelism) using OpenMP API and ILP(Instruction Level Parallelism) on ARM-modeled SimpleScalar in detail. We show that the embedded applications have the similar characteristics as integer applications to deliver low ILP and TLP in our environment. They have many small loops, which result in large instruction overhead in TLP and loop control overhead in ILP.

• Journal of Korean Society for Quality Management
• /
• v.20 no.2
• /
• pp.67-75
• /
• 1992

In this paper we propose a class of tests for the parallelism of two regression lines based on linear placement statistics. The results of a small-sample Monte Carlo study show that the proposed tests are reasonably good in level control and powers.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.11-20
• /
• 2002

We propose a new concurrency control algorithm for enhancing the degree of parallelism of the transactions in fully replicated databases designed to improve the availability and the reliability. The update transactions can be logically decomposed of a read-only transaction and a write-only transaction. In our algorithm, a set of read operations of an update transaction is treated as a read-only transaction and the read-only transaction reads data items in the site to which it is submitted. And a set of write operations of the update transaction is treated as a write-only transaction and it is submitted to all corresponding sites after the update transaction has been completed. By using the proposed update protocol, all write-only transactions can execute at all sites atomically. The proposed algorithm can have transactions execute concurrently at the site to which they are submitted and, after the completion of each transaction, the update protocol is performed for updating their data items and checking their serializability. Therefore, the degree of parallelism of the transactions can be improved. Especially, if the probability of conflict among transactions is low, we can expect the higher degree of their parallelism.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.482-489
• /
• 1997

This paper presents the analysis of the kinematics and dynamics of redundant parallel manipulators, and provides design guides for advanced parallel mainpulators with high performance. Three types of redundancies are considered which include the redundancies in serial chain, joint actuation, and parallelism. First, the kinematic and dynamic models of a redundant parallel manipulator are obtained in both joint and Cartesian spaces, and the kinematic and dynamic manipulabilities are defined for the performance evaluation. The effects of the three types of redundancies on the kinematic and dynamic performance of a parallel manipulator are then analyzed and compared, providing a set of guides for the design of advanced parallel manipulators. Finally, the simulation results using planer parallel manipulators are given.

• The korean journal of orthodontics
• /
• v.50 no.6
• /
• pp.401-406
• /
• 2020

Objective: To investigate and compare the slot sizes and parallelism of metal injection molding (MIM) and computerized numerical control (CNC) brackets. Methods: The following four MIM bracket series with 0.022-inch (in) slots were selected for investigation: Di MIM mini Twin (Ortho Organizers), Mini Diamond Roth (Ormco), Gemini MBT (3M Unitek), and Formula R Roth (Tomy). The following four CNC bracket series with 0.022-in slots were selected for investigation: Econoline MBT (Adenta), Legend mini MBT (GC Orthodontics), Crown mini MBT (Adenta), and Evolve MBT (DB Orthodontics). The slot dimensions were measured using an optical microscope (XTCam-D310M; Mitutoyo) with a resolution of 1 ㎛. The results were statistically analyzed using one-way analysis of variance and the Tukey post-hoc test with a significance level of 0.05. Results: The results indicated that all the investigated slot sizes were oversized with respect to the manufacturers' specifications (0.022 in). Among the eight bracket series, the Di MIM bracket (MIM) was the most oversized by 10.4%, whereas the Evolve bracket (CNC) was the least oversized by 2.6%. The slots in seven of the bracket series had divergent walls instead of parallel ones. The Evolve bracket alone had parallel slot walls. Conclusions: Regardless of the manufacturing method, all the slot sizes of the brackets investigated in this study were significantly oversized; most of the slot walls were nonparallel, except for those of the Evolve bracket. This study could not establish that the CNC method was more accurate than the MIM method in manufacturing bracket slots.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.876-880
• /
• 2009

A control flow graph(CFG) is an essential data structure for program analyses based on graph theory or control-/data- flow analyses. Esterel is an imperative synchronous language and its synchronous parallelism makes it difficult to construct a CFG of an Esterel program. In this work, we present a method to construct over-approximated CFGs for Esterel. Our method is very intuitive and generated CFGs include not only exposed paths but also invisible ones. Though the CFGs may contain some inexecutable paths due to complex combinations of parallelism and exception handling, they are very useful for other program analyses.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.4
• /
• pp.403-410
• /
• 1999

In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.