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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M07 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6571385 / rank
 
Normal rank
Property / zbMATH Keywords
 
adequation algorithm architecture
Property / zbMATH Keywords: adequation algorithm architecture / rank
 
Normal rank
Property / zbMATH Keywords
 
cellular automata
Property / zbMATH Keywords: cellular automata / rank
 
Normal rank
Property / zbMATH Keywords
 
data-flow process network
Property / zbMATH Keywords: data-flow process network / rank
 
Normal rank
Property / zbMATH Keywords
 
massively parallel processor array
Property / zbMATH Keywords: massively parallel processor array / rank
 
Normal rank
Property / zbMATH Keywords
 
network-on-chip
Property / zbMATH Keywords: network-on-chip / rank
 
Normal rank
Property / zbMATH Keywords
 
routing
Property / zbMATH Keywords: routing / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Ptolemy / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-013-9378-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003596264 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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