Many-core compiler fuzzing

We address the compiler correctness problem for many-core systems through novel applications of fuzz testing to OpenCL compilers. Focusing on two methods from prior work, random differential testing and testing via equivalence modulo inputs (EMI), we present several strategies for random generation of deterministic, communicating OpenCL kernels, and an injection mechanism that allows EMI testing to be applied to kernels that otherwise exhibit little or no dynamically-dead code. We use these methods to conduct a large, controlled testing campaign with respect to 21 OpenCL (device, compiler) configurations, covering a range of CPU, GPU, accelerator, FPGA and emulator implementations. Our study provides independent validation of claims in prior work related to the effectiveness of random differential testing and EMI testing, proposes novel methods for lifting these techniques to the many-core setting and reveals a significant number of OpenCL compiler bugs in commercial implementations

A Computational Interpretation of Context-Free Expressions

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability problem by using a canonical representation of states. The proofs-as-programs principle yields a computational interpretation of the reachability problem in terms of a coercion that transforms the parse tree for a context-free expression into a parse tree for a regular expression. It also yields a partial coercion from regular parse trees to context-free ones. The partial coercion from the trivial language of all words to a context-free expression corresponds to a predictive parser for the expression

Back Reflector with Diffractive Gratings for Light-Trapping in Thin-Film III-V Solar Cells

We report on the development of light-Trapping architectures applied to thin-film solar cells. In particular, we focus on enhancing the absorption at 1-eV spectral range for dilute nitride and quantum dot materials and report on the influence of planar back reflectors on the photovoltaic properties. Moreover, we discuss the properties of polymer diffraction gratings with enhanced light-Trapping capability pointing to advantageous properties of pyramidal gratings. In order to understand the suitability of these polymer grating architectures for space applications, we have performed an electron irradiation study (1 MeV) revealing the absence of reflectance changes up to doses of 1×1015 e-/cm

Thin-film InAs/GaAs quantum dot solar cell with planar and pyramidal back reflectors

Quantum dot solar cells are promising for next-generation photovoltaics owing to their potential for improved device efficiency related to bandgap tailoring and quantum confinement of charge carriers. Yet implementing effective photon management to increase the absorptivity of the quantum dots is instrumental. To this end, the performance of thin-film InAs/GaAs quantum dot solar cells with planar and structured back reflectors is reported. The experimental thin-film solar cells with planar reflectors exhibited a bandgap-voltage offset of 0.3 V with an open circuit voltage of 0.884 V, which is one of the highest values reported for quantum dot solar cells grown by molecular beam epitaxy to our knowledge. Using measured external quantum efficiency and current-voltage characteristics, we parametrize a simulation model that was used to design an advanced reflector with diffractive pyramidal gratings revealing a 12-fold increase of the photocurrent generation in the quantum dot layers

Fairness Considerations in Full-Duplex MIMO Interference Channels

In this paper, we address the proportional fair (PF) issue of a K link full-duplex (FD) multiple-input multiple-output (MIMO) interference channel, where each link consists of two FD nodes exchanging information simultaneously. The nodes in each pair suffer from self-interference due to operating in FD mode, and inter-user interference from the nodes in other links due to simultaneous transmission from each link. The PF issue is important for networks with asymmetric topology and/or asymmetric traffic demands. We demonstrate that the proposed algorithm provides a good trade-off between sum achievable rate and rate distribution for asymmetric links, and moreover we show that the sum-rate achieved by FD mode is higher than the sum-rate achieved by baseline half-duplex (HD) schemes

Searching good strategies in adaptive minority games

In this paper we introduce adaptation mechanism based on genetic algorithms in minority games. If agents find their performances too low, they modify their strategies in hope to improve their performances and become more successful. One aim of this study is to find out what happens at the system as well as at the individual agent level. We observe that adaptation remarkably tightens the competition among the agents, and tries to pull the collective system into a state where the aggregate utility is the largest. We first make a brief comparative study of the different adaptation mechanisms and then present in more detail parametric studies. These different adaptation mechanisms broaden the scope of the applications of minority games to the study of complex systems.Comment: 8 pages including 9 figures. Uses REVTeX

Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem

In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, Merge, Solve & Adapt, generates sub-instances based on merging the solution components found in randomly constructed solutions. These sub-instances are subsequently solved by means of an exact solver. Moreover, the considered sub-instances are dynamically changing due to adding new solution components at each iteration, and removing existing solution components on the basis of indicators about their usefulness. The results of applying this algorithm to the repetition-free longest common subsequence problem show that the algorithm generally outperforms competing approaches from the literature. Moreover, they show that the algorithm is competitive with CPLEX for small and medium size problem instances, whereas it outperforms CPLEX for larger problem instances.Peer ReviewedPostprint (author's final draft

Critical Networks Exhibit Maximal Information Diversity in Structure-Dynamics Relationships

Network structure strongly constrains the range of dynamic behaviors available to a complex system. These system dynamics can be classified based on their response to perturbations over time into two distinct regimes, ordered or chaotic, separated by a critical phase transition. Numerous studies have shown that the most complex dynamics arise near the critical regime. Here we use an information theoretic approach to study structure-dynamics relationships within a unified framework and how that these relationships are most diverse in the critical regime