Parallel Substitution Algorithm (PSA) is a new model for distributed (cellular) computations. It provides a concise mapping of distributed computation processes into cellular arrays. A PSA is specified by a set of parallel substitutions operating over a cellular array.Two concepts make PSA a powerful tool for modelling cellular computations: 1) naming functions which allow the specification of any type of interactions in the computation space, 2) a context which serves to represent control of a computational process in time.The foundation of PSA theory comprises validity conditions of computations in the synchronous and asynchronous modes, space-time, space-space (2D ⇒ 3D) and global-local equivalent transformations of PSAs, composition and decomposition of PSAs and interpretation of PSAs with automata nets.On the basis of the PSA theory, a variety of tools and techniques is developed for designing algorithmic-oriented cellular VLSI and optical architectures.
Betal enkelt med kort, Klarna, Apple Pay eller Google Pay. Ikke fornøyd? Du har alltid 14 dagers angrerett. Les mer i våre vilkår. Har du spørsmål, send oss en e-post på hello@memmo.org.
Memmo gjør det enklere å studere – uansett hvor du er i verden. Hos oss samler du pensumbøker og smarte studieverktøy på ett og samme sted: sammendrag, quizer, podkaster og flashcards. Og så Ted, din studiekompis som svarer på alt du lurer på. Over 50 000 studenter studerer allerede her – bygget for at du skal lære raskere og stresse mindre.
Du vil kanskje også like
Kjøp boken0