Nikolaos KyparissasThe University of Manchester · School of Computer Science
Nikolaos Kyparissas
PhD Student at the University of Manchester
About
3
Publications
5,082
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
7
Citations
Introduction
I am a Ph.D. student in the Department of Computer Science at the University of Manchester, UK, where I work under the supervision of Prof. Mikel Luján. My research interests lie in the areas of heterogeneous and special-purpose computer architectures, with my PhD research focusing on the near-data acceleration of machine learning. I hold a Diploma in Electrical and Computer Engineering from the Technical University of Crete, GR, where I worked under the supervision of Prof. Apostolos Dollas.
Education
September 2012 - February 2020
Publications
Publications (3)
Cellular automata (CA) are discrete mathematical models discovered in the 1940s by John von Neumann and Stanislaw Ulam and have been used extensively in many scientific disciplines ever since. The present work evolved from a Field Programmable Gate Array– (FPGA) based design to simulate urban growth into a generic architecture that is automatically...
In this paper we present a reconfigurable logic-based parallel architecture for the computation of 29X29 large-neighborhood cellular automata at 60 frames-per-second (FPS) real time update rate, using a small FPGA. The computation for each one of the n^2 elements of a two-dimensional input is O(k^2), where k is the size of the neighborhood in each...
Cellular Automata (CA) have been used for many decades to simulate physical processes. From the 3x3 and 5x5 neighborhoods of the 1950’s, and typically on binary images, as recently as the mid-2010’s the neighborhoods went up to 15x15 on images with a few states. Field Programmable Gate Array (FPGA) technology, already applicable to CA simulation si...
Questions
Questions (2)
Greetings everyone,
I was wondering whether there are any interesting aspects of cellular automata as computational models in the strict(er) sense of the term:
- Formulate the problem into an initial state of the automaton
- Run n generations
- Transform the resulting state back into a solution that makes sense in terms of the original formulation
For example: a 2D cellular automaton sorting an array of numbers or so, or something more complicated. Note: I am not referring for example to a Turing Machine designed in the Game of Life where the gliders can be seen as bits/wires etc, but rather a rule that has been designed for such purposes.
Are there any interesting works/papers you could suggest?
Greetings everyone,
I keep looking for software for high-performance cellular automata simulations, but I can't find anything specific. I need one that takes advantage of multi-core processors.
What software do researchers use? Is it a Matlab toolbox or an R library for example..? And can I somehow extract accurate measurements of its performance?
Thank you in advance for your help!
