Abstract
The general problem of formating microinstruction so as to minimize the width of words in control memory is shown to be computationally difficult. Hence, we should not attempt to solve the general case, but concentrate on heuristics for reasonable subcases.
- S. J. Schwartz, "An algorithm for minimizing read-only memories for machine control," 1969 IEEE 10th Annual Symposium of Switching and Automata, pp. 28--33. Google Scholar
Digital Library
- A. Grasselli and Montanri, "On the minimization of read-only memory in microprogrammed digital computers," IEEE Transactions on Computers, Vol. C-19, pp. 1111--1114, 1970. Google Scholar
Digital Library
- R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations (Miller and Thatcher, eds.), Plenum Press (1972), 85--104.Google Scholar
- S. Dasgupta and J. Tartar, "The identification of maximal parallism in straight-line microprogramming," IEEE Trans. on Computers, Vol. C-25, pp. 986--992, 1976. Google Scholar
Digital Library
- E. G. Coffman (ed.), Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976.Google Scholar
- M. Tsuchiya and M. J. Gonzalez, "Toward optimization of horizontal microprograms," IEEE Trans. on Computers, Vol. C-25, pp. 992--999, 1976. Google Scholar
Digital Library
- T. Agerwala, "Microprogram optimization: a survey," IEEE Trans. Comput., Vol. C-25, pp. 962--973. Google Scholar
Digital Library
- S. R. Das, D. K. Banerji, and A Chattopadhay, "On control memory minimization in microprogrammed digital computers," IEEE Trans. Comput., Vol. C-22, pp. 845--848, Sept. 1973.Google Scholar
Recommendations
Research Note-Heuristic Theorizing: Proactively Generating Design Theories
Design theories provide explicit prescriptions, such as principles of form and function, for constructing an artifact that is designed to meet a set of defined requirements and solve a problem. Design theory generation is increasing in importance ...
Technical Note: A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time"
In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time''', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set ...
Research article: Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins
The protein structure prediction problem is a classical NP hard problem in bioinformatics. The lack of an effective global optimization method is the key obstacle in solving this problem. As one of the global optimization algorithms, tabu search (TS) ...






Comments