Software trace cache

We explore the use of compiler optimizations, which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying hardware resources regardless of the specific details of the processor/architecture in order to increase fetch performance. The Software Trace Cache (STC) is a code layout algorithm with a broader target than previous layout optimizations. We target not only an improvement in the instruction cache hit rate, but also an increase in the effective fetch width of the fetch engine. The STC algorithm organizes basic blocks into chains trying to make sequentially executed basic blocks reside in consecutive memory positions, then maps the basic block chains in memory to minimize conflict misses in the important sections of the program. We evaluate and analyze in detail the impact of the STC, and code layout optimizations in general, on the three main aspects of fetch performance; the instruction cache hit rate, the effective fetch width, and the branch prediction accuracy. Our results show that layout optimized, codes have some special characteristics that make them more amenable for high-performance instruction fetch. They have a very high rate of not-taken branches and execute long chains of sequential instructions; also, they make very effective use of instruction cache lines, mapping only useful instructions which will execute close in time, increasing both spatial and temporal locality.Peer ReviewedPostprint (published version

Compiler analysis for trace-level speculative multithreaded architectures

Trace-level speculative multithreaded processors exploit trace-level speculation by means of two threads working cooperatively. One thread, called the speculative thread, executes instructions ahead of the other by speculating on the result of several traces. The other thread executes speculated traces and verifies the speculation made by the first thread. In this paper, we propose a static program analysis for identifying candidate traces to be speculated. This approach identifies large regions of code whose live-output values may be successfully predicted. We present several heuristics to determine the best opportunities for dynamic speculation, based on compiler analysis and program profiling information. Simulation results show that the proposed trace recognition techniques achieve on average a speed-up close to 38% for a collection of SPEC2000 benchmarks.Peer ReviewedPostprint (published version

Transparent code authentication at the processor level

The authors present a lightweight authentication mechanism that verifies the authenticity of code and thereby addresses the virus and malicious code problems at the hardware level eliminating the need for trusted extensions in the operating system. The technique proposed tightly integrates the authentication mechanism into the processor core. The authentication latency is hidden behind the memory access latency, thereby allowing seamless on-the-fly authentication of instructions. In addition, the proposed authentication method supports seamless encryption of code (and static data). Consequently, while providing the software users with assurance for authenticity of programs executing on their hardware, the proposed technique also protects the software manufacturers’ intellectual property through encryption. The performance analysis shows that, under mild assumptions, the presented technique introduces negligible overhead for even moderate cache sizes

Performance analysis of a second order delay-lock loop with application to a CDMA system with multipath propagation

CDMA systems require synchronization between the received sequence and the locally generated sequence. This is done by means of a delay-lock loop (DLL). The differential equation of an incoherent second-order DLL has been programmed. The mean time to lose lock (MTLL) of the DLL is a very important design parameter. The authors have obtained this parameter by computer simulation and are able to plot the MTLL as a function of the signal to noise ratio in the data bandwidth. In a narrow-band system, the simulation shows that the effect of the fast Rayleigh fading is a performance degradation even with high mean signal to noise ratio. Assuming a wide-band system, so that the receiver has enough bandwidth to resolve the different propagation paths, the authors propose a modified DLL scheme. The MTLL of the proposed DLL is evaluated using a dynamic simulation of the multipath channel. The results show an improvement with respect to the conventional DLL.Peer ReviewedPostprint (published version

Skyrmions around Kerr black holes and spinning BHs with Skyrme hair

We study solutions of the Einstein-Skyrme model. Firstly we consider test field Skyrmions on the Kerr background. These configurations -- hereafter dubbed Skerrmions -- can be in equilibrium with a Kerr black hole (BH) by virtue of a synchronisation condition. We consider two sectors for Skerrmions. In the sector with non-zero baryon charge, Skerrmions are akin to the known Skyrme solutions on the Schwarzschild background. These `topological' configurations reduce to flat spacetime Skyrmions in a vanishing BH mass limit; moreoever, they never become "small" perturbations on the Kerr background: the non-linearities of the Skyrme model are crucial for all such Skerrmions. In the non-topological sector, on the other hand, Skerrmions have no analogue on the Schwarzschild background. Non-topological Skerrmions carry not baryon charge and bifurcate from a subset of Kerr solutions defining an existence line. Therein the appropriate truncation of the Skyrme model yield a linear scalar field theory containing a complex plus a real field, both massive and decoupled, and the Skerrmions reduce to the known stationary scalar clouds around Kerr BHs. Moreover, non-topological Skerrmions trivialise in the vanishing BH mass limit. We then discuss the backreaction of these Skerrmions, that yield rotating BHs with synchronised Skyrme hair, which continously connect to the Kerr solution (self-gravitating Skyrmions) in the non-topological (topological) sector. In particular, the non-topological hairy BHs provide a non-linear realisation, within the Skyrme model, of the synchronous stationary scalar clouds around Kerr.Comment: 23 pages, 7 figures; to appear in JHE