Zobrazeno 1 - 10
of 10
pro vyhledávání: '"J. Robert Jump"'
Autor:
J. Robert Jump, P. S. Thiagarajan
Publikováno v:
Journal of the ACM. 22:596-612
Autor:
Susan E. Conry, J. Robert Jump
Publikováno v:
Information and Control. 41(3):247-274
This paper is concerned with a class of parallel computations which can be represented by a graphical model called a computation graph. In particular, graphs which represent the same computed function are studied. Given an arbitrary but well-formed c
Autor:
Jayant S. Kirtane, J. Robert Jump
Publikováno v:
Information and Control. 24:74-91
This paper presents a model which can be used to represent many of the interconnection patterns commonly found in cellular networks. This model is then used to classify cellular networks according to the degree of regularity in their interconnection
Autor:
David T. Harper, J. Robert Jump
Publikováno v:
IEEE Transactions on Computers. :1440-1449
The degree to which high-speed vector processors approach their peak performance levels is closely tied to the amount of interference they encounter while accessing vectors in memory. In this paper we present an evaluation of a storage scheme that re
Autor:
Dennis R. Fritsche, J. Robert Jump
Publikováno v:
IEEE Transactions on Computers. :974-984
The logical organization of a programmable cellular array is presented and discussed. This array is a two-dimensional array of identical cells, each of which can be programmed to one of 12 functional states. It is shown that by appropriate selection
Autor:
J. Robert Jump, Shreehari Marathe
Publikováno v:
Information and Control. 19(4):345-352
A result relating the length of a feedback shift register to the lengths of the cycles in its state transition graph is presented. Specifically, it is shown that, if a state of a feedback shift register is in one cycle of length c1, and another cycle
Autor:
J. Robert Jump
Publikováno v:
Information and Control. 15:424-435
This paper presents an application of the theory of automaton automorphisms to the decomposition theory of finite automata. In particular, it is shown how the automorphism group of an automaton can be used to construct decompositions which are iterat
Autor:
J. Robert Jump, N.D. Jotwani
Publikováno v:
Information and Control. (3):241-257
A class of parallel programs, based on Free Choice Petri nets, is modeled by associating operators and predicates with vertices of the net. The model, called a formal parallel program (FPP), forms a natural extension of flow-chart notation to paralle
Autor:
J. Robert Jump, P. S. Thiagarajan
Publikováno v:
SWAT (FOCS)
This paper is concerned with the problem of detecting when two asynchronous control systems are equivalent. The systems investigated in the paper are first represented by means of a formal model called an asynchronous control structure (ACS). This mo
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.