Explicit routing schemes for implementation of cellular automata on processor arrays

DOI10.1007/S11047-013-9378-5MaRDI QIDQ272775zbMATH OpenOpenAlexFDO

Authors Jean-Vivien Millo, Robert de Simone

Publication date 21 April 2016

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-013-9378-5

zbMATH Keywords

cellular automataroutingadequation algorithm architecturedata-flow process networkmassively parallel processor arraynetwork-on-chip

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 2079529
• A scalable configurable architecture for the massively parallel GCA model
• Pipeline implementation of cellular automata for structural design on message-passing multiprocessors
• scientific article; zbMATH DE number 852846
• Models of two-layer array processors generated by parallel substitution algorithms

Cites work

• scientific article; zbMATH DE number 1070886 (Why is no real title available?)
• From one-dimensional to two-dimensional cellular automata
• Marked directed graphs
• Periodic scheduling of marked graphs using balanced binary words
• Robustness of cellular automata in the light of asynchronous information transmission
• Taming Dr. Frankenstein: contract-based design for cyber-physical systems
• Theory of cellular automata: a survey
• \(N\)-synchronous Kahn networks: a relaxed model of synchrony for real-time systems

Cited in

(1)

• A Maze Routing Algorithm Based on Two Dimensional Cellular Automata

Describes a project that uses

Uses Software

• Ptolemy

This page was built for publication: Explicit routing schemes for implementation of cellular automata on processor arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272775)