• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.331-333
• /
• 2015

Data is increasing explosively with the spread of networks and mobile devices and there are problems in effectively processing the rapidly increasing data using existing recommendation techniques. Therefore, researches are being conducted on how to solve the scalability problem of the collaborative filtering technique. In this paper applies MapReduce, which is a distributed parallel process framework, to the collaborative filtering technique to reduce the scalability problem and heighten accuracy. The proposed technique applies MapReduce and the index technique to a user-based collaborative filtering technique and as a method which improves neighbor numbers which are used in similarity calculations and neighbor suitability, scalability and accuracy improvement effects can be expected.

• International Journal of Contents
• /
• v.16 no.1
• /
• pp.25-33
• /
• 2020

We develop a simulation method that affords very high variability of virtual pedagogical situations involving many independent plans, still achieves authoring (or implementation) scalability. While each individual plan would be coherently drawn up by an agent for its respective goal, those independently-made plans might be coincidentally intertwined in their execution. The inevitable non-determinism involved in this multi-event plan encompassing pre-planned and unforeseen events is resolved by (multi-phase) dynamic planning and articulated sequencing of events in contrast to static planning and monolithic authoring in conventional narrative systems. Connections between events are dictated by their associated rules and their actual connections are dynamically determined in execution time by current conditions of background-world. This unified connection scheme across pre-planned and unforeseen events allows a multi-plan, multi-agent situation to be coherently planned and executed in a global scale. To further the variability of a situation, the inter-event coupling is made in a fine level of action along with a limited episteme of each agent involved. We confirm analytically the viability of our approach with respect to the situation variability and authoring scalability, and demonstrate its practicality with an implementation of a composite situation.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.1-9
• /
• 2020

In this paper, we propose a method of in-depth analysis of internal operation process by recording library calls and related information that occur in the operation process of NoSQL database. It observes and records the specified library calls, compares the internal behavior differences between the NoSQL databases through recorded library call information, and evaluates the characteristics and scalability of each database by observing changes in the number of input data. The development of computing performance and the activation of big data have led to the emergence of different types of NoSQL databases for recording and analyzing various and large amounts of data, and it is necessary to evaluate the scalability of each database in order to select a database suitable for each environment. However, it is difficult to analyze or predict how a database operates in traditional ways, such as benchmarking, observing external behavior through performance models, or analyzing structural features based on design. Therefore, it is necessary to utilize the techniques proposed in this paper to understand the scalability of NoSQL databases with high accuracy.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.602-611
• /
• 2011

The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.195-199
• /
• 2002

Requirements of a well-designed VPNs(Virtual Private Networks) are scalability, performance, reliability, ease of management, interoperability and security. Tunneling is a important technology to support these. This paper researches VPNs tunneling technologies used currently and proposes VPN service models for the scalability that is a problem in VPNs and for the resource limit of Mobile Station in Mobile VPNs environment.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.188-191
• /
• 2010

The study investigated the optimal configuration of SVC (Scalable Video Coding) to apply to the satellite broadcasting service, and compared the performance of the SVC with that of the AVC (Advanced Video Coding). To get the optimal configuration, we analyzed the optimal bit rate allocation between the layers and the optimal scalability which requires the least bit rate for the required PSNR for various kinds of contents using JSVM. As a result of investigation, we found that the optimal bit rate allocation occurs when the bit rate of the base layer is minimum, and the spatial scalability shows the best performance. The performance of SVC is similar to that of AVC for spatial scalability, but it depends on contents.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.14 no.5
• /
• pp.537-542
• /
• 2014

The three-dimensional (3-D) NAND flash structure with fully charge storage using edge fringing field effect is presented, and its programming characteristic is evaluated. We successfully confirmed that this structure using fringing field effect provides good program characteristics showing sufficient threshold voltage ($V_T$) margin by technology computer-aided design (TCAD) simulation. From the simulation results, we expect that program speed characteristics of proposed structure have competitive compared to other 3D NAND flash structure. Moreover, it is estimated that this structural feature using edge fringing field effect gives better design scalability compared to the conventional 3D NAND flash structures by scaling of the hole size for the vertical channel. As a result, the proposed structure is one of the candidates of Terabit 3D vertical NAND flash cell with lower bit cost and design scalability.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.294-309
• /
• 2012

In the age of multi-core and specialized accelerators in high performance computing (HPC) systems, it is critical to understand application characteristics and apply suitable optimizations in order to fully utilize advanced computing system. Often time, the process involves multiple stages of application performance diagnosis and a trial-and-error type of approach for optimization. In this study, a general guideline of performance optimization has been demonstrated with two class-representing applications. The main focuses are on node-level optimization and inter-node scalability improvement. While the number of optimization case studies is somewhat limited in this paper, the result provides insights into the systematic approach in HPC applications performance engineering.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.86-87
• /
• 2018

As blockchain technology has the potential to revolutionize trust models and business processes across industries, applications are expected to be endless. However, this technology is still in the early stage, and the scalability caused by the accumulation of transaction data due to the increase of blocks is emerging as a serious problem. In this paper, we propose various alternatives to solve the scalability problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.452-474
• /
• 2010

Formidable growth of Internet technologies has revealed challenging issues about its scale and performance evaluation. Modeling and simulation play a central role in the evaluation of the behavior and performance of the large-scale network systems. Large numbers of nodes affect simulation performance, simulation execution time and scalability in a weighty manner. Most of the existing simulators have numerous problems such as size, lack of system theoretic approach and complexity of modeled network. In this work, a scalable discrete-event modeling approach is described for studying networks' scalability and performance traits. Key fundamental attributes of Internet and its protocols are incorporated into a set of simulation models developed using the Discrete Event System Specification (DEVS) approach. Large-scale network models are simulated and evaluated to show the benefits of the developed network models and approaches.