Memory addressing device using arbitrary directed graph structure

作者: Jacob Fredrik Klinkhamer

DOI:

关键词: Decision tableTable (database)Branch tableStructure (mathematical logic)Base (topology)Memory addressOperandDirected graphComputer scienceTheoretical computer science

摘要: Data-processing system comprising an addressing device for in a directed graph structure store which is divided this purpose into tables each having reference address as table base. Relative to the base, words be found numerically are addresses further or operands indirect operands. In order permit highly flexible structure, portion of instruction and/or any sequential contains arbitrary number components may have different lengths. The length data check and overflow tables.

参考文章(7)
Bobby A Creech, Erwin A Hauck, Benjamin A Dent, Robert S Barton, William M Mckeeman, Data processing system having tree structured stack implementation ,(1967)
King Paul D, Merner Jack N, Barton Robert S, Digital computer with indirect addressing ,(1961)
John F Couleur, Edward L Glaser, Shared-access data processing system ,(1965)
Alvin P Mullery, Ralph F Schauer, Current addressing system ,(1963)
Moore Mary Lou, Schmitt William Francis, Breslin Mary Anne, Indirect addressing system ,(1961)
Michael H Blume, Walter R Lethin, Variable width addressing arrangement ,(1964)