• Journal of Digital Contents Society
• /
• v.8 no.1
• /
• pp.41-50
• /
• 2007

People access web contain via PC and many other devices. In other words, not only they access information by a PC connected internet, but also they get information through a mobile phone, a PDA even D-TV. In this article, to resolve the problem, we suppose new web caching mechanism called 'SOP(Shared Object Page)'based on applying of meta data of web page information and storing adapted objects.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.70.3-70
• /
• 2001

In this paper, we suggest a kernel level multi thread web accelerator (called the SCALA-AX), which significantly improves the performance of the web soerver. In comparison with a conventional proxy web cache that is generally called a caching server and a simple content-copy based system, the primary functions and goals of SCALA-AX are designed to maximize the content services of a front end web server with high performance. Specifically, the SCALA-AX runs on the kernel level of a web sorrel, based on the newest caching techniques. Moreover, the SCALA-AX supports the http 1.1 protocol and allows the dynamic pages as well as static pages to be processed.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.651-663
• /
• 2012

Networked digital signage downloads necessary multimedia contents from a large-sized storage on WAN to its local disk of a limited size before starting their playback. If the required time to download the entire contents gets longer, a start time to play the contents at the digital signage could be delayed. In this paper, we propose a hybrid storage architecture that not only inserts an iSCSI storage layer between the existing local disk and the WAN storage, but offers a contents caching scheme in order to obtain all the necessary contents in digital signage rapidly. The proposed caching scheme determines how to place the downloaded contents both in the local disk and the iSCSI storage. Uniquely, the proposed caching scheme manages the iSCSI storage space by dividing it into two regions: (1) in one region, the digital signage can play the contents directly without downloading them into the local disk; (2) in the other region, the digital signage cannot. Performance evaluations on a simulator and an actual system with workloads of various contents show that a contents-downloading time of the hybrid storage architecture is at maximum three times shorter than that of the existing storage architecture.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2007.02a
• /
• pp.209-212
• /
• 2007

A very detail instruction of a m-Business application case for small scale company is given. Two results are proved. The one is that m-business application can reduce system building and maintaining fee. The other is that m-business application should running on the mobile machine with caching some application data on it.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.101-111
• /
• 2004

As different from wired internet, wireless internet has limitations due to the following characteristics; low bandwidth, frequent disconnection, low computing power, small screen in user terminal, and user mobility. Also, wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. Wireless proxy servers are used for the wireless internet because their caching and transcoding functions are helpful to overcome the above limitation. TranSend was proposed as a clustering based wireless proxy server but its scalability is difficult to achieve because there is no systematic way to do it. In this Paper. we proposed a clustering based wireless internet proxy server which can be scalable in a systematic way. We performed experiments using 16 PCs and experimental results show 32.17% performance improvement of the proposed system compared to TranSend system.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.243-250
• /
• 2005

To introduce the cache in a client is one of the methods to migrate the performance degradation of broadcast systems doe to the inherent restrictions of wireless communication environments such as low bandwidth or frequent disconnections. In this paper, we propose a pull-based broadcast strategy in hybrid-based data broadcast systems using bit vectors in order to effectively broadcast data recently requested by clients. Then, we propose a caching strategy considering the characteristics of data broadcast algorithm and then evaluate the performance of the system. According to the result of evaluation, the system employing the proposed strategies shows the better performance in terms of response time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.3
• /
• pp.282-291
• /
• 2004

There has been many researches in TopicMap and RDF which are approach to handle data efficiently with metadata. However, No researches has been performed to service and implement except for presentation and description. In this paper, We suggest the caching mechanism to support an efficient access of knowledgemap and practical knowledgemap service with implementation of TopicMap system. First, We propose a method to navigate Knowledgemap efficiently that includes advantage of former methods. Then, To transmit TopicMap efficiently, We suggest caching mechanism for knowledgemap. This method is that user will be able to navigate knowledgemap efficiently in the viewpoint of human, not application. Therefor the mechanism doesn't cash topics by logical or physical locality but clustering by information and characteristic value of TopicMap. Lastly, we suggest replace mechanism by using graph structure of TopicMap for efficiency of transmission.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.409-421
• /
• 2004

A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.447-454
• /
• 2001

Various caching and prefetching algorithms have been investigated to identify and effective method for improving the performance of I/O devices. A prefetching algorithm decreases the processing time of a system by reducing the number of disk accesses when an I/O is needed. This paper proposes an AMBA prefetching method that is an extended version of the OBA prefetching method. The AMBA prefetching method will prefetching blocks continuously as long as disk bandwidth is enough. In this method, though there were excessive data request rate, we would expect efficient prefetching. And in the AMBA prefetching method, to prevent the cache pollution, it limits the number of data blocks to be prefetched within the cache area. It can be implemented in a user-level File System based on a Linux Operating System. In particular, the proposed prefetching policy improves the system performance by about 30∼40% for large files that are accessed sequentially.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.77-82
• /
• 2023

Multi-cloud rendering has been attracting attention recently as the computational load of rendering fluctuates over time and each rendering process can be performed independently. However, it is challenging in multi-cloud rendering to deliver large amounts of input data instantly with consistency constraints. In this paper, we develop a new distributed file system for multi-cloud rendering. In our file system, a local machine maintains a file server that manages versions of rendering input files, and each cloud node maintains a rendering cache manager, which performs distributed cooperative caching by considering file versions. Measurement studies with rendering workloads show that the proposed file system performs better than NFS and the uploading schemes by 745% and 56%, respectively, in terms of I/O throughput and execution time.