• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1087-1090
• /
• 2005

In all contemporary superscalar processors, the result repositories are implemented as the Reorder Buffer(ROB) slots. In such designs, the ROB is a large multi-ported structure. There are several approaches for reducing the ROB complexity in processors. The one technique relies on a distributed implementation that spreads the centralized ROB structure across the function units(FUs). Each distributed component sized to match the FU workload and with one write port and one read port on each component. We are using M/M/1 Queuing theory to determine the number of entries in each ROB component that the performance of processor depends on. Our schemes are evaluated using the simulation of CPU2000 benchmarks.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.523-526
• /
• 1998

In an ongoing project at ETRI-CSTL, A debugger for distributed programs that run on a varied collection of machines is being built. To build such debugger, a clientserver model is incorporated. This strategy enables us to provide a unified user interface and isolate debugger core from the user interface. Several debugging servers running on a diverse set of platforms permit the implementation of a distributed debugger for heterogeneous environment, and the single debugging client provides unified debugging concept and graphical user interface over various servers. Also, the precise specification of the interaction protocol between the client and server facilitates client to be paired with a variety of server implementantations. This paper describes the design and implementation of our debugger, concentrating on the system architecture.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.497-502
• /
• 2004

OCSP has specific characters which can suspend, close, and correct in real time. But, as more clients use the OCSP server verification, more updated information is needed, which can lead to jamming in the OCSP server. To apply this technique of Distributed OCSP server so as to reduce the certificate verification OCSP from jamming. Also, the Distributed OCSP server will solve the problems of the intensive central structure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.314-316
• /
• 2017

Ransomware, a malicious program that requires money and then locks computers and files on network users for financial harvesting, will continue to evolve. Ransomware is a threat in mail systems that send and receive business information. By using Block Chain, Distributed Ledger technology, it is designed to be a safe mail system in which the automatically generated Ramsomware symptom data is directly linked to the security policy in the enterprise.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.457-458
• /
• 2007

This paper propose a method for representing distributed data of sensor networks. The proposed method is based on a general distributed regression framework that models sensor data by fitting a global function to each of the local measurements and explores the possible extensions of distribution regression by using complex signal representations. In order to reduce the amount of processed data and the required communication, the signal model has to be as compact as possible, with the ability to restore the arbitrary measurements. To achieve this requirement, data compression step is included, where the basis function set is changed to an overcomplete set. This have better advantages in case of nonstationary signal modeling than complete base representation.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.153-155
• /
• 2003

Laser scanning has become a viable technique for the collection of a large amount of accurate 3D point data densely distributed on the scanned object surface. The inherent 3D nature of the sub-randomly distributed point cloud provides abundant spatial information. To explore valuable spatial information from laser scanned data becomes an active research topic, for instance extracting digital elevation model, building models, and vegetation volumes. The sub-randomly distributed point cloud should be segmented and classified before the extraction of spatial information. This paper investigates some exist segmentation methods, and then proposes an octree-based split-and-merge segmentation method to divide lidar data into clusters belonging to 3D planes. Therefore, the classification of lidar data can be performed based on the derived attributes of extracted 3D planes. The test results of both ground and airborne lidar data show the potential of applying this method to extract spatial features from lidar data.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.354-356
• /
• 2003

The study of pedestrian behavior covers wide topics, including way finding, choice and decision make, as well as spatial cognition and environmental perception. To address the problem, simulation is now put forward as suitable technique and method for analyzing human spatial behavior. In the paper we present a development architecture for simulating tracking pedestrian in a distributed environment. We introduce and explore the potential of using mobile agent-enabled distributed implementation model as a tool for development and implementation of the simulation. Three kinds of mobile agents are designed for implementation of managing and querying data of pedestrian. Finally, simulation result of JR 10,000 passengers’ movement is developed and implemented as a case study.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1992.10a
• /
• pp.5-5
• /
• 1992

The DEVS(discrete event system specification) formalism describes a discrete event system in a hierarchical, modular form. DEVSIM++ is C++ based general purpose DEVS abstract simulator which can simulate systems to be modeled by the DEVS formalism in a sequential environment. We implement P-DEVSIM++ which is a parallel version of DEVSIM++. In P-DEVSIM++, the external and internal event of models can be processed in parallel. To process in parallel, we introduce a hierarchical distributed simulation technique and some optimistic distributed simulation techniques. But in our algorithm, the rollback of a model is localized itself in contrast to the Time Warp approach. To evaluate its performance, we simulate a single bus multiprocessor architecture system with an external common memory. Simulation result shows that significant speedup is made possible with our algorithm in a parallel environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.617-619
• /
• 2022

An embedded fiber-optic sensor was manufactured using 3D printing technology for distributed structural monitoring. Strain distribution of the embedded sensor was measured by the optical frequency domain reflectometry, and real-time data visualization for the embedded sensor model was demonstrated.