JPH0275055A - Master-slave switching method for multi-computer system - Google Patents

Master-slave switching method for multi-computer system

Info

Publication number
JPH0275055A
JPH0275055A JP63226528A JP22652888A JPH0275055A JP H0275055 A JPH0275055 A JP H0275055A JP 63226528 A JP63226528 A JP 63226528A JP 22652888 A JP22652888 A JP 22652888A JP H0275055 A JPH0275055 A JP H0275055A
Authority
JP
Japan
Prior art keywords
computer
computers
slave
master
resources
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
JP63226528A
Other languages
Japanese (ja)
Inventor
Yoshiyuki Abe
安倍 能行
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.)
Fuji Electric Co Ltd
Fuji Facom Corp
Original Assignee
Fuji Electric Co Ltd
Fuji Facom 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 Fuji Electric Co Ltd, Fuji Facom Corp filed Critical Fuji Electric Co Ltd
Priority to JP63226528A priority Critical patent/JPH0275055A/en
Publication of JPH0275055A publication Critical patent/JPH0275055A/en
Pending legal-status Critical Current

Links

Landscapes

  • Hardware Redundancy (AREA)
  • Multi Processors (AREA)

Abstract

PURPOSE:To facilitate a master-slave switching action and also to attain the easy application of this switching method to a multi-computer system including >=3 computers by shifting the computer that acquired the prescribed resources to a master computer out of those computers forming the multi-computer system. CONSTITUTION:The computers A and B form a multi-computer system. Then the computer A, for example, acquires the using right of the common resources 1 like a memory, its prescribed area, etc., and is defined as a master computer. While the other computer B that failed to acquire the using right of the resources 1 is defined as a slave computer and kept in a waiting state. Then the computer B kept waiting is changed into a master computer in case the computer A has some abnormality and abandons its using right of the resources 1. Thus the switching action is facilitated between both computers and these computers can be easily applied to a multi-computer system including >=3 computers.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 この発明は、多重化された計算機システムにおいて、主
系に異常が発生した場合に従系を主系に切り換える切換
方法に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a switching method for switching a slave system to a main system when an abnormality occurs in the main system in a multiplexed computer system.

〔従来の技術〕[Conventional technology]

従来、この種の切換方法としては、従系計算機の比例積
分初期状M4ヲ主系計算機の比例積分初期状態に一致さ
せて切り換えるようにしたもの(特開昭58−1636
4号公報)、または主系に従系への切り換え要因が生じ
た場合、一定時間、両制御系から被制御装fjl解放状
態におき、一定時間経過後被制御装置の制御を従系に切
り換えるようにしたもの(特開昭57−197669号
公報)等が知られている。
Conventionally, as a switching method of this type, the proportional integral initial state M4 of the slave system computer is switched to match the proportional integral initial state of the main system computer (Japanese Patent Laid-Open No. 58-1636).
(No. 4 Publication), or when a factor causing the main system to switch to the slave system occurs, the controlled device fjl is released from both control systems for a certain period of time, and after a certain period of time, the control of the controlled device is switched to the slave system. A device having the following structure (Japanese Unexamined Patent Publication No. 57-197669) is known.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

しかしながら、従来の方法ではハード的に異常を検知し
ない限り系の遷移は行なえず、ソフト的な異常に対処で
きないと云う問題がある。また、3重系以上の計算機シ
ステムについては、この種の切り換え方法は殆んど存在
しないのが現状である。
However, conventional methods have the problem that system transition cannot be performed unless a hardware abnormality is detected, and it is not possible to deal with software abnormalities. Furthermore, for triplex or higher computer systems, there is currently almost no switching method of this type.

したがって、この発明は簡単な方法で、しかもハード的
かソフト的かの異常種別や計算機の台数に関わりなく主
系、従系の切り換えが可能な切換方法を提供することを
目的とする。
Therefore, it is an object of the present invention to provide a switching method that allows switching between the main system and the slave system in a simple manner, regardless of the type of abnormality (hard or software) or the number of computers.

〔課題を解決)′るための手段〕[Means to solve the problem]

多重系計算他システム1r:構成゛する複数の計算機の
うち、各々が共通に使用する特定の資源全獲得したSF
算機を主系とし、獲得できなかった計算機を従系として
運用し、主系計算機に異常が発生したときは前記資源全
開放して待機状態にある所定の従系計詳機全主系へ移行
させる。
Multi-system computing system 1r: SF that has acquired all the specific resources that are commonly used by each of the multiple computers that make up the system.
The computer is the main system, and the computers that could not be acquired are operated as the slave system, and when an error occurs in the main computer, all the resources are released and the specified slave computer in standby status is transferred to the entire main system. Migrate.

〔作用〕[Effect]

多重計算機システム全構成する複数の計算機のうち、例
えばメモリやその所定領域の如き共通の資源の使用権を
獲得したものを主系計算機とする一方、資源の使用権を
獲得できなかったものを従系計算機として待機させ、主
系計算機に異常が生じて資源の使用権を放棄したときは
、待機状態にある所定の従糸計′n機全主系に移行させ
ることにより切り換え′f!:容易にし、3重系以上の
システムにも容易に適用できるようにする。
Among the multiple computers that make up the entire multicomputer system, the one that has acquired the right to use a common resource, such as memory or a predetermined area thereof, is designated as the main computer, while the one that has not been able to acquire the right to use the resource is designated as the slave computer. If the main computer is placed on standby as a system computer, and an abnormality occurs and the right to use the resource is relinquished, the switch is made by transferring the predetermined subordinate thread meter'n machines in the standby state to the entire main system. : Make it easy to apply to triple or higher systems.

〔実施例〕 第1図は2台の計算機によるこの発明の詳細な説明する
ための説明図である。なお、1は資源、■はアブリゲー
ショ/プログラム、■は糸監視プログラム金それぞれ示
している。
[Embodiment] FIG. 1 is an explanatory diagram for explaining in detail the present invention using two computers. Note that 1 indicates resources, ■ indicates aggregation/program, and ■ indicates thread monitoring program money.

すなわち、2台の計″l$機金それぞれA−計′j!#
機。
In other words, the total of the two machines is A-total'j!#
Machine.

B#算機とすれば、2台の計算機で共通に使用する特定
の資源1を先に獲得した方が主系(第1図の場合はA、
ttN機)となり、獲得できなかった系が従系(第1の
場合はB#算機)として待機させられることになる。そ
の後、A#算機に異常が発生して人計算機が獲得してい
た資源が解放されると、B#算機がその資源全獲得して
主系計W機に遷移する。なお、共通の資源としてはこ−
では、例えばメモリやその所定領域を想定している。ま
た、資源の獲得はフラグビット等で管理することができ
る。
If it is a B# computer, the one that acquires the specific resource 1 that is commonly used by two computers first will be the main system (in the case of Figure 1, A,
ttN machine), and the system that could not be acquired is kept on standby as a slave system (B# machine in the first case). After that, when an abnormality occurs in the A# computer and the resources acquired by the human computer are released, the B# computer acquires all of its resources and transitions to the main computer W computer. In addition, this is a common resource.
Here, for example, a memory or a predetermined area thereof is assumed. In addition, resource acquisition can be managed using flag bits and the like.

第2図はN台の計算機によるこの発明の実施例金示し、
N台の計算機のうち主系計算機全2台、他を従系#算機
として運用する例金示す。すなわち、こ\でも特定の資
源1人またはIBを獲得した計算機を主系とし、獲得で
きなかった系を従系とする。そして、異常が発生して資
源IAまたはIBが解放されると、獲得要求の発生順に
1またがつて従系#算機が資源全獲得して主系計算機に
遷移する。つまり、同図(イ)ではへ計算機とB計算機
が主系であり、その他の計算機は従系である。
FIG. 2 shows an embodiment of this invention using N computers,
An example of operating two primary computers among N computers and the others as secondary computers is shown below. That is, in this case, the computer that has acquired a specific resource or IB is defined as the main system, and the system that has not been able to acquire it is defined as the slave system. Then, when an abnormality occurs and the resource IA or IB is released, the slave # computers acquire all the resources in the order in which acquisition requests occur and transition to the primary computer. That is, in the same figure (a), the F computer and the B computer are the main system, and the other computers are the slave systems.

また、従系計算機の資源IA、IBに対する獲得要求の
発生順金それぞれの資源に対して■、■。
In addition, ■ and ■ for each resource in the order of generation of acquisition requests for resources IA and IB of the slave computer.

■で示す。同図(ロ)は、AI!を算機とB計算機に異
常が発生した場合全示す。この場合、C計算機が資源I
A金、E計算機が資源IBをそれぞれ獲得して主系計算
機に遷移する。このとき、C計算機が資源IBに出して
いた要求■と、E計算機が資源IAに出していた要求■
は解除しても良く、しなくても良い。
Indicated by ■. The same figure (b) shows AI! If an abnormality occurs in the calculator and B calculator, all will be shown. In this case, computer C uses resource I
Computers A and E each acquire the resource IB and transition to the main computer. At this time, the request ■ that computer C issued to resource IB, and the request ■ that computer E issued to resource IA.
may or may not be canceled.

〔発明の効果〕〔Effect of the invention〕

この発明によれば、多重計算機システムを構成する枚数
の計算機のうぢ、所定の資源全獲得したものを主系#算
機に遷移させるようにしたので、主系、従系の切り換え
が容易になるだけでなく、3台以上の多重計算機システ
ムにも容易に適用することができる利点がもたらされる
According to this invention, among the number of computers constituting a multi-computer system, the one that has acquired all the predetermined resources is transferred to the main computer, so switching between the main system and the slave system is facilitated. In addition, the present invention has the advantage that it can be easily applied to a multi-computer system with three or more computers.

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

第1図は2合の計算機によるこの発明の詳細な説明する
ための説明図、第2図は3台以北の計算機によるこの発
明の詳細な説明するための説明図である。 符号説明 1.1人、IB・・・・・・312源、■・・・・・・
アブリゲーシミンプログラム、■・・・・・・系監視プ
ログラム。 代理人 弁理士 並 木 昭 夫 代理人 弁理士 松 崎    清 第1 図 A討に冴°               B討糞岳・
@   ■          ■   @第2 図
FIG. 1 is an explanatory diagram for explaining the present invention in detail using a two-way computer, and FIG. 2 is an explanatory diagram for explaining the invention in detail using three or more computers. Code explanation 1. 1 person, IB...312 source, ■...
Abrige simulation program, ■... system monitoring program. Agent Patent attorney Akio Namiki Agent Patent attorney Kiyoshi Matsuzaki 1st figure
@ ■ ■ @Figure 2

Claims (1)

【特許請求の範囲】[Claims] 多重計算機システムを構成する複数の計算機のうち、各
々が共通に使用する少なくとも1つの所定資源の使用権
を獲得したものを主系計算機とする一方、該資源の使用
権を獲得できなかつたものを従系計算機として待機させ
、主系計算機に異常が生じて資源の使用権を放棄したと
きは、待機状態にある所定の従系計算機を主系に移行さ
せることを特徴とする多重計算機システムの主系、従系
切換方法。
Among a plurality of computers constituting a multi-computer system, the one that has acquired the right to use at least one predetermined resource that is commonly used by each computer is the main computer, while the computer that has not been able to acquire the right to use the resource is defined as the main computer. A main system of a multiple computer system characterized in that a predetermined slave computer in a standby state is made to stand by as a slave computer, and when an abnormality occurs in the main computer and the right to use resources is relinquished, a predetermined slave computer in a standby state is transferred to the main computer. System and slave system switching method.
JP63226528A 1988-09-12 1988-09-12 Master-slave switching method for multi-computer system Pending JPH0275055A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP63226528A JPH0275055A (en) 1988-09-12 1988-09-12 Master-slave switching method for multi-computer system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP63226528A JPH0275055A (en) 1988-09-12 1988-09-12 Master-slave switching method for multi-computer system

Publications (1)

Publication Number Publication Date
JPH0275055A true JPH0275055A (en) 1990-03-14

Family

ID=16846546

Family Applications (1)

Application Number Title Priority Date Filing Date
JP63226528A Pending JPH0275055A (en) 1988-09-12 1988-09-12 Master-slave switching method for multi-computer system

Country Status (1)

Country Link
JP (1) JPH0275055A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04355835A (en) * 1991-06-03 1992-12-09 Fujitsu Ltd Device with capability saving and restoring mechanism
WO2022074766A1 (en) * 2020-10-07 2022-04-14 日本電信電話株式会社 Multiplex transmission system and resource control method for multiplex transmission system
WO2022074763A1 (en) * 2020-10-07 2022-04-14 日本電信電話株式会社 Multiplex transmission system and resource control method for multiplex transmission system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04355835A (en) * 1991-06-03 1992-12-09 Fujitsu Ltd Device with capability saving and restoring mechanism
WO2022074766A1 (en) * 2020-10-07 2022-04-14 日本電信電話株式会社 Multiplex transmission system and resource control method for multiplex transmission system
WO2022074763A1 (en) * 2020-10-07 2022-04-14 日本電信電話株式会社 Multiplex transmission system and resource control method for multiplex transmission system

Similar Documents

Publication Publication Date Title
US6202149B1 (en) Automated application fail-over for coordinating applications with DBMS availability
EP0917057B1 (en) Multiprocessor computer architecture with multiple operating system instances and software controlled resource allocation
Lai et al. A model for availability analysis of distributed software/hardware systems
DE112011104471T5 (en) Method for failover management of virtual machines and system for supporting same
CN104123183B (en) Cluster job scheduling method and apparatus
CN109739634A (en) A kind of atomic task execution method and device
Fei et al. FlexNFV: Flexible network service chaining with dynamic scaling
JPH0275055A (en) Master-slave switching method for multi-computer system
CN109313581A (en) The method of simultaneously operating for multi-core processor
CN104486447A (en) Large platform cluster system based on Big-Cluster
JPH04311251A (en) Multiprocessor system
JPS589460B2 (en) Complex data processing unit/data processing equipment
JPH07334468A (en) Load distribution system
JPH0348937A (en) Input/output instruction executing system for virtual computer system
US10528391B1 (en) Execution manager for binary objects operating across private address spaces
JPH0296833A (en) Different type job control system
JPS588016B2 (en) Non-stop switching method of central processing unit in multi-computer system
JPH04148363A (en) Multi-computer system
JPH04364550A (en) Memory control method
JPS58217060A (en) Backup system of decentralized computer system
WO2020142025A1 (en) A data migration system by tdmf product
Kriloff A high-level language for use with multi-computer networks
JP2526480B2 (en) Interrupt control method in multiprocessor system
JPH03116337A (en) Mutual standby business processing device
JPS63208924A (en) Multiplex volume control system