• Korean Journal of Computational Design and Engineering
• /
• v.19 no.3
• /
• pp.214-223
• /
• 2014

This paper presents a bottleneck detection framework using simulation approach in a wafer FAB (Fabrication). In a semiconductor manufacturing industry, wafer FAB facility contains various equipment and dozens kinds of wafer products. The wafer FAB has many characteristics, such as re-entrant processing flow, batch tools. The performance of a complex manufacturing system (i.e. semiconductor wafer FAB) is mainly decided by a bottleneck. This paper defines the problem of a bottleneck process and propose a simulation based framework for bottleneck detection. The bottleneck is not the viewpoint of a machine, but the viewpoint of a step with the highest WIP in its upstream buffer and severe fluctuation. In this paper, focus on the classification of bottleneck steps and then verify the steps are not in a starvation state in last, regardless of dispatching rules. By the proposed framework of this paper, the performance of a wafer FAB is improved in on-time delivery and the mean of minimum of cycle time.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.621-628
• /
• 2009

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the networks that have a huge number of nodes. This paper first proposes a distributed algorithm called DBND (Distributed Bottleneck Node detection) that can reduce the time for location information collection, lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions of how to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.114-120
• /
• 2005

This paper studies procedures for bottleneck detection in closed queueing networks(CQN's) with multiple job classes. Bottlenecks refer to servers operating at $100\%$ utilization. For CQN's, this can occur as the population sizes approach infinity. Bottleneck detection reduces to a non-linear complementary problem which in important special cases may be interpreted as a Kuhn-Tucker set. Efficient computational procedures are provided.

• Journal of the Korea Society for Simulation
• /
• v.22 no.3
• /
• pp.35-41
• /
• 2013

This paper applies an active period based bottleneck detection method to flow shop manufacturing system with limited buffer size. Manufacturing systems are constrained by one or more bottlenecks which degrades the system throughput. Conventional bottleneck detection methods include the waiting time or queue length of production stations and their utilization. Due to the random events such as production time of items, machine failure and repair times, the systems may change over time, and subsequently bottlenecks shift from one station to another station. Active period of working station may cause other stations to wait for productions. Information when and where active periods occur helps to find bottlenecks in production systems. Based on these informations, we predict bottlenecks in applying AweSim simulation language. We compare the simulation results of conventional methods with those obtained from duration of active period method, and duration ratio method of both sole and shift bottleneck periods. Even though simulation results are from simple flow shop model, they are quite promising for predicting bottlenecks of production stations. We hope this study aids in decision making regarding the improving system production yield and allocation of available resources of system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.681-684
• /
• 2000

본 논문은 Client & Server 모델을 기반으로 선로 이용률과 응답시간을 분석, 조합하여 웹 상에서 해당 목적지 경로 사이에 있을 수 있는 bottleneck 구간을 탐지하기 위한 시스템을 설계하였다. 이를 위해 traceroute를 이용하여 사용자와 해당 목적지 경로 사이의 인터페이스들을 추적하였다. 추적된 인터페이스들의 IP로 TCP/IP 표준 네트워크 망 관리 프로토콜인 SNMP Polling을 하여 인터페이스로부터 각종 MIB 정보들을 가져와 각 인터페이스간의 선로 이용률을 분석해냈으며, 또한 정확한 bottleneck 구간을 알아내고자 각 라우터로 ping을 실행시켜 응답시간을 계산하였다. 이렇게 얻은 선로 이용률과 응답시간으로 보다 정확한 트래픽 정보와 bottleneck 구간을 분석해낼 수 있었다. 이러한 분석 시스템으로 인해 사용자들은 전문적인 지식 없이 단지 자신의 컴퓨터의 웹브라우저를 통한 서버 분석 시스템 접속만으로도 해당 구간의 어떤 부분이 bottleneck 구간인지를 탐지, 분석할 수 있을 것이다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1835-1845
• /
• 2021

To accurately identify black ice and warn the drivers of information in advance so they can control speed and take preventive measures. In this paper, we propose a lightweight black ice detection network based on infrared road images. A black ice recognition network model based on CNN transfer learning has been developed. Additionally, to further improve the accuracy of black ice recognition, an enhanced lightweight network based on MobileNetV2 has been developed. To reduce the amount of calculation, linear bottlenecks and inverse residuals was used, and four bottleneck groups were used. At the same time, to improve the recognition rate of the model, each bottleneck group was connected to a 3×3 convolutional layer to enhance regional feature extraction and increase the number of feature maps. Finally, a black ice recognition experiment was performed on the constructed infrared road black ice dataset. The network model proposed in this paper had an accurate recognition rate of 99.07% for black ice.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1778-1784
• /
• 2016

we improved the performance by parallelizing lane detection algorithms. Lane detection, as a intellectual assisting system, helps drivers make an alarm sound or revise the handle in response of lane departure. Four kinds of algorithms are implemented in order as following, Gaussian filtering algorithm so as to remove the interferences, gray conversion algorithm to simplify images, sobel edge detection algorithm to find out the regions of lanes, and hough transform algorithm to detect straight lines. Among parallelized methods, the data level parallelism algorithm is easy to design, yet still problem with the bottleneck. The high-speed data level parallelism is suggested to reduce this bottleneck, which resulted in noticeable performance improvement. In the result of applying actual road video of black-box on our parallel algorithm, the measurement, in the case of single-core, is approximately 30 Frames/sec. Furthermore, in the case of octa-core parallelism, the data level performance is approximately 100 Frames/sec and the highest performance comes close to 150 Frames/sec.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1042-1054
• /
• 1999

공유메모리 병렬프로그램의 오류수정에서 경합의 탐지는 중요하다. 왜냐하면 경합은 잘못된 수행 결과를 초래할 뿐만 아니라, 의도하지 않은 프로그램의 비결정적인 수행을 유발하여 오류수정을 어렵게 하기 때문이다. 특히 최초경합의 탐지는 더욱 중요하다. 그 이유는 최초경합을 제거함으로써 나머지 경합들을 방지할 수도 있기 때문이다. 기존의 수행중 경합 탐지기법들은 접근별 보고방식을 기반으로 하는데, 이 기법들은 임의 공유변수에 대한 병행 쓰레드들의 모든 접근사건들을 검사하기 위해서 접근역사라는 유일한 공유정보를 이용하므로 탐지과정에 심각한 병목현상을 유발시킨다. 그러나, 최초경합 탐지를 위한 경우 이러한 병목현상은 크게 개선될 수 있다. 본 논문에서는, 각 접근사건 검사를 위해 각 쓰레드에 공유되지 않는 독립적인 접근역사를 별개로 두고, 경합을 보고하는 시점인 쓰레드 합류시점에서만 공유되는 접근역사를 이용하도록 함으로써 병목현상을 개선하여 최초경합을 탐지할 수 있는 새로운 수행중 탐지기법을 제안한다. 그러므로 본 기법은 최초경합을 보다 효율적으로 탐지할 수 있기 때문에 수행중 경합 탐지를 더욱 효율적이고 실용적으로 할 수 있다. Abstract Detecting races is important for debugging shared-memory parallel programs, because the races lead to unintended nondeterministic executions of the programs as well as erroneous result and then make debugging programs difficult. Especially, detecting the first races is more important. The reason is that the removal of the first races can make other races disappear. Most existing on-the-fly techniques to detect the races are based on per- access reporting method incurring the serious central bottleneck, because the techniques use unique shared information called access history for checking all accesses of concurrent threads to a shared variable. Such bottleneck, however, can be improved considerably in case of detecting first races. This paper presents a new on-the-fly technique which detects the first races with reduced bottleneck through checking each accesses with private access histories and finally reporting races with shared access histories. Therefore, this technique makes on-the-fly race detection more efficient and practical.

• Journal of Radiation Industry
• /
• v.6 no.1
• /
• pp.67-73
• /
• 2012

The development of radiation detection systems mainly consist of two parts-radiation detector fabrication including material development, and its appropriate electronics development. For the core-technology incubation of a radiation detection system, radiation fabrication and an evaluation facility are scheduled to be founded at the RFT (Radiation Fusion Technology) Center at KAERI (Korea Atomic Energy Research Institute) by 2015. This facility is utilized for the development and incubation of bottleneck-technologies to accelerate the industrialization of a radiation detection system in the industrial, medical, and radiation security fields. This facility is also utilized for researchers to develop next-generation radiation detection instruments. In this paper, the establishment of core-technology development is introduced and its technological mission is addressed.

• Convergence Security Journal
• /
• v.8 no.3
• /
• pp.1-8
• /
• 2008

The pattern matching part of Intrusion Detection System based on misuse-detection mechanism needs much processing time and resources, and it has become a bottleneck in system performance. Moreover, it derives denial-of-service attack. In this paper, we propose (1) framework architecture that is strong against denial-of-service attack and (2) efficient pattern matching method especially for web server system. By using both of these 2 methods, we can maintain web server system efficiently secure against attacks including denial-of-service.