Loop Shifting for Loop Compaction

The idea of decomposed software pipelining is to decouple the software pipelining problem into a cyclic scheduling problem without resource constraints and an acyclic scheduling problem with resource constraints. In terms of loop transformation and code motion, the technique can be formulated as a combination of loop shifting and loop compaction. Loop shifting amounts to moving statements between iterations thereby changing some loop independent dependences into loop carried dependences and vice versa. Then, loop compaction schedules the body of the loop considering only loop independent dependences, but taking into account the details of the target architecture. In this paper, we show how loop shifting can be optimized so as to minimize both the length of the critical path and the number of dependences for loop compaction. The first problem is well-known and can be solved by an algorithm due to Leiserson and Saxe. We show that the second optimization (and the combination with the first one) is also polynomially solvable with a fast graph algorithm, variant of minimum-cost flow algorithms. Finally, we analyze the improvements obtained on loop compaction by experiments on random graphs.     

FAST: acceleration from theory to practice

Fast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated. This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005.     

On the use of analytical expressions for the voltage distribution to analyze intracellular recordings

Different analytical expressions for the membrane potential distribution of membranes subject to synaptic noise have been proposed and can be very helpful in analyzing experimental data. However, all of these expressions are either approximations or limit cases, and it is not clear how they compare and which expression should be used in a given situation. In this note, we provide a comparison of the different approximations available, with an aim of delineating which expression is most suitable for analyzing experimental data.     

Reducing aliasing in images: a PDE-based diffusion revisited

In this paper, we introduce a new diffusion algorithm that can be used for reducing aliasing on both step edges and lines. It derives from the diffusion model of Perona and Malik, and works as an adaptive level-curve method in which diffusion is carried out in the normal direction of the gradient for step edges, while the eigenvalues of the Hessian matrix are used for lines. To get sharp images, we use high-pass filters to preserve as much as possible the high frequency content while diffusing. Experimental tests using grayscale and colour images show that our algorithm efficiently reduces aliasing.     

Inferential Queueing and Speculative Push

Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of two mechanisms to reduce these communication latencies: Inferentially Queued locks (IQLs) and Speculative Push (SP). With IQLs, the processor infers the existence, and limits, of a critical section from the use of synchronization instructions and joins a queue of lock requestors, reducing synchronization delay. The SP mechanism extracts information about program structure by observing IQLs. SP allows the cache controller, responding to a request for a cache line that likely includes a lock variable, to predict the data sets the requestor will modify within the associated critical section. The controller then pushes these lines from its own cache to the target cache, as well as writing them to memory. Overlapping the protected data transfer with that of the lock can substantially reduce the communication latencies within critical sections. By pushing data in exclusive state, the mechanism can collapse a read-modify-write sequences within a critical section into a single local cache access. The write-back to memory allows the receiving cache to ignore the push. Neither mechanism requires any programmer or compiler support nor any instruction set changes. Our experiments demonstrate that IQLs and SP can improve performance of applications employing frequent synchronization.     

Reliability and performance optimization of pipelined real-time systems

We consider pipelined real-time systems that consist of a chain of tasks executing on a distributed platform. The processing of the tasks is pipelined: each processor executes only one interval of consecutive tasks. We are interested in minimizing both the input–output latency and the period of application mapping. For dependability reasons, we are also interested in maximizing the reliability of the system. We therefore assign several processors to each interval of tasks, so as to increase the reliability of the system. Both processors and communication links are unreliable and subject to transient failures. We assume that the arrival of the failures follows a constant parameter Poisson law, and that the failures are statistically independent events. We study several variants of this multiprocessor mapping problem, with several hypotheses on the target platform (homogeneous/heterogeneous speeds and/or failure rates). We provide NP-hardness complexity results, and optimal mapping algorithms for polynomial problem instances. Efficient heuristics are presented to solve the general case, and experimental results are provided.     

Exploring networks with traceroute-like probes: Theory and simulations

Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. In this paper, we explore these biases and provide a statistical analysis of their origin. We derive an analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular, we find that the edge and vertex detection probability depends on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with broad distributions of connectivity. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in network models with different topologies. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. Moreover, we characterize the level of redundancy and completeness of the exploration process as a function of the topological properties of the network. Finally, we study numerically how the fraction of vertices and edges discovered in the sampled graph depends on the particular deployements of probing sources. The results might hint the steps toward more efficient mapping strategies.     

High Efficiency and Wideband 300 GHz Frequency Doubler Based on Six Schottky Diodes

A high efficiency and wideband 300 GHz frequency doubler based on six Schottky diodes is presented in this paper. This balanced doubler features a compact and robust circuit on a 5-μm-thick, 0.36-mm-wide, and 1-mm-long GaAs membrane, fabricated by LERMA-C2N Schottky process. The conversion efficiency is mainly better than 16% across the wide bandwidth of 266–336 GHz (3 dB fractional bandwidth of 24%) when pumping with 20–60 mW input power (P _in) at the room temperature. A peak output power of 14.75 mW at 332 GHz with a 61.18 mW P _in, an excellent peak efficiency of 30.5% at 314 GHz with 43.86 mW P _in and several frequency points with outstanding efficiency of higher than 25% are delivered. This doubler served as the second stage of the 600 GHz frequency multiplier chain is designed, fabricated, and measured. The performance of this 300 GHz doubler is highlighted comparing to the state-of-art terahertz frequency doublers.     

Characterization of a Cutibacterium acnes Camp Factor 1-Related Peptide as a New TLR-2 Modulator in In Vitro and Ex Vivo Models of Inflammation

Cutibacterium acnes (C. acnes) has been implicated in inflammatory acne where highly mutated Christie–Atkins–Munch–Petersen factor (CAMP)1 displays strong toll like receptor (TLR)-2 binding activity. Using specific antibodies, we showed that CAMP1 production was independent of C. acnes phylotype and involved in the induction of inflammation. We confirmed that TLR-2 bound both mutated and non-mutated recombinant CAMP1, and peptide array analysis showed that seven peptides (A14, A15, B1, B2, B3, C1 and C3) were involved in TLR-2 binding, located on the same side of the three-dimensional structure of CAMP1. Both mutated and non-mutated recombinant CAMP1 proteins induced the production of C-X-C motif chemokine ligand interleukin (CXCL)8/(IL)-8 in vitro in keratinocytes and that of granulocyte macrophage-colony stimulating factor (GM-CSF), tumor necrosis factor (TNF)-α, IL-1β and IL-10 in ex vivo human skin explants. Only A14, B1 and B2 inhibited the production of CXCL8/IL-8 by keratinocytes and that of (GM-CSF), TNF-α, IL-1β and IL-10 in human skin explants stimulated with rCAMP1 and C. acnes. Following pretreatment with B2, RNA sequencing on skin explants identified the 10 genes displaying the strongest differential expression as IL6, TNF, CXCL1, CXCL2, CXCL3, CXCL8, IL-1β, chemokine ligand (CCL)2, CCL4 and colony stimulating factor (CSF)2. We, thus, identified a new CAMP1-derived peptide as a TLR-2 modulator likely to be a good candidate for clinical evaluation.     

Portfolio Risk Measures: The Time’s Arrow Matters

The traditional ex post risk measure associated to a portfolio, a fund or a market performance, is the standard deviation of a series of past returns, called volatility. We propose an alternative risk measure, that turns out to better quantify the risk actually supported by an investor or asset manager with respect to a portfolio or a fund. This alternative measure is computed from the actual dispersion of successive cumulated returns relative to the corresponding successive cumulated returns produced by an accrued performance of null volatility, which better reflects the dynamics of the risk-return relationship over time. Hence, the proposed name of “accrued returns variability”, for such a risk measure that incorporates the passage of time. Applications are presented, to enlighten the advantage of this risk measure.