Filters








9,855 Hits in 2.1 sec

Association Rule Mining with the Micron Automata Processor

Ke Wang, Yanjun Qi, Jeffrey J. Fox, Mircea R. Stan, Kevin Skadron
2015 2015 IEEE International Parallel and Distributed Processing Symposium  
We accelerate ARM by using Micron's Automata Processor (AP), a hardware implementation of non-deterministic finite automata (NFAs), with additional features that significantly expand the APs capabilities  ...  The Apriori algorithm that ARM uses for discovering itemsets maps naturally to the massive parallelism of the AP.  ...  AUTOMATA PROCESSOR Micron's Automata Processor (AP) is a massively parallel non-von Neumann accelerator designed for high-throughput pattern mining. A.  ... 
doi:10.1109/ipdps.2015.101 dblp:conf/ipps/WangQFSS15 fatcat:cpxy5oijozgkhlazyl4zorspnq

Broadcast automata: a parallel scalable architecture for prototypal embedded processors for space applications

M. Alderighi, G. Sechi, R. Mazzei, F. Tisato
Proceedings of the Thirtieth Hawaii International Conference on System Sciences  
The paper introduces a model of massively parallel computation based on broadcast synchronous agents. It consists of a collection of uniform automata which evolve synchronously.  ...  A Broadcast Automata based System (BAS) is presented as a new approach to the development of embedded system prototypes, specifically in the field of space applications, where the resource constraints,  ...  Affined automata evolve independently from all other automata in the system. This allows to fully exploit the intrinsic parallelism, if present, of the problem.  ... 
doi:10.1109/hicss.1997.663176 dblp:conf/hicss/AlderighiSMT97 fatcat:m7k6mvcknbgmjk2dadhzogd3iu

Page 271 of Automation and Remote Control Vol. 55, Issue 2 [page]

1994 Automation and Remote Control  
This article is concerned with modeling of local mass-parallel computers, more precisely, with their cellular automata models.  ...  Algorithms of image processing can be successfully realized on such cellular automata processors, since local connections between processors make it possible to retain the spatial relations between image  ... 

Execution models for processors and instructions

Florian Brandner, Viktor Pavlu, Andreas Krall
2010 NORCHIP 2010  
Modeling the execution of a processor and its instructions is a challenging problem, in particular in the presence of long pipelines, parallelism, and out-of-order execution.  ...  Based on this observation, we explore the use of a series of parallel finite automata to model the execution states of the processor's resources individually.  ...  Section IV introduces our execution model for processors based on parallel finite automata.  ... 
doi:10.1109/norchip.2010.5669478 fatcat:f7cza42dp5glto5buqeiekw374

Automata Processor Architecture and Applications: A Survey

Nourah A. Almubarak, Anwar Alshammeri, Imtiaz Ahmad
2016 International Journal of Grid and Distributed Computing  
In this paper, we present a survey of the state-of-the-art in automata processor based hardware accelerators.  ...  One such technology is the recently introduced Micron Automata Processor (AP), which is a novel and powerful reconfigurable non-von Neumann processor that can be used for direct implementation of multiple  ...  in the Automata Processor.  ... 
doi:10.14257/ijgdc.2016.9.4.05 fatcat:stay6tyhrzgdhfn4ptnv56oxq4

An Unbounded Parallel Binary Tree Adder for use on a Cellular Platform

James Weston, Peter Lee
2007 2007 IEEE Symposium on Artificial Life  
Cellular automata are by definition highly parallel structures and are therefore capable of giving rise to massively parallel systems.  ...  This flexibility and parallelism is also now present in a number of hardware platforms allowing for the adaptation of automata models into hardware.  ...  Cellular computing including cellular automata offers the opportunity to create truly parallel systems capable of, in cellular automata extensive computation and within electronics, numbers of computations  ... 
doi:10.1109/alife.2007.367821 dblp:conf/ieeealife/Weston007 fatcat:qzm7ck33xbblzaag6nwjm6aopu

Rekindling Parallelism

Frederic Gruau, Fabien Michel
2011 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops  
to parallel run-time performance for more classical parallel algorithms.  ...  Computing in parallel means performing computation simultaneously, this generates two distinct views: • Performance view A mean to accelerate computation using coarse grain parallelism. • Decentralization  ...  The mapping is now formulated using this coarser grain building block: • Load balancing: Balance the number of automata mapped to each processor. • Communications: Match the automata network with the processor  ... 
doi:10.1109/sasow.2011.7 dblp:conf/saso/GruauM11 fatcat:njluxdp4p5eodohxclmbw2nkhu

A Distributed Cellular Automata simulations on cluster of PCs [chapter]

Pawel Topa
2002 Lecture Notes in Computer Science  
Inherent parallelism of Cellular Automata as well as large size of automata systems used for simulations makes their parallel implementation indispensable.  ...  The purpose of this paper is to present a parallel implementation of two sequential models introduced for modelling evolution of anastomosing river networks.  ...  Parallel computers are the most natural environment for Cellular Automata simulation [4] , [5] .  ... 
doi:10.1007/3-540-46043-8_79 fatcat:flyaljjzgvbjthkc4itxj4qjpu

Parallel cellular automata: A model program for computational science

Per Brinch Hansen
1993 Concurrency Practice and Experience  
We develop a model program for parallel execution of cellular automata on a multicomputer.  ...  The performance of the parallel program is analyzed and measured on a Computing Surface configured as a matrix of transputers with distributed memory.  ...  SUMMARY We have developed a model program for parallel execution of cellular automata on a multicomputer with a square matrix of processor nodes.  ... 
doi:10.1002/cpe.4330050504 fatcat:dmbw35prizeptjuwetirqxeb6y

Page 4201 of Mathematical Reviews Vol. , Issue 99f [page]

1999 Mathematical Reviews  
We also consider the possible benefits of group- ing automata in an SAN with many small automata, to create an equivalent SAN having a smaller number of larger automata.”  ...  Stage-by-stage reduction of this problem to some hypothetical problem (without parallel processors) is accom- plished: at each stage of task allocation all processors are ignored except the one specially  ... 

Treating Insomnia, Amnesia, and Acalculia in Regular Expression Matching [article]

Luis Quesada and Fernando Berzal and Francisco J. Cortijo
2011 arXiv   pre-print
They are formally equivalent to either deterministic finite automata (DFAs) or nondeterministic finite automata (NFAs).  ...  Parallel Finite State Machines require quadratic time and linear memory and they are distributable.  ...  Parallel Finite State Machines can perform regular expression matching in quadratic order of efficiency and have linear memory space requirements, apart from automata storage, in the worst case.  ... 
arXiv:1110.1716v2 fatcat:r3hmcnnflzfplk56nxxduq5mlq

Parallelization of a Bio-inspired Computational Model for the Simulation of 3-D Multicellular Tissue Growth

Belgacem Ben Youssef
2013 Procedia Computer Science  
The use of parallelism may overcome some of the constraints imposed by single processor computing systems.  ...  We also discuss the main issues encountered in the parallelization of the model and its implementation on a parallel machine.  ...  To preserve the semantics of the serial algorithm, the parallel algorithm must communicate with the neighboring processors between the first and second step.  ... 
doi:10.1016/j.procs.2013.09.292 fatcat:7tlpepf5cjea3gagpqs3omdrjq

Cellular Automata as a Mesoscopic Approach to Model and Simulate Complex Systems [chapter]

P. M. A. Sloot, A. G. Hoekstra
2001 Lecture Notes in Computer Science  
We discuss the cellular automata approach and its extensions, the lattice Boltzmann and multiparticle methods.  ...  We discuss our distributed particle simulation of flow, based on a parallel lattice Boltzmann Method.  ...  This occurred due to the implementation of cellular automata on massively parallel computers.  ... 
doi:10.1007/3-540-45545-0_61 fatcat:w3hd6sm4n5amjlkyz6ukwtthyq

Overview of the KSLA efforts in parallel computing [chapter]

G. A. Zee
1989 Lecture Notes in Computer Science  
The parallel computers we are interested in consist of many processors with local memory.  ...  The construction of a parallel program is difficult because the computational load must be divided over the processors in a well balanced way, without causing excessive communication overhead.  ...  Stimulated by the opportunities offered by parallel computing, a completely new approach to fluid flow simulation has come up under the name of cellular automata.  ... 
doi:10.1007/3-540-51604-2_2 fatcat:npjjzxha75abdaglyo3jyaury4

Page 3618 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
Such ‘faculties’ of probabilistic processors and nets of probabilistic processors arise from properties of the probabilistic automata model.  ...  {For the entire collection see MR 2000c:68088. } 2000¢:68088 68Q45 Bukharaev, Rais (RS-KAZA; Kazan’) Probabilistic automata and processors (significance, some methodologies and results).  ... 
« Previous Showing results 1 — 15 out of 9,855 results