TY - JOUR U1 - Zeitschriftenartikel, wissenschaftlich - nicht begutachtet (unreviewed) A1 - Fertig, Matthias T1 - Universal Memory Automaton and Automated Verilog HDL Code Generation for a Cache Coherency Snooping Protocol T2 - MPC / Multi-Projekt-Chip-Gruppe Baden-Württemberg : Tagungsband zum Workshop der Multiprojekt-Chip-Gruppe Baden-Württemberg / Hrsg: Hochschule Ulm N2 - This paper introduces the concept of Universal Memory Automata (UMA) and automated compilation of Verilog Hardware Description Language (HDL) code at Register Transfer Level (RTL) from UMA graphs for digital designs. The idea is based on the observation that Push Down Automata (PDA) are able to process the Dyk-Language - commonly known as the balanced bracket problem - with a finite set of states while Finite State Machines (FSM) require an infinite set of states. Since infinite sets of states are not applicable to real designs, PDAs appear promising for types of problems similar to the Dyk-Language. PDAs suffer from the problem that complex memory operations need to be emulated by a specific stack management. The presented UMA therefore extends the PDA by other types of memory, e.g. Queue, RAM or CAM. Memories that are eligible for UMAs are supposed to have at least one read and one write port and a one-cycle read/write latency. With their modified state-transfer- and output-function, UMAs are able to operate user-defined numbers, configurations and types of memories. Proof of concept is given by an implementation of a cache coherency protocol, i.e. a practical problem in microprocessor design. Y1 - 2021 U6 - https://nbn-resolving.org/urn:nbn:de:bsz:kon4-opus4-28541 UN - https://nbn-resolving.org/urn:nbn:de:bsz:kon4-opus4-28541 UR - https://www.hs-mannheim.de/einzelansicht/63-workshop-der-mpc-gruppe-baden-wuerttemberg-an-der-hochschule-mannheim.html SN - 1868-9221 SS - 1868-9221 N1 - Volltextzugriff zu den Tagungsbänden unter http://www.mpc-gruppe.de derzeit inaktiv. VL - 2020 SP - 35 EP - 42 PB - Hochschule Ulm CY - Ulm ER -