8537388
Implementation of visual MPI parallel program performance analysis tool for cluster environments
In this paper, we present visual tool for performance measurement and analysis of MPI parallel programs in cluster environments. Most of tools available today for cluster systems show solely system performance data (e.g., CPU load, memory usage, network bandwidth, machine-room temperature, server average load, among others), being more suitable for system administrators who maintain such system. The visual tool is designed to show performance data of all computer nodes involved in the execution of MPI parallel program, such as CPU load level and memory usage. Additionally, this tool is able to display comparative performance data charts of multiple executions of the application (instrumented with MPI interface) under development.
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.
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.
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.
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.
15185752
Specifying distributed multi-agent systems in chemical reaction metaphor
This paper presents an application of Chemical Reaction Metaphor (CRM) in distributed multi-agent systems (MAS). The suitability of using CRM to model multi-agent systems is justified by CRM's capacity in specifying dynamic features of multi-agent systems. A case study in an agent-based e-learning system (course material updating) demonstrates how the CRM based language, Gamma, can be used to specify the architectures of multi-agent systems. The effectiveness of specifying multi-agent systems in CRM from the view point of software engineering is further justified by introducing a transformational method for implementing the specified multi-agent systems. A computation model with a tree-structured architecture is proposed to base the design of the specified multi-agent system during the implementation phase. A module language based on the computation model is introduced as an intermediate language to facilitate the translation of the specification of multi-agent systems. The multicast networking technology pragmatizes the implementation of communications and synchronization among distributed agents. The paper also discusses the feasibility of implementing an automatic translation from the Gamma specification to a program in the module language.
53783846
Translating–transliterating named entities for multilingual information access
Named entities are major constituents of a document but are usually unknown words. This work proposes a systematic way of dealing with formulation, transformation, translation, and transliteration of multilingual-named entities. The rules and similarity matrices for translation and transliteration are learned automatically from parallel-named-entity corpora. The results are applied in cross-language access to collections of images with captions. Experimental results demonstrate that the similarity-based transliteration of named entities is effective, and runs in which transliteration is considered outperform the runs in which it is neglected. © 2006 Wiley Periodicals, Inc.
43794915
A Parallel Library for Large-Scale Sparse Eigenvalue Calculation on NEC SX-4
14603553
Towards a structural load testing tool
Load sensitive faults cause a program to fail when it is executed under a heavy load or over a long period of time, but may have no detrimental effect under small loads or short executions. In addition to testing the functionality of these programs, testing how well they perform under stress is very important. Current approaches to stress, or load, testing treat the system as a black box, generating test data based on parameters specified by the tester within an operational profile. In this paper, we advocate a structural approach to load testing. There exist many structural testing methods; however, their main goal is generating test data for executing all statements, branches, definition-use pairs, or paths of a program at least once, without consideration for executing any particular path extensively.Our initial work has focused on the identification of potentially load sensitive modules based on a static analysis of the module's code, and then limiting the stress testing to the regions of the modules that could be the potential causes of the load sensitivity. This analysis will be incorporated into a testing tool for structural load testing which takes a program as input, and automatically determines whether that program needs to be load tested, and if so, automatically generates test data for structural load testing of the program.
7536937
An algorithm for all-du-path testing coverage of shared memory parallel programs
Little attention has focused on applying traditional testing methodology to parallel programs. This paper discusses issues involved in providing all-du-path coverage in shared memory parallel programs, and describes an algorithm for finding a set of paths covering all define-use pairs. To our knowledge, this is the first effort of this kind.