JPS6084652A - Access cycle assignment system - Google Patents

Access cycle assignment system

Info

Publication number
JPS6084652A
JPS6084652A JP19309183A JP19309183A JPS6084652A JP S6084652 A JPS6084652 A JP S6084652A JP 19309183 A JP19309183 A JP 19309183A JP 19309183 A JP19309183 A JP 19309183A JP S6084652 A JPS6084652 A JP S6084652A
Authority
JP
Japan
Prior art keywords
access
access request
cycle
storage device
allocation
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
JP19309183A
Other languages
Japanese (ja)
Inventor
Yasuharu Kosuge
小菅 康晴
Kenji Miyamori
宮森 憲治
Hiroshi Ishikawa
宏 石川
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.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone 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 Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP19309183A priority Critical patent/JPS6084652A/en
Publication of JPS6084652A publication Critical patent/JPS6084652A/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
    • G06F13/18Handling requests for interconnection or transfer for access to memory bus based on priority control

Abstract

PURPOSE:To improve an entire throughput by changing an access cycle assigned to an access request origin of a shared storage device temporarily to another access request origin which makes an access request. CONSTITUTION:A control registor group 1 holds control data for N access cycles so as to secure the case of the longest access cycle for the shared storage device 6. A flag 3 which indicates the presence or absence of an access request is used by a processing port determining circuit 4 together with access cycle assignment data 2 when the port to be next accessed to the shared storage device 6 is decided to use actually. This processing port determining circuit 4 changes the access cycle temporarily to another access request origin unless there is access request from an expected access request origin even at an access execution time.

Description

【発明の詳細な説明】 発明の技術分野 本発明は、高速な記憶装置を複数のアクセス要求元があ
らかじめ定められた周期に基づき周期的にアクセスする
形で共用するシステムにおいて、各アクセス要求元への
割付を、アクセス要求の発生状況に従って動的に変更可
能とするアクセスサイクル割付方式に[シ、1するもの
である。
DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention relates to a system in which a high-speed storage device is shared by a plurality of access request sources in a manner in which the devices are periodically accessed based on a predetermined cycle. This is an access cycle allocation method that allows the allocation of access cycles to be dynamically changed according to the generation status of access requests.

技術の背景 従来、一つの記憶装置のアクセスサイクルを周期的に複
数の要ボ元へ割付けて記憶装置を共用する方式において
は、割付固定的であシ各要求元に対する最低のスループ
ットが保証される。
Background of the Technology Conventionally, in a method of sharing a storage device by periodically allocating access cycles of one storage device to multiple key sources, the allocation is fixed and the minimum throughput for each request source is guaranteed. .

従来技術と問題点 従来の一つの記憶装置のアクセスサイクルを周期的に複
数の要求元へ割付けて記憶装置を共用する方式において
は、割判は固定的であシ各要求元に対する最低のスルー
プットは保証する反面、ある要求元からのアクセスが減
少した場合、アクセスサイクルが有効利用されないとい
う欠点が存在した。
Prior Art and Problems In the conventional method of periodically allocating the access cycle of one storage device to multiple request sources to share the storage device, the allocation is fixed and the minimum throughput for each request source is On the other hand, there is a drawback that if the number of accesses from a certain request source decreases, the access cycle cannot be used effectively.

発明の目的 本発明は、各アクセス要求元に対する最低スループット
を保証した上でこの欠点を除くため、アクセス実行時刻
に至っても予定されたアクセス要求元からのアクセス要
求が存在しない場合に共用する記憶装置のアクセス要求
元へのアクセス割付を別のアクセス要求元に一時的に変
更することによシ、システム全体のスループット向上を
可能とするものであシ、以下図面について詳細に説明す
る。
Purpose of the Invention In order to eliminate this drawback while guaranteeing the minimum throughput for each access request source, the present invention provides a storage device that is shared when there is no access request from a scheduled access request source even at the access execution time. By temporarily changing the access allocation to one access request source to another access request source, it is possible to improve the throughput of the entire system.The drawings will be described in detail below.

発明の実施例 図は本発明の実施例であシ、1は共用記憶装置のアクセ
スサイクルの各ボート(アクセス要求元)に対する割付
データを管理する管理レジスタ群、2は管理レジスタ群
1内のアクセスサイクル割付データ、3は各ポートのア
クセス要求の有無を表示するフラグ、4は処理ボート決
定回路、5はセレクタ、6は共用記憶装置である。なお
CDはサイクル割伺け、ACNはアクセスサイクル番号
、ARはアクセス要求、ADloはアクセスデータ/オ
ーダ、P1〜P4はそれぞれポートを示す。
Embodiment of the Invention The figure shows an embodiment of the present invention, in which 1 is a management register group that manages allocation data for each port (access request source) in the access cycle of the shared storage device, and 2 is an access control register in the management register group 1. Cycle allocation data, 3 is a flag indicating whether there is an access request for each port, 4 is a processing boat determination circuit, 5 is a selector, and 6 is a shared storage device. Note that CD indicates cycle allocation, ACN indicates access cycle number, AR indicates access request, ADlo indicates access data/order, and P1 to P4 each indicate a port.

処理ボート決定回路4内の41は、アクセスサイクル割
付データ2とアクセス要求表示フラグ6とのビット毎の
論理積を取るANDゲート、411はANDゲート41
の出力がα110 であることを検出して、それを通知
する信号412を発生するANDグー)、42はアクセ
ス要求表示フラグ6について1′の立つビット間の(す
なわちボート間の)優先判定を行い最優先のビットのみ
を出方する優先判定回路、46は優先判定回路42の出
力をANDゲート411からのα110信号412によ
シ通過させたシ(α110 ) +させなかったり (
NOt a!0 )するANDゲート、44はANDゲ
ート41.43からのデータを入力として論理和をとる
ORゲートである。
41 in the processing boat determination circuit 4 is an AND gate that takes a bit-by-bit logical product of the access cycle allocation data 2 and the access request display flag 6; 411 is an AND gate 41
42 detects that the output of α110 is α110 and generates a signal 412 notifying the same), and 42 makes a priority judgment between bits set to 1' (that is, between boats) for the access request display flag 6. A priority determination circuit 46 outputs only the highest priority bit, and the output of the priority determination circuit 42 is passed through the α110 signal 412 from the AND gate 411 (α110) + or not (
Not a! 0 ), and 44 is an OR gate that receives data from AND gates 41 and 43 and performs a logical sum.

図において、管理レジスタ群1は共用記憶装置6に対す
るアクセス周期の最長ケース(Nアクセスサイクルに1
回とする)を保証するため、Nアクセスサイクル分の管
理データを保持しており、各ボートはNアクセスサイク
ルに1回共用記憶装置6をアクセスするような最長のア
クセス周期までの設定が可能である。管理レジスタ群1
内のサイクル割付データ2は、共用記憶装置6の各アク
セスサイクル毎に1ポートを1ビツトで表示して割付ら
れたボート(1つに限られる)を示すデータである(1
:割付、0:割付せず)。サイクル割付データ2の設定
は、ソフトウェア又はハードウェアによる一般的手段を
用いて別途実行されているものとする。アクセス要求の
有無を表示するフラグ5は、現時点における各ボートの
アクセス要求の有無(1:有、0:無)を各ボート対応
に1ビツトで表示しており、共用記憶装置6に対する次
回のアクセスを実際にどのポートから行なわせるかを決
定する際に、当該アクセスサイクルのサイクル割付デー
タ2とともに処理ボート決定回路4において使用される
In the figure, the management register group 1 has the longest access cycle to the shared storage device 6 (one access cycle per N access cycles).
Management data for N access cycles is held in order to guarantee the maximum number of access cycles, and each boat can be configured to access the shared storage device 6 once every N access cycles, up to the longest access cycle. be. Management register group 1
The cycle allocation data 2 within is data that indicates one port (limited to one) allocated by one bit for each access cycle of the shared storage device 6 (1
: Assigned, 0: Not assigned). It is assumed that the setting of cycle allocation data 2 is separately executed using general means using software or hardware. The flag 5 that indicates the presence or absence of an access request indicates the presence or absence of an access request for each boat at the present time (1: Yes, 0: No) for each boat, and indicates the presence or absence of an access request for each boat at the present time, and indicates the next access request to the shared storage device 6. This is used in the processing boat determination circuit 4 together with the cycle allocation data 2 of the access cycle when determining from which port the access cycle is actually performed.

以下処理ボート決定回路4の動作を説明する。The operation of the processing boat determining circuit 4 will be explained below.

■、プサイル割付データ2とアクセス要求表示7ラグ6
について、ANDゲート41により論理積を取る。結果
がα110でない場合、11nの立っているビットに対
応するポートにアクセスが割付られることになシ、OR
ゲート44を介してセレクタ5によシ当該ボートからの
アクセスが選択され、共用記憶装置6がアクセスされる
■, Psile allocation data 2 and access request display 7 Lag 6
The AND gate 41 performs a logical product. If the result is not α110, access will not be assigned to the port corresponding to the bit 11n is set, OR
Access from the relevant boat is selected by the selector 5 via the gate 44, and the shared storage device 6 is accessed.

■、■においてANDゲート41の出力がα110の場
合、アクセス要求表示フラグ6についてポート間の優先
判定を優先判定回路42にて実施した結果をANDゲー
ト411と信号412の指示にょk) A#、Dゲート
43を通過させ、ORゲート44を介してセレクタ5に
入力し、当該ボートからのアクセスを選択し、共用記憶
装置6をアクセスさせる。
When the output of the AND gate 41 is α110 in (1) and (2), the priority determination circuit 42 performs priority determination between ports regarding the access request display flag 6, and the result is determined by the AND gate 411 and the signal 412. The data is passed through the D gate 43 and input to the selector 5 via the OR gate 44 to select access from the port and access the shared storage device 6.

■、■、■において、当該ポートからのアクセス要求処
理後は、アクセス要求表示フラグ60当該ビツトのリセ
ット(アクセス要求が処理されたアクセス要求元のアク
セス要求フラグをクリアする)処理を行う。
In (1), (2), and (2), after the access request from the port is processed, the corresponding bit of the access request display flag 60 is reset (the access request flag of the access request source from which the access request was processed is cleared).

以上本実施例の説明図において、アクセス要求元(ボー
ト)数は4としたが、他の数でも同様な形で実現可能で
ある。
In the explanatory diagrams of this embodiment, the number of access request sources (boats) is four, but other numbers can be used in a similar manner.

本発明は記憶装置のアクセスサイクルの用途をプログラ
ム走行用または伝送路からのデータのバッファリング用
に分けて使用するような交換機(たとえば先に提案した
特願昭58−99239 )に適用して効果が太きい。
The present invention is effective when applied to a switching system in which the access cycle of a storage device is used separately for running a program or for buffering data from a transmission line (for example, as disclosed in the previously proposed Japanese Patent Application No. 58-99239). It's thick.

発明の詳細 な説明したように、共用する記憶装置のアクセス要求元
へのアクセスサイクル割付を、アクセス実行時刻に至っ
ても予定されたアクセス要求元からのアクセス要求が存
在しない場合に、アクセス要求のある別のアクセス要求
元に一時的に変更可能としたため、無駄に消費される共
用記憶装置のアクセスサイクルを減少さぜることかでき
、全体のスループットを向上させることができる。
As described in detail of the invention, when there is no access request from the scheduled access request source even at the access execution time, the access cycle allocation to the access request source of the shared storage device is performed. Since the access request source can be temporarily changed to another access request source, it is possible to reduce wasted access cycles of the shared storage device and improve the overall throughput.

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

図は本発明の実施例である。 1・・・割付データ管理レジスタ群、2・・・アクセス
ザイクル割付データ、6・・・アクセス要求表示フラグ
、4・・・処理ボート決定回路、5・・・セレクタ、6
・・・共用記憶装置、41,411.43・・・AND
ゲート、412・・・信号、42・・・優先判定回路、
44・・・ORゲート特許出願人日本電信電話公社 代理人男理士玉蟲久五部(外2名) −□□−=T bijs /遵
The figure shows an embodiment of the invention. DESCRIPTION OF SYMBOLS 1... Allocation data management register group, 2... Access cycle allocation data, 6... Access request display flag, 4... Processing boat determination circuit, 5... Selector, 6
...Shared storage device, 41,411.43...AND
gate, 412...signal, 42...priority determination circuit,
44...OR Gate Patent Applicant Nippon Telegraph and Telephone Public Corporation Representative Tamamushi Gobe (2 others) −□□−=T bijs / Jun

Claims (1)

【特許請求の範囲】[Claims] 複数のアクセスサイクル要求元の各ボートのアクセス要
求の有無を表示するフラグと、該フラグについてアクセ
スサイクルのアクセス要求元の優先順位を決定する優先
判定回路と、該アクセス要求元が周期的に使用する共用
記憶装置を含むアクセスサイクル割付方式において、前
記共用記憶装置の゛アクセスサイクルのアクセス要求元
の各ホードに対するアクセス割付データを管理する管理
レジスタ群と、該アクセス割付データと前記アクセス要
求フラグとのビット毎の論理積出力の割付安来の有無を
検出する手段、該検出結果、割付袋オ(の有るとき対応
ボートにアクセスを割当てる手段、該検出結果割付要求
の無いとき該アクセス安水フラグについてボート間の優
先判定を行い最優先のポート対応ビットのみ出力する優
先判定手段、該優先判定手段からの出力を前記割付安水
の無窮の検出結果に応じて通過の可否を行う手段、該優
先判定手段からの通過再出力に対応するボートにアクセ
スを割当てる手段とを有する処理ポート決定回路とを備
えてなシ、アクセスサイクルに割付られていたアクセス
要求元に当該サイクル笑行時刻にアクセス要求の無い場
合、アクセスサイクルを一時的にアクセス要求のある他
のアクセス要求元に変更して割付けることを特徴とする
アクセスサイクル割付方式。
A flag that displays the presence or absence of an access request from each boat of a plurality of access cycle request sources, a priority determination circuit that determines the priority of the access request source of an access cycle with respect to the flag, and a priority determination circuit that is periodically used by the access request source. In an access cycle allocation method including a shared storage device, a management register group for managing access allocation data for each host that is an access request source of an access cycle of the shared storage device, and bits of the access allocation data and the access request flag. Means for detecting the presence or absence of an allocation Yasugi of the logical product output for each, means for allocating access to the corresponding boat when there is an allocation bag O (as a result of this detection), and means for allocating access to the corresponding boat when there is an allocation request for the detection result a priority determining means for performing a priority determination and outputting only the bit corresponding to the highest priority port; a means for determining whether or not the output from the priority determining means can be passed in accordance with a detection result of said allocated ammonium infinity; and from the priority determining means. and a processing port determination circuit having means for allocating access to a boat corresponding to the passing re-output of the processing port. An access cycle allocation method characterized by temporarily changing and allocating an access cycle to another access request source having an access request.
JP19309183A 1983-10-15 1983-10-15 Access cycle assignment system Pending JPS6084652A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP19309183A JPS6084652A (en) 1983-10-15 1983-10-15 Access cycle assignment system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP19309183A JPS6084652A (en) 1983-10-15 1983-10-15 Access cycle assignment system

Publications (1)

Publication Number Publication Date
JPS6084652A true JPS6084652A (en) 1985-05-14

Family

ID=16302075

Family Applications (1)

Application Number Title Priority Date Filing Date
JP19309183A Pending JPS6084652A (en) 1983-10-15 1983-10-15 Access cycle assignment system

Country Status (1)

Country Link
JP (1) JPS6084652A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01229352A (en) * 1988-03-09 1989-09-13 Nec Corp Storage device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5659352A (en) * 1979-10-19 1981-05-22 Hitachi Ltd Signal selective circuit

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5659352A (en) * 1979-10-19 1981-05-22 Hitachi Ltd Signal selective circuit

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01229352A (en) * 1988-03-09 1989-09-13 Nec Corp Storage device

Similar Documents

Publication Publication Date Title
US4933846A (en) Network communications adapter with dual interleaved memory banks servicing multiple processors
EP0472879B1 (en) Method and apparatus for dynamic detection and routing of non-uniform traffic in parallel buffered multistage interconnection networks
US6715008B2 (en) Method and system for over-run protection in a message passing multi-processor computer system using a credit-based protocol
JPH0650493B2 (en) Data processing device
JPS6084652A (en) Access cycle assignment system
JPH08161254A (en) Information processing system and bus arbitration system therefor
US5202999A (en) Access request prioritization and summary device
JPH0551933B2 (en)
US6938078B1 (en) Data processing apparatus and data processing method
JPH06161873A (en) Hang-up processings system for plural access points to main memory
JP2680208B2 (en) Memory access control device
JPH03238539A (en) Memory access controller
JP2585905B2 (en) Multitask execution device
JPS59214977A (en) Data processing device
JPH10171770A (en) Multiprocessor system
JP3588966B2 (en) Information processing system
JP2002024157A (en) Method and device for processing dma
CN116204271A (en) Virtual input/output (virtIO) optimization method and system in virtual environment
JPH03232052A (en) Exclusive access system for shared data
JPH03282664A (en) Input/output processor
JPH0833869B2 (en) Data processing device
JPH11212900A (en) System controller
RU2101759C1 (en) Computing unit with alternating processing of several instruction flows
CN116909729A (en) GPU multitasking scheduling method
JPS6010381A (en) System for deciding input and output interruption reception processor in multi-processor system