• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1122-1133
• /
• 2019

We have designed and implemented a new data processing framework called MOHA(Mtc On HAdoop) which can effectively support Many-Task Computing(MTC) applications in a YARN-based Hadoop platform. MTC applications can be composed of a very large number of computational tasks ranging from hundreds of thousands to millions of tasks, and each MTC application may have different resource usage patterns. Therefore, we have implemented MOHA-TaskExecutor(a pilot-job that executes real MTC application tasks)'s Adaptive Parallel Computability which can adaptively execute multiple tasks simultaneously, in order to improve the parallel computability of a YARN container and the overall system throughput. We have implemented multi-threaded version of TaskExecutor which can "independently and dynamically" adjust the number of concurrently running tasks, and in order to find the optimal number of concurrent tasks, we have employed Hill-Climbing algorithm.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.6
• /
• pp.1-10
• /
• 2004

A haptic rendering system is proposed for a puncture task of a virtual vertebra model. To build a mesh model from medical images, Delaunay triangulation is applied and physical models are based on elasticity theory. Also, a redundant actuated 6 DOF parallel type haptic device is designed to display large force and to resolve the singularity problem of parallel type mechanisms. Haptic feeling of puncture task and the performance of the proposed haptic device are tested by two puncture task experiments.

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

• Korean Journal of Child Studies
• /
• v.20 no.3
• /
• pp.231-244
• /
• 1999

This study examined the effects of short and long term playing of video gamer on children's visual parallel processing. All of the 64 fourth grade subjects were above average in IQ. They were classified into high and low video game users. Instruments were a visual parallel processing task consisting of imagery integration items, computers, and the arcade video game, Pac-Man. Subjects were pre-tested with a visual parallel processing task. After one week, the experimental group played video games for 15 minutes, but the control group didn't play. Immediately following this, all children were post-tested by the same task used on the pretest. The data was analyzed by ANCOVA and repeated measures ANOVA. The results showed that relaying short-term video games improved visual parallel processing and that long term experience with video games also affected visual parallel processing. there were no differences between high and low users in visual parallel processing after playing short term video games.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.2
• /
• pp.181-189
• /
• 2000

This paper presents the optimal redundant actuation of parallel manipulators for complicated robotic applications such as cutting grinding drilling and digging that require a high degree of operational stiffness as well as the balance between force applicability and dexterity. First by taking into account the distribution(number and location) of active joints the statics and the operational stiffness of a redundant parallel manipulator are formulated and the effects of actuation redundancy are analyzed, Second for given task requirements including joint torque limit task force maximum allowable disturbance and maximum allowable deflection the task execution conditions of a redundant parallel manipulator are derived and the efficient testing formulas are provided. Third to achieve high operational stiffness while maintaining moderate dexterity the redundant actuation of a parallel manipulator is optimized which determines the optimal distribution of active joints and the optimal internal joint torque, Finally the simulation results for the optimal redundant actuation of a planar parallel manipulator are given.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1636-1651
• /
• 1997

In task parallel language like Fortran M, programmer writes a task parallel program using parallel constructs which is provided. When some data dependencies exist between called procedures in various applications, it is difficult for programmer to write program according to their dependencies. Therefore, it is desirous that compiler can detect some implicit parallelisms and transform a program to parallelized form by using the task parallel constructs like PROCESSES block or PROCESSDO loop of Fortran M. But current task parallel language compilers can't provide these works. In this paper, we analyze the cases according to dependence relations and detect the implicit parallelism which can be transformed to task parallel constructs like PROCESSES block and PROCESSDO loop of Fortran M. Also, For the case which program can be paralleized both PROCESSES block and PROCESSDO loop, we analyze that which construct is more effective for various conditions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.764-767
• /
• 1997

This paper presents the modulation of the dexterity of a parallel manipulator using joint freezing/releasing and joint unactuation/actuation. In this paper, individual limbs have redundant number of joints, and each joint can be frozen/released and unactuated/actuated, as needed. First, given a task, the restrictions on joint freezing and joint unactuation of a parallel manipulator are derived. Next, with/without joint freezing and/or joint unactuation, the kinematics of a parallel manipulator is formulated, based on which the manipulability ellipsoid is defined. The effects of joint freezing and joint unactuation on the manipulability are analyzed and compared. Finally, simulation results for a planar parallel manipulator are given. Joint mechanisms, such as joint freezing and joint unactuation, are rather simple to adopt into a parallel manipulator, but is quite effective to improve the task adaptability of the system.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.4
• /
• pp.38-49
• /
• 1998

A fossil power plant can be modeled by a lot of algebraic equations and differential equations. When we simulate a large, complicated fossil power plant by a computer such as workstation or PC, it takes much time until overall equations are completely calculated. Therefore, new processing systems which have high computing speed is ultimately needed for real-time or high-speed(faster than real-time) simulators. This paper presents an enhanced strategy in which high computing power can be provided by parallel processing of DSP processors with communication links. DSP system is designed for general purpose. Parallel DSP system can be easily expanded by just connecting new DSP modules to the system. General urpose DSP modules and a VME interface module was developed. New model and techniques for the task allocation are also presented which take into account the special characteristics of parallel I/O and computation. As a realistic cost function of task allocation, we suggested 'simulation period' which represents the period of simulation output intervals. Based on the development of parallel DSP system and realistic task allocation techniques, we cound achieve good efficiency of parallel processing and faster simulation speed than real-time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.145-150
• /
• 1999

A real-time control system, composed of the controlled processor and the controller computer(s), may have a variety of task types, some of which have tight timing-constraints in generating the correct control input. The maximum period of those task failures tolerable by the system is called the hard deadline, which depends on not only fault characteristics but also task characteristics. In the paper, we extend a method deriving the hard deadline in LTI system executing single task. An algorithm to combine the deadlines of all the elementary tasks in the same operation-mode is proposed to derive the hard deadline of the entire system. For the end, we modify the state equation for the task to capture the effects of task failures (delays in producing correct values) and inter-correlation. We also classify the type of executing the tasks according to operation modes associated with relative importance of correlated levels among tasks, into series, parallel, and cascade modes. Some examples are presented to demonstrate the effectiveness of the proposed methods.

• Journal of Information Processing Systems
• /
• v.8 no.2
• /
• pp.331-346
• /
• 2012

Task-based programming is becoming the state-of-the-art method of choice for extracting the desired performance from multi-core chips. It expresses a program in terms of lightweight logical tasks rather than heavyweight threads. Intel Threading Building Blocks (TBB) is a task-based parallel programming paradigm for multi-core processors. The performance gain of this paradigm depends to a great extent on the efficiency of its parallel constructs. The parallel overheads incurred by parallel constructs determine the ability for creating large-scale parallel programs, especially in the case of fine-grain parallelism. This paper presents a study of TBB parallelization overheads. For this purpose, a TBB micro-benchmarks suite called TBBench has been developed. We use TBBench to evaluate the parallelization overheads of TBB on different multi-core machines and different compilers. We report in detail in this paper on the relative overheads and analyze the running results.