A new approach to evaluate the leading hadronic corrections to the muon g-2

We propose a novel approach to determine the leading hadronic corrections to the muon g-2. It consists in a measurement of the effective electromagnetic coupling in the space-like region extracted from Bhabha scattering data. We argue that this new method may become feasible at flavor factories, resulting in an alternative determination potentially competitive with the accuracy of the present results obtained with the dispersive approach via time-like data.Comment: 7 pages, 3 figures. Version accepted for publication in Phys. Lett.

Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems

Latency-insensitive protocols allow system-on-chip engineers to decouple the design of the computing cores from the design of the inter-core communication channels while following the synchronous design paradigm. In a latency-insensitive system (LIS) each core is encapsulated within a shell, a synthesized interface module that dynamically controls its operation. At each clock period, if new data has not arrived on an input channel or a stalling request has arrived on an output channel, the shell stalls the core and buffers other incoming valid data for future processing. The combination of finite buffers and backpressure from stalling can cause throughput degradation. Previous works addressed this problem by increasing buffer space to reduce the backpressure requests or inserting extra buffering to balance the channel latency around a LIS. We explore the theoretical complexity of these approaches and propose a heuristic algorithm for efficient queue sizing. We also practically characterize several LIS topologies and how the topology of a LIS can impact not only how much throughput degradation will occur, but also the difficulty of finding optimal queue sizing solutions

Flexible Filters: Load Balancing through Backpressure for Stream Programs

Stream processing is a promising paradigm for programming multi-core systems for high-performance embedded applications. We propose flexible filters as a technique that combines static mapping of the stream program tasks with dynamic load balancing of their execution. The goal is to improve the system-level processing throughput of the program when it is executed on a distributed-memory multi-core system as well as the local (core-level) memory utilization. Our technique is distributed and scalable because it is based on point-to-point handshake signals exchanged between neighboring cores. Load balancing with flexible filters can be applied to stream applications that present large dynamic variations in the computational load of their tasks and the dimension of the stream data tokens. In order to demonstrate the practicality of our technique, we present the performance improvements for the case study of a JPEG encoder running on the IBM Cell multi-core processor

A Recursive Data-Driven Approach to Programming Multicore Systems

In this paper, we propose a method to program divide-and-conquer problems on multicore systems that is based on a data-driven recursive programming model. Data intensive programs are difficult to program on multicore architectures because they require efficient utilization of inter-core communication. Models for programming multicore systems available today generally lack the ability to automatically extract concurrency from a sequential style program and map concurrent tasks to efficiently leverage data and temporal locality. For divide-and-conquer algorithms, a recursive programming model can address both of these problems. Furthermore, since a recursive function has the same behavior patterns at all granularities of a problem, the same recursive model can be used to implement a multicore program at all of its levels: 1. the operations of a single core, 2. how to distribute tasks among several cores, and 3. in what order to schedule tasks on a multicore system when it is not possible to schedule all of the tasks at the same time. We present a novel selective execution technique that can enable automatic parallelization and task mapping of a recursive program onto a multicore system. To verify the practicality of this approach, we perform a case-study of bitonic sort on the Cell BE processor

Cosmological solutions in generalized hybrid metric-Palatini gravity

We construct exact solutions representing a Friedmann-Lema\^itre-Robsertson-Walker (FLRW) universe in a generalized hybrid metric-Palatini theory. By writing the gravitational action in a scalar-tensor representation, the new solutions are obtained by either making an ansatz on the scale factor or on the effective potential. Among other relevant results, we show that it is possible to obtain exponentially expanding solutions for flat universes even when the cosmology is not purely vacuum. We then derive the classes of actions for the original theory which generate these solutions.Comment: 14 pages, 17 figure

Application of pactiter V3.3 code to the ACPS assessment of ITER neutral beam injectors primary heat transfer system

Activated Corrosion Products (ACPs) will be present in the various coolant loops of ITER: in-vessel and vacuum vessel, test blanket modules, auxiliary heating or diagnostic equipments. ACPs impact occupational exposure, routine effluents to the environment, and potential releases during accidents. Hence, the ACP inventory evaluation is an important task for ITER public and occupational safety. PACTITER v3.3 code is a computational tool derived from PACTOLE series of codes, modified in some modeling and computing capabilities. ITER Organization has included it as reference computer code for the ACP assessment. In the framework of its verification and validation activity, PACTITER v3.3 was used to assess the ACP inventory of the ITER Neutral Beam Injectors (NBIs) Primary Heat Transfer System (PHTS). This paper will document the preliminary results of this assessment, focusing on the impact of operation scenarios parameters (i.e. water chemistry, materials corrosion properties, etc.) and piping architecture

Synthesis of On-Chip Interconnection Structures:From Point-to-Point Links to Networks-on-Chip

Packet-switched networks-on-chip (NOC) have been advocated as the solution to the challenge of organizing efficient and reliable communication structures among the components of a system-on-chip (SOC). A critical issue in designing a NOC is to determine its topology given the set of point-to-point communication requirements among these components. We present a novel approach to on-chip communication synthesis that is based on the iterative combination of two efficient computational steps: (1) an application of the k-Median algorithm to coarsely determine the global communication structure (which may turned out not be a network after all), and a (2) a variation of the shortest-path algorithm in order to finely tune the data flows on the communication channels. The application of our method to case studies taken from the literature shows that we can automatically synthesize optimal NOC topologies for multi-core on-chip processors and it offers new insights on why NOC are not necessarily a value proposition for some classes of applcation-specific SOCs

One-loop corrections to the Drell--Yan process in SANC (II). The neutral current case

Radiative corrections to the neutral current Drell--Yan-like processes are considered. Complete one-loop electroweak corrections are calculated within the SANC system. Theoretical uncertainties are discussed. Numerical results are presented for typical conditions of LHC experiments.Comment: 17 pages, 9 figures, 3 table