General Purpose 3D Cellular Automata Modeller. A Regular Lattice of Cells, each obeying the same set of rules Simple rules for individual cells can produce.

Slides:



Advertisements
Similar presentations
Chapter 8 Geocomputation Part A:
Advertisements

1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.
Objektorienteret Middleware Presentation 2: Distributed Systems – A brush up, and relations to Middleware, Heterogeneity & Transparency.
Chapter 1: Introduction
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Creating new worlds inside the computer COS 116: 2/14/2008 Sanjeev Arora.
Distributed Systems and the WWW Extending the Capability of Massively Multiplayer Online Games by Introducing Distributed Systems as World Servers Jason.
CELLULAR AUTOMATA Derek Karssenberg, Utrecht University, the Netherlands LIFE (Conway)
1 CIS450/IMSE450/ECE478 Operating Systems Winter 2003 Professor Jinhua Guo.
MCell Usage Scenario Project #7 CSE 260 UCSD Nadya Williams
Self-Organisation in SECOAS Sensor Network UCL SECOAS team: Dr. Lionel Sacks, Dr. Matt Britton Toks Adebutu, Aghileh Marbini, Venus Shum, Ibiso Wokoma.
Astrophysics, Biology, Climate, Combustion, Fusion, Nanoscience Working Group on Simulation-Driven Applications 10 CS, 10 Sim, 1 VR.
Cellular Automata MATH 800 Fall “Cellular Automata” 588,000 results in 94,600 results in 61,500 results in 2.
2007Theo Schouten1 Introduction. 2007Theo Schouten2 Human Eye Cones, Rods Reaction time: 0.1 sec (enough for transferring 100 nerve.
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
1/16/2008CSCI 315 Operating Systems Design1 Introduction Notice: The slides for this lecture have been largely based on those accompanying the textbook.
1 Reconstructing Neutrino Interactions in Liquid Argon TPCs Ben Newell Steve Dennis.
04/25/13 Halting Problem Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1
1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Variations of Conway’s Game of Life Eswar Kondapavuluri.
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
ARRAYS EXAMPLE: THE GAME OF LIFE CITS Scope of this lecture The Game of Life Implementation Performance Issues References:
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
CompuCell Software Current capabilities and Research Plan Rajiv Chaturvedi Jesús A. Izaguirre With Patrick M. Virtue.
Institute for Mathematical Modeling RAS 1 Visualization in distributed systems. Overview. Remote visualization means interactive viewing of three dimensional.
Management in complexity The exploration of a new paradigm Complexity in computing and AI Walter Baets, PhD, HDR Associate Dean for Innovation and Social.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Unit – I CLIENT / SERVER ARCHITECTURE. Unit Structure  Evolution of Client/Server Architecture  Client/Server Model  Characteristics of Client/Server.
Processes and OS basics. RHS – SOC 2 OS Basics An Operating System (OS) is essentially an abstraction of a computer As a user or programmer, I do not.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Playing God: The Engineering of Functional Designs in the Game of Life Liban Mohamed Computer Systems Research Lab
Cellular Automata Spatio-Temporal Information for Society Münster, 2014.
Trust Propagation using Cellular Automata for UbiComp 28 th May 2004 —————— Dr. David Llewellyn-Jones, Prof. Madjid Merabti, Dr. Qi Shi, Dr. Bob Askwith.
Parallel Programming 0024 Spring Semester 2010 May 6, 2010.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Review Recursion Call Stack. Two-dimensional Arrays Visualized as a grid int[][] grays = {{0, 20, 40}, {60, 80, 100}, {120, 140, 160}, {180, 200, 220}};
Cellular Automata based Edge Detection. Cellular Automata Definition A discrete mathematical system characterized by local interaction and an inherently.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Operating System. Chapter 1: Introduction What is an Operating System? Mainframe Systems Desktop Systems Multiprocessor Systems Distributed Systems Clustered.
Chapter 1: Introduction What is an Operating System? Mainframe Systems Desktop Systems Multiprocessor Systems Distributed Systems Clustered System Real.
Presentation – NetGames 2008 Performance Analysis of Game world Partitioning Methods for Multiplayer Mobile Gaming Kusno Prasetya Bond University.
Collision Theory and Logic
Chapter 1: Introduction
Chapter 1: Introduction
Cellular Automata Project:
Collision Theory and Logic
Chapter 1: Introduction
Chapter 1: Introduction
Load Weighting and Priority
Chapter 1: Introduction
Illustrations of Simple Cellular Automata
Chapter 1: Introduction
Chapter 1: Introduction
Spatio-temporal information in society: cellular automata
Chapter 1: Introduction
Excursions into Logic Based Computation using Conway’s Game of Life
Subject Name: Operating System Concepts Subject Number:
Chapter 1: Introduction
Chapter 1: Introduction
Chapter 1: Introduction
Chapter 1: Introduction
Chapter 1: Introduction
Modeling Rainfall using a Cellular Automata
Chapter 1: Introduction
Presentation transcript:

General Purpose 3D Cellular Automata Modeller

A Regular Lattice of Cells, each obeying the same set of rules Simple rules for individual cells can produce complex global behaviour Used in the study of other systems with similar characteristics

Biological Models Fluid Pressure and Movement Models Image Processing Chemical Reactions Others

Antony Holmes, a PhD student in DCS Modelling of Myxobacteria Rippling Requires 2D and 3D Cellular Automata Case study for more general use of CA

Many only 2D Many did not support multiple cell variables Most only simulated variations of the Game of Life None were distributed

“To create a general purpose simulator for three dimensional cellular automata”

Simulates 1D, 2D and 3D CA Distributed processing Supports massive simulations (>100 million cells) Support for any number of cell variables, any neighbourhood sizes Intuitive GUI for creating simulations and viewing results Simple C++ scripting for maximum speed/flexibility

Cellunet NodeCellulate Client

Processing GUI Renderer Storage Networking Cellulate ClientCellulate Node Networking Storage

Renders simulation results in 3D Can render simulations up to 500 million cells Highly interactive user interface Optimised to display within limitations of single machine

Distribute, gather and synchronise regions 26 edges to swap Allocating regions efficiently – Reduce surface area – Load balancing Fault tolerance

Current solutions can require >8Gb per run Compression algorithms reduce storage demands to approximately 14% Balances conflicting requirements of compression and speed

Provides: System for rule scripting: Processing of a simulation region: - Functions for script definition - Compiling & loading scripts - Updating regions - Updating the shared edges between regions

Conway’s Game of Life In Cellulate 1. Any live cell with fewer than two live neighbours dies. 2. Any live cell with more than three live neighbours dies. 3. Any live cell with two or three live neighbours lives, unchanged. 4. Any dead cell with exactly three live neighbours comes to life. if ( numNeighbours == 3 )// 3 & 4 Set("cellalive", true); else if ( numNeighbours == 2 ) // 3 CopyCell(); else// 1 & 2 Set("cellalive", false);

Cellulate is now an Open Source project – hosted on SourceForge We hope it will enable new research into Cellular Automata and their applications Project may continue next year with new group

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.