Foreword: cellular automata and applications

International audienceThis special issue contains four papers presented during theworkshop, ‘‘18th International Workshop on CellularAutomata and Discrete Complex Systems’’ (Automata2012), held in La Marana, Corsica island (France) in theperiod September 19–21th, 2012.The aim of this workshop is to establish and maintain apermanent, international, multidisciplinary forum for thecollaboration of researchers in the field of Cellular Automata(CA) and Discrete Complex Systems (DCS), providea platform for presenting and discussing new ideas andresults, and support the development of theory and applicationsof CA and DCS.Typical, but not exclusive, topics of the workshop are:dynamics aspects, algorithmic, computational and complexityissues, emergent properties, formal language processing,models of parallelism and distributed systems,phenomenological descriptions, scientific modeling andpractical applications.After an additional review process, four papers wereselected and included in this special issue. They are nowpresented in an extended and improved form with respectto the already refereed workshop version that appeared inthe proceedings of Automata 2012.The paper ‘‘Computation of Functions on n Bits byAsynchronous Clocking Cellular Automata’’ by MichaelVielhaber aims at proving that different functions on binaryvectors can be computed by changing the updating schemefrom a fully synchronous to an asynchronous one on somefixed CA local rule.In their paper ‘‘Solving the Parity Problem in One–Dimensional Cellular Automata’’, Heather Betel, PedroP. B. de Oliveira, and Paola Flocchini deal with the parityproblem in one–dimensional cellular automata (CA): a CAlocal rule solves the parity problem if, starting from anyinitial configuration, the CA converges to the 0–configuration(resp., the 1–configuration) if and only if the initialconfiguration contains an even number of 1s (resp., an oddnumber of 1s). In particular, authors focus on the neighborhoodsize of CA rules solving the problem.Murillo G. Carneiro and Gina M. B. Oliveira present inthe paper ‘‘Synchronous Cellular Automata-Based Schedulerinitialized by Heuristic and modeled by a Pseudolinearneighborhood’’ two approaches based on CA to thetask scheduling problem in multiprocessor systems.The implementation of cellular automata on processorarrays is considered by Jean-Vivien Millo and Robertde Simone in the paper ‘‘Explicit routing schemes forimplementation of cellular automata on processor arrays’’.They deal with the trade-offs between the generality of theCA neighborhood and the limited expressive power providedby physical platforms. This is an extremely hot topicwhich will help in turning CA towards real extendedapplications.We would like to warmly thank the authors for theirwork and effort which made this special issue possible.Special thanks go to all referees for their valuable contributionsboth during the selection and the final reviewprocess. Finally, we also want to thank Professor GrzegorzRozenberg for offering us the opportunity to publish thisspecial issue in Natural Computing

Fault and Defect Tolerant Computer Architectures: Reliable Computing With Unreliable Devices

This research addresses design of a reliable computer from unreliable device technologies. A system architecture is developed for a fault and defect tolerant (FDT) computer. Trade-offs between different techniques are studied and yield and hardware cost models are developed. Fault and defect tolerant designs are created for the processor and the cache memory. Simulation results for the content-addressable memory (CAM)-based cache show 90% yield with device failure probabilities of 3 x 10(-6), three orders of magnitude better than non fault tolerant caches of the same size. The entire processor achieves 70% yield with device failure probabilities exceeding 10(-6). The required hardware redundancy is approximately 15 times that of a non-fault tolerant design. While larger than current FT designs, this architecture allows the use of devices much more likely to fail than silicon CMOS. As part of model development, an improved model is derived for NAND Multiplexing. The model is the first accurate model for small and medium amounts of redundancy. Previous models are extended to account for dependence between the inputs and produce more accurate results

Research-study of a self-organizing computer

It is shown that a self organizing system has two main components: an organizable physical part, and a programing part. This report presents the organizable part in the form of a programable hardware and its programing language

The connection machine

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1988.Bibliography: leaves 134-157.by William Daniel Hillis.Ph.D

A bibliography on parallel and vector numerical algorithms

This is a bibliography of numerical methods. It also includes a number of other references on machine architecture, programming language, and other topics of interest to scientific computing. Certain conference proceedings and anthologies which have been published in book form are listed also

Submicron Systems Architecture: Semiannual Technical Report

No abstract available