Cited By
View all- Jones L(1973)MicroprogrammingACM SIGACT News10.1145/1008299.10083005:4(9-11)Online publication date: 1-Oct-1973
Controlled graphs and instructions
Author: 
Guy Boulaye Translator: Louise JonesAuthors Info & Claims
Pages 30 - 35
Abstract
This paper is concerned with controlled graphs, a graph-theoretic formalism which was developed from the study of microprogramming. In this formalism, a microinstruction is equivalent to a subgraph of the graph representing the (microprogrammed) computer, and the problem of designing a micro-instruction is simply that of finding an appropriate subgraph. However, this idea can be generalized and applied to other networks which are characterized by flows of discrete elements. The results of one instruction or of a sequence of instructions, a natural notion for a programmer, are developed for controlled graphs in this paper.
Reference
[1]
Boulaye, G., Microprogrammation, Dunod, Paris, 1971.
Index Terms
- Controlled graphs and instructions
Recommendations
Dynamic coalescing for 16-bit instructions
In the embedded domain, memory usage and energy consumption are critical constraints.Embedded processors such as the ARM and MIPS provide a 16-bit instruction set, (called Thumb in the case of the ARM family of processors), in addition to the 32-bit ...
Dynamically Scheduling VLIW Instructions
Very long instruction word (VLIW) machines potentially provide the most direct way to exploit instruction-level parallelism; however, they cannot be used to emulate current general-purpose instruction set architectures. In addition, programs scheduled ...
Collapsible Graphs and Hamiltonicity of Line Graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53---69; Conjecture 8.6 of 1995 ) conjectured that every 3-edge connected and essentially 6-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
September 1973
183 pages
Copyright © 1973 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 September 1973
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 484 of 2,242 submissions, 22%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 149Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)4
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
Cited By
View all- Jones L(1973)MicroprogrammingACM SIGACT News10.1145/1008299.10083005:4(9-11)Online publication date: 1-Oct-1973
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in