• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.632-639
• /
• 2011

Searching distributed resource efficiently is very important in distributed computing, cloud computing environment. Distributed resource searching may have system overheads and take much time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. The open-source community project JXTA defines an open set of standard protocols for ad hoc, pervasive, peer-to-peer computing as a common platform for developing a wide variety of decentralized network applications. In this paper, we proposed peer search algorithm based on JXTA-Sim. original JXTA peer searching algorithm selected a loosely-consistent DHT. Our Lookup algorithm decreases message number of WALK_LOOKUP and reduce the network system overload, and we make a result of same performance both original algorithm and our proposed algorithm.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.129-136
• /
• 2006

Grid computing has been appeared for solving large-scaled data which are not solved by a single computer. Grid computing is a new generation platform which connects geographically distributed heterogeneous resources. However, gathering heterogeneous distributed resources produces many difficult problems. Especially. to assure resource reliability is one of the most critical problems. So, we propose a grid resource scheduling model using grid resource reliability measurement. We evaluate resource reliability based on resource status data and apply it to the grid scheduling model in DEVSJAVA modeling and simulation. This paper evaluates parameters such as resource utilization, job loss and average turn-around time and estimates experiment results of our model in comparison with those of existing scheduling models such as a random scheduling model and a round-robin scheduling model. These experiment results showed that the resource reliability measurement scheduling model provides efficient resource allocation and stable Job processing in comparison with a random scheduling model and a round-robin scheduling model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.713-718
• /
• 2011

The advancement of computer network technology, coupled with the growing prevalence of Internet, is promoting ubiquitous computing, also called next-generation computing paradigm, as an important study field that many researches are joining and undergoing. In this paper, as the support technology for creating ubiquitous computer environment, we design the SSDLbased on XMLwhich is used for sending and receiving data by USN application service in a standardized form. A ref model, with no regard to different platforms or implementation languages, is proposed in our research on the basis of web service so that most of unspecified users could apply the standardized protocol designed for sensor data to real sensor data in various application environments based on the designed language. Therefore, through this research we can take advantage of acquisition of USN-based technology and technology draft related to application service.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.567-575
• /
• 2011

The two most popular virtual machine allocation schemes, both match making and round robin, do consider hardware specifications such as CPU, RAM, and HDD, but not CPU usage, which results in balanced resource distribution, but not in balanced resource usage. Thus, in this paper a new virtual machine allocation scheme considering current CPU usage rate is proposed while retaining even distribution of node resources. In order to evaluate the performance of the proposed scheme, a cloud computing platform composed of three cloud nodes and one front end is implemented. The proposed allocation scheme was compared with both match making and round robin schemes. Experimental results show that the proposed scheme performs better in even distribution of overall CPU usage, which results in efficient load balancing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.485-492
• /
• 2008

Computers used fer light-weight computing environments are considerably limited in resources and performance running in ubiquitous environment. Because of the limited resources, it is difficult to apply existing security technologies to the light-weight computers. In this paper, light-weight security software is implemented using RC-5 encryption and SHA-1 authentication algorithm which is appropriate for light-weight computing environments. The design of components based on security software of a light-weight computer application and the test-bed for security software are presented. The simulation verifies the correctness of the security software. The architecture of the light-weight and reconfigurable security software for light-weight computer applications is proposed. The proposed security software is small size and provides reconfigurable security library based on the light-weight component and the software manager that configures software platform is loaded with the library at the time it is needed.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.141-149
• /
• 2006

In this paper, we introduce an improved algorithm for computing matrix triple product that commonly arises in primal-dual optimization method. In computing $P=AHA^{t}$, we devise a single pass algorithm that exploits the block diagonal structure of the matrix H. This one-phase scheme requires fewer floating point operations and roughly half the memory of the generic two-phase algorithm, where the product is computed in two steps, computing first $Q=HA^{t}$ and then P=AQ. The one-phase scheme achieved speed-up of 2.04 on Intel Itanium II platform over the two-phase scheme. Based on memory latency and modeled cache miss rates, the performance improvement was evaluated through performance modeling. Our research has impact on performance tuning study of complex sparse matrix operations, while most of the previous work focused on performance tuning of basic operations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.156-170
• /
• 2019

Rapid increasing of smartphones has changed people's lifestyles, and location-based services are providing a platform to provide various conveniences in accordance with these changes. In particular, it may provide convenience to many users if location-based services are provided in an indoor area such as subway station. However, it is still a difficult task to ensure accurate positioning result for guiding routes in subway stations. This study proposes a KAI-R system that allows all processes to be performed in one system for indoor navigation in subway stations. The proposed system includes a new pedestrian step detection method for continuous positioning along with an improved fusion positioning algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.573-575
• /
• 2019

Recently, augmented reality (AR) technology has been widely used in a variety of fields such as defense, medical, education, and entertainment. In the augmented reality environment, a user can interact a virtual object by the user 's specific behaviors. Also, it is necessary to use a technique to automatically interacts among the generated virtual objects. In this paper, we propose an authoring model to apply augmented reality environments based on quantum computing inspired entanglement and overlapping phenomenon. For example, it is possible to allow the user to automatically increase and decrease the number of the object with the characteristics of the virtual object without user intervention. As a tested platform for this purpose, this paper provide an augmented reality eco-system environment with automatic interaction among virtual animals.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1650-1658
• /
• 2019

In recent years, IoT device and platform become widely popular and the computing performance and capabilities of IoT devices are also getting improved. However, the size and computing resources of IoT devices, especially small single board computer, are limited in a way that the design and implementation of the system should be carefully considered to operate on the devices. Recently, SDR technologies are adapting in IoT devices and can perform various radio systems. Thorough analysis and investigation of computer performances on small single board computer are necessary for its usage. In this paper, we present the results of computing resources measurement and analysis on small single-board computers. At first, we consider to design SDR based spectrum sensing for single board computer, investigate various key factors and propose a design procedure that can affect performance of the system with experiments.

• Genomics & Informatics
• /
• v.19 no.4
• /
• pp.49.1-49.11
• /
• 2021

Nowadays, Genomic data constitutes one of the fastest growing datasets in the world. As of 2025, it is supposed to become the fourth largest source of Big Data, and thus mandating adequate high-performance computing (HPC) platform for processing. With the latest unprecedented and unpredictable mutations in severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), the research community is in crucial need for ICT tools to process SARS-CoV-2 RNA data, e.g., by classifying it (i.e., clustering) and thus assisting in tracking virus mutations and predict future ones. In this paper, we are presenting an HPC-based SARS-CoV-2 RNAs clustering tool. We are adopting a data science approach, from data collection, through analysis, to visualization. In the analysis step, we present how our clustering approach leverages on HPC and the longest common subsequence (LCS) algorithm. The approach uses the Hadoop MapReduce programming paradigm and adapts the LCS algorithm in order to efficiently compute the length of the LCS for each pair of SARS-CoV-2 RNA sequences. The latter are extracted from the U.S. National Center for Biotechnology Information (NCBI) Virus repository. The computed LCS lengths are used to measure the dissimilarities between RNA sequences in order to work out existing clusters. In addition to that, we present a comparative study of the LCS algorithm performance based on variable workloads and different numbers of Hadoop worker nodes.