• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.3
• /
• pp.82-90
• /
• 2011

Multi-core system is becoming more general with development of microprocessors. Due to this change in performance improvement paradigm, switching conventional single thread applications with multi thread applications. Performance monitoring tools are used to optimize application performance because of complexity in development of multi thread applications. Conventional performance monitoring tools are focused on performance itself rather than user friendliness or real-time support. Real-time performance monitor identify the problem while multi-threaded applications should be performed as well as check real-time operating status of the application. So it can be used as an effective tool compared to non-real-time performance monitor that only with simple performance indicators to find the cause of the problem. In this paper, we propose RMPM(Real-time Multi-core Performance Monitor) which is real-time performance monitoring tool for multi-core system. Observation period is optimized by comparing relation between overhead due to performance evaluation period and accuracy. Our performance monitor shows not only amount of CPU usage of whole system, memory usage, network usage but also aspect of overhead distribution per thread of an application.

• Journal of Korea Game Society
• /
• v.15 no.6
• /
• pp.97-106
• /
• 2015

In an Unity engine for multi-player online games, the main thread processing game logic must be separated from the network thread that is responsible for network packet communication. Packet communication between the network threads needs to drop packets that overlap in order to improve the rendering speed. In this paper, the packet discard policy of network thread is proposed for an Unity engine for multi-player online games. The proposed method is the hybrid method of both Partial Packet Discard and Periodic Packet Discard methods to improve the rendering speed by periodically discarding overlapped network packets managed by the queue. The rendering speed of the proposed method is analyzed and its effectiveness is verified by various packet generating simulations of the Unity engine for multi-player online games.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.469-473
• /
• 2002

고성능의 인터넷과 컴퓨터의 보급은 Online Game이 개발 될 수 있는 기반을 만들었다. 또한 게임에 관련된 프로나 채널이 생길 정도의 많은 관심은 Online 게임이 급성장을 이루는데 많이 도움을 주었다. 그러나 많은 Online 게임 사용자는 서버 접속률과 진행 속도 저하의 원인된다. 그래서 접속한 많은 Client를 효과적으로 다를 수 있도록 각 게임마다의 각 특성에 맞는 Game Server의 구현을 필요로 한다. 이 논문에서는 그것의 한 방법으로 여러 개의 그룹별로 게임을 하는데 효과적인 서버를 연결 리스트와 multi-thread를 이용하여 구현하였다. Client를 효과적으로 관리하기 위하여 각 데이터를 연결 리스트로 연결하고 multi-thread 사용하여 클라이언트의 요청을 처리하였다.

• Smart Media Journal
• /
• v.8 no.3
• /
• pp.53-61
• /
• 2019

In this paper, designing and implementing multi-communication middleware in multi-thread environmet through event-based synchronization method are proposed for stable data transmission of electronic optical equipment, which requires combining camera and various sensors to process multiple high-speed data. To verify the performance of the implemented communication middleware, image data and sensor data were sent to compare differences in reception-based and transmission-based cycles, and the maximum number of communication possibilities to transmit and process multiple was measured and analyzed. In addition, the proposed communication middleware's performance was verified through experiments such as validating the integrity of the transmitted data and measuring the Round Trip Time.

• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.984-989
• /
• 2010

In this paper, parallel programming technique by using Java Thread is introduced so as to develop parallel design tool to analyze the small micro flow sensor. To estimate computing time for Thread-level parallelism, the performances of two experimental models for potential problem subject to Thermal transfer equation are examined. As a result, if the number of network PC is increase, computing time for parallelism on network environment is enhanced to be almost n times. The micro sensor design tool based on distributed computing can be utilized to analyze a large scale problem.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.499-506
• /
• 2004

The copper foil surface inspection system is necessary for the factory automation and product quality. The developed system is composed of the high speed line scan camera, the image capture board and the processing computer. For the system resource utilization and real-time processing, multi-threaded architecture is introduced. There are one image capture thread, 2 or more defect detection threads, and one defect communication thread. To process the high-speed input image data, the I/O overlap is used through the double buffering. The defect is first detected by the predetermined threshold. To cope with the light irregularity, the compensation process is applied. After defect detection, defect type is classified with the defect width, eigenvalue ratio of the defect covariance matrix and gray level of defect. In experiment, for high-speed input image data, real-time processing is possible with multi -threaded architecture, and the 89.4% of the total 141 defects correctly classified.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.245-251
• /
• 2011

Quantities of data in the DMS (Distribution management system) or SCADA (Supervisory control and data acquisition) system is enormously large as illustrated by the usage of term flooding of data. This enormous quantity of data is transmitted to the status data or event data of the on-site apparatus in real-time. In addition, if GIS (Geographic information system) and AMR (Automatic meter reading), etc are integrated, the quantity of data to be processed in real-time increases unimaginably. Increase in the quantity of data due to addition of system or increase in the on-site facilities cannot be handled through the currently used Single Thread format of data processing technology. However, if Multi Thread technology that utilizes LF-POOL (Leader Follower -POOL) is applied in processing large quantity of data, large quantity of data can be processed in short period of time and the load on the server can be minimized. In this Study, the actual materialization and functions of LF POOL technology are examined.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.13-20
• /
• 2017

A message processor is server software that receives various message formats from clients, creates the corresponding threads to process them, and lastly delivers the results to the destination. Considering that each function of an SEDA-based message processor has its own characteristics such as CPU-bound or IO-bound, this paper proposes a thread-mapping strategy called "FC-TM" (function-characteristic aware thread mapping) that schedules the threads to the cores based on the function characteristics in multi-core environments. This paper assumes that message-processor functions are static in the sense that they are pre-defined when the message processor is built; therefore, we profile each function in advance and map each thread to a core using the information in order to maximize the throughput. The benchmarking results show that the throughput increased by up to a maximum of 72 % compared with the previous studies when the ratio of the IO-bound functions to the CPU-bound functions exceeds a certain percentage.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.12
• /
• pp.469-478
• /
• 2017

The mutual exclusion is originally based on the theory of race condition prevention in symmetric multi-processor operating systems. But recently, due to the generalization of multi-core processors, its application range has been rapidly shifted to parallel processing application domain. POSIX thread, WIN32 thread, and Java thread, which are typical parallel processing application development environments, provide a unique mutual exclusion mechanism for each of them. Applications that are very sensitive to performance in these environments may want to reduce the burden of mutual exclusion, even at some cost, such as inconvenience of coding. In this study, we implement Dekker's and Peterson's algorithm in the form of busy-wait and processor-yield in various platforms, and compare the performance of them with the built-in mutual exclusion mechanisms to evaluate the usability of the classic algorithms. The analysis result shows that Dekker's algorithm of processor-yield type is superior to the built-in mechanisms in POSIX and WIN32 thread environments at least 2 times and up to 70 times, and confirms that the practicality of the algorithm is sufficient.

• Journal of Computing Science and Engineering
• /
• v.5 no.1
• /
• pp.1-18
• /
• 2011

As the first step toward real-time multi-core computing, this paper presents a novel approach to bounding the worst-case performance for threads running on multi-core processors with shared L2 instruction caches. The idea of our approach is to compute the worst-case instruction access interferences between different threads based on the program control flow information of each thread, which can be statically analyzed. Our experiments indicate that the proposed approach can reasonably estimate the worst-case shared L2 instruction cache misses by considering the inter-thread instruction conflicts. Also, the worst-case execution time (WCET) of applications running on multi-core processors estimated by our approach is much better than the estimation by simply assuming all L2 instruction accesses are misses.