arXiv subjects

Lei Wang

Publications and source records attributed to Lei Wang.

At least 1,315 records · Page 73Linked to original sources

arXiv2011

Automatic Performance Debugging of SPMD-style Parallel Programs

The simple program and multiple data (SPMD) programming model is widely used for both high performance computing and Cloud computing. In this paper, we design and implement an innovative system, AutoAnalyzer, that automates the process of debugging performance problems of SPMD-style parallel programs, including data collection, performance behavior analysis, locating bottlenecks, and uncovering their root causes. AutoAnalyzer is unique in terms of two features: first, without any apriori knowledge, it automatically locates bottlenecks and uncovers their root causes for performance optimization; second, it is lightweight in terms of the size of performance data to be collected and analyzed. Our contributions are three-fold: first, we propose two effective clustering algorithms to investigate the existence of performance bottlenecks that cause process behavior dissimilarity or code region behavior disparity, respectively; meanwhile, we present two searching algorithms to locate bottlenecks; second, on a basis of the rough set theory, we propose an innovative approach to automatically uncovering root causes of bottlenecks; third, on the cluster systems with two different configurations, we use two production applications, written in Fortran 77, and one open source code-MPIBZIP2 (http://compression.ca/mpibzip2/), written in C++, to verify the effectiveness and correctness of our methods. For three applications, we also propose an experimental approach to investigating the effects of different metrics on locating bottlenecks.

cs.DC↗

arXiv2011

Superconductivity induced by doping Rh in CaFe2-xRhxAs2

In this paper we report the synthesis of iron-based superconductors CaFe2-xRhxAs2 using one-step solid state reaction method, which crystallizes in the ThCr2Si2-type structure with a space group I4/mmm. The systematic evolution of the lattice constants demonstrates that the Fe ions are successfully replaced by the Rh. By increasing the doping content of Rh, the spin-density-wave (SDW) transition in the parent compound is suppressed and superconductivity emerges. The maximum superconducting transition temperature is found at 18.5 K with the doping level of x = 0.15. The temperature dependence of DC magnetization confirms superconducting transitions at around 15 K. The general phase diagram was obtained and found to be similar to the case of Rh-doping Sr122 system. Our results explicitly demonstrate the feasibility of inducing superconductivity in Ca122 compounds by higher d-orbital electrons doping, however, different Rh-doping effect between FeAs122 compounds and FeAs1111 systems still remains an open question.

cond-mat.supr-con↗

arXiv2011

Superconducting properties of FeSe wires and tapes prepared by gas diffusion technique

Superconducting FeSe in the form of wires and tapes were successfully fabricated using a novel gas diffusion procedure. Structural analysis by mean of x-ray diffraction shows that themain phase of tetragonal PbO-type FeSe was obtained by this synthesis method. The zero resistivity transition temperature of the FeSe was confirmed to be 9.3 K. The critical current density as high as 137 A/cm^2 (4 K, self field) has been observed. The results suggest that the diffusion procedure is promising in preparing high-quality FeSe wires and tapes.

cond-mat.supr-con↗

arXiv2011

D-wave bosonic pair in an optical lattice

We present a bosonic model, in which two bosons may form a bound pair with d-wave symmetry via the four-site ring exchange interaction. A d-wave pairing superfluid as well as a d-wave density wave (DDW) state, are proposed to be achievable in this system. This exotic bosonic system can be realized in the BEC zone of a two-dimensional attractive p-band spinless fermionic system. By the mean field approach, we find that at low densities, the d-wave pairs may condensate, leading to a d-wave bosonic paired superfluid. At some particular filling factors, a novel phase, d-wave density wave state, emerges. We study this DDW state and its corresponding quantum phase transition in a two-leg ladder by the time-evolving block decimation (TEBD) method.

cond-mat.quant-gas↗

arXiv2011

Upper fields and critical current density of K0.58Fe1.56Se2 single crystals grown by one step technique

Single crystals of K0.58Fe1.56Se2 were successfully synthesized by a new single step process with the onset superconducting transition temperatures 31.9 K. The x-ray diffraction patterns suggest that they have high crystalline quality and c-axis orientation. A possible modulation structure of Fe-vacancy along c axis was observed. The upper critical field has been determined with the magnetic field along ab-plane and c-axis, yielding an anisotropy of about 3.3. It has also been shown that the critical current density of the K0.58Fe1.56Se2 is about 1.7x10^4 A/cm^2 at 5 K.

cond-mat.supr-con↗

arXiv2011

On the 3-$γ_t$-Critical Graphs of Order $Δ(G)+3$

Let $γ_t(G)$ be the total domination number of graph $G$, a graph $G$ is $k$-total domination vertex critical (or\ just\ $k$-$γ_t$-critical) if $γ_t(G)=k$, and for any vertex $v$ of $G$ that is not adjacent to a vertex of degree one, $γ_t(G-v)=k-1$. Mojdeh and Rad \cite{MR06} proposed an open problem: Does there exist a 3-$γ_t$-critical graph $G$ of order $Δ(G)+3$ with $Δ(G)$ odd? In this paper, we prove that there exists a 3-$γ_t$-critical graph $G$ of order $Δ(G)+3$ with odd $Δ(G)\geq 9$.

math.CO↗

arXiv2011

Feature Selection via Sparse Approximation for Face Recognition

Inspired by biological vision systems, the over-complete local features with huge cardinality are increasingly used for face recognition during the last decades. Accordingly, feature selection has become more and more important and plays a critical role for face data description and recognition. In this paper, we propose a trainable feature selection algorithm based on the regularized frame for face recognition. By enforcing a sparsity penalty term on the minimum squared error (MSE) criterion, we cast the feature selection problem into a combinatorial sparse approximation problem, which can be solved by greedy methods or convex relaxation methods. Moreover, based on the same frame, we propose a sparse Ho-Kashyap (HK) procedure to obtain simultaneously the optimal sparse solution and the corresponding margin vector of the MSE criterion. The proposed methods are used for selecting the most informative Gabor features of face images for recognition and the experimental results on benchmark face databases demonstrate the effectiveness of the proposed methods.

cs.CV↗

arXiv2011

Enhanced critical current properties in Ba0.6K0.4+xFe2As2 superconductor by over-doping of potassium

Phase-pure polycrystalline Ba0.6K0.4+xFe2As2 with were prepared using a one-step solid-state reaction method. We found that over-doping of potassium can improve critical current density (Jc). High-field Jc for samples with x = 0.1 is three times higher than that for samples with x = 0. Over-doping of K has minimal effect on the critical transition temperature (Tc). Less than 0.5 K degradations in Tc was measured for samples with x = 0.1. TEM revealed high concentration of dislocations in samples with x = 0.1, resulting in enhanced flux pining. Further analyses on magnetization loops for powder samples confirm that K over-doping can promote intra-grain Jc. Our results indicate that slight excess of K in Ba0.6K0.4Fe2As2 samples is beneficial to high-field applications.

cond-mat.supr-con↗

arXiv2011

Rare Z-decay into light pseudoscalar bosons in the simplest little Higgs model

The simplest little Higgs model predicts a light pseudoscalar boson $η$ and opens up some new decay modes for $Z$-boson, such as $Z \to \bar{f} f η$, $Z\to ηηη$, $Z\to ηγ$ and $Z\to ηgg$. We examine these decay modes in the parameter space allowed by current experiments, and find that the branching ratios can reach $10^{-7}$ for $Z\to \bar{b}bη$, $10^{-8}$ for $Z\to \barττη$, and $10^{-8}$ for $Z\to ηγ$, which should be accessible at the GigaZ option of the ILC. However, the branching ratios can reach $10^{-12}$ for $Z\to ηηη$, and $10^{-11}$ for $Z\to ηgg$, which are hardly accessible at the GigaZ option.

hep-ph↗

arXiv2010

Charge-density-wave and topological transitions in interacting Haldane model

Haldane model is a noninteracting model for spinless fermions showing nontrivial topological properties. Effect of the electron-electron interaction on the topological phase poses an intriguing question. By means of the Hartree-Fock mean field, the exact diagonalization and the constrained-path Monte Carlo methods we mapped out the phase diagram of the interacting Haldane model. It is found that interaction breaks down the topological phase and drives the system into the charge-density-wave state. Sequence of the two transitions depends on the strength of next-nearest-neighbor hopping. Many-body Chern number and the charge excitation gap are used to characterize the topological transition.

cond-mat.str-el↗

arXiv2010

Fabrication and some properties of biaxially aligned Sr0.6K0.4Fe2As2 superconductors by processing in high magnetic field

We fabricated the c axis and ab-plane biaxially aligned Sr0.6K0.4Fe2As2 superconductor using a two-step magnetic field procedure. The effect of magnetic fields on the structure and superconducting properties of Sr0.6K0.4Fe2As2 has been investigated by using X-ray diffraction and magnetic measurements. The degree of orientation of the samples was about 0.39 for the c axis and 0.51 for ab-plane orientation, as evaluated from the Lotgering factor of X-ray diffraction. This technology might be useful in a variety of potential applications, including preparing iron based superconducting bulks and wires with high critical currents.

cond-mat.supr-con↗

arXiv2010

One-step method to grow Ba0.6K0.4Fe2As2 single crystals without fluxing agent

Single crystals of Ba0.6K0.4Fe2As2 with excellent quality have been successfully grown without fluxing agent through a simple one-step method for the first time. X-ray diffraction patterns demonstrate that the samples have high crystalline quality and c-axis orientation. The onset transition temperature is up to 38 K with the zero resistivity temperature about 36.7 K. Both the R-T and M-T data show a very sharp superconducting transition with transition width 0.4 K. We also found that the samples possess very large current carrying ability and high upper critical fields, indicating potential applications requiring very high field. The above simple and safe one-step technique of single crystal growth can be effective in other systems of Fe-based superconductors.

cond-mat.supr-con↗

arXiv2010

Pseudoscalar boson and SM-like Higgs boson productions at LHC in simplest little Higgs model

In the framework of the simplest little Higgs model (SLHM), we perform a comprehensive study for the pair productions of the pseudoscalar boson η and SM-like Higgs boson h at LHC, namely gg(b\bar{b})-> ηη, gg(q\bar{q})-> ηh and gg(b\bar{b})-> hh. These production processes provide a way to probe the couplings between Higgs bosons. We find that the cross section of gg-> ηη always dominates over that of b\bar{b}-> ηη. When the Higgs boson h which mediates these two processes is on-shell, their cross sections can reach several thousand $fb$ and several hundred $fb$, respectively. When the intermediate state h is off-shell, those two cross sections are reduced by two orders of magnitude, respectively. The cross sections of gg-> ηh and q\bar{q}-> ηh are about in the same order of magnitude, which can reach $\ord{(10^2fb)}$ for a light η boson. Besides, compared with the SM prediction, the cross section of a pair of SM-like Higgs bosons production at LHC can be enhanced sizably. Finally, we briefly discuss the observable signatures of ηη, ηh and hh at the LHC, respectively.

hep-ph↗

arXiv2010

PowerTracer: Tracing requests in multi-tier services to save cluster power consumption

As energy proportional computing gradually extends the success of DVFS (Dynamic voltage and frequency scaling) to the entire system, DVFS control algorithms will play a key role in reducing server clusters' power consumption. The focus of this paper is to provide accurate cluster-level DVFS control for power saving in a server cluster. To achieve this goal, we propose a request tracing approach that online classifies the major causal path patterns of a multi-tier service and monitors their performance data as a guide for accurate DVFS control. The request tracing approach significantly decreases the time cost of performance profiling experiments that aim to establish the empirical performance model. Moreover, it decreases the controller complexity so that we can introduce a much simpler feedback controller, which only relies on the single-node DVFS modulation at a time as opposed to varying multiple CPU frequencies simultaneously. Based on the request tracing approach, we present a hybrid DVFS control system that combines an empirical performance model for fast modulation at different load levels and a simpler feedback controller for adaption. We implement a prototype of the proposed system, called PowerTracer, and conduct extensive experiments on a 3-tier platform. Our experimental results show that PowerTracer outperforms its peer in terms of power saving and system performance.

cs.DC↗

arXiv2010

Precise, Scalable and Online Request Tracing for Multi-tier Services of Black Boxes

As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administrators need a request tracing tool to (1) exactly know how a user request of interest travels through services of black boxes; (2) obtain macro-level user request behavior information of services without the necessity of inundating within massive logs. Previous research efforts either accept imprecision of probabilistic correlation methods or present precise but unscalable tracing approaches that have to collect and analyze large amount of logs; Besides, previous precise request tracing approaches of black boxes fail to propose macro-level abstractions that enables debugging performance-in-the-large, and hence users have to manually interpret massive logs. This paper introduces a precise, scalable and online request tracing tool, named PreciseTracer, for multi-tier services of black boxes. Our contributions are four-fold: first, we propose a precise request tracing algorithm for multi-tier services of black boxes, which only uses application-independent knowledge; second, we respectively present micro-level and macro-level abstractions: component activity graphs and dominated causal path patterns to represent causal paths of each individual request and repeatedly executed causal paths that account for significant fractions; third, we present two mechanisms: tracing on demand and sampling to significantly increase system scalability; fourth, we design and implement an online request tracing tool. PreciseTracer's fast response, low overhead and scalability make it a promising tracing tool for large-scale production systems.

cs.DC↗

arXiv2010

PhoenixCloud: Provisioning Resources for Heterogeneous Workloads in Cloud Computing

As more and more service providers choose Cloud platforms, which is provided by third party resource providers, resource providers needs to provision resources for heterogeneous workloads in different Cloud scenarios. Taking into account the dramatic differences of heterogeneous workloads, can we coordinately provision resources for heterogeneous workloads in Cloud computing? In this paper we focus on this important issue, which is investigated by few previous work. Our contributions are threefold: (1) we respectively propose a coordinated resource provisioning solution for heterogeneous workloads in two typical Cloud scenarios: first, a large organization operates a private Cloud for two heterogeneous workloads; second, a large organization or two service providers running heterogeneous workloads revert to a public Cloud; (2) we build an agile system PhoenixCloud that enables a resource provider to create coordinated runtime environments on demand for heterogeneous workloads when they are consolidated on a Cloud site; and (3) A comprehensive evaluation has been performed in experiments. For two typical heterogeneous workload traces: parallel batch jobs and Web services, our experiments show that: a) in a private Cloud scenario, when the throughput is almost same like that of a dedicated cluster system, our solution decreases the configuration size of a cluster by about 40%; b) in a public Cloud scenario, our solution decreases not only the total resource consumption, but also the peak resource consumption maximally to 31% with respect to that of EC2 +RightScale solution.

cs.DC↗

arXiv2010

Single Parameter Combinatorial Auctions with Partially Public Valuations

We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions where the valuation of an agent $i$ for a set $S$ of items can be expressed as $v_if(S)$, where $v_i$ is a private single parameter of the agent, and the function $f$ is publicly known. Our motivation behind studying this problem is two-fold: (a) Such valuation functions arise naturally in the case of ad-slots in broadcast media such as Television and Radio. For an ad shown in a set $S$ of ad-slots, $f(S)$ is, say, the number of {\em unique} viewers reached by the ad, and $v_i$ is the valuation per-unique-viewer. (b) From a theoretical point of view, this factorization of the valuation function simplifies the bidding language, and renders the combinatorial auction more amenable to better approximation factors. We present a general technique, based on maximal-in-range mechanisms, that converts any $α$-approximation non-truthful algorithm ($α\leq 1$) for this problem into $Ω(\fracα{\log{n}})$ and $Ω(α)$-approximate truthful mechanisms which run in polynomial time and quasi-polynomial time, respectively.

cs.GT↗

arXiv2010

Phoenix Cloud: Consolidating Different Computing Loads on Shared Cluster System for Large Organization

Different departments of a large organization often run dedicated cluster systems for different computing loads, like HPC (high performance computing) jobs or Web service applications. In this paper, we have designed and implemented a cloud management system software Phoenix Cloud to consolidate heterogeneous workloads from different departments affiliated to the same organization on the shared cluster system. We have also proposed cooperative resource provisioning and management policies for a large organization and its affiliated departments, running HPC jobs and Web service applications, to share the consolidated cluster system. The experiments show that in comparison with the case that each department operates its dedicated cluster system, Phoenix Cloud significantly decreases the scale of the required cluster system for a large organization, improves the benefit of the scientific computing department, and at the same time provisions enough resources to the other department running Web services with varying loads.

cs.DC↗