Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Alan Turing (1912-1954) (1)
- Cellular automata (1)
- Computational complexity (1)
- Computational intelligence (1)
- Computer algorithms (1)
-
- Computer architecture -- Algorithms (1)
- Computer architecture -- Design (1)
- Computer multitasking (1)
- Data mining (1)
- Electronic systems -- Design and construction (1)
- Information Theory (1)
- Machine learning (1)
- Machine theory (1)
- Mathematical optimization (1)
- Multivariate analysis discrete multivariate modeling (1)
- Parallel computers -- Programming (1)
- Parallel programming (Computer science) -- Evaluation (1)
- Probabilistic graphical modeling (1)
- Reconstructability Analysis (1)
- Signal processing -- Digital techniques (1)
- System design -- Data processing (1)
- System theory (1)
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Theory and Algorithms
Using Acl2 To Verify Loop Pipelining In Behavioral Synthesis, Disha Puri, Sandip Ray, Kecheng Hao, Fei Xie
Using Acl2 To Verify Loop Pipelining In Behavioral Synthesis, Disha Puri, Sandip Ray, Kecheng Hao, Fei Xie
Civil and Environmental Engineering Faculty Publications and Presentations
Behavioral synthesis involves compiling an Electronic System-Level (ESL) design into its RegisterTransfer Level (RTL) implementation. Loop pipelining is one of the most critical and complex transformations employed in behavioral synthesis. Certifying the loop pipelining algorithm is challenging because there is a huge semantic gap between the input sequential design and the output pipelined implementation making it infeasible to verify their equivalence with automated sequential equivalence checking techniques. We discuss our ongoing effort using ACL2 to certify loop pipelining transformation. The completion of the proof is work in progress. However, some of the insights developed so far may already be of …
Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom
Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom
Systems Science Friday Noon Seminar Series
In this presentation I will describe the latest version of the Numenta HTM Cortical Learning Algorithm and why it is interesting for doing research into radical new computer architectures. Then I will discuss the hardware acceleration research we are doing, and briefly look at some preliminary applications development.
Random Automata Networks: Why Playing Dice Is Not A Vice, Christof Teuscher
Random Automata Networks: Why Playing Dice Is Not A Vice, Christof Teuscher
Systems Science Friday Noon Seminar Series
Random automata networks consist of a set of simple compute nodes interacting with each other. In this generic model, one or multiple model parameters, such as the the node interactions and/or the compute functions, are chosen at random. Random Boolean Networks (RBNs) are a particular case of discrete dynamical automata networks where both time and states are discrete. While traditional RBNs are generally credited to Stuart Kauffman (1969), who introduced them as simplified models of gene regulation, Alan Turing proposed unorganized machines as early as 1948. In this talk I will start with Alan Turing's early work on unorganized machines, …
Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, Martin Zwick, Stephen Shervais
Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, Martin Zwick, Stephen Shervais
Systems Science Faculty Publications and Presentations
The building block hypothesis implies that genetic algorithm efficiency will be improved if sets of genes that improve fitness through epistatic interaction are near to one another on the chromosome. We demonstrate this effect with a simple problem, and show that information-theoretic reconstructability analysis can be used to decide on optimal gene ordering.
Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole
Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Parallel environments consisting of a network of heterogeneous workstations introduce an inherently dynamic environment that differs from multicomputers. Workstations are usually considered “shared” resources while multicomputers provide dedicated processing power. The number of workstations available for use is continually changing; the parallel machine presented by the network is in effect continually reconfiguring itself. Application programs must effectively adapt to the changing number of processing nodes while maintaining computational efficiency. This paper examines methods for adapting to this dynamic environment within the framework of explicit message passing under the data parallel programming model. We present four requirements which we feel a …