The rfmt code formatter incorporates a new algorithm that optimizes code layout with respect to an intuitive notion of layout cost. This note describes the foundations of the algorithm, and the programming abstractions used to facilitate its use with a variety of languages and code layout policies.

Valgrind is a widely used framework for dynamic binary instrumentation and its mostly known by its memcheck tool. Valgrinds code generation module is far from producing optimal code. In addition it has many backends for different CPU architectures, which difficults code optimization in an architecture independent way. Our work focused on identifying sub-optimal code produced by Valgrind and opt...

This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...

Low weight and high load capacity are remarkable advantages of sandwich panels with corrugated core, which make them more considerable by engineering structure designers. It’s important to consider the limitations such as yielding and buckling as design constraints for optimal design of these panels. In this paper, multi-objective optimization of sandwich panels with corrugated core is carried ...

AbstmctThis paper considers the design of binary Mock codes that are capaMe of correcting UP to t symmetric errors and detecting all unidirectional errors. A class of systematic t symmetric-error-correctingM1-unidirectional-error-detecting (tS~ECIAUED) codes are proposed. When = o the proposed codes become Berger codes. For t = 1, the proposed codes are puts. t-symmetric-errorcorrecting/all-uni...

A coding scheme for the binary memoryless source is presented. The scheme is an extension of a scheme discovered by Lynch and Davisson and developed by Schalkwijk, and is based upon the Schalkwijk algorithm for the Lynch-Davisson (LD) code. The new coding scheme is shown to be asymptotically optimal as the block length approaches infinity, regardless of the source statistics. Although the LD sc...