DATA PROCESSING SYSTEM
PURPOSE: To handle a 32-bit logical address with the size not larger and the cost not higher than those of a system handling a 16-bit logical address by inhibiting the data reference access to the address in the storage segment position discriminated as a segment position protected in a low level. C...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , , , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | POORU REIRII MAIKERU ERU JIIGURAA RICHIYAADO DABURIYUU KOIRU EDOWAADO RASARA SUCHIIBUN UORATSUCHI DEEBITSUDO ERU KIITEINGU JIEEMUZU II BERESU KENESU DEII HORUBAAGAA JIEEMUZU EMU GAIYAA CHIYAARUZU JIEI HOORANDO SUCHIIBUN EMU SUTOODAHAA KAARU HENRII KAARU JIEI ARUSHINGU MAIKERU BII DORIYUUKU JIYOSHIYU ROOZEN DEEBITSUDO AI EPUSUTEIN TOOMASU UESUTO |
description | PURPOSE: To handle a 32-bit logical address with the size not larger and the cost not higher than those of a system handling a 16-bit logical address by inhibiting the data reference access to the address in the storage segment position discriminated as a segment position protected in a low level. CONSTITUTION: The tag part of a word read out from a tag store 43 is compared with the tag part of the address presented from the request side by a comparator 52, and an effective flag is checked for the purpose of detecting that it is set. If this comparison fails (system cache miss), the requested data block doesn't exist in a cache data store 40 and must be brought from a main storage device. At this time, data loading is inhibited on the request side until this trouble is resolved. Thus, a 32-bit logical address is handled with the size not larger and the cost not higher than those of the system handling a 16-bit logical address. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JPH02153446A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JPH02153446A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JPH02153446A3</originalsourceid><addsrcrecordid>eNrjZBBzcQxxVAgI8nd2DQ729HNXCI4MDnH15WFgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8V4BHgZGhqbGJiZmjsbEqAEAwcsfbQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>DATA PROCESSING SYSTEM</title><source>esp@cenet</source><creator>POORU REIRII ; MAIKERU ERU JIIGURAA ; RICHIYAADO DABURIYUU KOIRU ; EDOWAADO RASARA ; SUCHIIBUN UORATSUCHI ; DEEBITSUDO ERU KIITEINGU ; JIEEMUZU II BERESU ; KENESU DEII HORUBAAGAA ; JIEEMUZU EMU GAIYAA ; CHIYAARUZU JIEI HOORANDO ; SUCHIIBUN EMU SUTOODAHAA ; KAARU HENRII ; KAARU JIEI ARUSHINGU ; MAIKERU BII DORIYUUKU ; JIYOSHIYU ROOZEN ; DEEBITSUDO AI EPUSUTEIN ; TOOMASU UESUTO</creator><creatorcontrib>POORU REIRII ; MAIKERU ERU JIIGURAA ; RICHIYAADO DABURIYUU KOIRU ; EDOWAADO RASARA ; SUCHIIBUN UORATSUCHI ; DEEBITSUDO ERU KIITEINGU ; JIEEMUZU II BERESU ; KENESU DEII HORUBAAGAA ; JIEEMUZU EMU GAIYAA ; CHIYAARUZU JIEI HOORANDO ; SUCHIIBUN EMU SUTOODAHAA ; KAARU HENRII ; KAARU JIEI ARUSHINGU ; MAIKERU BII DORIYUUKU ; JIYOSHIYU ROOZEN ; DEEBITSUDO AI EPUSUTEIN ; TOOMASU UESUTO</creatorcontrib><description>PURPOSE: To handle a 32-bit logical address with the size not larger and the cost not higher than those of a system handling a 16-bit logical address by inhibiting the data reference access to the address in the storage segment position discriminated as a segment position protected in a low level. CONSTITUTION: The tag part of a word read out from a tag store 43 is compared with the tag part of the address presented from the request side by a comparator 52, and an effective flag is checked for the purpose of detecting that it is set. If this comparison fails (system cache miss), the requested data block doesn't exist in a cache data store 40 and must be brought from a main storage device. At this time, data loading is inhibited on the request side until this trouble is resolved. Thus, a 32-bit logical address is handled with the size not larger and the cost not higher than those of the system handling a 16-bit logical address.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>1990</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19900613&DB=EPODOC&CC=JP&NR=H02153446A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76516</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19900613&DB=EPODOC&CC=JP&NR=H02153446A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>POORU REIRII</creatorcontrib><creatorcontrib>MAIKERU ERU JIIGURAA</creatorcontrib><creatorcontrib>RICHIYAADO DABURIYUU KOIRU</creatorcontrib><creatorcontrib>EDOWAADO RASARA</creatorcontrib><creatorcontrib>SUCHIIBUN UORATSUCHI</creatorcontrib><creatorcontrib>DEEBITSUDO ERU KIITEINGU</creatorcontrib><creatorcontrib>JIEEMUZU II BERESU</creatorcontrib><creatorcontrib>KENESU DEII HORUBAAGAA</creatorcontrib><creatorcontrib>JIEEMUZU EMU GAIYAA</creatorcontrib><creatorcontrib>CHIYAARUZU JIEI HOORANDO</creatorcontrib><creatorcontrib>SUCHIIBUN EMU SUTOODAHAA</creatorcontrib><creatorcontrib>KAARU HENRII</creatorcontrib><creatorcontrib>KAARU JIEI ARUSHINGU</creatorcontrib><creatorcontrib>MAIKERU BII DORIYUUKU</creatorcontrib><creatorcontrib>JIYOSHIYU ROOZEN</creatorcontrib><creatorcontrib>DEEBITSUDO AI EPUSUTEIN</creatorcontrib><creatorcontrib>TOOMASU UESUTO</creatorcontrib><title>DATA PROCESSING SYSTEM</title><description>PURPOSE: To handle a 32-bit logical address with the size not larger and the cost not higher than those of a system handling a 16-bit logical address by inhibiting the data reference access to the address in the storage segment position discriminated as a segment position protected in a low level. CONSTITUTION: The tag part of a word read out from a tag store 43 is compared with the tag part of the address presented from the request side by a comparator 52, and an effective flag is checked for the purpose of detecting that it is set. If this comparison fails (system cache miss), the requested data block doesn't exist in a cache data store 40 and must be brought from a main storage device. At this time, data loading is inhibited on the request side until this trouble is resolved. Thus, a 32-bit logical address is handled with the size not larger and the cost not higher than those of the system handling a 16-bit logical address.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1990</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZBBzcQxxVAgI8nd2DQ729HNXCI4MDnH15WFgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8V4BHgZGhqbGJiZmjsbEqAEAwcsfbQ</recordid><startdate>19900613</startdate><enddate>19900613</enddate><creator>POORU REIRII</creator><creator>MAIKERU ERU JIIGURAA</creator><creator>RICHIYAADO DABURIYUU KOIRU</creator><creator>EDOWAADO RASARA</creator><creator>SUCHIIBUN UORATSUCHI</creator><creator>DEEBITSUDO ERU KIITEINGU</creator><creator>JIEEMUZU II BERESU</creator><creator>KENESU DEII HORUBAAGAA</creator><creator>JIEEMUZU EMU GAIYAA</creator><creator>CHIYAARUZU JIEI HOORANDO</creator><creator>SUCHIIBUN EMU SUTOODAHAA</creator><creator>KAARU HENRII</creator><creator>KAARU JIEI ARUSHINGU</creator><creator>MAIKERU BII DORIYUUKU</creator><creator>JIYOSHIYU ROOZEN</creator><creator>DEEBITSUDO AI EPUSUTEIN</creator><creator>TOOMASU UESUTO</creator><scope>EVB</scope></search><sort><creationdate>19900613</creationdate><title>DATA PROCESSING SYSTEM</title><author>POORU REIRII ; MAIKERU ERU JIIGURAA ; RICHIYAADO DABURIYUU KOIRU ; EDOWAADO RASARA ; SUCHIIBUN UORATSUCHI ; DEEBITSUDO ERU KIITEINGU ; JIEEMUZU II BERESU ; KENESU DEII HORUBAAGAA ; JIEEMUZU EMU GAIYAA ; CHIYAARUZU JIEI HOORANDO ; SUCHIIBUN EMU SUTOODAHAA ; KAARU HENRII ; KAARU JIEI ARUSHINGU ; MAIKERU BII DORIYUUKU ; JIYOSHIYU ROOZEN ; DEEBITSUDO AI EPUSUTEIN ; TOOMASU UESUTO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JPH02153446A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1990</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>POORU REIRII</creatorcontrib><creatorcontrib>MAIKERU ERU JIIGURAA</creatorcontrib><creatorcontrib>RICHIYAADO DABURIYUU KOIRU</creatorcontrib><creatorcontrib>EDOWAADO RASARA</creatorcontrib><creatorcontrib>SUCHIIBUN UORATSUCHI</creatorcontrib><creatorcontrib>DEEBITSUDO ERU KIITEINGU</creatorcontrib><creatorcontrib>JIEEMUZU II BERESU</creatorcontrib><creatorcontrib>KENESU DEII HORUBAAGAA</creatorcontrib><creatorcontrib>JIEEMUZU EMU GAIYAA</creatorcontrib><creatorcontrib>CHIYAARUZU JIEI HOORANDO</creatorcontrib><creatorcontrib>SUCHIIBUN EMU SUTOODAHAA</creatorcontrib><creatorcontrib>KAARU HENRII</creatorcontrib><creatorcontrib>KAARU JIEI ARUSHINGU</creatorcontrib><creatorcontrib>MAIKERU BII DORIYUUKU</creatorcontrib><creatorcontrib>JIYOSHIYU ROOZEN</creatorcontrib><creatorcontrib>DEEBITSUDO AI EPUSUTEIN</creatorcontrib><creatorcontrib>TOOMASU UESUTO</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>POORU REIRII</au><au>MAIKERU ERU JIIGURAA</au><au>RICHIYAADO DABURIYUU KOIRU</au><au>EDOWAADO RASARA</au><au>SUCHIIBUN UORATSUCHI</au><au>DEEBITSUDO ERU KIITEINGU</au><au>JIEEMUZU II BERESU</au><au>KENESU DEII HORUBAAGAA</au><au>JIEEMUZU EMU GAIYAA</au><au>CHIYAARUZU JIEI HOORANDO</au><au>SUCHIIBUN EMU SUTOODAHAA</au><au>KAARU HENRII</au><au>KAARU JIEI ARUSHINGU</au><au>MAIKERU BII DORIYUUKU</au><au>JIYOSHIYU ROOZEN</au><au>DEEBITSUDO AI EPUSUTEIN</au><au>TOOMASU UESUTO</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>DATA PROCESSING SYSTEM</title><date>1990-06-13</date><risdate>1990</risdate><abstract>PURPOSE: To handle a 32-bit logical address with the size not larger and the cost not higher than those of a system handling a 16-bit logical address by inhibiting the data reference access to the address in the storage segment position discriminated as a segment position protected in a low level. CONSTITUTION: The tag part of a word read out from a tag store 43 is compared with the tag part of the address presented from the request side by a comparator 52, and an effective flag is checked for the purpose of detecting that it is set. If this comparison fails (system cache miss), the requested data block doesn't exist in a cache data store 40 and must be brought from a main storage device. At this time, data loading is inhibited on the request side until this trouble is resolved. Thus, a 32-bit logical address is handled with the size not larger and the cost not higher than those of the system handling a 16-bit logical address.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_JPH02153446A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
title | DATA PROCESSING SYSTEM |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T13%3A49%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=POORU%20REIRII&rft.date=1990-06-13&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJPH02153446A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |