With the rapid development of supercomputers, the scale and complexity are ever increasing, and the reliability and resilience are faced with larger challenges. There are many important technologies in fault tolerance...
详细信息
With the rapid development of supercomputers, the scale and complexity are ever increasing, and the reliability and resilience are faced with larger challenges. There are many important technologies in fault tolerance, such as proacrive failure avoidance technologies based on fault prediction, reactive fault tolerance based on checkpoint, and scheduling technologies to improve reliability. Both qualitative and quantitative descriptions on characteristics of system faults are very critical for these technologies, This study analyzes the source of failures on two typical petascale supercomputers called Sunway BlueLight （based on multi-core CPUs） and Sunway TaihuLight （based on heterogeneous manycore CPUs）. It uncovers some interesting fault characteristics and finds unknown correlation relationship among main components＇ faults. Finally the paper analyzes the failure time of the two supercomputers in various grains of resource and different time spans, and builds a uniform multi-dimensional failure time model for petascale supereomputers.
In this paper, we present our early performance evaluation results with the NPB benchmark and two scientific computing applications program, i.e., a HFFT package developed by our lab and a CFDO application software, o...
详细信息
We present Three Fingered Jack, a highly productive approach to writing high-performance software in Python. Our system applies traditional dependence analysis and reordering transformations to a restricted set of Pyt...
详细信息
Probabilistic tracking algorithms typically using linear structure to update the learning *** linear structure is not appropriate for long-term robust tracking as the occlusion and other challe
ISBN:
(纸本)9781509053643;9781509053636
Probabilistic tracking algorithms typically using linear structure to update the learning *** linear structure is not appropriate for long-term robust tracking as the occlusion and other challe
The problem of scalable video-on-demand (VoD) delivery has been extensively studied over the past years, in the context of wired networks. As VoD-based applications are gaining more and more attention, there is an inc...
详细信息
ISBN:
(纸本)8576690381
The problem of scalable video-on-demand (VoD) delivery has been extensively studied over the past years, in the context of wired networks. As VoD-based applications are gaining more and more attention, there is an increasing need of ubiquitous access for them. Wireless networks can be the answer to this need. However, the system behind the application must be scalable to deal with a growing amount of simultaneous accesses, while guaranteeing QoS. Thus the performance of VoD systems must be revisited in this new context, especially aiming scalability. In this paper, we present a preliminary study of a system-level design for VoD systems that operate over 802.11 networks, where commodity Access Points (APs) work collocated in no-overlapping channels which are orchestrated by a central entity that is responsible for controlling the association of clients to the APs. The simulation conducted demonstrates that our system design, using the generic least loaded first heuristic, can use the full aggregate bandwidth as collocated APs allow to. Despite the effective use of bandwidth, it achieved a low blockage rate only for short-length videos at low arrival rates, and performed poorly when video length and arrival rate grow.
A new class of three-variable orthogonal polynomials, defined as eigenfunctions of a second order PDE operator, is studied. These polynomials are orthogonal over a curved tetrahedron region, which can be seen as a map...
详细信息
A new class of three-variable orthogonal polynomials, defined as eigenfunctions of a second order PDE operator, is studied. These polynomials are orthogonal over a curved tetrahedron region, which can be seen as a mapping from a traditional tetrahedron, and can be taken as an extension of the 2-D Steiner domain. The polynomials can be viewed as Jacobi polynomials on such a domain. Three-term relations are derived explicitly. The number of the individual terms, involved in the recurrences relations, are shown to be independent on the total degree of the polynomials. The numbers now are determined to be five and seven, with respect to two conjugate variables z, $ \bar z $ and a real variable r, respectively. Three examples are discussed in details, which can be regarded as the analogues of the Chebyshev polynomials of the first and the second kinds, and Legendre polynomials.
暂无评论