Explicit routing schemes for implementation of cellular automata on processor arrays

DOI10.1007/S11047-013-9378-5zbMath1334.68142OpenAlexW2003596264MaRDI QIDQ272775

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)

Uses Software

• Ptolemy

Cites Work

• Unnamed Item
• Unnamed Item
• Periodic scheduling of marked graphs using balanced binary words
• Theory of cellular automata: a survey
• Taming Dr. Frankenstein: contract-based design for cyber-physical systems
• Marked directed graphs
• Robustness of Cellular Automata in the Light of Asynchronous Information Transmission
• N -synchronous Kahn networks

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