CA1151306A - Programmable controller - Google Patents

Programmable controller

Info

Publication number
CA1151306A
CA1151306A CA000354337A CA354337A CA1151306A CA 1151306 A CA1151306 A CA 1151306A CA 000354337 A CA000354337 A CA 000354337A CA 354337 A CA354337 A CA 354337A CA 1151306 A CA1151306 A CA 1151306A
Authority
CA
Canada
Prior art keywords
data
memory
bits
register
address
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
CA000354337A
Other languages
French (fr)
Inventor
Salvatore R. Provanzano
Wilbert H. Aldrich
Robert A. D'angelo
Emil P. Drottar
John J. Finnegan, Jr.
James Heom
Lawrence W. Hill
Ronald D. Malcolm
Michael C. Nollet
Baruch S. Perlman
Michael B. Tressler
John E. Vanschalkwyk
Kincade N. Webb
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Gould Inc
Original Assignee
Gould Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Gould Inc filed Critical Gould Inc
Application granted granted Critical
Publication of CA1151306A publication Critical patent/CA1151306A/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/04Programme control other than numerical control, i.e. in sequence controllers or logic controllers
    • G05B19/05Programmable logic controllers, e.g. simulating logic interconnections of signals according to ladder diagrams or function charts
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/12Plc mp multi processor system
    • G05B2219/1204Multiprocessing, several plc's, distributed logic control
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/14Plc safety
    • G05B2219/14005Alarm
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/15Plc structure of the system
    • G05B2219/15028Controller and device have several formats and protocols, select common one
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/15Plc structure of the system
    • G05B2219/15048Microprocessor
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/15Plc structure of the system
    • G05B2219/15055FIFO
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/15Plc structure of the system
    • G05B2219/15064MMU, memory management unit
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/15Plc structure of the system
    • G05B2219/15107Linesolver, columnsolver
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/10Plc systems
    • G05B2219/15Plc structure of the system
    • G05B2219/15131Pipeline registers

Abstract

ABSTRACT
An improved programmable controller having the ability to use two different data bases while presenting to the outside world a uniform word size. The programmable con-troller includes pipeline processing and hardware solution of a user control program in a network node format. A
memory management scheme is provided allowing for the direct addressability of one-half million words by utilization of a page register. The programmable controller can be incorporated into a network containing other programmable controllers.
The programmable controller also incorporates a multi-task interrupt so that the processor can handle more than one job at any particular time. Input/output tasks are handled logically in the scan solving the user networks rather than being based upon a particular physical area of the controller memory.

Description

1~513~)6 T~C-~INICAL FIELD
The present invention relates to programmable con-trollers and programmable controller systems.

BACKGROUND ART
The present invention is directed to programmable controllers typically used for control of industrial machines and processes which, since approximately 1969 when they were first developed, have been utilized to replace relay ladder-type logic previously used to achieve such control functions.
U.S. Patents 3,686,639, Fletcher et al, 3,994,984, Morley et al, 3,930,233, Morley et al, and 4,492,666, Gould Inc., illustrate the historical development of the programmable controller art. It is known that other patents have been issued to other companies manufacturing programmable con-trollers, including Allen-Bradley Co., Texas Instruments, and General Electric.
The present invention is an improvement over these prior art programmable controllers. It provides a dual data base capability with a unique data packing scheme while presenting a uniform word size to the external world and a user control hardware network logic solver utilizing a programmable logic array that allows the user to specify various node elements, including horizontal and vertical shorts. The processor hardware and software include a FIFO
system to improve the memory throughput by taking advantage of the fact that the programmable controller solves network nodes in a sequential fashion. Two ports are provided to the memory including a random access port and th~ FIFO port.
These features and a memory management system in which up to one-half million words can be directly addressed by a page register have not been previously utilized in the programmable controller art. Furthermore, the present invention performs ~' ~

llS~30~
-2- 122-027 input/output (I/O~ logically throughout the scan solving the user networks rather than performing the I/O at a particular location in memory. Furthermore, a multi-phase clock system is utilized in the bus design to increase overall system speed.
These improvements yield a Easter, more powerful and cost effective programmable controller than prior art con-trollers.

11513~6
-3- 122-027 DISCLOSURE OF THE INVENTION
The present invention relates to an improved programmable controller which can form part of an overall programmable controller system. It has rapid solution of the user control program networks, a large user logic space, a large quantity of I/O, and a broad library of user functions. It can support 256 discrete inputs and 256 discrete output points which may be traded in blocks of 16 for register I/O. It can be expanded to 1,024 inputs and 1,024 outputs. Its scan time solving a 4,000 relay contact program is less than 40 milliseconds.
The basic system can be modularly upgraded to provide such additional functions as: (1) additional memory with a user space of at least 32,000 words, (2) the ability to directly address up to 64,000 references, (3) a remote I/O
up to 5,000 feet from the mainframe central processing unit, and (4) the ability to support computer oriented functions including interrupt driven I/O, process control oriented user languages, mass storage, closely-coupled multiple CPU's and other peripherals.
The programmable controller utilizes hardware that can operate in two different data bases; namely, 16-bit and 24-bit, while all communications with the outside world utilize a uniform 24-bit format. A memory packing technique is able to efficiently store 24 bit data in a 16 bit memory. The bus design for intercommunica~ion between the central processing unit, memory and I/O utilizes a multi-phase clock which forms two lines of a multi-line bus.
The programmable controller can operate in a pipeline format by utilizing a FIFO port with a cache memory to the main memory which takes advantage of the fact that the network nodes are solved in sequence. The FIFO cache memory resides between the main memory and the bus. It is sixty-four words deep and is able to be filled from the main memory at the memory cycle time of 750 nanoseconds. During 11513~)16
-4- 122-027 times when the eentral processor unit (CPU) does not need aecess to memory (sueh as during the solution of a sixteen bit by sixteen bit multiply), the FIFO eaehe memory ean eontinue its reading of sequential locations in memory.
Then when access is requested by the CPU to memory, it can instead read data from the FIFO cache memory. Since the FIFO cache memory has a cycle time equal to the bus cyele time (250 nanoseconds), the CPU is not delayed in its proeessing by the slower main memory eycle time. This technique takes advantage of storing user control program network logic in sequential memory locations.
The programmable controller utilizes network format user control programs for specifying the eontrol functions to be performed. The solution of the node types is performed in hardware forming the mainframe central processing unit.
In this arrangement the speed for solving user networks is increased while providing great flexibility to the user with respect to designating his or her control program. The interconnectable programming panel is able to show the user any portion of the control program, allows the user to change or modify the control program, and is able to display the real time power node status of any selected node through use of a keyboard.
By a particular peripheral port protocol, the programmable controller can be interconnected to other programmable controllers which combine to form a control system.
The programmable controller also incorporates a multi-task interrupt so as to allow the processor to perform more than one function at any particular time.
The overall result is a programmable controller with a fast solution time, flexible user implementation, and a relatively low cost.

According to a broad aspect of the present invention, there is provided an improved programmable controller of the type having a central processing unit (CPU), and addressable memory having more than 1.5 x N addressable memory locations, each memory location capable of storing P data bits, where P is an integer greater than one, an input/output (I/O) system, a bus interconnecting the CPU, memory and I/O, and wherein the programmable controller is able to store user logic defining a control program for execution by the program-mable controller wherein the user logic may comprise up to N
possible nodes, where N is a positive integer, wherein the improvement comprises:
A) first means, interconnected to the bus and forming part of the memory, for storing up to N data words representing the user nodes, each data word comprising up to 1.5 x P bits of data so that for each data word "i", where i=l, . . ., N, up to P data bits are stored in memory location "j" of addressable memory, where j= base address (base addR) + i-.l and so that the remaining data bits of the data word "i", if any, are stored in up to half the memory space of memory location "k" of the addressable memory, where k = (j/2) +
"widget", where "widget" = ((base addR)/2) + N, and where the remainder of j/2 determines which half of addressable memory location "k" to use to store the remaining data bits of data word "i", and B) second means, interconnected to the bus and forming part of the memory, for reading the data words from the addressable memory so that for any data word "i" data is read from addressable memory location "j" and combined with - 4b 11513S)6 the data bits corresponding to data word "i" stored in addressable memory location "k", wherein this means further increases the length of data word "i" to equal 1.5 x P bits, when the data word "i" has less than 1.5 x P significant data bits, by further combining nondata significant bits to the data significant bits read from addressable memory locations "j" and "k" so as to equal 1.5 x P bits;
whereby all data words N are stored and packed in the addres-sable memory in the same manner regardless of the number of data bits in any given data word, and wherein these data words are stored in the addressable memory beginning at an address defined by the base address so that a flexible address boundary is realized between the addressable memory locations for non-user node storage and that utilized for user logic node storage.

~lS~
-5- 122-027 THE DRAWINGS
For a fuller understanding of the nature and objects of the present invention, reference should be made to the following detailed description taken in conjunction with the following drawings, in which:
FIGURE 1 is a block diagram of the programmable controller with interconnection to the input/output;
FIGURE 2 is a diagrammatic illustration of the programmable controller system structure;
FIGURE 3A is a diagrammatic representation o~ the packing of 24 bit data in a 16 bit memory;
FIGURE 3B is a diagrammatic representation of a conventional prior art technique of packing 24 bits into a 16 bit word size memory;
FIGURE 4 is a block diagram illustrating the use of a cache memory in conjunction with the programmable controller CPU and input/output processor;
FIGURES 5A-5F are detailed block diagrams of the central processing unit;
FIGURE 5 is a diagram showing how FIGURES 5A-5F are put together;
FIGURES 6A-6F are detailed block diagrams of the input/
output processor;
FIGURE 6 is a diagram showing how FIGURES 6A-6F are put together;
FIGURES 7A-7E are detailed block diagrams of the pro-grammable controller memory;
FIGURE 7 is a diagram showing how FIGURES 7A-7E are put together;
FIGURE 8 is a diagram showing the memory space allocations of the programmable controller; and FIGURE 9 is a diagram showing the page selection and address generation from a 16-bit address word.

115~306
-6- 122-027 BEST MODE FOR CARRYING OUT THE INVENTION
As shown in FIGURE 1, an improved programmable controller 20 according to the present invention comprises a central processing unit 22, a main memory which may be a volatile memory 24 or a non-volatile memory 26, and an I/O processor 28 all intercommunicating with each other by means of a mainframe bus 30. A power supply 32 provides the necessary electrical current to drive the programmable controller components. A direct memory access (DMA) interface 34 may optionally be utilized for memory access without inter-communication with the CPU.
FIGURE 2 is a diagrammatic representation of various aspects of the programmable controller system achievable by the present invention. As is shown diagrammatically in FIGURE 2, the programmable controller is housed in a drip-proof mechanical housing. The central processing unit can have enhanced capability and is able to replace conventional relays. It is able to perform DX functions; that is, functions of a non-relay logic nature such as a table-to-table move.
It is able to perform such additional functions as a proportional integrator-differentiator (PID), trigonometric functions, etc.
The programmable controller comprises a main memory fabricated from CMOS and can have a size ranging from 4K by 16 bits up to 32 K by 16 bits in increments of 4K bits. It can alternatively have a core memory, ranging in size from 4K by 16 bits up to 32K by 16 bits. The input/output (I/O) communicates on a protocol known as the 200 series, a series used by Modicon Corporation and described in their literature including that of their 384 (RIProgrammable Controller. The programmable controller also has a capability of direct memory access as also shown in FIGURE 2. The power supply is able to drive the CMOS memory plus two channels of I/O.
It can also power a core memory if such is used in the programmable controller and two channels of I~O.

liS~3~6
-7- 122-027 Thus, the programmable controller shown in FIGURE 1 provides a faster and functionally superior programmable controller system than the present assignee's 384 ~ Pro-grammable Controller, has a larger usex logic space, a larger quantity of I/O and a broader library of user functions.
It functions primarily as a relay replacer, has a 4K user memory expandable up to 32K words, can support 256 discrete inputs and 256 discrete output points which may be traded in blocks of 16 for register I/O and can be expanded up to 1024 input and 1024 output points. Its scan time solving a 4K
relay contact user program is less than 40 milliseconds. It is housed in a rugged drip-proof package.
The programmable controller system can be modularly upgraded to provide the following additional characteristics:
1) more user functions;
2) additional memory up to a user space of at least 32,000 words;
3) the ability to address up to 64K references and register-plus discrete locations;
4) a faster scan time of 20 milliseconds;
5) a remote I/O up to 5000 feet from the mainframe CPU;
6) an interface to a communication link with other programmable controllers; and 7) the ability to support computer oriented functions includiny interrupt driven I/O, process control oriented user languages, mass storage, closely coupled multiple CPU's and other peripherals.
The basic package has a drip-proof housing designed so that the addition of more printed circuit boards can be obtained with a package having a similar appearance. The drip-proof housing has an upper and lower series of louvers to provide flow within the housing so as to cool the com-ponents on the various printed circuit cards placed within the housing.

11513~16 -~ 122-027 A central processing unit (CPU) 22 shown in FIGURE 1 is illustrated in greater detail in block diagrams FIGURES 5A-5F. A more thorough discussion of this block diagram is presented later.
The programmable controller has software functionality so as to perform relay replacement functions including normally open and normally closed contacts, horizontal and vertical shorts, and a user control network, counters and timers, and such additional non-logic functlons as proportional integrator-differentiator, trigonometric functions, etc.
The software comprises a minicode machine and a microcode machine. The minicode machine has the following major features:
1) 8 general purpose registers, 2) 3 special purpose registers (Index, page A and B), 3) the capability of addressing 512K words of memory, and 4) a word of memory having 16 bits with two "node"
types, 16 bits and 24 bits.
The minicode machine is able to word address so as to ~- allow addressing 32K words per page. This allows for generation of a larger operation code set including~new instructions beyond those of the Digital Corporation~PDP-ll instruction set. The general design for the minicode word is 4 bits for an operation code and 12 bits for a source/destination addresses. This gives 16 major opcodes and 4096 source/
destination address combinations. The 12-bit source/destination field is further broken up into two sections, with two 3-bit subsections including 3 bits for the source code, 3 bits for the source register, 3 bits for the destination code, and 3 bits for the destination register. The eight general purpose registers have the following utilizations:
1) R0-R5 are general purpose registers, 2) R6 is used by hardware as a stack pointer for interrupt and subroutine call service and is referred to as SP, and llS~306 3) R7 is used by hardware as the program counter and is referred to as PC.
The three special purpose registers are the index register (IR), the page register A (PRA), and the page register B(PRB~. The index register is a read/write via special instructions. It is used in addressing mode 5. The two page registers are also read/write via special instructions.
They are used when an address (that is, used to find anything in memory) has a ~ as its most significant bit. The contents of page register A are used as the four most significant bits (bits 18-15) of the address. When the address has 1 as its most significant bit, the contents of page register B
are used as the four most significant bits (bits 18-15) of the address. This is a hardware feature that is independent of the addressing mode and the instruction.
The minicode operation code is built to be large in size and includes the instruction set given in Table 1 with their accompanying description. By use of this instruction set, a powerful programmable controller is realized.
The minicode machine described above thus uses a minicode executive which is the executive of the programmable controller. This executive amounts to a large loop with exception code for both power up and power down. The loop services I/O, solves user logic and handles peripheral port communications. Hardware interrupts for a real time clock (described later) watchdog timer failure (described later) and power down are serviced as well as a number of soft interrupts othertimes referred to a "traps".
Two major exceptions to the loop are power up and power down. The power up restores state tables, performs memory diagnostics, initializes coils, initializes peripheral port, and controls the executive through the first scan of I/O and logic solving.
Power down copies the state tables to a backup area, and does a check sum of the data contained in the state tables. The backup area uses a non-volatile memory (see 11513~6 Mnemonic - RESET, Generic - reset Description: The RESET instruction sends the controller to its microcode power up routine. It resets all logic and begins in microcode. I-t begins minicode through the power up vector.
Mnemonic - WAIT, Generic - wait Description: writes registers 0-15 into memory addresses, ehecks for bus request and grants it if there. Then, restores registers from same memory locations and refetches the instruction at its location, and starts all over again.
Mnemonic - JMP, Generic - ~ump Deseription: Transfers control to any location in memory with the full flexibility of the addressing modes (with the exception mode 0). Mode 0 causes an illegal instruction condition in the assembler. Modes 1-7 calculate the address of an operand. This address is the value put into the PC.
Mnemonic - RTS, Generic - ReTurn from Subroutine 0 D cription: First loads contents of register into the PC
and then pops the top element of the processor stack into the specified register. Usually the register used is the same one used in the original subroutine call (i.e., if JSR PC then, RTS PC).
Mnemonic - NOP, Generic - No Operation Mnemonic - SETC, Generic - eondition code operators Description: sets or clears condition codes according to the information in the 4 LSB's.
Mnemonic - SWAB, Generic - swap byte 0 Description: Exchanges high order byte and low order byte of operand specified by destination field.
Mnemonic - RNE, REQ, RPL, RMI, RVC, RVS, RCC, RCS, Generic - Return from subroutine on condition ~151306 Mnemonie - SOB, Generic - subtraet one and braneh (if not - 0) Description: the register is deeremented by one. If the result Not = 0, then the offset is subtraeted from the eurrent eontents of PC 9 whieh will point to the word following the SOB instruction) and the results put baek in the PC. NOTE that this means that this braneh only goes in one direction; back.
Mnemonic - JNE, JEQ, JPL, JMI, JVC, JVS, JCC, JCS, Generic - Jump on condition Mnemonie - CLR, Generic - elear destination Deseription: contents of specified destination are replaced with zero.
Mnemonie - COM, Generic - complement destination Description: replaees the eontents of the destination with their one's complement (each bit that is a 0 is set to a 1 and vice versa).
Mnemonie - INC, Generie - inerement dst Deseription: add one to the eontents of the destination and put baek into the destination.
Mnemonie - DEC, Generie - deerement destination Deseription: subtract one from contents of the destination and put back into the destination.
Mnemonie - NEG, Generic - negate dst Deseription: Replaces the eontents of the destination address with its two's complement.
Mnemonie - ADC, Generic - add earry Deseription: adds the state of the earry flag (e) to the eontents of the destination address and puts result -baek into this address. If C = O, destination is unaffeeted.
Mnemonic - SBC, Generie - subtract earry Deseription: subtraets the state of the earry f'ag (e) from the eontents of the destination address and puts baek into this address. If C = 0, destination is unaffeeted.

11513~6 Mnemonic - TST, Generic - test dst Description: sets the condition codes N and Z according to the contents of the destination address.
Mnemonic - ROR, Generic - rotate right Description: rotate all bits of destination right one place through the carry.
Mnemonic - ROL, Generic - rotate left Description: rotate all bits of destination left one place through carry.
Mnemonic - ASR, Generic - arithmetic shift right Description: shift all bits of destination right one place: bit 16 is replicated and bit 0 goes into the carry.
Mnemonic - ASL, Generic - arithmetic shift lef'c Description: shifts all bits of destination left one place: bit zero is loaded with a zero.
Mnemonic - r~FCR, Generic - move from condi-tion register Description: the four system condition flags plus a variety of system states are loaded into the destination address.
Mnemonic - MTCR, Generic - move to condition register Description: four least significant bits of the contents of the source address are loaded into the condition register. Memory protect and "config" are not affected as they are read only.
Mnemonic - SXT, Generic - sign extend Description: if the sign flag (N) is set, a -1 is put in the destination address. If the sign flag is clear, then destination address is cleared. This is useful in multiple precision arithmetic because it permits the sign to be extended through multiple words.

llS~3~6 Mnemonic - JSR, Generic - jump to subroutine Description: the contents of the reyister are pushed into the processor stack, the PC is then put into the specified regis-ter (the PC will point to the instruction following the JSR), and finally executes similar to a JMP instruction. This means that modes 1-7 can be used in the destination. Mode 0 should cause an illegal instruction error in the assembler.
A common use of this instruction involves specifying the PC as the register (~SR PC, dst).
This will result in PC -~ stack and dst -~ PC.
Return from subroutine is performed by the RTS PC
instruction.
Mnemonic - MOV, Generic - move source to destination Description: the source operand is placed in the destination address. Previous contents of destination are lost.
The contents of the source address are not affected.
Mnemonic - MOVM, Generic - move under mask Description: The source operand is logically ANDed with a mask, the destination operand is logically ANDed with the inverse of the mask, and the two are logically ORed to obtain a result. This result is placed in the destination address. The contents of the source address are not affected, the contents of the destination address are destroyed. Note- this instruction takes 2-4 words. The mask is always the first word after the instruction.
Mnemonic - CMP, Generic - compare src to dst Description: compares the source and destination operands by subtracting the dest. from the source. Its function is to set condition flags. The contents of the source and destination addresses are unaffected.

~lS13~6 Mnemor.ie - CMPM, Generic - eompare under mask Deseription: The souree and destination operands are logieally ANDed with a mask before being compared. The eompare is done by subtracting the modified dest. operand from the modified source operand. The result is used to set/elear eondition eodes. The eontents of the souree and destination addresses are NOT affected. The mask always resides in the first word following the instruetion.
Mnemonie - BIT, Generie - bit test Deseription: The souree operand is logieally ANDed with the destination operand and the condition codes are modified appropriately. The contents of the source and destination operands are not affeeted.
Mnemonie - OR, Generie - logieal or (bit set) Deseription: The source operand is logieally OR'd wlth the destination operand and the result is placed baek into the destination address. The contents of the source address are not affected but the original contents of the destination address are destroyed.
Mnemonie - ADD, Generie - add sre to dst Description: Adds the source operand to the destination operand and puts the result into the destination address. The contents of the source address are not affected, but the original contents of the destination address are lost. nemonic - BNE, BEQ, BPL, BMI, BVC, BVS, BCC, BCS, BR, BGE, BLT, BGT, BLE, BHI, BLOS, BMPROT, Generic - branch on condition Description: provides a way of transferring program control within a range of -128 to +127 words.
Mnemonic - SUB, Generic - subtract src from dst Description: subtracts source operand from destination operand and puts the result into the destination address. The contents of the source address are not affected but the original contents of the destination address are destroyed.

llSl~)6 Mnemonic - XOR, Generic ~ exclusive or Descrip-tion: the exclusive OR of the source operand and the destination operand is put into -the destination address. The contents of the source address are not affected, but the original contents of the destination address are lost.
Mnemonic - AND, Generic - logical ~ND
Description: the logical AND of the source operand and the destination operand is put in the destination address.
The contents of the source address are not affected, but the original contents of the destination address are destroyed.
Mnemonic - MBLK, Generic - move block Description: RO is defined to contain the # of words to be moYed. This instruction performs the so called COBOL move. The block os words starting at the source address is moved to become a block of the same size starting at the destination address. This instruc-tion will move the source block intact regardless of the direction of the move. If the source address is less than the destination address, the move will be performed from the bottom of the source block to the bottom of the new destination block. If the source address is greater than the dstination address, the move will be from the top of the source block to the top of the destination block. This keeps any information from being destroyed in the transition. NOTE that RO is not changed, and that the source and destination registers change ~ according tot he node. Example:
MBLK (R2), (R3) will leave R2 and R3 unchanged.
"MBLK" will be interruptible during its execution.
Mnemonic - ROTL, ROTR, LGL, LGR, Generic - Rotate/Shift specials Description: Destination operand is rotated or shifted by the $ of bits in the count. If the count = 0, then the contents of RO are the count. RO remains unchanged at the completion of the instruction, if it held the count.
Only the 4 LSB's of RO will be used, the 12 MSB's will be ignored.

115~3~16 Mnemonic - MUL, Generic - single precision mul-tiply (two's complement) Description: A 2's complement multiply is performed between the source operand and the contents of the register and the result is placed in the register. The contents of the source address are not affected. The original con-tents of the register are lost and the register is filled wlth the LSB's of the result.
The asse~bler must block any register greater than R5.
Mnemonic - DIV, Generic - single precision divide (2's complement) Description: A two's complement divide is performed between the source operand and the contents of the register and the results are placed in the register. The remainder is neglected. The contents of the source address are unaffected; the original contents of the register are lost.
The assembler block uses any register greater than R5.
Mnemonic - ASH, Generic - arithmetic shift Description: register is shifted as a function of the information in (src). Meaningful contents of source range from -32 to +31 (0 means no action). If source contains a +4, the register is arithmetically shifted 4 bits to the left: if -4, it would be shifted 4 bits to the right.
Mnemonic - ASIIC, Generic - arithmetic shift combined Description: the contents of the register and the register plus one are used for a 32 bit shift, according to information in source. Meaningful contents of the source range from +31 to -32 (0 means no action).
If source contains a +4, the 32 bit register pair is shifted 4 bits to the left. A -4 would shift to the right.

11513~16 Mnemonic - ADWC, Generic - add with carry Description. the source operand :is added to the contents -of the register and the carry flag (0 or 1) and the result put into the reg. The contents of the source address is not affected; the original contents of the register are lost.
Mnemonic - SB~C, Generic - subtract with carry Description^ the source operand is subtracted from the contents of the register and the carry flag (0 or 1) is subtracted; the result is put in the register.
The contents of the source address are Note affected.
The original contents of the register are lost.
This instruction adds carry to permit multiple precision (i.e. multiple registers) subtraction.
Mnemonic - DMUL, Generic - double precision multiply (2's complement) Descrip~ion: A 2's complement multiply is performed between the source operand and the contents of register, and the double precision result is put into this register and the one immediately following it.
For example, if R3 were specified, the MS word of the result would be placed in R3 and the LS word in R4. The contents of the source address are not affected. The original contents of Rn and Rn ~ 1 - are lost.
The assembler must block any register greater than R4.
Mnemonic - DDIV, Generic - double precision divide Description A 2's complement divide is performed in which the contents of the register (MS) and the one immediately following it (LS) are divided by the source operand. The results are placed in the register (quotient) and in the one immediately following it (remainder). The contents of the source address and the source address plus one are not affected. The contents of the register (Rn) and the one immediately following it (Rn~l) are lost.
The assembler must block any register greater than R4.

11513~6 Mnemonic - SOLV, Generic - solve logic Description: This solves the user logic data base. Must be set up with a FIDO command.
The SOLV instruction will solve the nodes of one segment, up to but not including the EOS/EOL
node which marks the end of segment. (The minicode will dri~e the I/O thru separate instructions; MAPIN &
MAPOUT). The SOLV must be explicitly executed for each segment in the database.
Furthermore, SOLV will terminate (return to minicode) at 16 different PC locations, based upon the 4 least significant bi~s of reference portion of the EOS/EOL node.
The SOLV instruction will have 16 possible vectored exits, calculated from the vector index in the EOS/EOL
node. The 4 bit index will be added to the (updated) PC, and the SOLV will vector to the address within "PC+l-index." Index = 0 will mean "EOL".
In all cases, the EOS/EOL reference bits will be returned in register Rl (16 l.s. bits).
Mnemonic - MOVNOD, Generic - move nodes Description: MOVNOD is a specialized instruction. It expects RO to contain a count of the number of nodes to move (1-32K). It expects the source address to be in R4, and the destination address to be in R5. It also requires that the source and destination addresses be correctly set up for overlapping moves.
If the src~adr dst adr ~R4~R5), the addresses will be decremented used for inserting nodes).
If the src addr>dst addr (R4~R51, the addresses will be incremented (used for deleting nodes~.
When the move is done, R4 and R5 will be updated to point beyond the last node moved. That is; (R4) _ (RO)~ R4; (R5) + (RO) ~ R5. RO is unchanged.

Mnemonic - RTMI, RTMO, RTSV, Generic - return -to MAPIN
return to MAPO~T, return to SOLV
Description: minicode rou-tines are needed to perform -general user logic nodes or traffic cop types that are not done in microcode. rrhese routines must be concluded an RTMI, RTMO, RTSV instr.
Mnemonic - FIDO, Generic - FIFO load Description: the source operand is provided to the user logic FIFO as the starting address of user logic.
10 The FIFO will start to fill from this address.
This command must be given prior to a SOLV instr., preferably far enough in advance to permit the FIFO
to fill.
Mnemonic - RDNOD, Generic - read a node Description: RDNOD always gets 24 bit node, whether the database is 16 bits or 24 bits. The microcode uses the "config" line to determine how it will process the node. For the 24 bit configuration, the node is supplied as is. For the 16 bit configuration, it is "expanded". RO gets the 8 bit node type in the low
8 bits and Rl gets the 16 bit reference address.
The assembler will block use of RO, Rl and/or mode 0 in the destination specification.
Mnemonic - WRNOD, Generic - write a node Description: WRNOD always expects a 24 bit node where:
RO (15-8) = 0; RO (7-0) = 8-bit node type;
Rl (15-0) = 16-bit reference number. Then, the microcode uses the "config" line to determine how it will process the node. For the 24 bit configuration, the node is written at the destination address as is, using the special logic which packs a node away in memory. For the 16 bit configuration, the microcode "implodes" the node. Then the resulting bits are written to memory at the destination address.
The assembler will block use of RO, Rl and/or mode 0 destination specification.

-2~- 122-027 1~51306 Mnemonic - LDWIDG, Generic - load 'widget' register Description: The 'widget' register is a special register in the 2~-bit node type memory. This is the register which the hardware uses to pull the node type byte out of the user area for concatenation with the 16 bit reference number. It is loaded with a value equal to:
(base addr of user logic)/2 -~ (total # of nodes possible).
The "base addr of user logic" must be an even number.
Mnemonic - CLRINT, Generic - clear all pending interrupts Description: initializes the interrupt controller such that any pending interrupt requests are erased and all eight interrupts are enabled.
Mnemonic - EI, Generic - enable interrupts Description: All interrupts are globally enabled.
Mnemonic - DI, Generic - disable interrupts Descri~tion: All interrupts are globally disabled.
Mnemonic - RTI, Generic - return from interrupt Description: used to exit from an interrupt (one of the ones reserved for minicode use - see CLRINT) or a software trap routine. The PC and condition code register are restored from the system stack.
Mnemonic - SPR, RPR, Generic - set/read page registers Description: SPR (set page registers) this instruction sets page registers A & B according to the values in "source". Src bits 7-4 go to page reg A and src bits 3-0 go to page reg _ RPR (read page registers) this instruction reads page registers A & B into "destination".
~ reg _ goes to dst bits 7-4 and page reg B
goes to dst bits 3-0. (Dst bits 15-8 are set zero).

Mnemonic - RDKEY, Generic - read the keypad Description: This instruction reads one ke~stroke into des-tination, if available. If there is no keystroke available, the m.s. bit (bit 15) is set to 1; the rest are unpredictable. If there is a keystroke, the m.s.
bit is set to zero and the four l.s. bits (bits 3-0~ are set as follows:
0 = zero; 1 = one; 2 = two; 3 = three;
4 = four; 5 = five; 6 = six; 7 = seven;
8 = eight; 9 = nine; A = address;
B = contents Mnemonic - WRLED, Generic - write an LED digit Description: The LED is a decimal/hex display; that is, -it can be written with 0-9; A-F ~ . The 1.s.
byte of the source controls the digit, its position, and the decimal point. The bits control the 6-digit LED display as follows:
Bit 7: decimal point (0 = none; 1 = dec'l on) ~its 6-3: digit itself (0-9; A-F) Bits 2-0: digit "address"; 0 = l.s. digit;
5 = m.s. digit.
Mnemonic - CTBCD, Generic - convert to/from BCD
Description: the destination operand is converted to/from BCD and replaced in the destination address.
Mnemonic - FASCII, Generic - convert to/from ASCII
Description:
Mnemonic Operation TASCII Convert contents of RO to ASCII, put into (dst), (dst+l) FASCII Convert 4 ASCII characters residing in (dst), (dst+l) to binary and put into RO

1~51306 Mnemonic - PUSHR, Generic<-~push RO - R5 selectively onto system stack Mnemonic - POPR, Generic<-~pop RO - R5 selectively from system stack Mnemonic - STRAP, Generic - software trap Description: this generates a software trap. The old PC
and condition code register are pushed onto the stack.
The number NN (0 to 77) is additionally pushed onto the stack for use by the software trap handler.
Mnemonic - MTIR, MFIR, Generic - move to/from index register Description: MTIR moves the source operand to the Index Register.
MFIR moves the contents of the Index Register into the destination address.
Mnemonic - ADIR, SBIR, Generic - add/subtract nn to/from Index register Description: The value NN (bits 5-0 of instr) is either added to or subtracted from the contents of the Index register and the result put back in the Index register.
The original conten-ts of the Index register are lost.
Mnemonic - MAPIN, General - map inputs into CPU
Description: MAPIN will move ("map") 8 words from a buffer (Rl) to the s-tate ram (coils and registers) according to the traffic cop (RO).
RO has the address of 8 words of the traffic cop for this map-in operation. Rl has the address of 8 words of the I/O buffer with the data.
At the end of the MAPIN instruction, the values in RO & Rl will each have been increased by 8.
The values in R2-R5 will have been destroyed.

1151~0~

Mnemonic - MAPOUT, Generic - map outputs from CPU
Description: MAPOUT will move ('imap") 8 words from the state ram (coils and registers) to a buffer, according to the traffic cop.
RO has the address of 8 words of the traffic cop for this mapout operation.
Rl has the address of 8 words of the I/O buffer which will receive the outpu-t data.
At the end of the MAPOUT instruction, the values in RO & Rl will each have been increased by ~.
The values in R2-R5 will have been destroyed.
- Mnemonic - STRTIO, Generic - start the field I/O
Description. This instruction starts the exchange of I/O between the I/O R~M buffers and the physical I/O
The I/O process will continue on its own (in the microcode) once this instruction has been executed.
Mnemonic - WDTENB, Generic - watchdog timer enable Description: This instruction sets the "enable watchdog timer" flag in the microcode. Thus, when SOLV
sees EOL, it can then "kick" the wdt if enabled.
Mnemonic - CRC16, Generic - cyclic redundancy check Description: CRC16 calculates a CRC-16. The data is packed one byte per word with the upper byte zero.
The starting address is placed in RO, the byte count in Rl. The CRC-16 result (a 16-bit value) will be in R2 upon completion of the instruction.
Mnemonic - PUNT, Generic - power unquestionably not there Description: moves a block of memory from State RAM adr;
state RAM adr+count-l. Adds each word moved to the current checksum.

~lS13~6 FIGURE 1).
Errors within the loop cause the programmable controller to enter the "STOP" state in which logic and I/O are not performed but peripheral port functions are performed. This allows the STOP machine to be open to the outside world for both examination and remedy if possible.
Expansion of the executive is possible though new code types, I/O types and total or partial override of the executive.
The first expansion level is achieved by using existing tables or vector addresses to exit to codes that can handle such things as new node types (non-microcode node vector) or I/O type (after traffic cop) or even after the vector addition of hardware interrupts.
Power-up is the first minicode routine executed by the programmable controller when power comes on. It stores tables saved during power-down (tables which normally reside in volatile memory, see FIGURE 1), performs initial diagnostics, initializes coils (including a first pass of input), solves the first scan and does first pass of output control and then goes to the main loop. Power-up is basically used to initialize the organization of the programmable controller for later operation.
The next operation of the minicode executive is to read all inputs twice. This allows the printed circuit input cards of the Series I/O to "warm up". It is basically a precaution to insure that transients have settled. The second read is used as the actual data.
The next executive operation is to solve all logic as set forth by the user control program.
The following step of the minicode executive is to perform all I/O twice. This allows the printed circuit output cards of the Series 200 I/O to "warm up", and brings "fresh" inputs for the next sweep to utilize.
Other operations of the minicode executive include clearing the first pass flag and the end of the power-up.
In addition, the minicode executive has a "widget" register ~1513(~6 and a 24-bit node storage. A widget regi,s-ter is a hardware device which gives the programmable controller the ability to store and retrieve 24 bits from a 16-bit memory.
FIGURES 3A and 3B respectively illustrate the present invention and the prior art. They are a comparison of memory packing techniques utilized in the prior art and the present invention for packing 24 bits into a 16-bit word size memory. As is readily apparent in FIGURE 3A, for any 24-bit word (such as word No. 1), the first 16 bits of that word (the least significantl6 bits) are stored in a first memory address (such as address 0001) with the eight remaining bits (the most significant bits), stored in a memory address positioned from the first memory address by a given number of locations (such as 1,000); and thus, at memory location 1001. Only 8 of the 16 bits of location 1001 are used for word No. 1. For the second 24-bit word, the first 16 bits of the word are stored in memory location 0002 with the remaining eight bits of that word stored in memory location 1001, in that memory locations eight least significant bits.
As is readily apparent from FIGURE 3A, this provides a neat manner for packing a 24-bit word into a 16-bit memory. The alternative method shown in the prior art would be to store the 24 bits of the first word in the first 24 bits of memory;
that is, 16 bits in memory location 0001 with the eight remaining bits in memory location 0002. Then for the second 24-bit word to be stored in memory would be first presented to the eight remaining bits of memory location 0002 with the remaining 16 bits of word No. 2 stored in memory location 0003. The present invention's memory packing technique is easier to utilize since there is a one-to-one correspondence between the memory and the data to be stored with only the remaining bits of the data to be stored packed into additional memory locations having a fixed space from the former memory address location. Each word of data is thus stored at the beginning of a memory location unlike the prior art where, ~1513~6 depending upon the data, it is even stored as a first bit of a memory address location or the ninth bit of the memory address location.
The widget register is thus the hardware device that gives the programmable controller the ability to store and retrieve 24-bit nodes in a 16 bit memory. This register is loaded with a special "value" to enable it to perform its function. It also requires that the data base area be organized so that the area reserved for user logic holds two nodes for each three words available. Furthermore, the nodes are stored as shown in FIGURE 3A. The 24-bit node is divided into eight bits (the most significant eight) and sixteen bits (the least significant). They are shown in FIGURE 3A as "aA", "bB", "cC", "dD", where "a" is the most significant eight bits and "A" and the corresponding least significant sixteen bits. There is one further rule needed to make the widget system work and that is that the "base addR" must be an even number. Although the maximum number of nodes "N" may be odd or even for a given user logic, for clarity sake the executive always has an even total number of nodes. Thus the widget register mus-t be loaded with a value from the following equation:
widget register =[(base addR). 2]+ N, where "N" is the total number possible user nodes, not the to-tal amount of user logic words "area". The widget register is always loaded at power up regardless of the configuration of the programmable controller; that is whether it utilizes a sixteen bit memory or a twenty-four bit memory.
The main loop is the center of operations after the power up is completed. Through it logic is solved, I~O
performed, diagnostics performed, peripheral port commands execu-ted, and major housekeeping performed.
The exits from the main loop are interrupts of both a "hard" and "soft" nature. In most cases return is made to the main loop. Other exits can occur in the peripheral port ~15~;~Q6 command handler section. The main loop checks for a "STOP"
state. If there is not a "STOP" state, the logic is solved and I/O performed. At the end of a scan of the user networks, the peripheral port commands are executed. Diagnostics (logic check sum, etc.) are also performed. After, if there still is no "STOP" state, I/O is completed. E3y doing peripheral port and diagnostics first, time is given for the I/O to finish any transactions. Then the clocks are updated (real time clocks settings for timer nodes, not needed if in "STOPPED" state.). Finally, regardless of the "STOP" state, the key pad and display lights of the programmable controller are updated.
Another function of the minicode executive is the peripheral port command handler. The peripheral port command handler is used to act upon commands/requests received at either one of two peripheral ports. The basic func-tion of the peripheral port is to supply programming (for user logic and data) and monitoring (of register coils, status, etc.).
The peripheral ports are in-terrupt driven. The peripheral port handlers exist in microcode (discussed later). When data is coming in from an outside device, the interrupt handler for that port buffers the data. Output interrupts occur when the por. is ready to transmit, in which case, data in the transmit buffer is sent. Although there are two peripheral ports there is only one command handler.
Another function of the minicode executive is interrupt handlers and traps. The interrupt handlers are used to process interrupts. The actions involved depend on the type of interrupt. There are two categories of interrupts, "hard" and "soft". "Elard" interrupts are the type genera-ted (originally) by the hardware. These interrupts are, real time clock, watch dog timer failure, peripheral por-t one, peripheral port two, and power down.
"Soft" interrupts are the type which are generated solely by the microcode software. These are software trap, illegal minicode instruction, illegal traffic cop item, microcode fatal error, and non-microcode node type. As is evident, these interrupts are used as an escape for things the microcode is not intended to handle.
In order to perform the minicode executive through the minicode machine the programmable controller incorporates a microcode which performs the basis of operation for the central processing unit (see FIGURE 1). The microcode routines are of three general types: 1) those that perform (or aid in performing) the minicode instruction set, 2) those that execute (or aid in executing) user logic instructions, and 3) those that perform other necessary system functions such as service interrupts, system I/O , etc.
The microcode represents the basic level of awareness in the programmable con-troller.- There is a basic set of routines that can be entered in response to external events (interrupts). These routines fall into two areas: those that perform a background function for the minicode (discre-te I/O, plus request, etc.) and those that rely on a sequence of minicode instructions to perform a function.
The rest of the microcode routines perform functions that are indicated by information in memory (instructions).
Each of these routines perform its function and, through use of the program counter (for minicode instructions), or the USER LOGIC FIFO (used for logic instructions, discussed later) jump to another routine to perform another function.
The routines that perform minicode instructions call the next routine by fetching the contents of the memory word indicated by the program countex and putting this word into the instruction register. Through the use of a ~PPING ROM
and a programmable logic array (PLA) ! this results in 1) addresses of the next microcode routine, and 2) the addresses (if any) of the source and destination code microcode routines becoming available (as long as this information is in the instruction register). A jump is made to the address provided by the MAPPI~G PLA of the next routine. ~he new routine utilizes the source and destination code routines ( if 1~513~6 appropriate) to find operands in memory.
The routines that perform user logic instructions call the next routine through the use of a "PIPELINE" command.
Basically it results in information being taken from the user logic FIFO and loaded into a "link register" specified by the routine. Through use of another "M~PPING ROM", the address of the next routine is made available. The link register is used in order to insure that additional in-formation (operand) is immediately available upon entering the routine to perform another user logic instruction.
Interrupts are handled by an interrup-t controller.
When one occurs, a flag is set. The above mentioned routines deal with this flag differently. In minicode and user logic instruction fetch routines test for this flag. Additionally, any microcode routine that takes longer than 50 microseconds also tests this flag. This serves to minimize interrupt ; response time.
When a routine senses the interrupt flag, it jumps to a routine that gives the appropriate commands to the interrupt controller so that the address of the interrupt handling routine is provided to this routine by the MAPPING ROM.
This routine then jumps to this address.
The function and description of the microcode modules is set forth below:
A) Basic Instruction Design There are three types of minicode instructions, a single word instruction, a single operand instruction, and a double operand instruction.
The single word instruction routine performs its function without using the source~destination code routines to obtain operands. The operands for these instructions are either ir~plicit in the instruction ~contained in the defined location or register), part of the instruction (as in the offset contained in a branch instruction) or not necessary at all.

~15~3~6 B) Utility Models A utility model is a microcode module that performs a service or function and is written in a way that can be utilized by multiple microcode modules. I-t is similar to a sub-routine, except that entry to and exit from it are not by standard JSR and RTS.
C) Microcode ~ibrary Routines Library routines are microcode sub-routines that perform services or functions that are used by more than one module.
They are entered with a JSR and returned via an RTS. In most cases they are standard 2911 commands with the return address on the 2911 stack. In the situation where the library routine may be long in time, a different technique is used. In these latter situations the routine that is calling the library module puts a return code on the micro-code memory stack. It will then jump to the module. The library module performs its task and returns by retrieving the return code from the microcode memory stack and jumping to the RETURN portion of the RTI module. This insures safe return to the calling module.
D) Connections Between M crocode Modules There are six pages in the 1.5K microcode system.
Modules are assigned to these pages as set forth below:
Page 0 Minicode instruction modules where MS bit of the instruction machine code is equal to 0, power up routine Page 1 Minicode instruction modules where the MS bit of the machine code equals 1 Page 2 FETCH, source~destination routines, interrupt routines, user logic modules, etc.
Page 3 MAPIN, MAPOUT, STRT I/O, I/OHAHA, BCD-BIN, BIN-BCD.
Page 4 Peripheral port handlers, basic user logic modules, some minicode instruction modules, CRC 16 Paye 5 User logic modules 11513~6 The programmable controller microprogram executive is performed by the microprogrammed central processing unit which incorporates a 2901A microprocessor slice arithmetic logic unit 36 as seen in FIGUR~ 5D. The microcomputer incorporates an Advanced Micro ~evices, AMD 2900 family of components as set for-th in FIGURES 5A-5F. Reference should be made to the Advance Micro Devices' "Family Data ~ook" as well as the Signetic's Micro "Assembler Reference Manual".
The microprogram and minicomputer comprising the central processing unit 22 can be viewed in two ways: 1) From a minicomputer side it is a minicomputer with an instruction set having special instructions for logic solving. The basic word is siY~teen bits, the user logic can be either in a 16-bit or 24-bit format and can be handled in special ways by the memory interface hardware; 2) From the microcomputer side, it is a collection of special processor chips, or logic that acts like special processor chips, and other internal functions which enable it to perform the minicode and special functions.
Microcode Processor There are several specialized processes (and blocks of logic that act as processors) which, together, create the microcode machine. They are 1) AMD 2901; this is a 4-bit slice arithmetic logic unit. Four are used to create the basic arithmetic/logic unit (ALU) 36 of the CPU 22. ~lso, the 4-bit slice performs logical shifts and contains seventeen internal general purpose registers.

This is also a 4-bit slice. Three aXe used to create a microcode address sequence control capable of addressing up to a 4K microcode memory. It also controls selection of next addresses in the microcode memory. It contains an internal register, a program counter and four element stacks.

~1513~6 Interrupt Control 61 (FIGURE 5C~
This block of logic can be instructed to ENABLE, DISABLE, and CLEAR all or CLEAR one interrupt.
CPU Control This logic controls the bus registers and other special purpose registers surrounding the AMD 2901. It is a catch-all area; anything outside of 2901 but inside the busses that is not controlled elsewhere, is controlled here.
Bus Control including Bus Control Prom 63 (FIGURE 5E) This logic controls the flow of information on the system address and data busses. It controls reading/writing of main memory.
Hardware Logic Solver 74 (FIGURE 5D) This logic solves all relay nodes, resolves vertical connections and does the power in-power out bookkeeping for the logic solver operation.
The above are the major processing areas. There are several minor ones which serve to provide additional controller information for the above six areas.
There are also 16-bit internal registers. These are general purpose registers used by the arithmetic logic unit.
Registers R0-R7 are also the minicode registers. There is - also a single 16-bit "Q" register which is used during double register mathematical operations. The above registers are associated with the 2901 bit slice clips. In the 2911 sequence control, there is one 12-bit program counter register, four 12-bit stack location registers used during call/
return/push/pop and other jump instructions, and one 12-bit register which is assumed in certain instructions. This latter register can be loaded with the contents of the next microcode address.
As shown in FIGURES 5A-5F, there are also a number of special registers used by a number of processors in the microcode machine including one 16-bit "A" bus register 65 (FIGURE 5B) to load the data bus and read the 2901 arithmetic l~Si3~

logic unit, one 24-bit "Y" bus register 98 (FIGURE 5D) to buffer data from the ALU Y-bus to the data bus, one 24-bit instruction register 40 (FIGURE 5D) used to contain a minicode and/or user logic instruction for decoding, one 8-bit page register 64 (FIGURE 5D) used as two 4-bit page address registers. ~'he contents of each 4-bit register is used as the most significant four bits of a l9-bit minicode address, one 8-bit power-in" register 67 (FIGURE 5F) used by the hardware logic solver to hold the "power coming in"
information for the current column, one 8-bit "power-out"
register 69 (FIGURE 5F) used by the hardware logic solver to hold the "power coming out" information for the current column, one 24-bit holding register 58 (FIGURE 5D) to hold the PRIOR contents of the Ins-truction Register, one 4-bit condition code register 60 (FIGURE 5C) having conditions codes of CARRY, OVERFOLW, SIGN, and ZERO, one 16-bit test multiplexer (MUX) 62 (FIGURE 5C), containing sixteen selectible testable bits which reflect and supply a variety of statuses concerning the programmable controller, one 16-bit link register used during logic solving for pipelining user logic instructions, (it is written from the data bus and is read by the state RAM memory address register), one 16-bit state RAM Memory Address register which contains the state RAM, one 16-bit FIFO memory address register (part of address computa-tion block 104, FIGURE 7A) containing the address of the current core memory access, one 4-bit microcode page register 70 (FIGURES 5C-5D) to select one of sixteen 256 word pages, one 16-bit "widget" register (part of address computation block 104) used in non-vQlatile memory interface calculations for a 24-bit user logic data base, and a 16-bit non-volatile memory address regi~.ter containing current address of the non-volatile memory.

Table 2 illustrates the various functions performed by the central processing unit.
Table 3 illustrates the various "line types" and their numerical availability for the presen-t invention.
Table 4 illustrates the various scan time options available for both the 16-bit and 24-bit data bases utilizing various memory sizes.
Memory and Busses Main Memory There are sixteen pagcs each having thirty-two thousand addresses of sixteen bit words. The memory is "word" address;
that is zero, one, two, three..., not "byte" address.
The maximum address space is allocated as shown in FIGURE 8.
- The user logic/state R~ backup non--volatile memory is used for two things; 1) the user logic data base, and 2) space for backup of coil/register data from the state RAM
which must be saved upon power down.
There is a FIFO series of registers 96 (see FIGURE 4), in microcode, for accessing the first thirty-two thousand words of user memory. This device reads a word from non-volatile memory at a given address, increments its address, and reads again. It holds the most recently requested sixty-four words. This is used to allow microcode to operate quickly on user logic instructions in memory and not have to wait for slow memory access. The information retrieved by the FIFO is treated as user logic. This means that in-formation is presented as representing a 16-bit user logic data base or a 24-bit user logic data base.
Main memory is addressed, in minicode, by utilizing a l9-bit address. This address is one generated by the central processing unit using a 16-bit address word in one of two 4-bit page registers. The high order bit of the address word is used to select which page register will he used. Thus, 1151~6 CPU FUNCTIONS

. . BASIC hanted CODE FuNcTI~N SOURCE* DES~ ~ tPU CPU
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ ~ _ _ _ _ --- Relays 0,1 --- x --- Tirners(1 0,0.1,G 01) ~irett,3,4 4 x --- Counter direct,3,4 .4 Y
Add direct,3,4 4- x Subtract direct,3,4 4 x ~uLtiply direct,3,4 l. x Divide direct,3,4 4 Skip direct,3,4 --- x xxx Register to Table** û,1,3,4 4 . x 11xxx Tab~e to Reg;ster 0,1,3,4 4 x 1~xxx Table to Table 0,1,3,4 4 . x 13xxx Blr,ck .~ove 0,1,3,4 . 0~4 x 14xxx Fi~o Lo~ 0,1,3,4 4- x 15xxx Fifo Re~ove 4 C,i.- . Y
17xxx Get Status ~~-~~~~ 4 x 2Dxxx And 0,1,3,b D,4 x 21xxx OR/X~ 0,1,3,4 0~4 x 22xxx Not - C,1,3,4 0,4 x 23xxx Rr~tate 0,1,3,4 0,4 x 24xxx Compare 0,1,3,4 U,4 x 25xxx Clear Set 3,4 . D,4 x 26xxx Zer~es 3,4 n,1~3,4 x 3DOxx PID . 3,4 4 x 30100 Trig 3,4 4 x 30200 Inv Trig 3,4 4 . x 3n300 Log Funct 3,4 4 x 3U400 Anti-log 3~4 x 3~55C Char Det 3,4 4 .................. x 306GO Average 3,4 4 x 307~0 Sort 4 4 x 3D&OO Square Root 3,4 b .- x 30900 Stand~rd Deviation 3,4 4 ~ x 40xxx Ascii out 4 . 4 x 41~xx Ascii in 3 4 : x 42xxx Numeric out 3 4 . x 43xxx Numcric in 4 . 4 :
~T,i~TE: *O means coil reference . ..
1 means in~ut re~erence 3 rneans input register reference 4 means holding or output register reference ~* Table lengths are l;mited to 255 in the 16 ~it system .

11~13~6 PER LINE EFFECTS ON SCAN TIMES
LINE TYPE NUMBER AVAILABLE
Relay 9 Timer (Sec & 1/10 Sec) 15 .
Counter 20 .
Calculate (B~C & B-C) 31 llXX 80 16XX (w/one element in table)100 16XX (w/99 elements in table)690 17XX 80 .

2599 8~0 3000 (lxl) 8 3000 (9999x9999) 68 3100 (1/1) 31 3100 (9998999/9999) 134 ~S~31Q~

TABLE 3 Cont'd PER LINE EFFECTS ON SCAN TIMES
LINE TYPE NUMBER AVAILABLE
3201 (lxl) 8 3299 (9999x99) 63 3301 (1/1) 31 3399 (989999/99) 134 ~3~- 122-027 TABLE

Memory Si~e/Scan Time ~ptions .
16 ~ 24 ~it D~ta Elase ________________________________________ ____~_______________________________ ! ~EMDRY ! TYPICAL C~FlGURA~l~rJ
! ! 16 ~I~ DATA BASE ! 24 ~IT DA~A BACE
! !---------------------------------!----------------------------------! NODES ! I/O ! HOLDI~'JG r~EGI~EkS! N~DES ! IJO ! H(ILD~ G REGlS~RS
_______ ______________________________________ _ ________ ______ ____________ 4t: ! 2500 ! lG24 !7no ! 1600 ! 1ù24 !70n ~K ! 50ûu ! 1~)24 ! 15DD ! 33DU !1E24 ! 1500 ! 12K ! ~OOD ! 2048 !192D ! 5300 ! 204R !1920 ! 16K !11000 ! 2048 !1923 ' 650Q ! 2D4~. ! 4QOG
~!2~lK !175E)0 ~ 2n4~ ! 1920 ! 9sno !204X ! ~ODO
! 32K !24003 ! 2048 !1920 ! 130QD ! 2l~.~ ! XDaQ
___________________________________________________________ _______________ ~;~TE: These 6 configuratiDns r~present a sample_ nther configurations can be made ~hen l~, registersr and no!ies are traded ~or each other, -., ,' .. ' ....

1~51306 for any address presented to the bus, the four high order bits are the contents of the page register selected by the high order bit of the address word and the fifteen low order bits are the remaining fifteen bits of the address word. A
diagramatic representation of this addressing scheme is shown in FIGURE 9.
Microeode Memory The microeode memory is a lK to 4K by 48-bit PROM
memory (FIGURE 5C) which contains the microcode instructions.
Constant ROM
The constant ROM 56 (FIGURE 5B) is an area available to the microcode instructions. It is 16-bits by 256 words. It is used for bit masks and contains constants for microcode only.
The data bus 146 of main bus 30 (see FIGURE 6C) is a 24-bit wide bus and conneets memory with the mieroeode bus registers.
Address Bus The address bus 143 (see FIGURE 6C) of the main bus 30 is l9 bits wide and is eonnected only to the main memory.
It is loaded from the 2901 arithmetic logic unit 36 (see FIGURE 5D).
Y-bus The Y-bus 145 (FIGURE 5D) is a bus from the arithmetie logie unit 36. It is 16 bits wide and earries the final results of the arithmetie logie unit operations to the rest of the mieroeode machine.
Arithmetic logic functions performed by the 2901 ALU
are the arithmetie or logieal operations performed on two 16-bit source operands and a carryin bit. The results may go to an internal 2901 register (R0-R15), a 2901 Q register and Y bus, or both an internal 2901 regiater and onto the Y
bus.
The 2901 has two l-bit shifters and can perform logical shifts on the ALU output before it is put into an internal 11513Q~
-~0- 12~-027 2901 register, and, if selected, simultaneously shift the contents of the Q register and put back into the Q register.
The hardware logic solver resolves the basic user logic instructions (relays, beginning of column, start of network) maintains column by column power in and power out information and provides a limited amount or external access and control over this information. The basic user control program is in the form of a network essentially similar to that shown in co-pending United States Patent Application Serial Number 895,581.
The hardware logic solver functions are controlled by the following fields in the microcode word:
ALUIILS - 1 bit which selects the 2901 or the HLS
SETPWR - 1 bit which controls the setting or a power out bit from external information SOLVNODE - 1 bit which enables the solution of a user logic instruction and the recording of the results in internal registers BOC - 1 bit which tells the HLS to resolve a beginning of column node NODETYPE - 3 bits which tell the ~ILS to resolve a certain relay node type INITHLS - 1 bit which tells the HLS to initialize for start of ~et~ork (solve start of Network node) PWRCNTR - 2 bits which control the power register counter which points to power bit to be read/set/cleared ADVSTAT - 1 bit which controls the shifting of the LSB out of the HLS column status register and power in register.
Through these Eunctions the hardware logic solver is able to solve the user network for the desired control function.
The microcode machine also includes a 2911 address sequence controller to select the address for the next microcode instruction, a test ~UX, a conditional code re~ister and in-terrup-t con-tro] and a CPU con-trol to control the bus regis-ters and special purpose registers surroundiny 115130~

the 2901. Furthermore there is a bus controller which moves information onto the data and address busses from the CPU, makes it available to the system memory, and/or places information from memory onto either of the busses.
FIGURES 5A-5F are detailed block diagrams of the central processing unit 22. In FIGURES 5A 5F as well as in FIGURES
6A-6F and 7A-7D, the slash lines through the parallel lines designating data paths represent the number of lines or bits that are transferred in parallel along that data path. For example in FIGURE 5A, the number of data lines transferred from the CPU bus 30 to the interrupt storage register 41 is eight.
Referring now to FIGURE 5B, the DIN REG (D-IN register) accepts 24 inputs from the main bus 30. This data either comes from the scratchpad (described later)-or from the main memory or the CMOS memory. The scratchpad is from the I/O
processor and particularly tha$ shown in FIGURE 6E.
The data comes into the DIN REG from either a 16-bit data base or from a 24-bit data base. The 24-bit data base is primarily intended for user logic and comes exclusively from the CMOS memory shown in FIGURES 7A-7E. When data comes in, such as a regular minicode instruction, it branches over to the instruction register 40 (FIGURE 5A) and will be put into a form containing 16 bits. From the instruction register, the data is decoded by the minicode programmable logic array (PLA) 42 (FIGURE 5A). The minicode PLA transfers the microcode address sequence to a starting routine.
Depending upon the format of the instruction (e.g. a dual operand, single source operand), either the source map 44 or the destination map 46 will be called upon by the instruction to go to a particular vector point and start executing that portion of the instruction. All of the instruction sequences are resident in the microcode of the PROM 48 which is a 1-4K by 48 bit programmable read only memory. Thus the microcode is 48 bits wide. In the microcode PROM the routines reside for the minicode instructions discussed earlier.

11513~6 From the microcode PROM 48, the system is pipelined to the pipe line registers 50 shown in FIGURE 5E. Out of the pipeline registers, which acts as a bu~fer, the ~8 bits are broken up into various fields as indicated in FIGURE 5E.
While the instruction is being executed from the pipeline registers, the next microcode instruction is being fetched in the microcode PROM area.
Thus data fields corresponding to bits 47-38 are used for the logic solver instructions or to control the arith-1~ metic logic unit 36 (minicode instructions). Bits 47-45 control the ALU destination field which basically states where in the ALU the results are to be placed.
Bits 44-42 define the type of operation to be performed by the ALU with the ALU responding by requesting where the data is to come from; namely, to internal registers, an external source coming in directly to the ALU 36 or coming from the Q-register, an internal register within the ALU 36.
Rit 38 basically differentiates between the performance of a logic solver instruction and a minicode-type instruction.
Thus bit 38 is low for a logic instruction and is high for a minicode instruction. The above bits when bit 38 is low have a different use as explained later.
Bits 37-36 comprise the shift control. These two bits control the shift-up latch 54 and shift-down latch 53 that are attached to the side of the ALU 36. It controls the direction of a shift or a rotate or whatever it is that is being performed.
Bits 35-32 are transferred to the ALU A register select module 52. This register provides for accessing the 16 registers of the ALU 36 through the A port. Thus these four bits can select any of these 16 registers within the ALU.
Bits 31-30 can also be transferred to the ALU select register 52; that is, an instruction from memory can also address those registers within the ALU 36. Depending upon the combination of these two bits, it is determined whether or no-t there is an address within the ALU 36 coming from the microcode or from the minicode.

l~S13~6 Bit 29 of the pipeline register controls -the constant ROM address MU~ 56. The 4-bit address can either be fed from the pipeline registers 0-3 or come from holding register 58. As noted, the holding register was previously filled with the four bits from the instruction register 40.
Bit 28 of the pipeline register loads the condition code reyister multiplexer 60. Thus this bit controls the loading of that register.
Bits 27-24 control (by enabling and disabling) the test multiplexer 62.
Bits 23-19 is the bus control field. This sets in motion what happens in the CMOS memory and then sets in motion what happens on what is called the I/O processor code.
Bits 18-14 are the internal CPU control fields. This field controls all the operations that go on within the CPU
and their data movements. This field controls the loading of the A register (four bits which go into the microprocessor arithmetic logic unit 36, see ~`IGURE 5D). These control bits control the enabling of the output of the constant PROM
56 into the ALU 36, control the loading of the data out bus register at the bottom of ALU 36 and control the page register 64 (FIGURE 5D). It also controls the loading of the instruction register 40 (FIGURE 5A) as well as the loading of the holding register 58.
Bits 13-11 of the pipeline registers 50 control the microcode address sequencer 66 (FIGURE 5E) so that it can have conditional operations or expanded operations.

~iS13Q6 -44~ 122-027 Bits 10-8 control the source of the direct address into the microcode sequencer. The output of the microcode branch and select module 68 controls the particular group of bits of the branch select field.
Finally, bits 7-0 define the last field of the pipeline registers. Four of the bits can be used to load the microcode page register 70. Also the entire eight bits can go into buffer 72 (FIGURE 5D) to form par-t of the twelve bits comnuni-cating with the source and des-tination map 44 and 46. In addition, bits 7-4 can define the field of the B register of the microprocessor ALU 36.
As mentioned earlier, the hardware logic solver receives bits 47-37 of the pipeline register first field. The hardware logic solver 74 is shown in FIGURE 5D. The function of the hardware logic solver is to solve the open and closed relays for both in the horizontal position as well as to ascertain vertical flow of power in a user network. It is also used in the processing of the node-type functions selected by the user. It further defines the functions of the counter, timer and transfer functions. In essence, it takes the power in and takes the function desired and determines if there is going to be a power-out condition. It uses a coil power bit which comes from the scratchpad RAM 76 (FIGURE 6E) of the I/O processor through the internal data bus 78 through a 16-1 multiplexer 80 to a latch 82 to generate the coil power signal 84.
Specifically, bit 47 enables the test multiplexer 62, output line (test MUX 86) to be lowered into the power-out regis-ter 88.
Bit 46 basically shifts register control within the hardware logic solver while the shift register is to be shifted up or down. Bit 45 indicates a beginning of a column-type node so as to take the information in the holding register and dump it into the column status register 90.

1~5131~

Bits 44 and 43 determine the type of node that is to be executed and whether it is to be a normally open or normally closed node or positively or negatively transitional. Bit 42 states whether or not it is a standard type node or a transitional type node. Bit 41 indicates the start of a user network which is similar to the beginning of a column so as to have power at the beginning of the operation.
Bit 40 is for the up-down counter within the logic solver so that it can be ascertained where the logic solver is with respect to a particular column in a user network.
Bit 39 is used to increment the counter itself.
Bit 38 indicates the existence of a logic solver in-struction while bit 37 iS used as a shift register control bit within the columns of the logic solver.
Basically, the logic solver emulates the relay confi-guration of the user network, takes the vertical bits that are in there and moves power up and down the column auto-matically as well from left to right so that the execution of the user network is obtained. That is, the logic solver looks at the power in bits, the coil power bit, and determines if there is to be a bit loaded into the particular power register. After the column is completed, the vertical connection bits are processed and this combination enables the controller to know the power-in status to the next column of the user network.
As best seen in FIGURES 1 and 5D, a keyboard pad 92 comprises sixteen divisions which is able to enter hexadecimal data. This data can be loaded into the central processor arithmetic unit 36 by the user.
The central processing unit 22 further comprises a display register 92 (FIGURE 5F) and a display control module 94 (FIGURE 5F) which control a six digit LED display that is on the mainframe front panel.
The end result of the cen~ral processing unit as set forth in FIGURES 5A-5F is that instructions can be executed out of memory at a rate equivalent to the microcode instruction 11513~ti speed. This is basically the result of having a five-fold Increased computational speed is also obtained by the central processing unit 22 communicating by bus 30 with a FIFO cache memory 96 resident within the memory 24 which has a cycle time equal to that of the bus for read and write.
This cycle time is 250 nanoseconds compared to the memory cycle time of 750 nanoseconds. Thus, sequential locations in memory 24 are packed into the sixty-four word deep cache memory 96 at the 750 nanosecond cycle time and are available to the CPU at the 250 nanosecond cycle time. Thus, during times when the central processing unit is executing instructions without the need for data from memory, the FIFO stack can be filled by the memory and thus be available for the CPU.
This particular technique is advantageously utilized by the present invention since user logic data is stored in sequential locations of memory as earlier described and shown in FIGURE
3A.
Finally data out bus register (Y) 98 (FIGURE 5D) is the means by which 24 bits or 16 bits of output data can be placed on the data bus 30 if this data is to be written either into the memory or scratchpad. Also shown in FIGURE
5F is a real-time clock (RTC) 100 which counts off of a main oscillator and gives a signal every ten milliseconds. There is also a watchdog timer 102 shown in FIGURE 5F which indicates when too much time has been taken with respect to a particular scan.
Memory The memory associated with the CPU by bus 30 can be either a volatile memory or a non-volatile memory. A
detailed block diagram of the memory when using CMOS volatile memory is shown in FIGURES 7~-7E. Instead of the 6504 CMOS
chips, core memory can be utilized and this would therefore represent the confiyuration to be used when a non-volatile memory is used as the main memory. As shown in FIGURE 7A, an address computa~ion module 104 receives the external addresses from bus 30. There are lg bits which enter the llS13~)6 address computation module from the main bus 30. Several functions are performed by the address computation module, one of them is splitting the address bits which are latched onto the block into a lower 12 represented by output line AIG (0-11) and three upper bits represented by output line AI (12-14). Bits 12-14 on output AI are transferred to a chip ENABLE decode circuit 106 which decodes the three bits to determine which column of up to eight columns is to be active.
Another function of the address computation is to obtain a 24 bit operand or deposit 24 bits in a 24-bit WRITE
operation. This requires two accesses to memory since the memory size is 16 bits as explained earlier. Thus one access is for the lower 16 bits of data, and one is for the upper 8 bits of data. The address of the lower 16 bits is the address that is sent in from the central processing unit. The address computation module then computes the address of the upper 8 bits by using a constant loaded into it from a "widget" register resident within the address computation block. The second address is then put on the oucput line during the second memory cycle to properly access the second memory location associated with the upper 8 bits of data. This corresponds to the earlier discussion as shown in FIGURE 3A. The "widget" register comprises 16 bits and is loaded from an input da-ta steering block 108 which also obtains its information from bus 30.
A third function of the address computation block is the computation of addresses for the FIFO cache memory 96 (see FIGURE 4). The address computation block generates the FIFO address register data. This address is the address where data can be obtained from the memory chips the next time data can be retrieved by the FIFO catch memory. Thus, the control system is always attemp-ting to keep the FIFO
cache memory full, and whenever it observes on the bus 30 that the memory is not needed by the central processing unit 11513~6 and if there is an opening in the 64 word FIFO stack, it does a memory cycle to put data into the FIFO using -the FIFO
address register 110 (see FIGURE 7E). The FIFO register can comprise up to 64, twenty-four bit words and has a 250 nano-second cycle time with the bus and is thus able to increase the speed of the overall programmable controller by allowing the CPU to have faster access to memory.
Referring again to the address computation block, it consists of a number of integrated circuit chips as well as three registers, one holding the active address, one com-prising the "widget" register, and the third acting as a counting register for computing the second memory address location when a 24-bit word is to be read or written from the memory. The memory itself comprises CMOS 4K by 1 memory chips of the 6504 type. These memory chips 112 are shown in FIGURE 7D. Of course, core memory can be used in place of the CMOS. There can be up to eight columns of these memory chips with 16 memory chips in each column comprising a 16-bit word.
The input data steering block 108 accepts ~4 data bits from the system bus 30 and sends them to tri-state buffers (3-S buffers) 114. There are 16 lines between the input data, steering block and the tri-state buffers 14, and these 16 lines can either represent the low 16 bits of a 24-bit word or the upper 8 bits of two different 16-bit words as explained earlier and shown in FIGURE 3A. The output of the tri-state buffer 114 is sent on data input lines DI/OO
through DI/15 which are the 16 lines that carry data into the memory array comprising the 6504 memory chips 112. It should be noted that each column of the 6504 memory chips is 16 chips in height to represent a 16-bit data word. There can be up to eight columns of these chips from left to right as viewed in FIGURE 7D.
In order to ensure the proper addressing of the memory chips, strobe gating blocks 116 (FIGURE 7B) are used to ~1513Q6 ensure that the address information coming from tri-state buffers 118 have settled and therefore represent valid information.
The reading of information from the memory chips 114 is basically the same as the writing of information via the input data steering block and the address computation block. Thus the output data steering block 120 (FIGU~E 7C) accepts 16 output lines from the memory chips (D0 00 and D0 15) and converts them into a 24-bit output which is trans-ferred to output register 122 which is in turn connected tothe main bus 30. The addressing of the memory is again performed by the address computation block in association with the chip encode block 106, tri-state buffers 118, and strobe gating circuitry 116.
There is one additional function performed by the output data steering and that arises when only 16 bits of data actually are emanating from the memory chips for trans-ferral as 24 bits onto the main bus 30. In some situations this arises where there are not 8 additional bits of in-formation to be read from the memory with respect to aparticular word of data. In these situations, the output data steering block also sets 8 of its output bits to 0 and thus presents a 24-bit word to the output register. In this way the outside world also views the processor as having a fixed data format although more than one format may be used depending upon the size of the programmable controller. It should be noted that the output data steering block is also associated with the FIFO registers 110 and transfers data to the FIFO registers during those times when the CPU is not requesting data from the memory and when the FIFO has room in its registers for the receipt of additional data. Thus, in the normal configuration the output data steering block receives two memory cycles representing first the lower 16 bits of data on lines D0 00 and D0 15 and then the upper 8 bits for tha-t same word of da-ta which is obtained from the 11~13(~6 ~50- 122-027 second memory location within the memory as compu-ted by the address computation block. The comb:ination results in ~ 24-bit word being retrieved by the output data steering module for presentation to the output register and thus the system bus 30. In those situa-tions where only 16 bits actually exist in the memory, the output data steering sets 8 of its 24-bit output lines to 0 and therefore is able to present a 24-bit word to the output regis-ter of which only 16 bits contain actual information.
Also shown in FIGURE 7E is a control block 124 which provides the strobe timing outputs and steering controls and READ/WRITE instructions for the proper timing of the overall memory system. In addition, a battery detector 126 senses the output voltages of the six back-up batteries which are used to keep the CMOS memories active during ~ower outages.
These batteries are necessary to refresh the CMOS memory so that the data stored therein is rot destroyed during such power outages. If the battery detector senses any battery voltage as being below a predetermined amount, it causes a battery OK signal to be turned off as shown by BATT OK L
output line 127.
Furthermore, in FIGURE 7E a switch 128 is used to switch between power supply voltage VCC and battery voltage line 129 when the power supply voltage is below a normal operating level.
The overall result of the present memory is a memory having the capability of storing a 24-bit word in a 16-bit word memory space by using two memory cycles for storing the 24-bit word in two memory addresses, the two addresses associated to each other by a constant shift. The r~ading of information is also performed on a two memory cycle basis so that a 16-bit memory can output a 24-bit word to the central processing unit. There is also the capability of generating a 24-bit output even though there are only 16 bits of data representing the particular memory location.

llS13Q6 -51- 122-0~7 The FIFO cache memory is able to retrieve data from the main memory and is able to present it to the central processing unit on a 250 nano-second cycle time equal to that of the main bus 30 rather than the normal 750 nano-second cycle time of the main memory. This enables the central processing unit to complete the processing of information represented by the user network and other functions performed therein at a faster rate. The FIFO register is advantageously employed because the user network control program is stored in sequential memory locations allowing the data to be read by the FIFO register and presentable to the CPU in an orderly fashion. That is, the storage of data within the main memory is in a particular order for that portion of memory representing the user network and therefore the solving of user network by the CPU can also be performed in an orderly fashion by reading sequential memory locations of the main memory via the FIFO cache memory 96.
I/O Processor The I/O processor 28 is shown in detail in FIGURES 6A-6F. This processor performs more than just input/output - processing but also communicates with the central processing unit by the scratchpad RAM 76 (FIGURE 6E) and the PROM
executive 130 (FIGURE 6E) in which the minicode executive instructions are stored.
As shown in FIGURES 6D and 6E, the I/O processor can communicate on two RS 232C serial ports 1 and 2 by means of a peripheral logic port 1 module 132 and peripheral logic port 2 module 13~.
The I/O processor is also able to communicate via the Gould-~odicon Series 200 I/O protocol. In this protocol, a channel of I/O consists of up to 8 input modules and up to 8 output modules with a par-ticular message format. In essence, it is a serial data s-tream accompanied with a clock. One of the basic signals is data. The data signal is clocked so that the data is strobed on a particular edge of the clock.

115~3~6 There are 23 bits of information; the first seven are control information or header information. This header includes two bits for a sync pattern for informing the processor of an incoming message. Another bit specifies to the channel whether it is communicating with an input module or an output module. Another bit specifies the first communication to the module or the second communication to the module.
These communications are used in an error checking scheme.
In addition, three other bits of header are used to specify one of the eight input modules or eight output modules to be communicated with.
The remaining sixteen bits of the 23-bit message contain the actual data. This ~eries 200 I/O data is transferred to and from the peripheral logic port 1 module 132 and the peripheral logic port 2 module 134.
Referring now to FIGURE 6A, a clock timing logic module 136 receives two timing input signals (D0304H, and D0401H) which are 50% duty cycle signals having a 90 phase difference and a period of 250 nanoseconds each. Thus a clock edge occurs every 62.5 nanoseconds. The clock timing logic module develops any clock signal that is necessary from these four clock edges. A free-running clock output 137 and a controlled clock output 138 are generated. These clock signals can be cut off by the single-step input 139 which is a signal that can be activated by some devices external to the programmable controller in order to single-step the controller through its microcode routines. This single-step information can be used by the programmable controller user who must know the clock timing logic in order to insure that certain operations are not performed until after the end of a cycle. For instance, a scratchpad read and increment instruction should not be incremented at the beginning of a cycle. Thus, there is a distinction between -the freerunning clock and the control clock for such situations.
Also shown in FIGURE 6A is an address decoding control logic module 140 which receives address information from the il513~!~

address portion of bus 30. This address information is coded in terms of a memory mapping to control various blocks and interfaces of the I/O processor. Such controls are those directed to the Series 200 I/O read and write controls including the RS 232 port 1 read and write controls, the RS
232 port 2 read and write controls, and the ASCII read and write controls as shown in FIGURE 6F. The address space with respect to the I/O processor comprises a full page of information representing 32,000 locations. In the programmable controller, there are up to sixteen pages in the complete system. The upper half of page F is devoted strictly to the PROM executive 130 directed to the minicode executive. The lower half of the page has 15,000 addresses devoted to the scratchpad RAM 76 which need not be fully populated depending upon the system configuration. In addition, there is also another 1,000 location addresses forming part of the 32,000 address of page F which is devoted to special I/O processor functions.
A 5-bit memory control bus 142 comprising part of system bus 30 communicates with instruction decode PROM ' s 144 so as to generate up to 32 instructions which can be decoded as microcode instructions. The output of the instruction decode PROM' s thus are logic controls and information, some of which is transferred to the addressed decoding control logic module 140 for controlling the I/O's, the read and write of port 1 and port 2 peripheral logic modules, and the ASCII read and write.
A data bus 146 comprising part of the system bus 30 is used in conjunction with an internal data bus 78 (FIGURE 6D) for the transfer of data to and from the I/O processor and the CPU as well as internally within the I/O processor. The internal data bus 78 is utilized to minimize the number of lines needed in the data bus 30 for the transEer of data.
Latches 148 and 149 are used to interconnect the data bus 1~5~;~Q6 146 of the system bus 30 with the internal data bus 7~.
Latch 148 is used where a write operation is to be performed from the programmable controller to the internal data bus and lat^h 149 is for transferral of data from the internal data bus to the data bus and thus the CPU.
Also connected to the internal data bus 78 are latches 150 and 151 (FIGURE 6D) which are for the transfer of data to and from the internal data bus and the ASCII data con-centrator. The ~SCII data concentrator is a general purpose parallel port which eight bits in width. This da-ta con-centrator can be used with devices which are both intelligent or non-intelligent and for general communication in a parallel data bus which is bi-directional. The internal data bus also communicates information from the PROM executive 130 and to and from the scratchpad RAM 76.
It should be noted that the peripheral port logic modules 15Z and 154 also allow the programmable controller to communicate with other programmable controllers through a system communications protocol in addition to the RS 232C
protocol. In this manner, the programmable controllers can be linked together in a system with a master and several slave programmable controllers as well as other peripheral devices for communication to and from ex-ternal devices.
This protocol for intercommunication between programmable controllers can utilize the ASCII mode of communication or the RTU (remote terminal unit) mode of protocol. In the ASCII mode of communication, the beginning of a new message is indicated with a colon character. The peripheral port logic module is able to decode the colon character but does not give an interrupt to the central processing unit until the first actual data character is received at which time the CPU is interrupted. In this way, the CPU is not burdened with the extra overhead of recognizing the colon character.
In the remote terminal unit mode of operation, a new message is indica-ted by a gap of at leas-t three characters 1~513Q6 at the particular baud rate being eommunicated to and from the peripheral logie module. The first character after this gap is then considered to be a valid character which the CPU
ean read. Typically this would be address information.
Referring now to the scratchpad RP~I 76 shown in FIGURE
6E, a number of speeialized functions are performed by this memory. The address presented to the seratchpad RAM eomes from the RAM address counter 152 (FIGURE 6C). This eounter ean be loaded with an address from elther the address bus 143 of the system bus 30 or from one of two link registers, the "normal" link register 153 or the "swap" link register 154. These registers present addresses from the data bus 146 into the RAM address counter 152.
In addition, individual bits from the seratehpad RAM 76 can be individually accessed by the 16-1 multiplexer (MUX) 156 as shown in FIGURE 6E. The output of the 16-1 MUX is a single bit which is in turn transmitted to a latch 82 for representing coil power output on line 8~. This coil power is aetually the sta-tus information in terms of a partieular bit of information stored in the scratehpad RAM whieh relates back to an individual input or output of the programmable controller. It thus represents-the status of an external input such as a switch, motor or some other device, or a particular output to such a deviee.
Finally, the scratchpad RAM is used for a number of specialized functions involved in the overall optimization of the programmable controller system. It has special purpose instructions resident therein; for instanee, addresses can be incremented or addresses can come from other plaees such as the data bus for a particular specialized instruction.
In summary, the overall I/O processor 28 provides for both the communication with external devices and the rest of the programmable controller as well as being the residence area for specialized memories, the scratchpad RAM and executive PROM which are utilized by the central processing unit to complete -the overall operation of the programmable controller system.

llS13Q6 .

Thus what has been described is an improved programmable controller having the ability to uti]ize two different data bases. The programmable controller utilizes pipeline processing and hardware solution of the user control program.
A memory management scheme is provided for direct addressability of up to 1/2 million words by utilization of page registering as well as the utilization of an input/output processor for communication in both serial and parallel format. The overall programmable controller is able to achieve relay replacement of standard control programs while maintaining a rapid execution time for scanning the user control program.
It will thus be seen that the objects set forth above, among those made apparent from the preceding description, are efficiently attained and, since certain changes may be made in carrying out the above construction without departing from the scope of the invention, it is intended that all matter contained in the above description or shown in the accompanying drawings shall be interpreted as illustrative and not in a limiting sense.
It is also to be understood that the following claims are intended to cover all of the generic and specific features of the invention herein described, and all statements of the scope of the invention which, as a-matter of language, might be said to fall therebetween.
Having described the invention, what is claimed is:

Claims (9)

THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. An improved programmable controller of the type having a central processing unit (CPU), and addressable memory having more than 1.5 x N address-able memory locations, each memory location capable of storing P data bits, where P is an integer greater than one, an input/output (I/O) system, a bus interconnecting the CPU, memory and I/O, and wherein the programmable control-ler is able to store user logic defining a control program for execution by the programmable controller wherein the user logic may comprise up to N pos-sible nodes, where N is a positive integer, wherein the improvement comprises:
A) first means, interconnected to the bus and forming part of the mem-ory, for storing up to N data words representing the user nodes, each data word comprising up to 1.5 x P bits of data so that for each data word "i", where i = 1, . . ., N, up to P data bits are stored in memory location ";"
of the addressable memory, where j = base address (base addR)+ i-l, and so that the remaining data bits of the data word "i", if any, are stored in up to half the memory space of memory location "k" of the addressable memory, where k = (j/2) 1 "widget", where "widget" =((base addR)/2) + N, and where the re-mainder of j/2 determines which half of addressable memory location "k" to use to store the remaining data bits of data word "i", and B) second means, interconnected to the bus and forming part of the mem-ory, for reading the data words from the addressable memory so that for any data word "i" data is read from addressable memory location "j" and combined with the data bits corresponding to data word "i" stored in addressable memory location "k", wherein this means further increases the length of data word "i"
to equal 1.5 x P bits, when the data word "i" has less than 1.5 x P significant data bits, by further combining non-data significant bits to the data sig-nificant bits read from addressable memory locations "j" and "k" so as to equal 1.5 x P bits;

whereby all data words N are stored and packed in the addressable memory in the same manner regardless of the number of data bits in any given data word, and wherein these data words are stored in the addressable memory beginning at an address defined by the base address so that a flexible address boundary is realized between the addressable memory locations for non-user node storage and that utilized for user logic node storage.
2. An improved programmable controller as defined in claim 1, wherein the means for storing up to N data words in two different addressable memory locations "j" and "k" comprises a designated register for storing the widget value.
3. An improved programmable controller as defined in claim 1 or 2, wherein P equals 16 and wherein the data words comprise either 16 or 24 bits each, whereby the data format communicated with the outside world is 24 bits and whereby 16 bit and 24 bit data words are storable in the addressable memory.
4. An improved programmable controller as defined in claim 1, wherein the addressable memory further comprises a FIFO memory connected to the second means, wherein the output of the FIFO memory contains data words representing relay or non-relay elements, each element resident in a unique node of a network of nodes comprising the user logic, the nodes arranged in lines whose logical output is represented by the state of a coil, each relay type element conditioned by the state of a referenced coil, and wherein the bus transfers these data words from the FIFO memory to both the CPU and the I/O system, and wherein the CPU comprises means, interconnected to the bus for determining from the data word the contact type of each node representing a relay element, and wherein the I/O system comprises means interconnected to the bus for using the same data word to simultaneously determine the state of the coil referenced by the relay element in the data word; whereby a single data word represents different information to different portions of the programmable controller for their simultaneous execution.
5. An improved programmable controller as defined in claim 41 wherein the bus comprises a data bus portion and wherein the I/O system means for simultaneously determining the state of the referenced coil comprises a link register connected to the data bus portion of the bus for receipt of the data word from the FIFO memory, a random access memory (RAM) address counter connected to the output of the link register for determining the address of the referenced coil, a random access memory (RAM) connected to the output of the RAM address counter for storing the states of the coils, and means connected to the output of the RAM for transferring the referenced coil state to the CPU.
6. An improved programmable controller as defined in claim 5, wherein the CPU means for determining the contact type of each relay type element represented by a data word comprises a data in register connected to the bus for receipt of data words from the FIFO memory, an instruction register connected to the output of the data in register, a node map, a minicode programmable logic array, a source map, a destina-tion map, and a holding register each connected to the instruction register, a column status register connected to the holding register for representing the status of a user network column, a microcode address sequencer connected to the putput of the node map, minicode programmable logic array, source map and destination map, a microcode PROM connected to the output of the microcode address sequencer, and pipeline registers connected to the output of the micro-code PROM; whereby the simultaneous execution of both the CPU means for determining the contact type of each relay type element and the I/O system means for determining the state of the referenced coil are achieved using pipeline techniques.
7. An improved programmable controller as defined in Claim 6, wherein the CPU further comprises a logic solver communicating with the output of the CPU means for determin-ing the contact type of each relay type element and also communicating with the output of the I/O system means for determining the state of the referenced coil, the logic solver logically combining the information from the CPU
means and I/O processor means so as to determine the logical output of the node.
8. An improved programmable controller as defined in Claim 1, wherein the memory has memory management means interconnected to the bus for storing data in a multipage format, each page providing for the direct addressability of R addressable locations, where R is an integer equal to the number of binary permutations of a second integer S equal to the number of bits in a data word.
9. An improved programmable controller as defined in Claim 1, wherein the I/O system comprises third means for handling input/output tasks with interconnected devices as those tasks logically occur during the solving of the user logic.
CA000354337A 1979-06-19 1980-06-19 Programmable controller Expired CA1151306A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US049,895 1979-06-19
US06/049,895 US4307447A (en) 1979-06-19 1979-06-19 Programmable controller

Publications (1)

Publication Number Publication Date
CA1151306A true CA1151306A (en) 1983-08-02

Family

ID=21962309

Family Applications (1)

Application Number Title Priority Date Filing Date
CA000354337A Expired CA1151306A (en) 1979-06-19 1980-06-19 Programmable controller

Country Status (6)

Country Link
US (1) US4307447A (en)
EP (1) EP0022622B1 (en)
JP (1) JPS564804A (en)
AT (1) ATE25778T1 (en)
CA (1) CA1151306A (en)
DE (1) DE3071917D1 (en)

Families Citing this family (126)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4442504A (en) * 1981-03-09 1984-04-10 Allen-Bradley Company Modular programmable controller
US4575797A (en) * 1981-05-22 1986-03-11 Data General Corporation Digital data processing system incorporating object-based addressing and capable of executing instructions belonging to several instruction sets
US4499604A (en) * 1981-05-22 1985-02-12 Data General Corporation Digital data processing system for executing instructions containing operation codes belonging to a plurality of operation code sets and names corresponding to name table entries
US4514823A (en) * 1982-01-15 1985-04-30 International Business Machines Corporation Apparatus and method for extending a parallel channel to a serial I/O device
US4509113A (en) * 1982-02-02 1985-04-02 International Business Machines Corporation Peripheral interface adapter circuit for use in I/O controller card having multiple modes of operation
JPS59174948A (en) * 1983-03-25 1984-10-03 Toshiba Corp Information processing device
US4675813A (en) * 1985-01-03 1987-06-23 Northern Telecom Limited Program assignable I/O addresses for a computer
US4908746A (en) * 1986-10-15 1990-03-13 United States Data Corporation Industrial control system
US4811214A (en) * 1986-11-14 1989-03-07 Princeton University Multinode reconfigurable pipeline computer
JPS63245547A (en) * 1987-03-31 1988-10-12 Hitachi Ltd Data processor
US4833599A (en) * 1987-04-20 1989-05-23 Multiflow Computer, Inc. Hierarchical priority branch handling for parallel execution in a parallel processor
JPS63289607A (en) * 1987-05-21 1988-11-28 Toshiba Corp Inter-module communication control system for intelligent robot
IN170793B (en) * 1987-12-18 1992-05-23 Hitachi Ltd
US5023770A (en) * 1988-04-11 1991-06-11 Square D Company High-speed press control system
JPH04160438A (en) * 1990-10-23 1992-06-03 Mitsubishi Electric Corp Semiconductor device
US5225974A (en) * 1990-10-30 1993-07-06 Allen-Bradley Company, Inc. Programmable controller processor with an intelligent functional module interface
CA2071347A1 (en) * 1991-10-15 1993-04-16 Nader Amini Expandable high performance fifo design
US7095783B1 (en) 1992-06-30 2006-08-22 Discovision Associates Multistandard video decoder and decompression system for processing encoded bit streams including start codes and methods relating thereto
US6112017A (en) * 1992-06-30 2000-08-29 Discovision Associates Pipeline processing machine having a plurality of reconfigurable processing stages interconnected by a two-wire interface bus
US6047112A (en) * 1992-06-30 2000-04-04 Discovision Associates Technique for initiating processing of a data stream of encoded video information
DE69229338T2 (en) * 1992-06-30 1999-12-16 Discovision Ass Data pipeline system
US5828907A (en) 1992-06-30 1998-10-27 Discovision Associates Token-based adaptive video processing arrangement
US6263422B1 (en) 1992-06-30 2001-07-17 Discovision Associates Pipeline processing machine with interactive stages operable in response to tokens and system and methods relating thereto
US5768561A (en) * 1992-06-30 1998-06-16 Discovision Associates Tokens-based adaptive video processing arrangement
US5809270A (en) * 1992-06-30 1998-09-15 Discovision Associates Inverse quantizer
US6067417A (en) * 1992-06-30 2000-05-23 Discovision Associates Picture start token
US6079009A (en) * 1992-06-30 2000-06-20 Discovision Associates Coding standard token in a system compromising a plurality of pipeline stages
US5842033A (en) 1992-06-30 1998-11-24 Discovision Associates Padding apparatus for passing an arbitrary number of bits through a buffer in a pipeline system
US6330665B1 (en) 1992-06-30 2001-12-11 Discovision Associates Video parser
US5386823A (en) * 1992-07-01 1995-02-07 The United States Of America As Represented By The Secretary Of The Air Force Open loop cooling apparatus
US5805914A (en) * 1993-06-24 1998-09-08 Discovision Associates Data pipeline system and data encoding method
US5861894A (en) * 1993-06-24 1999-01-19 Discovision Associates Buffer manager
US5696917A (en) * 1994-06-03 1997-12-09 Intel Corporation Method and apparatus for performing burst read operations in an asynchronous nonvolatile memory
US5727170A (en) * 1994-12-29 1998-03-10 Siemens Energy & Automation, Inc. User defined port and protocol scheme for a programmable logic controller
US5933651A (en) * 1995-09-29 1999-08-03 Matsushita Electric Works, Ltd. Programmable controller
DE19728476A1 (en) * 1997-07-03 1999-01-07 Siemens Ag Programming device
JP3663846B2 (en) * 1997-08-26 2005-06-22 松下電工株式会社 Base board, power supply unit mounted on it, and CPU unit
US6934817B2 (en) 2000-03-31 2005-08-23 Intel Corporation Controlling access to multiple memory zones in an isolated execution environment
US7013481B1 (en) 2000-03-31 2006-03-14 Intel Corporation Attestation key memory device and bus
US7013484B1 (en) 2000-03-31 2006-03-14 Intel Corporation Managing a secure environment using a chipset in isolated execution mode
US6760441B1 (en) 2000-03-31 2004-07-06 Intel Corporation Generating a key hieararchy for use in an isolated execution environment
US7111176B1 (en) 2000-03-31 2006-09-19 Intel Corporation Generating isolated bus cycles for isolated execution
US7194634B2 (en) * 2000-03-31 2007-03-20 Intel Corporation Attestation key memory device and bus
US7082615B1 (en) 2000-03-31 2006-07-25 Intel Corporation Protecting software environment in isolated execution
US6996710B1 (en) 2000-03-31 2006-02-07 Intel Corporation Platform and method for issuing and certifying a hardware-protected attestation key
US7089418B1 (en) 2000-03-31 2006-08-08 Intel Corporation Managing accesses in a processor for isolated execution
US6754815B1 (en) 2000-03-31 2004-06-22 Intel Corporation Method and system for scrubbing an isolated area of memory after reset of a processor operating in isolated execution mode if a cleanup flag is set
US6990579B1 (en) 2000-03-31 2006-01-24 Intel Corporation Platform and method for remote attestation of a platform
US6769058B1 (en) 2000-03-31 2004-07-27 Intel Corporation Resetting a processor in an isolated execution environment
US6957332B1 (en) 2000-03-31 2005-10-18 Intel Corporation Managing a secure platform using a hierarchical executive architecture in isolated execution mode
US6976162B1 (en) 2000-06-28 2005-12-13 Intel Corporation Platform and method for establishing provable identities while maintaining privacy
US7389427B1 (en) 2000-09-28 2008-06-17 Intel Corporation Mechanism to secure computer output from software attack using isolated execution
US7793111B1 (en) 2000-09-28 2010-09-07 Intel Corporation Mechanism to handle events in a machine with isolated execution
US7215781B2 (en) * 2000-12-22 2007-05-08 Intel Corporation Creation and distribution of a secret value between two devices
US7035963B2 (en) 2000-12-27 2006-04-25 Intel Corporation Method for resolving address space conflicts between a virtual machine monitor and a guest operating system
US7818808B1 (en) 2000-12-27 2010-10-19 Intel Corporation Processor mode for limiting the operation of guest software running on a virtual machine supported by a virtual machine monitor
US7225441B2 (en) * 2000-12-27 2007-05-29 Intel Corporation Mechanism for providing power management through virtualization
US6907600B2 (en) 2000-12-27 2005-06-14 Intel Corporation Virtual translation lookaside buffer
US7117376B2 (en) * 2000-12-28 2006-10-03 Intel Corporation Platform and method of creating a secure boot that enforces proper user authentication and enforces hardware configurations
US20020144121A1 (en) * 2001-03-30 2002-10-03 Ellison Carl M. Checking file integrity using signature generated in isolated execution
US7096497B2 (en) * 2001-03-30 2006-08-22 Intel Corporation File checking using remote signing authority via a network
US7272831B2 (en) * 2001-03-30 2007-09-18 Intel Corporation Method and apparatus for constructing host processor soft devices independent of the host processor operating system
US7191440B2 (en) * 2001-08-15 2007-03-13 Intel Corporation Tracking operating system process and thread execution and virtual machine execution in hardware or in a virtual machine monitor
US7103771B2 (en) * 2001-12-17 2006-09-05 Intel Corporation Connecting a virtual token to a physical token
US20030126454A1 (en) * 2001-12-28 2003-07-03 Glew Andrew F. Authenticated code method and apparatus
US7308576B2 (en) * 2001-12-31 2007-12-11 Intel Corporation Authenticated code module
US20030126453A1 (en) * 2001-12-31 2003-07-03 Glew Andrew F. Processor supporting execution of an authenticated code instruction
US7480806B2 (en) * 2002-02-22 2009-01-20 Intel Corporation Multi-token seal and unseal
US7124273B2 (en) * 2002-02-25 2006-10-17 Intel Corporation Method and apparatus for translating guest physical addresses in a virtual machine environment
US7631196B2 (en) 2002-02-25 2009-12-08 Intel Corporation Method and apparatus for loading a trustable operating system
US7028149B2 (en) * 2002-03-29 2006-04-11 Intel Corporation System and method for resetting a platform configuration register
US7069442B2 (en) 2002-03-29 2006-06-27 Intel Corporation System and method for execution of a secured environment initialization instruction
US20030191943A1 (en) * 2002-04-05 2003-10-09 Poisner David I. Methods and arrangements to register code
US20030196096A1 (en) * 2002-04-12 2003-10-16 Sutton James A. Microcode patch authentication
US20030196100A1 (en) * 2002-04-15 2003-10-16 Grawrock David W. Protection against memory attacks following reset
US7076669B2 (en) * 2002-04-15 2006-07-11 Intel Corporation Method and apparatus for communicating securely with a token
US7058807B2 (en) * 2002-04-15 2006-06-06 Intel Corporation Validation of inclusion of a platform within a data center
US7127548B2 (en) * 2002-04-16 2006-10-24 Intel Corporation Control register access virtualization performance improvement in the virtual-machine architecture
US7139890B2 (en) * 2002-04-30 2006-11-21 Intel Corporation Methods and arrangements to interface memory
US20030229794A1 (en) * 2002-06-07 2003-12-11 Sutton James A. System and method for protection against untrusted system management code by redirecting a system management interrupt and creating a virtual machine container
US6820177B2 (en) * 2002-06-12 2004-11-16 Intel Corporation Protected configuration space in a protected environment
US7142674B2 (en) 2002-06-18 2006-11-28 Intel Corporation Method of confirming a secure key exchange
US7392415B2 (en) * 2002-06-26 2008-06-24 Intel Corporation Sleep protection
US20040003321A1 (en) * 2002-06-27 2004-01-01 Glew Andrew F. Initialization of protected system
US7124327B2 (en) * 2002-06-29 2006-10-17 Intel Corporation Control over faults occurring during the operation of guest software in the virtual-machine architecture
US6996748B2 (en) * 2002-06-29 2006-02-07 Intel Corporation Handling faults associated with operation of guest software in the virtual-machine architecture
US7296267B2 (en) * 2002-07-12 2007-11-13 Intel Corporation System and method for binding virtual machines to hardware contexts
US7165181B2 (en) 2002-11-27 2007-01-16 Intel Corporation System and method for establishing trust without revealing identity
US7073042B2 (en) 2002-12-12 2006-07-04 Intel Corporation Reclaiming existing fields in address translation data structures to extend control over memory accesses
US7318235B2 (en) 2002-12-16 2008-01-08 Intel Corporation Attestation using both fixed token and portable token
US20040117318A1 (en) * 2002-12-16 2004-06-17 Grawrock David W. Portable token controlling trusted environment launch
US7900017B2 (en) * 2002-12-27 2011-03-01 Intel Corporation Mechanism for remapping post virtual machine memory pages
US20040128465A1 (en) * 2002-12-30 2004-07-01 Lee Micheil J. Configurable memory bus width
US7076802B2 (en) * 2002-12-31 2006-07-11 Intel Corporation Trusted system clock
US20040128528A1 (en) * 2002-12-31 2004-07-01 Poisner David I. Trusted real time clock
US7415708B2 (en) 2003-06-26 2008-08-19 Intel Corporation Virtual machine management using processor state information
US7424709B2 (en) * 2003-09-15 2008-09-09 Intel Corporation Use of multiple virtual machine monitors to handle privileged events
US7287197B2 (en) * 2003-09-15 2007-10-23 Intel Corporation Vectoring an interrupt or exception upon resuming operation of a virtual machine
US7739521B2 (en) 2003-09-18 2010-06-15 Intel Corporation Method of obscuring cryptographic computations
US7610611B2 (en) 2003-09-19 2009-10-27 Moran Douglas R Prioritized address decoder
US7237051B2 (en) * 2003-09-30 2007-06-26 Intel Corporation Mechanism to control hardware interrupt acknowledgement in a virtual machine system
US20050080934A1 (en) 2003-09-30 2005-04-14 Cota-Robles Erik C. Invalidating translation lookaside buffer entries in a virtual machine (VM) system
US7177967B2 (en) 2003-09-30 2007-02-13 Intel Corporation Chipset support for managing hardware interrupts in a virtual machine system
US7366305B2 (en) * 2003-09-30 2008-04-29 Intel Corporation Platform and method for establishing trust without revealing identity
US7636844B2 (en) 2003-11-17 2009-12-22 Intel Corporation Method and system to provide a trusted channel within a computer system for a SIM device
US8156343B2 (en) 2003-11-26 2012-04-10 Intel Corporation Accessing private data about the state of a data processing machine from storage that is publicly accessible
US20050133582A1 (en) * 2003-12-22 2005-06-23 Bajikar Sundeep M. Method and apparatus for providing a trusted time stamp in an open platform
US8037314B2 (en) 2003-12-22 2011-10-11 Intel Corporation Replacing blinded authentication authority
US7802085B2 (en) 2004-02-18 2010-09-21 Intel Corporation Apparatus and method for distributing private keys to an entity with minimal secret, unique information
US7356735B2 (en) 2004-03-30 2008-04-08 Intel Corporation Providing support for single stepping a virtual machine in a virtual machine environment
US7620949B2 (en) 2004-03-31 2009-11-17 Intel Corporation Method and apparatus for facilitating recognition of an open event window during operation of guest software in a virtual machine environment
US7360130B2 (en) * 2004-05-24 2008-04-15 Jed Margolin Memory with integrated programmable controller
US7490070B2 (en) 2004-06-10 2009-02-10 Intel Corporation Apparatus and method for proving the denial of a direct proof signature
US7305592B2 (en) 2004-06-30 2007-12-04 Intel Corporation Support for nested fault in a virtual machine environment
US7840962B2 (en) 2004-09-30 2010-11-23 Intel Corporation System and method for controlling switching between VMM and VM using enabling value of VMM timer indicator and VMM timer value having a specified time
US8146078B2 (en) 2004-10-29 2012-03-27 Intel Corporation Timer offsetting mechanism in a virtual machine environment
US8924728B2 (en) 2004-11-30 2014-12-30 Intel Corporation Apparatus and method for establishing a secure session with a device without exposing privacy-sensitive information
US8533777B2 (en) * 2004-12-29 2013-09-10 Intel Corporation Mechanism to determine trust of out-of-band management agents
US7395405B2 (en) 2005-01-28 2008-07-01 Intel Corporation Method and apparatus for supporting address translation in a virtual machine environment
US8189599B2 (en) 2005-08-23 2012-05-29 Rpx Corporation Omni-protocol engine for reconfigurable bit-stream processing in high-speed networks
ES2340954T3 (en) * 2005-08-23 2010-06-11 Slt Logic Llc MULTI-PROTOCOL ENGINE FOR RECONFIGURABLE BITS CURRENT PROCESSING IN HIGH SPEED NETWORKS.
US7782873B2 (en) * 2005-08-23 2010-08-24 Slt Logic, Llc Omni-protocol engine for reconfigurable bit-stream processing in high-speed networks
US7809957B2 (en) 2005-09-29 2010-10-05 Intel Corporation Trusted platform module for generating sealed data
US8014530B2 (en) 2006-03-22 2011-09-06 Intel Corporation Method and apparatus for authenticated, recoverable key distribution with no database secrets
US8108056B2 (en) * 2007-11-13 2012-01-31 Rockwell Automation Technologies, Inc. Industrial controller using shared memory multicore architecture
KR102036514B1 (en) * 2015-07-13 2019-10-28 엘에스산전 주식회사 Data access apparatus using memory device

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1077028A (en) 1965-08-23 1967-07-26 Vyzk Ustav Matemat Stroju Addressing system for computer memories
GB1443777A (en) * 1973-07-19 1976-07-28 Int Computers Ltd Data processing apparatus
FR2253430A5 (en) * 1973-11-30 1975-06-27 Honeywell Bull Soc Ind
US3898626A (en) * 1974-03-13 1975-08-05 Control Data Corp Data processing apparatus
US3965459A (en) * 1974-04-01 1976-06-22 Rockwell International Selectable eight or twelve digit integrated circuit calculator and conditional gate output signal modification circuit therefor
US3930233A (en) * 1974-04-11 1975-12-30 Richard E Morley Data transfer and manipulation apparatus for industrial computer controllers
US3944984A (en) * 1974-04-23 1976-03-16 Modicon Corporation Computer controller system with a reprogrammable read only memory
CA1059639A (en) * 1975-03-26 1979-07-31 Garvin W. Patterson Instruction look ahead having prefetch concurrency and pipe line features
DE2517565C3 (en) * 1975-04-21 1978-10-26 Siemens Ag, 1000 Berlin Und 8000 Muenchen Circuit arrangement for a data processing system
CH584488A5 (en) * 1975-05-05 1977-01-31 Ibm
GB1506972A (en) * 1976-02-06 1978-04-12 Int Computers Ltd Data processing systems
US4078259A (en) * 1976-09-29 1978-03-07 Gulf & Western Industries, Inc. Programmable controller having a system for monitoring the logic conditions at external locations
US4104720A (en) * 1976-11-29 1978-08-01 Data General Corporation CPU/Parallel processor interface with microcode extension
US4089052A (en) * 1976-12-13 1978-05-09 Data General Corporation Data processing system
US4103329A (en) * 1976-12-28 1978-07-25 International Business Machines Corporation Data processing system with improved bit field handling
US4195340A (en) * 1977-12-22 1980-03-25 Honeywell Information Systems Inc. First in first out activity queue for a cache store
US4190885A (en) * 1977-12-22 1980-02-26 Honeywell Information Systems Inc. Out of store indicator for a cache store in test mode
US4195341A (en) * 1977-12-22 1980-03-25 Honeywell Information Systems Inc. Initialization of cache store to assure valid data
US4195342A (en) * 1977-12-22 1980-03-25 Honeywell Information Systems Inc. Multi-configurable cache store system
US4195343A (en) * 1977-12-22 1980-03-25 Honeywell Information Systems Inc. Round robin replacement for a cache store
US4197580A (en) * 1978-06-08 1980-04-08 Bell Telephone Laboratories, Incorporated Data processing system including a cache memory

Also Published As

Publication number Publication date
ATE25778T1 (en) 1987-03-15
JPS564804A (en) 1981-01-19
EP0022622A1 (en) 1981-01-21
US4307447A (en) 1981-12-22
EP0022622B1 (en) 1987-03-04
DE3071917D1 (en) 1987-04-09

Similar Documents

Publication Publication Date Title
CA1151306A (en) Programmable controller
US4484303A (en) Programmable controller
JP3982716B2 (en) Programmable controller using ladder diagram macro instructions
US4302820A (en) Dual language programmable controller
US4638452A (en) Programmable controller with dynamically altered programmable real time interrupt interval
US4488258A (en) Programmable controller with control program comments
EP0169565B1 (en) Microprocessor compatible with any software represented by different types of instruction formats
US4742443A (en) Programmable controller with function chart interpreter
US4442504A (en) Modular programmable controller
US3962685A (en) Data processing system having pyramidal hierarchy control flow
US3739352A (en) Variable word width processor control
US3839705A (en) Data processor including microprogram control means
US3930236A (en) Small micro program data processing system employing multi-syllable micro instructions
CA1139002A (en) Microprogrammed programmable controller
EP0217922B1 (en) An array for simulating computer functions for large computer systems
US4005391A (en) Peripheral interrupt priority resolution in a micro program data processor having plural levels of subinstruction sets
JPS5975347A (en) Simulation device of logical circuit
KR920005227B1 (en) Programmable controller
US4153942A (en) Industrial control processor
EP0381600A2 (en) Robotic workcell control system with a binary accelerator providing enhanced binary calculations
JP2826309B2 (en) Information processing device
Nketsa et al. A Petri net based single chip programmable controller for distributed local controls
Bolton Microprocessor Systems
JPS6041102A (en) Sequence control device
JPS5866112A (en) Computer system

Legal Events

Date Code Title Description
MKEX Expiry