A real-time asymmetric multiprocessor-reconfigurable system-on-chip architecture

We propose an asymmetric multi-processor SoC architecture, featuring a master CPU running uClinux, and multiple loosely-coupled slave CPUs running real-time threads assigned by the master CPU. Real-time SoC architectures often demand a compromise between a generic platform for different applications, and application-specific customizations to achieve performance requirements. Our proposed architecture offers a generic platform running a conventional embedded operating system providing a traditional software-oriented development approach, while multiple slave CPUs act as a dedicated independent real-time threads execution unit running in parallel of master CPU to achieve performance requirements. In this paper, the architecture is described, including the application / threading development environment. The performance of the architecture with several standard benchmark routines is also analysed.

Implementation of a triple modular redundant FPGA based safety critical system for reliable software execution

This paper describes the implementation of a TMR (Triple Modular Redundant) microprocessor system on a FPGA. The system exhibits true redundancy in that three instances of the same processor system (both software and hardware) are executed in parallel. The described system uses software to control external peripherals and a voter is used to output correct results. An error indication is asserted whenever two of the three outputs match or all three outputs disagree. The software has been implemented to conform to a particular safety critical coding guideline/standard which is popular in industry. The system was verified by injecting various faults into it.

BURSTLOGIC : design and analysis of logic circuitry to perform arithmetic on data in the Burst format /

Thesis--Illinois.

A systematic approach to the design of structures for arithmetic /

"NSF-MCS-80-00058"--Cover.

Unfolding Feasible Arithmetic and Weak Truth

In this paper we continue Feferman’s unfolding program initiated in (Feferman, vol. 6 of Lecture Notes in Logic, 1996) which uses the concept of the unfolding U(S) of a schematic system S in order to describe those operations, predicates and principles concerning them, which are implicit in the acceptance of S. The program has been carried through for a schematic system of non-finitist arithmetic NFA in Feferman and Strahm (Ann Pure Appl Log, 104(1–3):75–96, 2000) and for a system FA (with and without Bar rule) in Feferman and Strahm (Rev Symb Log, 3(4):665–689, 2010). The present contribution elucidates the concept of unfolding for a basic schematic system FEA of feasible arithmetic. Apart from the operational unfolding U0(FEA) of FEA, we study two full unfolding notions, namely the predicate unfolding U(FEA) and a more general truth unfolding UT(FEA) of FEA, the latter making use of a truth predicate added to the language of the operational unfolding. The main results obtained are that the provably convergent functions on binary words for all three unfolding systems are precisely those being computable in polynomial time. The upper bound computations make essential use of a specific theory of truth TPT over combinatory logic, which has recently been introduced in Eberhard and Strahm (Bull Symb Log, 18(3):474–475, 2012) and Eberhard (A feasible theory of truth over combinatory logic, 2014) and whose involved proof-theoretic analysis is due to Eberhard (A feasible theory of truth over combinatory logic, 2014). The results of this paper were first announced in (Eberhard and Strahm, Bull Symb Log 18(3):474–475, 2012).

Block sum register and burst arithmetic/

Typescript.

Bounded Arithmetic and Randomized Computation

In this work, we develop a randomized bounded arithmetic for probabilistic computation, following the approach adopted by Buss for non-randomized computation. This work relies on a notion of representability inspired by of Buss' one, but depending on a non-standard quantitative and measurable semantic. Then, we establish that the representable functions are exactly the ones in PPT. Finally, we extend the language of our arithmetic with a measure quantifier, which is true if and only if the quantified formula's semantic has measure greater than a given threshold. This allows us to define purely logical characterizations of standard probabilistic complexity classes such as BPP, RP, co-RP and ZPP.

Theoretical investigation of atomic and electronic structures of Ga(2)O(3)(ZnO)(6)

Transparent conducting oxides (TCO) are widely used in technological applications ranging from photovoltaics to thin-film transparent field-effect transistors. In this work we report a first-principles investigation, based on density-functional theory, of the atomic and electronic properties of Ga(2)O(3)(ZnO)(6) (GZO(6)), which is a promising candidate to be used as host oxide for wide band gap TCO applications. We identify a low-energy configuration for the coherent distribution of the Ga and Zn atoms in the cation positions within the experimentally reported orthorhombic GZO(6) structure. Four Ga atoms are located in four-fold sites, while the remaining 12 Ga atoms in the unit cell form four shared Ga agglomerates (a motif of four atoms). The Zn atoms are distributed in the remaining cation sites with effective coordination numbers from 3.90 to 4.50. Furthermore, we identify the natural formation of twin-boundaries in GZO(6), which can explain the zigzag modulations observed experimentally by high-resolution transmission electron microscopy in GZO(n) (n=9). Due to the intrinsic twin-boundary formation, polarity inversion in the ZnO tetrahedrons is present which is facilitated by the formation of the Ga agglomerates. Our analysis shows that the formation of fourfold Ga sites and Ga agglomerates are stabilized by the electronic octet rule, while the distribution of Ga atoms and the formation of the twin-boundary help alleviate excess strain. Finally we identify that the electronic properties of GZO(6) are essentially determined by the electronic properties of ZnO, i.e., there are slight changes in the band gap and optical absorption properties.

A scanning electron microscopic survey of the cuticle in Cyphophthalmi (Arachnida, Opiliones) with the description of novel sensory and glandular structures

The cuticular surfaces of Cyphophthalmi (Opiliones) were studied in detail, covering a wide range of their taxonomic diversity. Previously unknown structures are described, including a sexually dimorphic row of spines and glandular openings on leg I of Fangensis cavernarum. Scanning electron micrographs of the prosomal paired hairs and the subapical process are provided for the first time. Evidence for the multi-pored nature of the shaft of solenidia as well as the hollowed nature and absence of wall pores of sensilla chaetica are also shown for the first time using scanning electron microscopy. The prosomal paired hairs may constitute a novel autapomorphy for Cyphophthalmi, as they are absent in all studied members of the other species of Opiliones. Finally, the variation in shape of some of the structures examined may be of great taxonomic value.