GB1188436A - Improvements in and relating to Digital Computers - Google Patents

Improvements in and relating to Digital Computers

Info

Publication number
GB1188436A
GB1188436A GB4474068A GB4474068A GB1188436A GB 1188436 A GB1188436 A GB 1188436A GB 4474068 A GB4474068 A GB 4474068A GB 4474068 A GB4474068 A GB 4474068A GB 1188436 A GB1188436 A GB 1188436A
Authority
GB
United Kingdom
Prior art keywords
descriptor
mother
field
address
memory
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
GB4474068A
Inventor
Carl Bernard Carlson
William Marshall Mckeeman
William Chandler Price
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.)
Unisys Corp
Original Assignee
Burroughs Corp
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 Burroughs Corp filed Critical Burroughs Corp
Publication of GB1188436A publication Critical patent/GB1188436A/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/355Indexed addressing
    • 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/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/10Address translation

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Executing Machine-Instructions (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

1,188,436. Addressing data stores; computers. BURROUGHS CORP. 20 Sept., 1968 [25 Sept., 1967], No. 44740/68. Headings G4A and G4C. Address manipulation circuitry for a digital computer comprises a computer memory, a peripheral memory, and a source of copy descriptors and mother descriptors referencing information stored in groups of memory cells forming arrays in the computer memory, each mother descriptor including fields designating respectively: (1) the base address of an array in the computer memory or the array address in the peripheral memory, (2) length of array, (3) nature of field (1), each copy descriptor including fields designating respectively: (1) the base address of an array or the location of the mother descriptor of the array in the source, (2) the index value of a cell in the array relative to the base address, (3) nature of field (1), there being means responsive to an instruction to access a cell of the computer memory to address this memory with the sum of fields (1) and (2) of an appropriate copy descriptor if field (3) of this descriptor designates field (1) as containing a base address. General.-The computer memory includes a last-in-first-out stack to hold the descriptors (see above) but the locations of the stack are also addressable randomly by a memory address register also used for addressing the rest of the computer memory. The peripheral (back-up) memory may be a disc file or magnetic tape. Besides the fields mentioned above, each descriptor includes a field (4) specifying the descriptor as mother or copy. During operation, fields (3) and (4) are consulted and updated as appropriate. In the course of generation of the descriptors, a mother descriptor is generated for information in an array the first time it is referenced and a copy descriptor on each subsequent reference, so all the copy descriptors related to a given mother descriptor lie above it in the stack. Accessing a cell of computer memory.-A computer-memory-access instruction causes the top descriptor in the stack to be obtained. If it is a copy descriptor with a base address in field (1), fields (1) and (2) are added and used to address the computer memory. If it is a copy descriptor with a mother descriptor address in field (1), this address is used to access this mother descriptor from the stack. If the mother descriptor has a peripheral address in field (1), the computer programme is interrupted and fields (1) and (2) of the mother descriptor are used to obtain the array from peripheral memory, this array being stored in an unused portion of computer memory and its new base address being substituted for the peripheral address in field (1) of the mother descriptor. Thus if the mother descriptor did not initially have a base address in field (1) it has now, and in either case the base address is transferred to field (1) of the copy descriptor and added to field (2) of the copy descriptor to address the computer memory. If, alternatively, the original descriptor is a mother descriptor it is treated like the mother descriptor referred to above up to the point where it contains a base address in field (1), when an index value is inserted in field (2) and the sum of these fields is used to address the computer memory. As a modification, field (2) of either type of descriptor could contain an index value or an array length, a further field of the descriptor indicating which and causing replacement of a length by an index value from the stack before addition. Updating descriptors (see above also).-When an array has to be returned from peripheral to computer memory as described above, but there is no room, an array has to be transferred to the peripheral memory to make room. The computer memory is addressed to obtain (from the stack) the mother descriptor relating to the array to be sent to peripheral memory and field (1) of each descriptor above this mother descriptor in the stack is compared with field (1) of the mother descriptor, being replaced with the address in memory of the mother descriptor if equal. Finally, the peripheral address of the array is inserted into field (1) of the mother descriptor. All the descriptors are returned to their locations in the stack after use. Reference is made to Specification 1,188,435.
GB4474068A 1967-09-25 1968-09-20 Improvements in and relating to Digital Computers Expired GB1188436A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US67030467A 1967-09-25 1967-09-25

Publications (1)

Publication Number Publication Date
GB1188436A true GB1188436A (en) 1970-04-15

Family

ID=24689867

Family Applications (1)

Application Number Title Priority Date Filing Date
GB4474068A Expired GB1188436A (en) 1967-09-25 1968-09-20 Improvements in and relating to Digital Computers

Country Status (5)

Country Link
BE (1) BE721403A (en)
CA (1) CA920277A (en)
DE (1) DE1774866C3 (en)
FR (1) FR1604610A (en)
GB (1) GB1188436A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1985004031A1 (en) * 1984-03-02 1985-09-12 Goran Anders Hendrik Hemdal Virtual address to real address conversion

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1985004031A1 (en) * 1984-03-02 1985-09-12 Goran Anders Hendrik Hemdal Virtual address to real address conversion
AU569615B2 (en) * 1984-03-02 1988-02-11 Hemdal, G.A.H. Improvements in or relating to computers
US4922415A (en) * 1984-03-02 1990-05-01 Hemdal Goran A H Data processing system for converting virtual to real addresses without requiring instruction from the central processing unit

Also Published As

Publication number Publication date
BE721403A (en) 1969-03-03
FR1604610A (en) 1972-01-03
DE1774866C3 (en) 1979-04-05
DE1774866B2 (en) 1978-08-03
DE1774866A1 (en) 1971-04-29
CA920277A (en) 1973-01-30

Similar Documents

Publication Publication Date Title
GB919964A (en) Improvements in memory systems for data processing devices
GB1329721A (en) Data processing devices
GB1188435A (en) Improvements in and relating to Digital Computers
GB1488980A (en) Memory and buffer arrangement for digital computers
GB1233117A (en)
GB1532798A (en) Computer memory systems
GB1233926A (en)
JP2008152802A (en) Method of storing file data on disk
GB1124017A (en) Data storage apparatus
GB1328268A (en) Address manipulation circuitry for a digital computer
GB1263743A (en) Storage control apparatus for a multiprogrammed data processing system
JPS5622172A (en) Retrieving device for picture information
GB1188436A (en) Improvements in and relating to Digital Computers
GB1498116A (en) Data processing systems
GB1314140A (en) Storage control unit
KR900002189A (en) Method and apparatus for improving data reliability in computer system
ES358538A1 (en) Address examination mechanism for use in a system operating with dynamic storage relocation
GB1012117A (en) Improvements in or relating to data storage systems
SU737952A1 (en) Buffer storage control device
JP3157673B2 (en) Virtual storage system
JPS5987567A (en) Variable length data storage controlling system
JPS6265146A (en) Dump system for information processing system
JPS558628A (en) Data processing system
CN117290390A (en) Method for memory mapping on big data retrieval based on special index
KR880000995B1 (en) An improved memory unit

Legal Events

Date Code Title Description
PS Patent sealed
732 Registration of transactions, instruments or events in the register (sect. 32/1977)
PCNP Patent ceased through non-payment of renewal fee