JPS60123956A - Memory writing device - Google Patents

Memory writing device

Info

Publication number
JPS60123956A
JPS60123956A JP23138983A JP23138983A JPS60123956A JP S60123956 A JPS60123956 A JP S60123956A JP 23138983 A JP23138983 A JP 23138983A JP 23138983 A JP23138983 A JP 23138983A JP S60123956 A JPS60123956 A JP S60123956A
Authority
JP
Japan
Prior art keywords
data
memory
addresses
register
transfer
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.)
Pending
Application number
JP23138983A
Other languages
Japanese (ja)
Inventor
Hiroshi Watanabe
弘 渡辺
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.)
Hitachi Ltd
Original Assignee
Hitachi 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 Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP23138983A priority Critical patent/JPS60123956A/en
Publication of JPS60123956A publication Critical patent/JPS60123956A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)

Abstract

PURPOSE:To shorten the memory writing time of a processor, by sending out data of the same contents and continuous memory addresses at once from the processor to a data transfer controlling device, when said data are written in the continuous memory addresses. CONSTITUTION:A data register 10, address register 11 which is capable of update by (+1), and subtracting by (-1) register 16 which performs count-up control on the address register 11 are installed to a data transfer controlling device 2. The subtraction counter 16 once stores the number of continuous addresses and performs (-1) subtraction whenever memory writing is performed. A flip- flop 26 controls the output of a memory writing request signal. Each register 10, 11, and 16 decodes a memory writing request from a common bus 3 by means of a decoder 25 and writing is simultaneously performed synchronously to a timing pulse 30. The number of continuous addresses is set in the subtraction counter 16 from a signal line 18 and subtraction by (-1) is performed at every memory transfer. This operation is repeated until all the outputs are reduced to zero.

Description

【発明の詳細な説明】 〔発明の利用分野〕 本発明は、同一内容のデータ全連続したメモリアドレス
に畳込む場合のデータ転送装置に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a data transfer device for convolving all data of the same content into consecutive memory addresses.

〔発明の目的〕[Purpose of the invention]

本発明の目的は、同一内容のデータケ連続したメモリア
ドレスに畳込む場合、−回のデータ転送毎に、処理装置
と主記憶装置C以下MM)間のデータ交信を行なうこと
なく一括して、データと連続したアドレスn=i処理装
置からデータ転送制御装置(以下MCU)に送出するこ
とにより、処理装置のメモリ書込時間ケ格段に短縮化す
る装置ヶ提供するにある。
An object of the present invention is to convolute data of the same content into consecutive memory addresses without performing data communication between the processing unit and the main memory (C or lower MM) every - times of data transfer. An object of the present invention is to provide a device that significantly shortens the memory writing time of a processing device by sending consecutive addresses n=i from the processing device to a data transfer control unit (hereinafter referred to as MCU).

〔発明の背景〕[Background of the invention]

本発明の対象となるノ・−ドウエアケ第1図に示す、。 The hardware that is the object of the present invention is shown in FIG.

lは主記憶装置、2はMCU、3は共通ノ(ス、4〜6
は処理装置?示す。処理装置4〜6からのデータ転送要
求は、全て一担共通)くス3に出力し、MCU2により
優先判定し順番に〜IMIとのデータ転送?行なう。こ
の場合の情報としては、(a)データ(b)データ転送
方向(C)MMアドレスの三種となり、−語毎に転送情
報の交信が行なわれる。従って、同一内容のデータケ連
続したMMアドレスに書込む場合でも、MCUの中にデ
ータがあるにもかかわらず、再度処理装置からデータが
転送される形となり非効率的である。M2図は第1図の
詳細図である。共通バス3はデータバス7、MMアドレ
スバス8、データ転送方向9を示すバスにより構成し、
MCU2には各々データレジスタ10゜MMアドレスレ
ジスタl l % データ運送制御回路12に接続する
。処理装置4,5には同様に転送データを格納するレジ
スタ13.MMアドレスヶ送出するレジスタ14、デー
タ転送方向ケ指定する制御回路15があり共通バス3に
接続する。
1 is the main memory, 2 is the MCU, 3 is the common node, 4 to 6
Is it a processing device? show. Data transfer requests from the processing units 4 to 6 are all output to the common processing unit 3, and the MCU 2 determines the priority and sequentially transfers data to the IMI? Let's do it. In this case, there are three types of information: (a) data, (b) data transfer direction, and (C) MM address, and transfer information is exchanged for each word. Therefore, even when data of the same content is written to consecutive MM addresses, the data is transferred from the processing device again even though the data is in the MCU, which is inefficient. Figure M2 is a detailed view of Figure 1. The common bus 3 is composed of a data bus 7, an MM address bus 8, and a bus indicating a data transfer direction 9.
The MCU 2 is connected to a data register 10°, an MM address register l l %, and a data transport control circuit 12, respectively. Similarly, the processing devices 4 and 5 have registers 13 . There are a register 14 for sending MM addresses and a control circuit 15 for specifying the direction of data transfer, which are connected to the common bus 3.

第3図は共通バス3上でのデータ転送タイムチャートを
示し、MMアドレス8(メモリアドレス)n、n+1.
m、m+lに各々”l bl cl dというデータ7
ケ転送することを衆わしている。第4図は本発明の対象
となる連続したアドレスに同一データケ艦込む場合ケ示
し、n番地からn+4番地までaというデータを転送す
ることを表わしている。
FIG. 3 shows a data transfer time chart on the common bus 3, showing MM addresses 8 (memory addresses) n, n+1 .
Data 7 “l bl cl d” for m and m+l respectively
It is recommended to transfer the information. FIG. 4 shows a case in which the same data is transferred to consecutive addresses, which is the object of the present invention, and represents that data a is transferred from address n to address n+4.

〔発明の概要〕[Summary of the invention]

第5図ないし第7図に本発明の要点?示す。 What are the main points of the present invention shown in Figures 5 to 7? show.

第5図は本発明のポイントとなるデータ構成ケ示す。書
込データと平行して連続する語数(連続したアドレス)
全送出することにより、1回の転送で連続したnアドレ
スに同一データを書込むことが可能になる。第5図では
、ビット0〜15が書込データゲ示[7、ビット16〜
19が連続するアドレスバス示す。つまり、連続するア
ドレスが5ならば、同一データ勿連続したアドレスに5
回転送すること?意味する。第6図は本発明の構成ハー
ド9エアケ示す。〜1cU2の中にはデータレジスタl
Oの他に、+1更新可能なアドレスレジスタll、この
アドレスレジスタ11の史新回数全制御する連続したア
ドレスn忙1回をメモリ書込毎に−lするカウンタ16
にもち、甘た、共通バス3にも連続したアドレス数を交
信するだめの信号線18にもつ。処理装置4にも連続し
たアドレスレジスタするレジスタ17に−もつ。第7図
は本発明によるデータ転送のタイムチャートケ示す。
FIG. 5 shows the data structure which is the key point of the present invention. Number of consecutive words in parallel with written data (continuous addresses)
By sending all the data, it becomes possible to write the same data to n consecutive addresses in one transfer. In FIG. 5, bits 0 to 15 indicate write data [7, bits 16 to 15]
19 indicates a continuous address bus. In other words, if the number of consecutive addresses is 5, the same data can be stored in 5 consecutive addresses.
To transfer times? means. FIG. 6 shows the hardware 9 of the present invention. ~1cU2 contains data register l
In addition to O, there is an address register ll that can be updated by +1, and a counter 16 that controls the total number of new and new addresses in this address register 11 and decreases the number of successive addresses n busy once every time the memory is written.
However, the common bus 3 also has a continuous number of addresses on the signal line 18 for communication. The processing unit 4 also has a continuous address register 17. FIG. 7 shows a time chart of data transfer according to the present invention.

ここではメモリアドレス1000番地から1007番地
オでaというブータラ書込んだ場合の例奮示す。共通バ
ス3上でi’11000というメモリアドレスが21の
アドレスバス上に送出され、また、同時に、データaが
24のデータバスに送出される。データ送出と同時に2
0の信号線上に連続アドレス指定”8″が送出さtしる
。3め共通バス上ではこの一回のデータ転送のみが行な
われる。次に、MCU2.MMI間のデータ転送にメモ
リアドレスバス23、データバス22により、1000
番地から順に1007番地甘で”せ″というデータが転
送される。従って、従来1007番地までのデータ転送
の時間捷で共通バス3が占有されていだのに対し、図中
′1゛の間が占有解除が可能となり、この間、処理装置
4〜7の相互交信等他用途に使用出来るように斤り、処
理装置全体の処理性向上が可能となる。
Here, an example will be shown in which a booter a is written at memory addresses 1000 to 1007. On the common bus 3, the memory address i'11000 is sent out onto the 21st address bus, and at the same time, data a is sent out onto the 24th data bus. 2 at the same time as data transmission
Continuous address designation "8" is sent on the 0 signal line. Only this one data transfer is performed on the third common bus. Next, MCU2. The memory address bus 23 and the data bus 22 are used to transfer data between MMIs.
The data "Se" is transferred at address 1007 in order. Therefore, whereas conventionally the common bus 3 was occupied during the time period for data transfer up to address 1007, it is now possible to release the common bus 3 from '1' in the figure, and during this period, mutual communication between the processing units 4 to 7, etc. It can be used for other purposes, and the processing performance of the entire processing apparatus can be improved.

〔発明の実施例〕[Embodiments of the invention]

本発明の具体的実施例を第8図に示す。MCU2にはデ
ータレジスタ10、+1更新可能なアドレスレジスタ1
1.このアドレスレジスタ11のカウントアツプ制御?
行なう−l減算カウンタ16、減算カウンタ16は連続
するアドレスに’In奮−担記憶し、−回のメモリ1込
毎に−1する動作を行なう。26はフリラグフロッグを
示し、メモリ1込要求信号の出力制御ケ行なう。27は
メモリ書込要求信号、28はその応答信号ケ示す。
A specific embodiment of the present invention is shown in FIG. MCU2 has data register 10 and +1 updateable address register 1.
1. Is this address register 11 count up control?
-1 subtraction counter 16 The subtraction counter 16 performs an operation of storing 'In' in successive addresses and incrementing the memory by 1 every - times. Reference numeral 26 indicates a free-lag frog, which controls the output of the memory 1 loading request signal. Reference numeral 27 indicates a memory write request signal, and 28 indicates a response signal thereof.

10.11.16の各々のレジスタは、共通ノくス3か
らのメモリ書込要求?25のデコーダにより解続し、3
0のタイミングパルスと同期し、同時に書込が行なわれ
る。29は共通ノ(ス3のデータ転送制御信号ラインで
あり、データ転送方向、タイミングを制御する。連続す
るアドレス数は18の信号ラインから16の減算カウン
タにセントされ、メモリ転送毎に−1し、出力が全てO
になるまでこの動作がくり返えされる。これらの動作に
より連続したメモリアドレスに同一内容のデータ′fI
:書込むことが可能となる。
10.11.16 Each register receives a memory write request from common node 3? 25 decoders, and 3
Writing is performed simultaneously in synchronization with the 0 timing pulse. 29 is a data transfer control signal line of common node (3), which controls the data transfer direction and timing.The number of consecutive addresses is sent from the 18 signal lines to the 16 subtraction counter, and is decremented by 1 for each memory transfer. , all outputs are O
This operation is repeated until . Through these operations, data with the same content 'fI' is stored in consecutive memory addresses.
: Enables writing.

〔発叫の効果〕[Screaming effect]

本発明によれば、連続したアドレスに同一データkm込
む場合、連続したnアドレス分の転送が可能となり、こ
れにより空いた共通バスケ他用途に使用できる。
According to the present invention, if km of the same data is stored in consecutive addresses, it is possible to transfer n consecutive addresses, which frees up space and can be used for other purposes such as common basketball.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は従来の対象構成金示すブロック図、第2図は第
1図の詳細図、第3図、第4図は従来のデータ転送タイ
ムチャート、第5図は本発明のデータフォーマット、第
6図は本発明の一実施例のハードウェア構成図、第7図
は本発明のデータ転送タイムチャート、第8図は本発明
の回路図である。 11・・・アドレスレジスタ、16・・・減算カウンタ
。 代理人 弁理士 高橋明夫 $7図 メモ’/7ドレス (=7tシ〕◇72′jや続アトU
スI瞥Aシぐ==1−=Σ−″。
Fig. 1 is a block diagram showing the conventional target configuration, Fig. 2 is a detailed view of Fig. 1, Figs. 3 and 4 are conventional data transfer time charts, and Fig. 5 shows the data format of the present invention. FIG. 6 is a hardware configuration diagram of an embodiment of the present invention, FIG. 7 is a data transfer time chart of the present invention, and FIG. 8 is a circuit diagram of the present invention. 11... Address register, 16... Subtraction counter. Agent Patent Attorney Akio Takahashi $7 figure memo'/7 dress (=7t sheet) ◇72'j Ya Zoku Ato U
SwI glance A sig==1−=Σ−″.

Claims (1)

【特許請求の範囲】 1、主記憶装置と処理装置間のデータ転送装置において
、 一同一内容のデ〜りを連続するアドレスに書込む場合、
データと同時に連続する転送語数ni送出し、これによ
り1回のデータ転送で連続するn語?一括転送するため
、前記主記憶装置と前記処理装置間の前記データ転送全
制御する装置に転送アドレス全+1する第1のカウンタ
と、このカウンタの出力を前記主記憶装置のアドレスと
し、捷だ、連続するn語を記憶し、1回のメモリ書込毎
に−1する第2のカウンタと、前記第2のカウンタの内
容が0になるまで同一データを前記主記憶装置に書込む
手段とからなることを特徴とするメモリ書込み装置。
[Claims] 1. In a data transfer device between a main storage device and a processing device, when data with the same content is written to consecutive addresses,
The number of consecutive transfer words ni is sent at the same time as the data, so that n consecutive words are transmitted in one data transfer? For batch transfer, a device that controls all data transfer between the main storage device and the processing device has a first counter that increments all transfer addresses by 1, and the output of this counter is set as the address of the main storage device. a second counter that stores n consecutive words and increments by 1 for each memory write; and means for writing the same data into the main memory until the content of the second counter becomes 0. A memory writing device characterized by:
JP23138983A 1983-12-09 1983-12-09 Memory writing device Pending JPS60123956A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP23138983A JPS60123956A (en) 1983-12-09 1983-12-09 Memory writing device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP23138983A JPS60123956A (en) 1983-12-09 1983-12-09 Memory writing device

Publications (1)

Publication Number Publication Date
JPS60123956A true JPS60123956A (en) 1985-07-02

Family

ID=16922842

Family Applications (1)

Application Number Title Priority Date Filing Date
JP23138983A Pending JPS60123956A (en) 1983-12-09 1983-12-09 Memory writing device

Country Status (1)

Country Link
JP (1) JPS60123956A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6426949A (en) * 1987-07-23 1989-01-30 Fuji Xerox Co Ltd Transfer controller for memory data

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6426949A (en) * 1987-07-23 1989-01-30 Fuji Xerox Co Ltd Transfer controller for memory data

Similar Documents

Publication Publication Date Title
US3781810A (en) Scheme for saving and restoring register contents in a data processor
US4339804A (en) Memory system wherein individual bits may be updated
JPS6259822B2 (en)
JPS5975365A (en) Vector processing device
JPH0248747A (en) Microprocessor
US5146572A (en) Multiple data format interface
JPS585867A (en) Data transmission method and apparatus
US3351913A (en) Memory system including means for selectively altering or not altering restored data
JPS60123956A (en) Memory writing device
JPS616746A (en) Partial writing control system
JPH0652516B2 (en) Bus interface device
JPS6391756A (en) Partial write instruction processing system for storage device
JPH0565895B2 (en)
JP2581144B2 (en) Bus control device
JPS6145343A (en) Swapping control system
JPH0370816B2 (en)
JPH04333950A (en) Information processing system
JPS63201810A (en) Time system for information processing system
JPS6143366A (en) Data transfer system
JPH04160458A (en) Dma controller peripheral circuit
JPS61161560A (en) Memory device
JPS61117651A (en) Interface device
JPS63126047A (en) Memory control system
JPS58192123A (en) Device for transferring and controlling input and output data
JPS63165940A (en) Data processor