JPS60175172A - Information processing system - Google Patents

Information processing system

Info

Publication number
JPS60175172A
JPS60175172A JP3067484A JP3067484A JPS60175172A JP S60175172 A JPS60175172 A JP S60175172A JP 3067484 A JP3067484 A JP 3067484A JP 3067484 A JP3067484 A JP 3067484A JP S60175172 A JPS60175172 A JP S60175172A
Authority
JP
Japan
Prior art keywords
access
request
main memory
receiving circuits
requests
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
JP3067484A
Other languages
Japanese (ja)
Inventor
Tadao Kondo
忠雄 近藤
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.)
NEC Corp
Original Assignee
NEC Corp
Nippon Electric Co 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 NEC Corp, Nippon Electric Co Ltd filed Critical NEC Corp
Priority to JP3067484A priority Critical patent/JPS60175172A/en
Publication of JPS60175172A publication Critical patent/JPS60175172A/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

Landscapes

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

Abstract

PURPOSE:To reduce considerably the number of hardwares by dividing one main memory area under roughly coupled state to be used and to access a part of main memory areas in common by plural arithmetic processors. CONSTITUTION:Memory access request from respective units 2-5 are set up in request receiving circuits 20-23 in an SCU1. The request receiving circuits 20-23 check whether the addresses of the received memory access requests are included in a specified area or not. If a certain address exceeds the access range, an outarea access error is reported to the requested unit through an answering circuit 24. When the access requests are included in the specified area, a control circuit 27 decides the priority of the requests in accrodance with the signals from the request receiving circuits 20-23, selects the request having the highest priority and sends the selected request to an MMU6 through a request sending circuit 25.

Description

【発明の詳細な説明】 発明の属する技術分野 本発明は粗結合型マルチプロセッサで構成された情報処
理システムに関する。
DETAILED DESCRIPTION OF THE INVENTION TECHNICAL FIELD The present invention relates to an information processing system configured with loosely coupled multiprocessors.

従来技術 被数台の処理装置を有するマルチプロセッサシステムは
、全土メモリ領域を共用する密結合型と生メモリ領域を
共用しない粗結合型とに分類される。粗結合型マルチプ
ロセッサは装置間の独立性が尚<、耐故障性に優れてい
るが、密結合型システムは性能改善面で粗結合型よシ優
れている。一方通常運用は密結合で行い、新しいソフト
ウェアのデバッグ時、システムを粗結合運転し、業務の
運用と並行して蝕立なシステムでデバッグするという連
用方式゛も行なわれている。ところが粗結合システムを
構築するためKd、各装甑ヲ完全に2重に用意しなけれ
はならずハードウェア蓋が増加するという問題かある0
すなわち、主メモリへの演算処理装置のアクセスを制御
するシステム制御装置は先金に2重に用意する必要があ
る0発明の目的 本発明の目的はハードウェア量の増加を最小にした粗結
合の情報処理システムを提供することにある。
BACKGROUND OF THE INVENTION Multiprocessor systems having a large number of processing units are classified into tightly coupled types in which the entire memory area is shared, and loosely coupled types in which the raw memory areas are not shared. A loosely coupled multiprocessor has excellent fault tolerance due to the independence between devices, but a tightly coupled system is superior to a loosely coupled system in terms of improved performance. On the other hand, a continuous system is also used in which normal operations are performed in a tightly coupled manner, and when debugging new software, the system is operated in a loosely coupled manner, and the debugging system is debugged in parallel with business operations. However, in order to construct a loosely coupled system, each device must be prepared in duplicate, which poses the problem of increasing the number of hardware covers.
In other words, the system control device that controls the access of the arithmetic processing unit to the main memory needs to be prepared in duplicate in advance.Objective of the Invention The object of the present invention is to provide a coarse coupling system that minimizes the increase in the amount of hardware. Our goal is to provide information processing systems.

発明の構成 すなわち、本発明のシステムは、複数の演算処理装置と
、複数の人出力処理装−と主メモリに接続され、前記複
数の演算処理装置および入出力処理装置の主メモリアク
セスと前記処理装態間の通信を制御する1台のシステム
制御装置と、前記複数の演算処理装−7が管結合運転状
態か粗結合連転状態かを保持する状態保持手段と、前記
演算処理装置および入出力処理装置の主メモリアクセス
アドレスがアクセスを許可された主メモリ領域内か否か
をチェックするアクセスチェック手段を有し、粗結合状
態で1台の主メモリ領域を分割して使用するとともに1
部の主メモリ鎖板は前記複数の演算処理装置が共通にア
クセスできるようにしたことを特徴とする。
Configuration of the Invention In other words, the system of the present invention includes a plurality of arithmetic processing units, a plurality of human output processing devices, and a main memory connected to each other, and the main memory access of the plurality of arithmetic processing units and the input/output processing device and the processing one system control device that controls communication between devices; a state holding means that maintains whether the plurality of processing devices 7 are in a pipe-coupled operation state or a coarse-coupled continuous state; It has an access check means for checking whether or not the main memory access address of the output processing device is within the main memory area to which access is permitted.
The main memory chain plate of the section is characterized in that it can be accessed in common by the plurality of arithmetic processing units.

発明の実施例 次に本発明について、図面を参照して詳細に説明する。Examples of the invention Next, the present invention will be explained in detail with reference to the drawings.

第1図を参照すると、本発明の一実施例は、演算処理装
置!L(以下CPU)2および3;入出力処理装置(以
下l0P)4および5;主記憶装置(以下MMU)6お
よびCPU2.3とl0P4゜5のMMLJ6へのアク
セスとCP(J2,3およびl0P4.5の間の通信を
制御するシステム制御装置(以下5CU)1とから構成
されている。
Referring to FIG. 1, one embodiment of the present invention is an arithmetic processing device! L (hereinafter referred to as CPU) 2 and 3; input/output processing units (hereinafter referred to as 10P) 4 and 5; main memory unit (hereinafter referred to as MMU) 6 and CPU 2.3 and 10P4゜5's access to MMLJ6 and CP (J2, 3 and 10P4) .5, and a system control unit (hereinafter referred to as 5CU) 1 that controls communications between the 5CUs.

8CU1の1作は密結合モードと粗結合モードとで異な
る。このモードは初期設定時に設定される。
One work of 8CU1 differs between tight coupling mode and coarse coupling mode. This mode is set during initial setup.

密結合モードにおいてはCPU2.3およびl0P4.
5は任意の主記憶エリヤ、任意のプロセッサにアクセス
できるが、粗結合モードにおいてはCPUIはI(J)
’4と、C1’U2は10P5とのみ交信可能で69、
CPU1およびCPU2間の通信は禁止される0アクセ
スできる主記憶の領域も眼足される。以下粗結合モード
での動作を第2図を参照して説明する。第2図は8C0
1の概略構成を示す図である。
In tightly coupled mode, CPU2.3 and l0P4.
5 can access any main memory area and any processor, but in loosely coupled mode, the CPU
'4 and C1'U2 can only communicate with 10P569,
Communication between CPU1 and CPU2 is prohibited, and areas of the main memory that can be accessed are also noted. The operation in the coarse coupling mode will be explained below with reference to FIG. Figure 2 is 8C0
FIG. 1 is a diagram showing a schematic configuration of FIG.

各装置2〜5からのメモリアクセス要求は5CUlのリ
フニスl付回路20,21.22および23にセットさ
れる。リクエスト受付回路20〜23は、6処[i&2
〜5がアクセス可能な主記憶の領域を記憶するレジスタ
を壱する。本実施例ではアクセス可能領域を開始番地と
サイズの形で指定する2組のレジスタを各リクエスト受
付回路20〜23は備えており、初期設定時にその値が
設定される。
Memory access requests from each of the devices 2 to 5 are set in the 5CUl refinishing circuits 20, 21, 22, and 23. The request reception circuits 20 to 23 are located at six locations [i&2
~5 is a register that stores an accessible area of main memory. In this embodiment, each of the request reception circuits 20 to 23 includes two sets of registers for specifying an accessible area in the form of a start address and size, and the values thereof are set at the time of initial setting.

第3図を参照すると、MMU6の記憶領域は分割され、
CPU2 、l0P4およびCPU3.l0P5専川の
領域と全処理鋏〜°が共通にアクセスできる領域とに分
けられる。
Referring to FIG. 3, the storage area of the MMU 6 is divided into
CPU2, l0P4 and CPU3. It is divided into an area of 10P5 special river and an area that can be accessed in common by all processing scissors.

再び、第2図を参照すると、リクエスト受付回路20,
21,22および23d受付けたメモリアクセス要求の
アドレスが、指定された領域内かどうかをチェックする
。もしアクセス範囲外であれは、領域外アクセスエラー
を要求元装置itK対し、応答回路24を介して報告す
る。アクセス要求が指定された領域内であれは、制御回
路27は各リクエスト受付回路20〜23からの信号に
従いその優先順位を判定し、最も優先順位の尚いリクエ
ストを選びリクエスト送出(ロ)路25を介してMMU
 6に送出子る。MMU6はリクエストに従って書込も
しくは読出動作を行い、その結果をメモリリプライ回路
26に送出する。さらにリプライは応答(ロ)路24を
介して要求元鉄橋に送出される。
Referring again to FIG. 2, the request receiving circuit 20,
21, 22 and 23d Check whether the address of the accepted memory access request is within the specified area. If it is outside the access range, an out-of-range access error is reported to the requesting device itK via the response circuit 24. If the access request is within the designated area, the control circuit 27 determines its priority according to the signals from each request receiving circuit 20 to 23, selects the request with the lowest priority, and sends the request to the request sending (b) path 25. via MMU
Sending child to 6. The MMU 6 performs a write or read operation according to the request and sends the result to the memory reply circuit 26. Further, the reply is sent to the requesting railway bridge via the response path 24.

処理装態間の通信は次のように行なわれる。各処理装置
からの通信要求(CPUからのIOP起#iJ、Iまた
はIOPからのCPUへの割込報告)はメモリアクセス
と網様リクエス)+行回路20.21゜22および23
にセットされる。谷リクエスト受付回路20.21.2
2および23は粗結合モードで許される処理装誕間通信
かどうかを、初期設定情報にもとづきチェ、りする。違
反するアクセスはメモリの領域外アクセスエラーと同様
にアクセス違反を要求元装fi[K報告する。許された
アクセスであれは制御回路27による優先1−位の判定
を行い、最もプライオリティが尚ければ応答回路24を
介して、その要求は髪求先処理装置に送出されるO 本実施例ではCPU3およびl0P5はMMU6のn番
地〜(2n−1)番地、2n番地からm番地迄アクセス
可能である。この主メモリアドレスとプログラムアドレ
スとの対応は、プログラムの発生する仮想アドレスを主
メモリの実アドレスへの変換の過程で使用する公知のペ
ージ表を用いてCPU内で行なわれる。
Communication between processing units is performed as follows. Communication requests from each processing unit (IOP activation #iJ, I or interrupt report from the IOP to the CPU from the CPU) are memory access and network requests) + row circuits 20.21°22 and 23
is set to Valley request reception circuit 20.21.2
2 and 23 check whether communication between processing devices is allowed in the coarse coupling mode based on initial setting information. Violating accesses report access violations to the requestor as well as memory out-of-range access errors. If the access is allowed, the control circuit 27 determines the priority level 1-1, and if it is the highest priority, the request is sent to the hair request processing device via the response circuit 24. The CPU 3 and l0P5 can access addresses n to (2n-1) and addresses 2n to m of the MMU 6. This correspondence between main memory addresses and program addresses is performed within the CPU using a known page table that is used in the process of converting virtual addresses generated by a program into real addresses in main memory.

本実施例ではSCUが1つのシステムについて説明した
が、第4図に示される28CUのシステムにも適用可能
な事は明らかであシ、第4図に示される例では最大4つ
のオペレーティングシステムの粗結合運転か可能となる
Although this embodiment describes a system with one SCU, it is obvious that it can also be applied to a system with 28 CUs shown in FIG. 4. In the example shown in FIG. Combined operation is possible.

本発明には1台のSOUで粗結合運転システムを構築で
きるため、ハードウェアの大幅な削減ができるという効
果がある。
The present invention has the effect of being able to significantly reduce the amount of hardware because it is possible to construct a loosely coupled operation system with one SOU.

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

第1図は本発明の一実施例を示す図、第2図はシステム
制御装置の構成例を示すブロック図、第3図は主メモリ
領域の割当を示す図、および第4図は本発明の他の実施
例を示す囚である。 第1図から第4図において、1.7・・・・・・システ
ム制御装置、2,3,8.9・・・・・・演算処理装置
、4.5,9.il・・・・・・入出力処理装置、6.
12・・・・・・主メモリ。
FIG. 1 is a diagram showing an embodiment of the present invention, FIG. 2 is a block diagram showing an example of the configuration of a system control device, FIG. 3 is a diagram showing allocation of main memory areas, and FIG. 4 is a diagram showing an example of the configuration of a system control device. This is a prisoner showing another example. 1 to 4, 1.7... system control device, 2, 3, 8.9... arithmetic processing device, 4.5, 9. il... input/output processing device, 6.
12... Main memory.

Claims (1)

【特許請求の範囲】 複数の演算処理装置と、 複数の入出力処理&籠と。 主メモリに接続され前記複数の演算処理装置および前記
入出力処理装置の主メモリアクセスと前記各処理装−9
間の通信とを制御する1台の7ステム制御装り、と、 前記複数の演算処理装置が密結合運転状態か粗結合運転
状態かを保持する状態保持手段と、前記演算処理装置お
よび入出力処理装置の主メモリアクセスアドレスがアク
セスを許可された主メモリ領域内か否かをチェックする
アクセスチェック手段と會有し、 粗結合状態で1台の生メモリ領域を分割して使用すると
ともに1部の主メモリ領域は前記複数の演算処理装置が
共通にアクセスできるようにしたことを特徴とする情報
処理システム。
[Claims] A plurality of arithmetic processing units, and a plurality of input/output processing and cages. Main memory access of the plurality of arithmetic processing units and the input/output processing unit connected to the main memory;
one 7-stem control device for controlling communication between the two; a state holding means for maintaining whether the plurality of arithmetic processing units are in a tightly coupled operating state or a loosely coupled operating state; It is equipped with an access check means for checking whether the main memory access address of the processing unit is within the main memory area to which access is permitted, and divides and uses one raw memory area in a loosely coupled state. An information processing system characterized in that a main memory area of the information processing system can be accessed in common by the plurality of arithmetic processing units.
JP3067484A 1984-02-21 1984-02-21 Information processing system Pending JPS60175172A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3067484A JPS60175172A (en) 1984-02-21 1984-02-21 Information processing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3067484A JPS60175172A (en) 1984-02-21 1984-02-21 Information processing system

Publications (1)

Publication Number Publication Date
JPS60175172A true JPS60175172A (en) 1985-09-09

Family

ID=12310261

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3067484A Pending JPS60175172A (en) 1984-02-21 1984-02-21 Information processing system

Country Status (1)

Country Link
JP (1) JPS60175172A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03501069A (en) * 1987-07-10 1991-03-07 フォームラブ・インターナショナル・リミテッド recognition system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03501069A (en) * 1987-07-10 1991-03-07 フォームラブ・インターナショナル・リミテッド recognition system

Similar Documents

Publication Publication Date Title
CA1176337A (en) Distributed signal processing system
US6986005B2 (en) Low latency lock for multiprocessor computer system
JP4124507B2 (en) Multiprocessor computer with configurable hardware system domain
US6910108B2 (en) Hardware support for partitioning a multiprocessor system to allow distinct operating systems
US6212610B1 (en) Memory protection mechanism for a distributed shared memory multiprocessor with integrated message passing support
AU721685B2 (en) Bus interface control circuit
US5765195A (en) Method for distributing interprocessor interrupt requests via cache memory coherency mechanisms
US20030229721A1 (en) Address virtualization of a multi-partitionable machine
JPS60175172A (en) Information processing system
JP4306811B2 (en) Cache coherence unit with integrated message passing and memory protection for distributed shared memory multiprocessor systems
JPS60173655A (en) Memory system of multiprocessor
JPS60175170A (en) Information processing system
JPS60175173A (en) Information processing system
JPS599767A (en) Multiprocessor
JPS60175171A (en) Information processing system
JP3182000B2 (en) Extended storage device in complex information processing system
JP2946561B2 (en) Multiprocessor system
EP0472754B1 (en) Multiprocessor system having selective global data replication
JPH03232052A (en) Exclusive access system for shared data
EP0472753B1 (en) Multiprocessor system having selective global data replication
JPS6371749A (en) Memory protecting system
JP2003280980A (en) Shared memory exclusive control device and shared memory exclusive control method
JPS633350A (en) Semiconductor memory device
JPH0342762A (en) Inter-processor communication method for multiprocessor system
JPH0427584B2 (en)