Fault-aware Communication Mapping for NoCs with Guaranteed Latency

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.     

Polarization independent isolator using spatial walkoff polarizers

A novel type of polarization-independent optical isolator is described which utilizes the polarization walkoff provided by birefringent crystals. Isolation of 44 dB is measured at a wavelength of 1.3 mu m with single-mode fiber insertion loss of 1.5 dB. A temperature-independent scheme is also described that provides at least 39 dB of isolation over the temperature range of 25-75 degrees C.<>     

PMR1, a Ca2+-ATPase in yeast Golgi, has properties distinct from sarco/endoplasmic reticulum and plasma membrane calcium pumps

PMR1, a P-type ATPase cloned from the yeast Saccharomyces cerevisiae, was previously localized to the Golgi, and shown to be required for normal secretory processes (Antebi, A., and Fink, G.R. (1992) Mol. Biol. Cell 3, 633-654). We provide biochemical evidence that PMR1 is a Ca2+-transporting ATPase in the Golgi, a hitherto unusual location for a Ca2+ pump. As a starting point for structure-function analysis using a mutagenic approach, we used the strong and inducible heat shock promoter to direct high level expression of PMR1 from a multicopy plasmid. Yeast lysates were separated on sucrose density gradients, and fractions assayed for organellar markers. PMR1 is found in fractions containing the Golgi marker guanosine diphosphatase, and is associated with an ATP-dependent, protonophore-insensitive 45Ca2+ uptake activity. This activity is virtually abolished in the absence of the expression plasmid. Furthermore, replacement of the active site aspartate within the phosphorylation domain had the expected effect of abolishing Ca2+ transport activity entirely. Interestingly, the mutant enzymes (Asp-371 --> Glu and Asp-371 --> Asn) demonstrated proper targeting to the Golgi, unlike analogous mutations in the related yeast H+-ATPase. Detailed characterization of calcium transport by PMR1 showed that sensitivity to inhibitors (vanadate, thapsigargin, and cyclopiazonic acid) and affinity for substrates (MgATP and Ca2+) were different from the previously characterized sarco/endoplasmic reticulum and plasma membrane Ca2+-ATPases. PMR1 therefore represents a new and distinct P-type Ca2+-ATPase. Because close homologs of PMR1 have been cloned from rat and other organisms, we suggest that Ca2+-ATPases in the Golgi will form a discrete subgroup that are important for functioning of the secretory pathway.     

Obtaining high-alumina cement at the semiluksk refractories factory

Conclusions We demonstrate that it is, in principle, possible to obtain refractory high-alumina cement on industrial equipment at the Semiluksk refractories factory. Technological parameters were developed for preparing raw mixtures, pressing the green articles and firing in a tunnel kiln. It was established that the mass percentage of SiO₂ in the raw mixture should not exceed 1.5%. For industrial production of high-alumina cement in department No. 1 it is necessary to implement measures on the mechanization of the production process.Translated from Ogneupory, No. 5, pp. 26–28, May, 1986.     

Dynamic Verification of Memory Consistency in Cache-Coherent Multithreaded Computer Architectures

Multithreaded servers with cache-coherent shared memory are the dominant type of machines used to run critical network services and database management systems. To achieve the high availability required for these tasks, it is necessary to incorporate mechanisms for error detection and recovery. Correct operation of the memory system is defined by the memory consistency model. Errors can therefore be detected by checking if the observed memory system behavior deviates from the specified consistency model. Based on recent work, we design a framework for dynamic verification of memory consistency (DVMC). The framework consists of mechanisms to verify three invariants that are proven to guarantee that a specified memory consistency model is obeyed. We describe an implementation of the framework for the SPARCv9 architecture, and we experimentally evaluate its performance using full-system simulation of commercial workloads.     

Magnebike: A magnetic wheeled robot with high mobility for inspecting complex‐shaped structures

This paper describes the Magnebike robot, a compact robot with two magnetic wheels in a motorbike arrangement, which is intended for inspecting the inner casing of ferromagnetic pipes with complex‐shaped structures. The locomotion concept is based on an adapted magnetic wheel unit integrating two lateral lever arms. These arms allow for slight lifting off the wheel in order to locally decrease the magnetic attraction force when passing concave edges, as well as laterally stabilizing the wheel unit. The robot has the main advantage of being compact (180 × 130 × 220 mm) and mechanically simple: it features only five active degrees of freedom (two driven wheels each equipped with an active lifter stabilizer and one steering unit). The paper presents in detail design and implementation issues that are specific to magnetic wheeled robots. Low‐level control functionalities are addressed because they are necessary to control the active system. The paper also focuses on characterizing and analyzing the implemented robot. The high mobility is shown through experimental results: the robot not only can climb vertical walls and follow circumferential paths inside pipe structures but it is also able to pass complex combinations of 90‐deg convex and concave ferromagnetic obstacles with almost any inclination regarding gravity. It requires only limited space to maneuver because turning on the spot around the rear wheel is possible. This high mobility enables the robot to access any location in the specified environment. Finally the paper analyzes the maximum payload for different types of environment complexities because this is a key feature for climbing robots and provides a security factor about the risk of falling and slipping. © 2009 Wiley Periodicals, Inc.     

Multilevel assessment method for reliable design of composite structures

This work aims at demonstrating the interest of a new methodology for the design and optimization of composite materials and structures. Coupling reliability methods and homogenization techniques allow the consideration of probabilistic design variables at different scales. The main advantage of such an original micromechanics-based approach is to extend the scope of solutions for engineering composite materials to reach or to respect a given reliability level. This approach is illustrated on a civil engineering case including reinforced fiber composites. Modifications of microstructural components properties, manufacturing process, and geometry are investigated to provide new alternatives for design and guidelines for quality control.     

Heuristics for the multi-period orienteering problem with multiple time windows

We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms.     

Computing efficiently the lattice width in any dimension

We provide an algorithm for the exact computation of the lattice width of a set of points K in Z² in linear-time with respect to the size of K. This method consists in computing a particular surrounding polygon. From this polygon, we deduce a set of candidate vectors allowing the computation of the lattice width. Moreover, we describe how this new algorithm can be extended to an arbitrary dimension thanks to a greedy and practical approach to compute a surrounding polytope. Indeed, this last computation is very efficient in practice as it processes only a few linear time iterations whatever the size of the set of points. Hence, it avoids complex geometric processings.     

Generation of Efficient Nested Loops from Polyhedra

Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead.