Abstract
The flow of control signals in digital computers is modelled as destructible flows in controlled graphs where each vertex i ε V(G) represents some module of a system zn. By establishing a flow path from vertex i to vertex j an edge x ε E(G) is created which represents a microinstruction. For all sets of vertices V(G) exist a connectivity matrix C on which a set of microinstructions μ I(zn) can be defined. The model can be used to answer several computer design questions including cost-effective control paths, control functions extensions and coding and in digital systems design optimization.
- Akonteh, A. N. Microprogramming: Principles and Developments. Monograph in Computer Science, N° 04/79. PUC-RJ. Rio de Janeiro.Google Scholar
- Akonteh, A. N. Theoretical Evolution of the Microprogram Concept. Monograph in Computer Science N? 02/79. PUC-RJ. Rio de Janeiro.Google Scholar
- Akonteh, A. N. A Performance Index for Emulation Environments. ACM SIGMICRO -- November. 1979. Google Scholar
Digital Library
- Akonteh, A. N. Mathematical Functions Extensions of Microprogram Control, University of Brasília, Brasília, DF. 1981.Google Scholar
- Akonteh, A. N. Hierachical Control in Digital Systems. University of Brasília, Brasília, DF. 1981.Google Scholar
- Bela Bollobas. Graph Theory: An Introduction Course Springer -- Verlag, N.Y. 1979.Google Scholar
- Mayeda, Wataru. Graph Theory Wiley -- Interscience N.Y., 1972.Google Scholar
- Mehdi, Behzad et al: Theory of Graphs Allyn and Bacon Inc. Boston. 1971.Google Scholar
Recommendations
On flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279-292]. He proved ...
Nowhere-zero 3-flows in triangularly connected graphs
Let H"1 and H"2 be two subgraphs of a graph G. We say that G is the 2-sum of H"1 and H"2, denoted by H"1@__ __"2H"2, if E(H"1)@__ __E(H"2)=E(G), |V(H"1)@__ __V(H"2)|=2, and |E(H"1)@__ __E(H"2)|=1. A triangle-path in a graph G is a sequence of distinct ...
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4
Tutte's 5-flow conjecture from 1954 states that every bridgeless graph has a nowhere-zero 5-flow. It suffices to prove the conjecture for cyclically 6-edge-connected cubic graphs. We prove that every cyclically 6-edge-connected cubic graph with oddness ...






Comments