Browsing by Author "Chiang, Mei-Ling"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Item, A server-side pre-linking mechanism for updating embedded clients dynamically(2007) ;Shen, Bor-Yeh ;Chiang, Mei-Ling ;資訊工程學系Department of Computer ScienceTo allow embedded operating systems to update their components on-the-fly, dynamic update mechanism is required for operating systems to be patched or added extra functionalities in without the need of rebooting the machines. However, embedded environments are usually resource-limited in terms of memory size, processing power, power consumption, and network bandwidth. Thus, dynamic update for embedded operating systems should be designed to make the best use of limited resources. In this paper, we have proposed a server-side pre-linking mechanism to make dynamic updates of embedded operating system efficiently. Applying this mechanism can reduce not only memory usage and CPU processing time for dynamic update, but also data transmission size for update components. Power consumption can be reduced as well. Performance evaluation shows that compared with the approach of Linux loadable kernel modules, the size of update components can be reduced about 14-35% and the overheads in embedded clients are minimal.Item type:Item, A Server-side Pre-linking Mechanism for Updating Embedded Operating System Dynamically(2010-01-01) ;Shen, Bor-Yeh ;Chiang, Mei-Ling ;資訊工程學系Department of Computer ScienceTo allow embedded operating systems to update their components on-the-fly, dynamic update mechanism is required For operating systems to be patched or added extra functionalities in without the need of rebooting the machines However. embedded environments are usually resource-limited in terms of memory size, processing power, power consumption, and network bandwidth Thus. dynamic update for embedded operating systems should be designed to make the best use of limited resources In this paper, a server-side pre-linking mechanism is proposed to make dynamic updates of embedded operating system efficiently Applying this mechanism can reduce not only memory usage and CPU processing time for dynamic update, but also data transmission size for updated components Power consumption can be reduced as well We have implemented this mechanism in LyraOS which is a component-based embedded operating system Performance evaluation shows that the size of updated components applying the proposed dynamic update mechanism can be 65-86% smaller than applying the approach of Linux loadable kernel modules Especially, the overheads in embedded clients are minimal since the component linking time in embedded clients is eliminatedItem type:Item, Efficient support for content-aware request distribution and persistent connection in Web clusters(2007-09-01) ;Liu, Ho-Han ;Chiang, Mei-Ling ;Wu, Men-Chao ;資訊工程學系Department of Computer ScienceTo support Web clusters with efficient dispatching mechanisms and policies, we propose a light-weight TCP connection transfer mechanism, TCP Rebuilding, and use it to develop a content-aware request dispatching platform, LVS-CAD, in which the request dispatcher can extract and analyze the content in requests and then dispatch each request by its content or type of service requested. To efficiently support HTTP/1.1 persistent connection in Web clusters, request scheduling should be performed per request rather than per connection. Consequently, multiple TCP Rebuilding, as an extension to normal TCP Rebuilding, is proposed and implemented. On this platform, we also devise fast TCP module handshaking to process the handshaking between clients and the request dispatcher in the IP layer instead of in the TCP layer for faster response times. Furthermore, we also propose content-aware request distribution policies that consider cache locality and various types of costs for dispatching requests in this platform, which makes the resource utilization of Web servers more effective. Experimental results of a practical implementation on Linux show that the proposed system, mechanisms, and policies can effectively improve the performance of Web clusters. Copyright (C) 2007 John Wiley & Sons, Ltd.