Explicit routing schemes for implementation of cellular automata on processor arrays (Q272775): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Periodic scheduling of marked graphs using balanced binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2883186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of Cellular Automata in the Light of Asynchronous Information Transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>N</i> -synchronous Kahn networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cellular automata: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming Dr. Frankenstein: contract-based design for cyber-physical systems / rank
 
Normal rank

Latest revision as of 20:37, 11 July 2024

scientific article
Language Label Description Also known as
English
Explicit routing schemes for implementation of cellular automata on processor arrays
scientific article

    Statements

    Explicit routing schemes for implementation of cellular automata on processor arrays (English)
    0 references
    0 references
    0 references
    21 April 2016
    0 references
    0 references
    adequation algorithm architecture
    0 references
    cellular automata
    0 references
    data-flow process network
    0 references
    massively parallel processor array
    0 references
    network-on-chip
    0 references
    routing
    0 references
    0 references