11888498
The Design and Implementation of Extensible Information Services
High-performance distributed computing often requires careful selection and configuration of computers, networks, application protocols, and algorithms. In grid environment, the participators of domains provide site information by default that may be not adequate for resources manager to achieve optimal performance. In this paper, an Extensible Information Service Architecture (EISA) is described to resolve this problem. EISA supports a virtual organization participator's autonomous control of local resources. It consists of three layers, the registration and deployment layer, normalization and organization layer, and information collection layer. Dynamic information services in EISA could be deployed and extended easily. EISA improves the extensibility of grid information services and the efficiency of resources utilization.
20644298
MASSIVE: a multidisciplinary applications-oriented simulation and visualization environment
The objective of the MASSIVE project is to build a grid platform to enable large-scale and distributed scientific and engineering computations. Its focus is numerical simulation and visualization. This paper addresses a prototype grid utilizing resources at the Center for Engineering and Scientific Computation (CESC) in Zhejiang University (ZJU). This grid is capable of taking a model geometry generated by CAD systems, transferring it to an SGI Onyx 3900 supercomputer where it is meshed. The meshed geometry is then transferred to a Dawning PC cluster where it is used to solve computational fluid dynamics and computational solid mechanics problems and it is finally visualized showing numerical results.
7408751
Quantitative Association Analysis Using Tree Hierarchies
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, association analysis aims to find dependencies of target variables to subsets of measurements. Most previous algorithms adopt a two-stage approach; they first group samples based on the similarity in the subset of measurements, and then they examine the association between these groups and the specified target variables without considering the inter-group similarities or alternative groupings. This can lead to cases where the strength of association depends significantly on arbitrary clustering choices. In this paper, we propose a tree-based method for quantitative association analysis. Tree hierarchies derived from sample similarities represent many possible sample groupings. They also provide a natural way to incorporate domain knowledge such as ontologies and to identify and remove outliers. Given a tree hierarchy, our association analysis evaluates all possible groupings and selects the one with strongest association to the target variable. We introduce an efficient algorithm, TreeQA, to systematically explore the search-space of all possible groupings in a set of input trees, with integrated permutation tests. Experimental results show that TreeQA is able to handlelarge-scale association analysis very efficiently and is more effective and robust in association analysis than previous methods.
14969897
Dynamic adaptive file management in a local area network
In light of advances in processor and networking technology, especially the emergence of network attached disks, the traditional client-server architecture of file systems has become suboptimal for many computation/data intensive applications. We introduce a revised architecture for file management employing network attached storage: the dynamic file server environment (Dynamo). Dynamo introduces two main architectural innovations: to provide high scalability, the file management functions are mainly performed cooperatively by the clients in the system. Furthermore, data is transferred directly to the client's cache from network-attached disks, thus avoiding copies from a disk to the server buffer and then over the network to the client. Secondly, Dynamo uses a cooperative cache management which employs a decentralized lottery-based page replacement strategy. We show via performance benchmarks run on the Dynamo system and simulation results how this architecture increases the system's adaptability, scalability and cost performance.
37619733
Taming Underlying Design for Energy Efficient Distributed Source Coding in Multirate Wireless Sensor Network
Signal processing applications such as Distributed Source Coding (DSC) in Wireless Sensor Network (WSN) are often multirate in nature, which provide additional significant opportunities in WSN design for achieving energy efficiency. In this paper, we analyze the DSC traffic for signal processing applications in multirate WSN and propose a novel rate oriented approach with MAC and PHY cross layer utilization to achieve high energy efficiency. Simulation results show that the proposed approach achieves significant energy efficiency by a factor of three while maintaining the transmission quality in WSN. This approach can be easily extended to other WSN MAC and PHY designs, providing multirate service to application layer to allow achieving higher energy efficiency
16209599
Extend SRML schema based on DEVS: an executable DEVS language
This paper analyzes the significance of the representation and reusability of SRML when being used in simulation models as well as its drawbacks. The paper also discusses the ways to extend SRML schema based on DEVS. The emphasis is placed on the elaboration of mapping DEVS onto SRML schema to formulate SRML's basic syntax and semantics for the structure and behavior representation of atomic model and coupled model. The model structure, such as property, input interface, output interface and sub-model composition, are described by a group of XML marks. The model behavior, such as external transition, internal transition, output and time-advance functions are described by script language and a group of standard interface offered by SRML simulator in script marks. The paper then reviews the SRML element architecture and finally gives a simulation demo of using SRML to build differential equation model.
15644746
RRNS quasi-chaotic coding and its FPGA implementation
In this paper, a new architecture of the redundant residue number system (RRNS) based quasi-chaotic coding is proposed for the secure telecommunication systems and networks. In the proposed architecture, a number of modulo operations required by the existing designs are replaced by binary coding operations to simplify the design. Also, a moduli selection method and a residue-to-binary converter with error-correction capability are proposed to further improve the efficiency of the design specifically for FPGA implementation. The proposed architecture is implemented and tested using Matlab and Xilinx FPGA hardware. The results show that compared to the existing design, the proposed design requires only 80% of the hardware resources while maintaining the same speed. The power consumption is also reduced by 25%.