We introduce a class of multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. This technique is based on a recursive two by two block incomplete LU factorization on...
详细信息
The intersection of superconductivity and ferroelectricity hosts a wide range of exotic quantum phenomena. Here, we report on the observation of superconductivity in high-quality tin telluride films grown by molecular...
详细信息
Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtua...
详细信息
Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual net- works affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evalua- tion, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies (e.g., AT&T, DFN) and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.
Applications with divisible loads have such a rich source of parallelism that their parallelization can significantly reduce their total completion time on grid computing environments. However, it is a challenge for g...
详细信息
Applications with divisible loads have such a rich source of parallelism that their parallelization can significantly reduce their total completion time on grid computing environments. However, it is a challenge for grid users, probably scientists and engineers, to develop their applications which can exploit the computing power of the grid. We propose a performance-based skeleton algorithm for implementing divisible load applications on grids. Following this skeleton, novice grid programmers can easily develop a highperformance grid application. To examine the performance of programs developed by this approach, we apply this skeleton to implement three kinds of applications and conduct experiments on our grid test-bed. Experimental results show that programs implemented by this approach run more rapidly than those using conventional scheduling schemes.
In this work, a Storm-based query language System(SQLS) is proposed for real-time data stream analysis. The system is compatible with Continuous query language(CQL) specification. It supports both continuous queries a...
详细信息
In this work, a Storm-based query language System(SQLS) is proposed for real-time data stream analysis. The system is compatible with Continuous query language(CQL) specification. It supports both continuous queries and one-time queries over streaming data, and meets the requirements of user experience(traditional SQL queries) and Qo S(such as real-time and throughput). In order to better meet the requirement of throughput and enhance the processing efficiency, the load shedding algorithm and cache optimization are employed during the implementation of SQL-like operators. Finally, performance testing of the proposed SQLS has been conducted on standalone Storm platform and Storm clusters. Experimental results show that our system can not only meet the needs of users, but also extend the function of real-time streaming queries processing.
A global seventh-order dissipative compact finite-difference scheme is optimized in terms of time stability. The dissipative parameters appearing in the boundary closures are assumed to be different, resulting in an o...
详细信息
A global seventh-order dissipative compact finite-difference scheme is optimized in terms of time stability. The dissipative parameters appearing in the boundary closures are assumed to be different, resulting in an optimization problem with several parameters determined by applying a generic algorithm. The optimized schemes are analyzed carefully from the aspects of the eigenvalue distribution, the ε-pseudospectra, the short time behavior, and the Fourier analysis. Numerical experiments for the Euler equations are used to show the effectiveness of the final recommended scheme.
In this paper, we report on implementing an experimental distributed computing application for bioinformatics consisting of basic high-performance computing environments (Grid and PC Cluster systems), multiple interfa...
详细信息
ISBN:
(纸本)1595934804;9781595934802
In this paper, we report on implementing an experimental distributed computing application for bioinformatics consisting of basic high-performance computing environments (Grid and PC Cluster systems), multiple interfaces at user portals that provide useful graphical interfaces to enable biologists who are not IT specialists to benefit directly from the use of high-performance technology. Copyright 2007 ACM.
In this paper, we evaluate the performance of Meghadoot - a packet based wireless mesh network architecture for low cost rural community networks. Meghadoot is designed for rural community networks as an alternative f...
详细信息
In this paper,rank factorizations and factor left prime factorizations are *** authors prove that any polynomial matrix with full row rank has factor left prime *** for a class of polynomial matrices,the authors give ...
详细信息
In this paper,rank factorizations and factor left prime factorizations are *** authors prove that any polynomial matrix with full row rank has factor left prime *** for a class of polynomial matrices,the authors give an algorithm to decide whether they have rank factorizations or factor left prime factorizations and compute these factorizations if they exist.
GaN has emerged to be a major semiconductor akin to silicon due to its revolutionary impacts in solid state lighting, critically enabled by p-type doping1, and high-performance radio-frequency and power electronics2–...
详细信息
暂无评论