• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.165-175
• /
• 2007

The mobile agent executes a given task by which the agent code moves to the server directly. Therefore, node migration method becomes an important factor which impact on the whole performance of distributed system. In this paper, we propose an adaptive migration path technique of mobile agent using the metadata of naming agent. In this proposed technique, node selection for migration depends on the content of referenced metadata, and the reliability of migrated information is determined by the metadata updating method and cooperative operations of individual agents in multi-agents system. For these, we design the metadata using by the number of hit documents, hit ratio, node processing time and network delay time, and describe the methods for creating, using and updating metadata for which determine the adaptive node migration path of mobile agent according to the cooperation of individual agents and number of hit documents using by designed metadata. And results of evaluated performance for proposed adaptive migration path technique through the proper experiment and analysis gain rate of high effective information earning, because of high hit ratio(72%) about of fathered documents by case of applying metadata move to the 13 nodes. But, in case of non-applying metadata is hit ratio(46%) of gathered documents and rate of effective information earning about of 26 nodes is 36.8%.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.137-148
• /
• 2011

Different from the traditional client-server model, it is possible for participants in a cooperative distributed system to get quality services regardless of the number of participants in the system since they voluntarily pool or share their resources in order to achieve their common goal. However, some selfish participants try to avoid providing their resources while still enjoying the benefits offered by the system, which is termed free-riding. The results of free-riding in cooperative distributed systems lead to system collapse because the system capacity (per participant) decreases as the number of free-riders increases, widely known as the tragedy of commons. As a consequence, designing an efficient incentive mechanism to prevent free-riding is mandatory for a successful cooperative distributed system. Because of the importance of incentive mechanisms in cooperative distributed system, a myriad of incentives mechanisms have been proposed without a standard for performance evaluation. This paper draws general incentive design considerations which can be used as performance metrics through an extensive survey on this literature, providing future researchers with guidelines for the effective incentive design in cooperative distributed systems.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.157-168
• /
• 2011

Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.

• KIISE Transactions on Computing Practices
• /
• v.22 no.8
• /
• pp.369-374
• /
• 2016

The growing demand of virtual computing and storage resources in the cloud computing environment has led to deduplication of storage system for effective reduction and utilization of storage space. In particular, large reduction in the storage space is made possible by preventing data with identical content as the virtual desktop images from being stored on the virtual desktop infrastructure. However, in order to provide reliable support of virtual desktop services, the storage system must address a variety of workloads by virtual desktop, such as performance overhead due to deduplication, periodic data I/O storms and frequent random I/O operations. In this paper, we designed and implemented a clustered file system to support virtual desktop and storage services in cloud computing environment. The proposed clustered file system provides low storage consumption by means of inline deduplication on virtual desktop images. In addition, it reduces performance overhead by deduplication process in the data server and not the virtual host on which virtual desktops are running.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.232-238
• /
• 2003

Traditional operating systems use a virtual memory to provide users with a bigger memory than a physical memory. The virtual memory augments the insufficient physical memory by the swap device. Since disks are usually used as the swap device, the cost of a page fault is relatively high compared to the access cost of the physical memory. Recently, numerous papers have investigated the Network RAM in order to exploit the idle memory in the network instead of disks. Since today's distributed systems are interconnected with high-performance networks, the network latency is far smaller than the disk access latency In this paper we design and implement the Network RAM using block device driver on Linux. This is the first implementation of the Network RAM on Linux. We propose the new reliability method to recover the page when the other workstation's memory is damaged. The system using the Network RAM as the swap device reduces the execution time by 40.3% than the system using the disk as the swap device. The performance results suggest that the new reliability method that use the processor more efficiently has the similar execution time with others, but uses smaller server memory and generates less message traffic than others.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.83-93
• /
• 2012

HTML5 has developed not to have browser dependancy considering interoperability as same as maintaining compatability with lower versions of HTML. HTML5, the newest web standardization is on going of being structured. Along with the smart phone boom, HTML5 is spotlighted because it can be applied to cross platforms in mobile web environments. Specially the local Storage that has been listed in new features in HTML5 supports offline function for web application that enables web application to be run even when the mobile is not connected to 3G or wifi. With Local storage, development of server-independent web application can be possible. However Local storage stores plaintext data in it without applying any security measure and this makes the plaintext data dangerous to security threats that are already exist in other client side storages like Cookie. In the paper we propose secure Local storage methods to offer a safe way to store and retrieve data in Local storage guaranteeing its performance. Suggested functions in this paper follow localStorage standard API and use a module that provide cryptographic function. We also prove the efficiency of suggested secure Local storage based on its performance evaluation with implementation.

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

One of the Cooperative Intelligent Transportation System(C-ITS) priority services is collision prevention support service. Several studies have considered V2I2V communication-based collision prevention support services using Artificial Neural Networks(ANN). However, such services still show some issues due to a low penetration of C-ITS devices and large delay, particularly when loading massive traffic data into the server in the C-ITS center. This study proposes the Artificial Neural Network-based Collision Warning Service(ACWS), which allows upstream vehicle to update pre-determined weights involved in the ANN by using real-time sectional traffic information. This research evaluates the proposed service with respect to various penetration rates and delays. The evaluation result shows the performance of the ACWS increases as the penetration rate of the C-ITS devices in the vehicles increases or the delay decreases. Furthermore, it reveals a better performance is observed in more advanced ANN model-based ACWS for any given set of conditions.

• Journal of Broadcast Engineering
• /
• v.27 no.3
• /
• pp.318-331
• /
• 2022

With the recent development of hardware computing devices and software based frameworks, machine tasks using deep learning networks are expected to be utilized in various industrial fields and personal IoT devices. However, in order to overcome the limitations of high cost device for utilizing the deep learning network and that the user may not receive the results requested when only the machine task results are transmitted from the server, Collaborative Intelligence (CI) proposed the transmission of feature maps as a solution. In this paper, an efficient compression method for feature maps with vast data sizes to support the CI paradigm was analyzed and presented through experiments. This method increases redundancy by applying feature map reordering to improve compression efficiency in traditional video codecs, and proposes a feature map method that improves compression efficiency and maintains the performance of machine tasks by simultaneously utilizing image compression format and video compression format. As a result of the experiment, the proposed method shows 14.29% gain in BD-rate of BPP and mAP compared to the feature compression anchor of MPEG-VCM.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.25-34
• /
• 2020

In the current medical information system, a system environment is constructed in which Biometric data generated by using IoT or medical equipment connected to a patient can be stored in a medical information server and monitored at the same time. Also, the patient's biometric data, medical information, and personal information after simple authentication using only the ID / PW via the mobile terminal of the medical staff are easily accessible. However, the method of accessing these medical information needs to be improved in the dimension of protecting patient's personal information, and provides a quick authentication system for first aid. In this paper, we implemented an automatic authentication system based on the patient's situation and evaluated its performance. Patient's situation was graded into normal and emergency situation, and the situation of the patient was determined in real time using incoming patient biometric data from the ward. If the patient's situation is an emergency, an emergency message including an emergency code is send to the mobile terminal of the medical staff, and they attempted automatic authentication to access the upper medical information of the patient. Automatic authentication is a combination of user authentication(ID/PW, emergency code) and mobile terminal authentication(medical staff's role, working hours, work location). After user authentication, mobile terminal authentication is proceeded automatically without additional intervention by medical staff. After completing all authentications, medical staffs get authorization according to the role of medical staffs and patient's situations, and can access to the patient's graded medical information and personal information through the mobile terminal. We protected the patient's medical information through limited medical information access by the medical staff according to the patient's situation, and provided an automatic authentication without additional intervention in an emergency situation. We performed performance evaluation to verify the performance of the implemented automatic authentication system.