14699908
Performance Analysis of Applying Replica Selection Technology for Data Grid Environments
The Data Grid enables the sharing, selection, and connection of a wide variety of geographically distributed computational and storage resources for solving large-scale data intensive scientific applications. Such technology efficiently manage and transfer terabytes or even petabytes of data for data-intensive, high-performance computing applications in wide-area, distributed computing environments. Replica selection process allows an application to choose a replica from replica catalog, based on its performance and data access features. In this paper, we build a Grid environment based on three existing PC Cluster environments and perform performance analysis of data transfers using GridFTP protocol over these systems. In addition, based on experimental results, it is proposed a cost model to pick the best replica, in real and dynamic network situations.
7749374
A Performance-Based Approach to Dynamic Workload Distribution for Master-Slave Applications on Grid Environments
Effective workload distribution techniques can significantly reduce the total completion time of a program on grid computing environments. In this paper, we propose a dynamic performance-based workload partition approach for master-slave types of applications on grids. Furthermore, we implement two types of applications and conduct the experimentations on our grid testbed. Experimental results showed that our method could execute more efficiently than traditional schemes.
5672930
An e-Learning Platform Based on Grid Architecture
The overall popularity of the Internet has helped e-learning become a hot method for learning in recent years. Over the Internet, learners can freely absorb new knowledge without restrictions on time or place. Many companies have adopted e-learning to train their employees. An e-learning system can make an enterprise more competitive by increasing the knowledge of its employees. E-learning has been shown to have impressive potential in e-commerce. At present, most e-learning environment architectures use single computers or servers as their structural foundations. As soon as their work loads increase, their software and hardware must be updated or renewed. This is a big burden on organizations that lack sufficient funds. Thus, in this study we employ a kind of Grid Computing technology, called the ”Data Grid” to integrate idle computer resources in enterprises into e-learning platforms, thus eliminating the need to purchase costly high-level servers and other equipment.
7849532
A Peer-to-Peer Resource Sharing System with Data Grid Technology for Mobile Devices
Increases in mobile device processing power, storage capacity, and connectivity in recent years have led to a rapid rise in mobile device use. But mobile users face challenges in making connections with other users in order to share resources. To address this issue, we propose an architecture that uses peer-to-peer protocol to establish a resource sharing platform for mobile devices, combined with a data grid to help analyze and classify resources.
12951016
A shareable e-learning platform using data grid technology
Over the past decade, speed in the transmission of knowledge is no longer the way it used to be. Due to this influence, conventional educational methodology has also followed this trend and has gone through a momentous transformation. An excellent example is e-learning which has achieved and broken through the restrictions of time and space. In recent years it has become one of the most popular teaching methods. SCORM (Sharable Course Object Reference Model) the most popular e-learning standard has been adapted from many differing e-learning platforms. Normally, courseware meeting SCORM standards is sharable with other e-learning platforms. Most e-learning platforms however are unable to share courseware directly on the Internet. With this in mind, we have employed one type of grid computing technology called "data grid" in order to achieve this. This technology allows the integration of different SCORM platforms into a huge e-learning environment.
32464432
An Enhanced Parallel Loop Self-Scheduling Scheme for Cluster Environments
In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance.
6108459
Fast multiple object tracking via a hierarchical particle filter
A very efficient and robust visual object tracking algorithm based on the particle filter is presented. The method characterizes the tracked objects using color and edge orientation histogram features. While the use of more features and samples can improve the robustness, the computational load required by the particle filter increases. To accelerate the algorithm while retaining robustness we adopt several enhancements in the algorithm. The first is the use of integral images for efficiently computing the color features and edge orientation histograms, which allows a large amount of particles and a better description of the targets. Next, the observation likelihood based on multiple features is computed in a coarse-to-fine manner, which allows the computation to quickly focus on the more promising regions. Quasi-random sampling of the particles allows the filter to achieve a higher convergence rate. The resulting tracking algorithm maintains multiple hypotheses and offers robustness against clutter or short period occlusions. Experimental results demonstrate the efficiency and effectiveness of the algorithm for single and multiple object tracking.
16561888
Learning to predict train wheel failures
This paper describes a successful but challenging application of data mining in the railway industry. The objective is to optimize maintenance and operation of trains through prognostics of wheel failures. In addition to reducing maintenance costs, the proposed technology will help improve railway safety and augment throughput. Building on established techniques from data mining and machine learning, we present a methodology to learn models to predict train wheel failures from readily available operational and maintenance data. This methodology addresses various data mining tasks such as automatic labeling, feature extraction, model building, model fusion, and evaluation. After a detailed description of the methodology, we report results from large-scale experiments. These results clearly show the great potential of this innovative application of data mining in the railway industry.
43794915
A Parallel Library for Large-Scale Sparse Eigenvalue Calculation on NEC SX-4
6374629
A Multimedia Synchronization Model and Its Implementation in Transport Protocols
An implementation of a synchronization mechanism in transport protocol to support multimedia applications over a packet or cell switched network is proposed. In designing such a mechanism for practical use, ease of implementation and capability of handling random delay of packets are two key issues for success. Since the random delay of packet or cell switched networks makes synchronization among media more complicated after the transmission across the network, a model which considers the random transmission delay is hence required to specify the temporal relationship among media. Therefore, a real-time synchronization model is presented to satisfy this requirement in the paper. Based on the proposed synchronization model, a transport protocol, namely the multimedia synchronization transport protocol (MSTP), is designed and implemented. We have implemented a prototype system using the MSTP protocol and built a simulation system for the wide area network (WAN) environment in order to evaluate the performance of the MSTP protocol.
636423
Visualization of large category map for Internet browsing
Information overload is a critical problem in World Wide Web. Category map developed based on Kohonen's self-organizing map (SOM) has been proven to be a promising browsing tool for the Web. The SOM algorithm automatically categorizes a large Internet information space into manageable sub-spaces. It compresses and transforms a complex information space into a two-dimensional graphical representation. Such graphical representation provides a user-friendly interface for users to explore the automatically generated mental model. However, as the amount of information increases, it is expected to increase the size of the category map accordingly in order to accommodate the important concepts in the information space. It results in increasing of visual load of the category map. Large pool of information is packed closely together on a limited size of displaying window, where local details are difficult to be clearly seen. In this paper, we propose the fisheye views and fractal views to support the visualization of category map. Fisheye views are developed based on the distortion approach while fractal views are developed based on the information reduction approach. The purpose of fisheye views are to enlarge the regions of interest and diminish the regions that are further away while maintaining the global structure. On the other hand, fractal views are an approximation mechanism to abstract complex objects and control the amount of information to be displayed. We have developed a prototype system and conducted a user evaluation to investigate the performance of fisheye views and fractal views. The results show that both fisheye views and fractal views significantly increase the effectiveness of visualizing category map. In addition, fractal views are significantly better than fisheye views but the combination of fractal views and fisheye views do not increase the performance compared to each individual technique.