In this paper we propose a mesh algorithm to generate a regular and conformal family of nested triangulations for a planar domain divided into two non-convex polygonal subdomains by a prefractal Koch type interface. T...
详细信息
In this paper we propose a mesh algorithm to generate a regular and conformal family of nested triangulations for a planar domain divided into two non-convex polygonal subdomains by a prefractal Koch type interface. The presence of the interface, a polygonal curve, induces a natural triangulation in which the vertices of the prefractal are also nodes of the triangulation. In order to achieve an optimal rate of convergence of the numerical approximation a suitably refined mesh around the reentrant corners is required. This is achieved by generating a mesh compliant with the Grisvard's condition. We present the mesh algorithm and a detailed proof of the Grisvard conditions. (C) 2014 IMACS. Published by Elsevier B.V. All rights reserved.
Complete exchange or all-to-all personalized communication is a widely used message passing algorithm among the processors in any network. Dealing with fault while a message is being passed from one processor into oth...
详细信息
ISBN:
(纸本)9781538677094
Complete exchange or all-to-all personalized communication is a widely used message passing algorithm among the processors in any network. Dealing with fault while a message is being passed from one processor into other processor is a very common scenario and should be considered while designing an efficient fault tolerant routing algorithm. In this paper a fault tolerant version of the complete exchange algorithm in Multi-mesh with n(4) processors (n = 2(k)) is proposed where the message passing between communicating processors is being performed using wormhole routing.
This is the first part of our two part paper with the same title. Following our Coxeter spectral study in [Fund. Inform. [123(2013), 447-490] and [SIAM J. Discr. Math. 27(2013), 827-854] of the category UBigr(n) of lo...
详细信息
This is the first part of our two part paper with the same title. Following our Coxeter spectral study in [Fund. Inform. [123(2013), 447-490] and [SIAM J. Discr. Math. 27(2013), 827-854] of the category UBigr(n) of loop-free edge-bipartite (signed) graphs Delta, with n >= 2 vertices, we study here the larger category RBigr(n) of Cox-regular edge-bipartite graphs Delta (possibly with dotted loops), up to the usual Z-congruences similar to(Z) and approximate to(Z). The positive graphs Delta in RBigr(n), with dotted loops, are studied by means of the complex Coxeter spectrum specc(Delta) subset of C, the irreducible mesh root systems of Dynkin types B-n, n >= 2, C-n, n >= 3, F-4, G(2), the isotropy group Gl (n, Z)Delta (containing the Weyl group of Delta), and by applying the matrix morsification technique introduced in [J. Pure A ppl. Algebra 215(2011), 13-24] and [Fund. Inform. [123(2013), 447-490]. One of our aims of the paper is to study the Coxeter spectral analysis question: "Does the congruence Delta approximate to(Z) Delta' hold, for any pair of connected positive graphs Delta, Delta' is an element of RBigr(n) such that specc(Delta) = specc(Delta') and the numbers of loops in Delta and Delta' coincide?" We do it by a reduction to the Coxeter spectral study of the Gl (n, Z) D-orbits in the set Mor (D) subset of M-n (Z) of matrix morsifications of a Dynkin diagram D - D Delta is an element of uBigr(n) associated with Delta. In particular, we construct in the second part of the paper numeric algorithms for computing the connected positive edge-bipartite graphs Delta in RBigr(n), for a fixed n >= 2, mesh algorithms for computing the set of all Z-invertible matrices B is an element of Gl (n, Z) definining the Z-congruence Delta approximate to(Z) Delta', for positive graphs Delta, Delta' is an element of RBigr(n), with n >= 2 fixed, and mesh-type algorithms for the mesh root systems Gamma(R-Delta(center dot), Phi(Delta)). In the first part of the paper we present an
Cloud computing facilitates end users to allow high performance computing applications by allocating resources on demand. This avoids large capital expenditure for small and medium sized enterprises having limited res...
详细信息
ISBN:
(纸本)9781538636848
Cloud computing facilitates end users to allow high performance computing applications by allocating resources on demand. This avoids large capital expenditure for small and medium sized enterprises having limited resources to obtain High Performance Computing(HPC). In this paper, we propose a new distributed HPC model in self-built OpenStack public cloud under SDN infrastructure. For partitioning any task in HPC, domain decomposition strategy is used. We analyse different parallel computation topologies and benchmark their performances. The public cloud constructed under OpenStack platform is integrated with OpenDaylight SDN controller for network controlling and monitoring. Also, we analyze and compare the performance of the OpenStack cloud with and without proposed distributed HPC system. The result shows that the speed performance of OpenStack cloud under SDN infrastructure is enhanced by implementation of our HPC system based on Hypercube algorithm and mesh algorithm.
暂无评论