• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1804-1812
• /
• 1989

Recently, as the configuration of computer systems are changed to the system equipped with several processors, operating system to support these systems has been needed. The purpose of this paper is to implement concurrent execution of processes as synchronization mechanism by using concurrent programming language, pascal-s. In this paper, concurrnecy of processes is represented

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.517-520
• /
• 2003

Orthogonal Frequency Division Multiplexing (OFDM) is a promising technology for high speed multimedia communication in a frequency selective multipath channel. In this paper, Software IPs for the synchronizer of IEEE 802.11a Wireless LAN system are designed and optimized for TI's TMS320C6201 fixed point DSP. As a result of the execution cycles of the target DSP for each functions of the system, an efficient HW/SW partitioning method can be considered.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.4
• /
• pp.259-264
• /
• 2012

Automobile market was grown up by 1.7% at the first half of 2012 comparison with 2011 in China and this growth trend will be continued for a while. Under this market environment the China automobile companies expand the production capacity and result in heightening the intense competition for companies. This paper deals with the more efficient production line and production logistics through SPS(Synchronized Production System) with construction of MES(Manufacturing Execution System) in H automobile company in China. In plastic painting line we can simultaneously prepare the production quantity and delivery time according to assembly production plan by introducing MES. We can reduce the excess production and result in extreme reduction of inventory.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.45-56
• /
• 2017

In astronomy, the amount of data generated using wide-field optical telescope has increased exponentially. However, the fixed-size small-scale computing environment and the complexity of data analysis tools, results in difficulties to process the massive observation data collected. To resolve this problem, we propose a cloud-based automation system for the efficient processing of the enormous data gathered. The proposed system consists of a Workflow Execution Manager which manages various workflow templates and controls the execution of workflows instantiated from theses templates, and an Elastic Resource Manager that dynamically adds/deletes computing resources, according to the amount of data analysis requests. To show the effectiveness of our proposed system, we exhaustively explored a board spectrum of experiments, like elastic resources allocation, system load, etc. Finally, we describe the best practice case of DEEP-SOUTH scheduling system as an example application.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.445-455
• /
• 2002

In this paper, we present a new task scheduling scheme ior the efficient execution of the tasks of compound nodes of hierarchical task graph(HTG) on shared memory system. The proposed scheme for exploitation functional parallelism is autoscheduling that performs the role of scheduling by processor itself without any dedicated global scheduler. To adapt the proposed scheduling scheme for various platforms, Including a uni-processor systems, Java threads were used for implementation, and the performance is analyzed in comparison with a conventional bit vector method. The experimental results showed that the proposed method was found to be more efficient in its execution time and exhibited good load-balancing when using the experimental parameter values. Furthermore, the memory size could be reduced when using the proposed algorithm compared with a conventional scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.1-9
• /
• 1998

Temporal Databases store all of informations by time varying, so the temporal query processor has to process very large information. Therefore, we propose an efficient method of query processing by using the relevance checking algorithm of input query and view definition. The relevance checking algorithm of query investigates relevance between the input query of user about base relation and the execution tree of view definition stored in system catalog. And related input query with view definition have a process of the query translation to the execution tree of view. So temporal query processor is able to increase performance of query processor by reducing the number of tuple.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.5
• /
• pp.267-275
• /
• 2017

Time of difference of arrival (TDOA) method using passive sonar sensor array has normally been used to estimate the location of a concealed moving target in underwater environment. Particle filter has been introduced for effective target estimation for non-Gaussian and nonlinear systems. In this paper, we propose a GPU-based acceleration of target position estimation using particle filter and propose efficient embedded system and software architecture. For the TDOA measurement from the passive sonar sensor, we use the generalized cross correlation phase transform (GCC-PHAT) method to obtain the correlation coefficient of the signal using FFT and we try to accelerate the calculation of GCC-PHAT based TDOA measurements using FFT with GPU CUDA. We also propose parallelization method of the target position estimation algorithm using the GPU CUDA to update the state of each particle for the target position estimation using the measured values. The target estimation algorithm was verified using Matlab and implemented using GPU CUDA. Then, we realized the proposed signal processing acceleration system using NVIDIA Jetson TX1 as the target board to analyze in terms of the execution time. The execution time of the algorithm is reduced by 55% to the CPU standalone-operation on the target board. Experiment results show that the proposed architecture is a feasible solution in terms of high-performance and area-efficient architecture.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.113-118
• /
• 2021

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.97-106
• /
• 2007

In this paper, the business process was easily modeled by distinguishing between the business process and work logic. Based on this model, B2Bi collaboration Workflow modeling tool, which facilitates collaboration, was designed and implemented. The collaboration workflow modeling tool consists of 3 components; business process modeling tool, execution engine and monitoring tool. First, a business process modeling tool is used to build a process map that reflects the business logic of an application in a quick and accurate manner. Second an execution engine provides a real-time execution environment for business process instance. Third, a monitoring tool provides a real-time monitoring function for the business process that is in operation at the time. In addition to this, it supports flexibility and expandability based on XML and J2EE for the linkage with the legacy system that was used previously, and suggests a solution for a new corporate strategy and operation.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.834-845
• /
• 2000

Most agents are associated with plan rules for their tasks when they are created. In a multi-agent system in which many agents are interacting, the direct use of predefined plan rules of each agents may slow down the system due to the lack of recognition of the relationship among plan rules of the agents. In order to overcome this, we need to analyze and integrate the agent's plan rules to facilitate concurrent rule execution. This paper proposes a method that integrates and executes local plan rules of task agents in a multi-agent environment. The results of the integration are represented in a network structure. For domain task execution, a task agent collects other task agents' plan rules and builds an integrated domain network, which is exploited to achieve the goal. The agent problem solving by using the domain network enables not only the concurrent plan execution but the solution of coordination problems.