• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.6
• /
• pp.521-530
• /
• 2013

This paper proposes a task parallelism system (BioMP) to improve applications' execution time of multicore based mobile device. When application developers append the functions of parallel specification into the existing software, our proposed system supports the parallel processing of threads as well as a compatibility. BioMP improves the software in order that an existing large-scale source can recognize the multicore architecture. From our experiment, our idea improved the execution time of application until about 64% against the existing system in multicore environment based on quad core. In addition, BioMP does not require any additional modification of a mobile platform because BioMP is independent component. Consequently, when application developers release multicore-aware applications into the application store, users can immediately run without any modification of the mobile device.

• Journal of the Korean Society of Safety
• /
• v.13 no.4
• /
• pp.230-239
• /
• 1998

Though limited, Model Human Processor (MHP) has been used to explain the complex users' behaviors during human-computer interactions in a simplified manner. MHP consists of perceptual, cognitive and motor systems, each with processors and memories interacting with each other in serial or parallel mode. The important parameters of memory include the storage capacity, the decay time, and the code type of a memorized item. The important parameter of a processor is the cycle time. Using these features of the model, this study developed a computerized cognitive process simulator to predict the cognitive process time of a class match task process. An experimental validity test result showed that the mean prediction time for cognitive process of the class match task simulated 50 times by the simulator was consistent with the mean cognitive process time of the same task performed by 37 subjects. Animation of the data flow during the class match task simulation will help understand the invisible human cognitive process.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.93-104
• /
• 2023

Coreference resolution is a task in discourse analysis that links several headwords used in any document object. We suggest pointer networks-based coreference resolution for Korean using multi-task learning (MTL) with an attention mechanism for a hierarchical structure. As Korean is a head-final language, the head can easily be found. Our model learns the distribution by referring to the same entity position and utilizes a pointer network to conduct coreference resolution depending on the input headword. As the input is a document, the input sequence is very long. Thus, the core idea is to learn the word- and sentence-level distributions in parallel with MTL, while using a shared representation to address the long sequence problem. The suggested technique is used to generate word representations for Korean based on contextual information using pre-trained language models for Korean. In the same experimental conditions, our model performed roughly 1.8% better on CoNLL F1 than previous research without hierarchical structure.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.1-5
• /
• 1988

The realization of high quality robot control needs the improvement of computing speed of controller. In this paper, parallel processing method is considered for this purpose. A S/W algorithm for task scheduling is developed first, and then, an appropriate H/W structure is proposed. This scheme is applied to calculate inverse kinematics of PUMA robot. The simulation results show that the computing time when using three 8086/87's is reduced to 4.23 msec compared to 10 msec in case using one 8086/87.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.631-633
• /
• 2003

인터넷 가반 분산/병렬 처리 프레임 워크 PDP(Parallel/Distributed Processing Scheme on Web)는 네트워크 내 유휴 상태 호스트들을 활용하여 대용량 작업을 병렬로 처리한다. 본 논문에서는 이러한 서브 작업을 할당받는 자원이 동작하는 네트워크 환경을 모니터링 함으로써 수시로 변화하는 네트워크 환경에 대처하는 방안을 제시한다. 특히 네트워크 환경 모니터링 예측 결과를 PDP의 작업 할당 알고리즘에 적용하여 네트워크 과부하 및 결함 등으로 인해 발생되는 작업 지연 요소에 적응적 대처함으로써 전체 작업 수행 처리율 향상을 도모하는 방법을 제안한다.

• ETRI Journal
• /
• v.42 no.5
• /
• pp.748-760
• /
• 2020

MapReduce is a framework that can process huge datasets in parallel and distributed computing environments. However, a single machine failure during the runtime of MapReduce tasks can increase completion time by 50%. MapReduce handles task failures by restarting the failed task and re-computing all input data from scratch, regardless of how much data had already been processed. To solve this issue, we need the computed key-value pairs to persist in a storage system to avoid re-computing them during the restarting process. In this paper, the task failure resilience (TFR) technique is proposed, which allows the execution of a failed task to continue from the point it was interrupted without having to redo all the work. Amazon ElastiCache for Redis is used as a non-volatile cache for the key-value pairs. We measured the performance of TFR by running different Hadoop benchmarking suites. TFR was implemented using the Hadoop software framework, and the experimental results showed significant performance improvements when compared with the performance of the default Hadoop implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.899-912
• /
• 2000

PVM provides users with a single image of high performance parallel computing machine by collecting machines distributed over a network. Low communication overhead is essential to effectively run applications on PVM based platforms. In the original PVM, three times of memory copies are required for a PVM task to send a message to a remote task, which results in performance degradation. We propose a zero-copy model using global shared memory that can be accessed by PVM tasks, PVM daemon, and network interface card(NIC). In the scheme, a task packs data into global shared memory, and notify daemon that the data is ready to be sent, then daemon routes the data to a remote task to which it is sent with no virtual data copy overhead. Experimental result reveals that the message round trip time between two machines is reduced significantly in the proposed zero-copy scheme.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1100-1122
• /
• 2023

Scheduling user-submitted cloud tasks to the appropriate virtual machine (VM) in cloud computing is critical for cloud providers. However, as the demand for cloud resources from user tasks continues to grow, current evolutionary algorithms (EAs) cannot satisfy the optimal solution of large-scale cloud task scheduling problems. In this paper, we first construct a large- scale multi-objective cloud task problem considering the time and cost functions. Second, a multi-objective optimization algorithm based on multi-factor optimization (MFO) is proposed to solve the established problem. This algorithm solves by decomposing the large-scale optimization problem into multiple optimization subproblems. This reduces the computational burden of the algorithm. Later, the introduction of the MFO strategy provides the algorithm with a parallel evolutionary paradigm for multiple subpopulations of implicit knowledge transfer. Finally, simulation experiments and comparisons are performed on a large-scale task scheduling test set on the CloudSim platform. Experimental results show that our algorithm can obtain the best scheduling solution while maintaining good results of the objective function compared with other optimization algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.1
• /
• pp.81-90
• /
• 2000

Parallel manipulator is suitable for the high precise task because it than has higher stiffness, larger load capacity and more excellent precision, due to the closed-lop structure, than serial manipulator. But the controller design for parallel manipulator is difficult because the parallel manipulator has both the complexity of structure and the interference of actuators. The precision improvement of parallel manipulator using a classical linear control scheme is difficult because the parallel manipulator has the tough nonlinear characteristics. In this paper, firstly, the kinematic analysis of a parallel manipulator used at the experiments is performed so as to show the controllability. The analysis of internal singular configuration of the workspace is performed using the kinematic isotropic index so a sto show the limitation of control performance of a simple linear controller with fixed control gains. Secondly, a control scheme is designed by using an adaptive fuzzy logic controller so that active joints of the parallel manipulator track more precisely the desired input trajectory. This adaptive fuzzy logic controller so that active joints of the parallel manipulator track more precisely the desired input trajectory. This adaptive fuzzy logic controller is often used for the control of nonlinear system because it has both the inference ability and the learning ability. Lastly, the effeciency of designed control scheme is demonstrated by the real-time control experiments with IBM PC interface logic H/W and S/W of my won making. The experimental results was a success.