GB1172103A - Improvements relating to Data Processing Systems - Google Patents

Improvements relating to Data Processing Systems

Info

Publication number
GB1172103A
GB1172103A GB2483067A GB2483067A GB1172103A GB 1172103 A GB1172103 A GB 1172103A GB 2483067 A GB2483067 A GB 2483067A GB 2483067 A GB2483067 A GB 2483067A GB 1172103 A GB1172103 A GB 1172103A
Authority
GB
United Kingdom
Prior art keywords
address
word
register
instruction
bit
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
GB2483067A
Inventor
David Maudsley England
David Paculabo
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.)
Plessey Co Ltd
Original Assignee
Plessey Co Ltd
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 Plessey Co Ltd filed Critical Plessey Co Ltd
Priority to GB2483067A priority Critical patent/GB1172103A/en
Publication of GB1172103A publication Critical patent/GB1172103A/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/34Addressing or accessing the instruction operand or the result ; Formation of operand address; Addressing modes
    • G06F9/342Extension of operand address space
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/06Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
    • G06F12/0615Address space extension
    • G06F12/0623Address space extension for memory modules

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Executing Machine-Instructions (AREA)

Abstract

1,172,103. Data processing systems; data storage. PLESSEY CO. Ltd. 24 May, 1968 [30 May, 1967], No. 24830/67. Headings G4A and G4C. A data processing system comprises a main store holding the information for each programme in two discrete parts, viz. the data words and the instruction words respectively, each part being stored separately using sequentially numbered pages (multi-word storage sections), there being three registers holding codes respectively indicative of: (a) the first page (base page) holding date words of the operative programme (relocation register); (b) the page in which the data word currently being processed is stored (page register); (c) the address of the instruction word currently controlling the system (sequence control register). As described there are 256 pages, each of 256 words. Obtaining operand addresses.-If an " indirect address " tag in the current instruction word is O, an 8-bit address field of the instruction is concatenated (as the low order portion) with the contents of the 8-bit page register to form the operand (data word) address, except that if a " modifier " tag in the instruction is 1 the contents of a 16-bit modifier register are added. If the " indirect address " tag is 1, the same occurs except that the 8-bit relocation register is used instead of the page register and the resulting address is used to obtain an indirect address word from the store (base page). If a " common data " tag in this address word is 1, a 13-bit address portion of the word is used (with or without modification as before under control of a " modifier " tag in the word) to access data common to a plurality of programmes. Otherwise if an " indirect address " tag of the indirect address word is O, the address portion is used as the operand address (with or without "modification " as before) whereas if this tag is 1, the address portion and the contents of the relocation register are added to obtain (with or without " modification " as before) the address of another indirect address word, and so on. The page register is updated as appropriate. A guard register restricts addressing to the area allocated to the operative programme except in a " common data access. Obtaining the next instruction.-Normally the 16-bit sequence control register is merely incremented by one. However, a single length jump instruction contains a 7-bit address portion which is added to or subtracted from the sequence control register according to a sign bit in the instruction. A " modifier " tag in the instruction, if 1, causes the contents of the modifier register to be added in as well. A double length jump instruction (i.e. consisting of two consecutive words) has a 13-bit address portion in the second word which can be used and modified like the address portion of the single length jump instruction under control of tags and a sign bit, or can be added with the contents of the relocation register to form (with or without modification by the contents of the modifier register as before) the address of an indirect address word which either contains an address to be added to or subtracted from the contents of the sequence control register as before or the address of another indirect address word and so on (with or without modification in either case). Another double length jump instruction, used for returning from a subroutine, holds the absolute address of the instruction to be returned to in the 16 bits of the second word. This absolute address is simply overwritten into the sequence control register. There may be a list of such absolute return addresses in which case the contents of the sequence control register and modifierregister are added to obtain the address of the appropriate word in the list. Other features.-The main store may be a core store periodically loaded from a back-up magnetic tape or drum store. Two-address instruction words may be used, instead of oneaddress words as above.
GB2483067A 1967-05-30 1967-05-30 Improvements relating to Data Processing Systems Expired GB1172103A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB2483067A GB1172103A (en) 1967-05-30 1967-05-30 Improvements relating to Data Processing Systems

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB2483067A GB1172103A (en) 1967-05-30 1967-05-30 Improvements relating to Data Processing Systems

Publications (1)

Publication Number Publication Date
GB1172103A true GB1172103A (en) 1969-11-26

Family

ID=10217896

Family Applications (1)

Application Number Title Priority Date Filing Date
GB2483067A Expired GB1172103A (en) 1967-05-30 1967-05-30 Improvements relating to Data Processing Systems

Country Status (1)

Country Link
GB (1) GB1172103A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117875264A (en) * 2024-03-13 2024-04-12 江苏中威科技软件系统有限公司 Dynamic marking method for DLF file

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117875264A (en) * 2024-03-13 2024-04-12 江苏中威科技软件系统有限公司 Dynamic marking method for DLF file
CN117875264B (en) * 2024-03-13 2024-05-24 江苏中威科技软件系统有限公司 Dynamic marking method for DLF file

Similar Documents

Publication Publication Date Title
US4339804A (en) Memory system wherein individual bits may be updated
GB1494505A (en) Data processing system
US3761883A (en) Storage protect key array for a multiprocessing system
GB1245601A (en) Data storage apparatus
US4298932A (en) Serial storage subsystem for a data processor
GB1353925A (en) Data processing system
US5060137A (en) Explicit instructions for control of translation lookaside buffers
CA2022529C (en) Apparatus for page tagging in a computer system
DK409080A (en) DATA PROCESSING SYSTEM WITH STOCK PROTECTION SYSTEM
GB1247974A (en) Storage protection system
GB1329721A (en) Data processing devices
GB1242437A (en) Data processing system
KR870004366A (en) Data processing systems
GB1493817A (en) Information processor with immediate and indirect addressing
GB1026897A (en) Digital data storage systems
GB1470104A (en) Stored programme electronic computer
GB1150236A (en) Improvements in Data Processing Systems.
GB1282449A (en) Access control for plural magnetic memories
GB1280772A (en) Memory system
US5390311A (en) Method and apparatus for accessing microcoded instructions in a computer system
GB1172103A (en) Improvements relating to Data Processing Systems
KR19990013576A (en) Forced Page Zero Paging Method of Microcontroller Using Data Random Access Memory
GB1072629A (en) Improvements in or relating to memory systems
US4456976A (en) Associative memory system
GB2238145A (en) Current window cache in a data processor

Legal Events

Date Code Title Description
PS Patent sealed
PE20 Patent expired after termination of 20 years