中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

988 records (took 0.023 seconds)

    256.
    发明专利
    未知

    公开(公告)号：DE2423194A1

    公开(公告)日：1974-12-05

    申请号：DE2423194

    申请日：1974-05-14

    Applicant: CII HONEYWELL BULL

    Inventor： BIENVENU JACQUES MICHEL JEAN

    IPC: G06F12/10 ,  G06F12/1036 ,  G06F9/06

    Abstract: A data processing system includes apparatus for addressing operands within a segment utilizing segment descriptors. The apparatus is responsive to instruction words executed by a first of a plurality of processes. An exemplary embodiment includes a first component which stores a segment table containing a plurality of segment descriptors, a plurality of second components, each selectively coupled to the first components and responsive to a selected one of the instruction words, identify the segment table and the location within the segment table and store an offset address within the segment identified by the segment descriptor, a third component is responsive to an address syllable element of an instruction being executed for addressing one of the plurality of second components, a fourth component stores a displacement D from the address syllable, a fifth component is coupled to the second and fourth components for adding the displacement D to the offset whereby an SRA is developed (a segment relative address), a sixth component stores an index for addressing the next sequential word following the currently addressed word and adds the index to the displacement D and to the offset, a seventh component generates an absolute address of an operand contained within the segment and is coupled to the first and fifth components for adding the segment relative address SRA to the base address of the segment descriptor associated with the segment, and an eighth component is coupled to the sixth component for incrementing the absolute address location of the operand to the next word following the currently addressed word.

    IMPROVEMENTS IN OR RELATING TO RELATING TO DATA HANDLING ARRANGEMENTS
    258.
    发明专利
    IMPROVEMENTS IN OR RELATING TO RELATING TO DATA HANDLING ARRANGEMENTS 未知

    公开(公告)号：GB1208276A

    公开(公告)日：1970-10-14

    申请号：GB3713267

    申请日：1967-05-03

    Applicant: INT COMPUTERS LTD

    Inventor： MELLIA-SMITH PETER MICHAEL

    IPC: G06F12/10 ,  G06F12/1036

    Abstract: 1,208,276. Data storage; computers. INTERNATIONAL COMPUTERS Ltd. 2 May, 1968 [3 May, 1967; 12 Aug., 1967], Nos. 20417/87 and 37132/67. Headings G4A and G4C. A data-handling arrangement, for accessing a data store including words arranged in pages arranged in segments, operates in accordance with whether page and segment portions of an address satisfy a predetermined requirement. In a multiprogrammed computer, a data store contains 64-word pages in 64-page segments which are in 64-segment zones. Besides data, the store contains a zone table pointer word, a one-page zone table, a 64-page segment table and a 4096-page page table. A data word can be accessed using a virtual address with zone segment, page and word portions by concatenating the zone table pointer word with the zone portion to address a word in the zone table, this word being concatenated with the segment portion to address a word in the segment table, this word being concateanated with the page portion to address a word in the page table, this word being concatenated with the word portion to address the required data word. However, the use made of the pointer word and the various tables is reduced using an associative store holding virtual address parts of the three forms: (1) zone, segment, page (2) ones, zone, segment (3) ones, ones, zone each form being accompanied by the corresponding table entry. The virtual address of the desired data word is inserted into a shift register and an associative match tried for with the above forms in turn until a match is found, the shift register being shifted to the right (with insertion of ones into the left end vacated positions) after associative interrogation for a given form before trying the next. If no match is found, the data word is obtained using the tables &c, as above. If a match is found, the corresponding table entry from the associative store is concatenated with the virtual address portion next to those used in the associative interrogation which gave match (e.g. the page portion if the matched entry was of form (2)) to address either the data word or a table entry. In the latter case, the word from the table is concatenated with the next portion from the virtual address to address either the data word or a table entry, and so on. Successive virtual address portions are presented for concatenation from the same portion of the shift register, by using repeated left shift, the left shift occurring in response to output of each table word from the data store, the first such word retrieved being also inserted into the associative store together with the corresponding portions of the virtual address from the shift register. As a modification, the associative store could also hold complete virtual addresses (on which a match is attempted first) and the corresponding data words.

    259.
    发明专利
    未知

    公开(公告)号：FR2008322A1

    公开(公告)日：1970-01-16

    申请号：FR6915081

    申请日：1969-05-09

    Applicant: PHILIPS NV

    IPC: G06F9/355 ,  G06F12/02 ,  G06F12/10 ,  G06F12/1036 ,  G06F12/14 ,  G06F7/00

    Abstract: A computer comprising a store addressable in segments, containing segment words selectable by segment numbers, which words contain data of the segment, for example, a segment base address and a segment length information, in which two or three segment word registers are provided for storing two or particularly three segment words in order to ensure a rapid run of the programmes in the event of frequent change of addressing in a plurality of segments. The computer for this purpose with a detection device for detecting whether and, if so, in which of the in total two or three segment word registers the segment word of an indicated segment in a segment number register is stored. In the presence of the relevant segment word it is released via gates for calculating the address and for length check. In the absence of said segment word this word is carried on from the store to a segment word register. Particularly one of the three segment word registers is constantly reserved for storing the segment word of one given segment (O-segment).

Patent Agency Ranking