This paper presents of the native function connection technique for the embedded virtual machines, base on the native function connection methods of the virtual machines such as W, WabaVM. For this goals, we designs the adapter model and then implements the new native function table for the native function connection. And we presents the variety experiment and analysis results using the implemented technique.

The main bottleneck for large scale VOD systems is bandwidth of storage or network I/O due to the large number of client requests simultaneously, and then efficient techniques are required to solve the bottleneck problem of the VOD system. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, called P2P proxy patching, for improving the typical patching technique by jointly using the prefix caching and P2P proxy. In our proposed scheme, each client plays a role in a proxy to multicast a regular stream to other clients that request the same video stream. Due to the use of the P2P proxy and the prefix caching, the client requests that ive out of the patching window range can receive the regular stream from other clients in the previous patching group without allocating the new regular channels from the VOD server to the clients. In the performance study, we show that our patching scheme can reduce the server bandwidth requirement about less than that of the existing patching technique with respect to prefix size and request interval.

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

Schedulability analysis is necessary to build reliable embedded real-time systems. For schedulability analysis, worst-case execution time(WCET) analysis that computes upper bounds of the execution times of tasks, is required indispensably. WCET analysis is done in two phases. The first phase is high-level analysis that analyzes control flow and finds longest paths of the program. The second phase is low-level analysis that computes execution cycles of basic blocks taking into account the hardware architecture. In this thesis, we design and implement integrated WCET analysis tools. We develop the WCET analysis tools for XScale-based system called WATER(WCET Analysis Tool for Embedded Real-time system). WATER consist of high-level flow analyzer and low-level execution time analyzer. Also, We compare real measurement for execution of program with analysis result calculated by WATER.

General purpose operating systems are Increasingly being used for serving time-sensitive applications. These applications require soft real-time characteristics from the kernel and from other system-level services. In this paper, we explore various operating systems techniques needed to support time-sensitive applications and describe the design of MUSMA(Multi-level Scheduler for Multimedia Application). MUSMA is a framework that combination of user-level top scheduler and kernel-level bottom scheduler. We develope MUSMA in linux environment and it`s performance is evaluated. Experiment result shows that it is possible to satisfy the constraints of multimedia in a general purpose operating system without significantly compromising the performance of non-realtime applications.

Set constraints logic language is a language that adopts `set theory` in programming. In this paper, we introduce the procedure for solving set constraints proposed by A. Dovier and show how the procedure can be implemented in logic language Prolog. The procedure is represented in `rewriting rules` and this representation is characterized by having nondeterministic rule applicationsand mathematical variables that is difficult to be implemented in general programming languages. In this paper, we show that the representation can be easily implemented by using nondeterministic control, logical variables and data structure `list` provided in Prolog. Our implementation has following advantages.First we have implemented the full features of the language. Second we have described the implementation detail in thisresearch. Third other used the commercial Prolog called SICStus, but we are using CIAO Prolog with GNU GPL(General Public License) and anyone can use it freely. Forth the software of our implementation is open source so anyone can use, modify, and distribute it freely.

In this paper, we study the average case error of the Trapezoidal rule using zero mean-Gaussian. Assume that we have n subintervals (for simplicity equal length) partitioning [0,1] and that each subinterval has the length h. Then, for , we show that the average error between simple Trapezoidal rule and the composite Trapezoidal rule on two consecutive subintervals is bounded by through direct computation of constants .

There have been large concerns about survivability defined as the capability of a system to perform a mission-critical role, in a timely manner, in the presence of attacks, failures. In particular, One of the most important core technologies required for the design of the ITS(Intrusion Tolerance System) that performs continuously minimal essential services even when the computer system is partially compromised because of intrusions is the survivability one of In included the dependability analysis of a reliability and availability etc. quantitative dependability analysis of the In. In this Paper, we applied self-healing mechanism utilizing two factors of self-healing mechanism (fault model and system response), the core technology of autonomic computing to secure the protection power of the ITS and consisted of a state transition diagram of the ITS composed of a primary server and a backup server. We also defined the survivability, availability, and downtime cost of the ITS, and then performed studies on simulation experiments and two cases of vulnerability attack. Simulation results show that intrusion tolerance capability at the initial state is more important than coping capability at the attack state in terms of the dependability enhancement.

In the process of distributing blood many troubles are arising. In order to establish a drastic solution, the current distribution must be reviewed as well as its problems must be clearly grasped. This paper introduces RFID(Radio Frequency Identification) system to solve the problems, which arise in the process of distribution, and to systemically manage blood. Among various RFID systems, the reader and tag suitable to the blood distribution are designed. Likewise, through constructing a DB that can cognize electronic tags, objects and blood-distributing RFID system are designed.

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson`s reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: `$X_{i+1}

In a large scale parallel computation, some processor or communication link failure results in a waste of huge amount of CPU hours. However, MPI in its current specification gives the user no possibility to handle such a problem. In this paper, we propose an application-level fault tolerant linear system solver by using an MPMD-type asynchronous iteration, purely on the basis of the MPI standard without using any non-standard fault-tolerant MPI library.

I studied about existent load distribution algorithms and the WLC(Weighted Least Connection) algerian that is using much at present to distribute the connection request of users to real servers efficiently in web cluster system. The efficiency of web cluster system is fallen by load imbalance between servers, because there is problem In inaccurate load status measuring of servers and measuring timing at these load distribution algorithms. In this paper, I suggest an algorithm that distributes load base on various load state of servers by real time using broadcasting RPC(Remote Procedure Call) when a user requests connection, and implement a prototype and experiment its performance. The experiment result shows that load imbalance phenomenon between reai sowers was improved greatly than existing method, and performance of web cluster system was improved by efficiency that response time is shortened.

The sharing of objects for authoring frequently occurs among participating users in a cooperative authoring system where many users can collaborate. Floor control is therefore needed not only for minimizing the race condition during object accesses but also for ensuring the exclusive use of objects. h floor is a temporary access right that is given to a participating user who wants to use a shared object. Although the floor control methods for a single session environment can be found in various literature, those methods for a multi-session environment can hardly be found. In a multi-session environment, an object can be shared by multiple sessions. As a solution to the problems due to object sharing in such an environment, this paper presents a floor control method based on the chair-of-chair guidance. This method is an extension of those based on traditional chair guidance; the chair-of-chair elected among session chairs exists in this method.

As game markets are rapidly growing, the cost and period of game development are both increasing. These imply that the game development projects require more professional management of the project. Game mechanics is an algorithm of the gameplay on a specific game-platform. Game mechanics is concentrated on engineering elements of the game and its quality should be continuously managed from the design phase to the implementation phase. In the design phase, useful methods that can analyze the quality of game mechanics are the simulations. There are several simulation methods of the game mechanics but each method has limited use range because of its characteristics. In this Paper, we survey the game mechanics simulation methods and analyze the characteristics of each method. By the analyzed results, the Petri net model simulation method is good for analyzing total quality of no-error, optimization, and play-balance of the game mechanics but others are not.

We present a methodology to design energy-efficient data paths using FPGAs. Our methodology integrates domain specific modeling, coarse-grained performance evaluation, design space exploration, and low-level simulation to understand the tradeoffs between energy, latency, and area. The domain specific modeling technique defines a high-level model by identifying various components and parameters specific to a domain that affect the system-wide energy dissipation. A domain is a family of architectures and corresponding algorithms for a given application kernel. The high-level model also consists of functions for estimating energy, latency, and area that facilitate tradeoff analysis. Design space exploration(DSE) analyzes the design space defined by the domain and selects a set of designs. Low-level simulations are used for accurate performance estimation for the designs selected by the DSE and also for final design selection We illustrate our methodology using a family of architectures and algorithms for matrix multiplication. The designs identified by our methodology demonstrate tradeoffs among energy, latency, and area. We compare our designs with a vendor specified matrix multiplication kernel to demonstrate the effectiveness of our methodology. To illustrate the effectiveness of our methodology, we used average power density(E/AT), energy/(area x latency), as themetric for comparison. For various problem sizes, designs obtained using our methodology are on average superior with respect to the E/AT performance metric, compared with the state-of-the-art designs by Xilinx. We also discuss the implementation of our methodology using the MILAN framework.

In leaner-controlled environment where learners can decide and restructure the contents, methods and order of learning by themselves, it is possible to apply individualized learning in consideration of each learner`s characteristics. The present study analyzed learners` learning path pattern, which is one of learners` characteristics important in Web-based teaching-learning process, using the Apriori algorithm and grouped learners according to their learning path pattern. Based on the result, we designed and implemented a multi-dimensional learning path pattern analysis system to provide individual learners with teaming paths, learning contents, learning media, supplementary teaming contents, the pattern of material presentation, etc. multi-dimensionally. According to the result of surveying satisfaction with the developed system satisfaction with supplementary learning contents was highest (Highly satisfied `, Satisfied`). By learners` level, satisfaction was higher in low-level learners (Highly satisfied`, Satisfied`) than in high-level learners (Highly satisfied`, `Satisfied`). The developed system is expected to provide learners with multi-dimensionally meaningful information from various angles using OLAP technologies such as drill-up and drill-down.