JPS60100850A - Local area network - Google Patents
Local area networkInfo
- Publication number
- JPS60100850A JPS60100850A JP59171726A JP17172684A JPS60100850A JP S60100850 A JPS60100850 A JP S60100850A JP 59171726 A JP59171726 A JP 59171726A JP 17172684 A JP17172684 A JP 17172684A JP S60100850 A JPS60100850 A JP S60100850A
- Authority
- JP
- Japan
- Prior art keywords
- station
- transmission
- queue
- data
- terminal station
- 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.)
- Granted
Links
- 239000000872 buffer Substances 0.000 claims abstract description 27
- 230000015654 memory Effects 0.000 claims abstract description 16
- 238000007726 management method Methods 0.000 claims description 7
- 238000013500 data storage Methods 0.000 claims description 4
- 230000006870 function Effects 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract description 17
- 238000010586 diagram Methods 0.000 description 7
- 238000000034 method Methods 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000004220 aggregation Methods 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000003908 quality control method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
Description
【発明の詳細な説明】
〔産業上の利用分野〕
本発明は、ファクトリ−・オートメーション等の促進を
図ることのできるローカルエリアネットワークに関する
ものである。DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a local area network capable of promoting factory automation and the like.
工場における生産性向上のために近年ファクトリ−・オ
ートメーション（ＦＡ）化が叫ばれており、機械や装置
の自動化と同時に、その機械の稼動状態や負荷の分配に
始まり、生産結果の集計、更には歩留りの分析まで、個
々の機械単位に１理できるシステムが要望されるように
なってきている。In recent years, factory automation (FA) has been called for in order to improve productivity in factories.At the same time as automating machines and equipment, it is also important to understand the operating status and load distribution of the machines, as well as the aggregation of production results and even more. There is a growing demand for a system that can perform analysis on an individual machine basis, including yield analysis.
その一つとして、機械制御のマイクロコンピュータと、
生産管理や品質管理を行なうパーソナルコンピュータと
を結んで、生産現場のローカルエリアネットワーク（以
下［ＬＡＮＪという。）を構成できるような高信頼性の
情報伝送システムが望まれている。One of them is a mechanical control microcomputer,
There is a need for a highly reliable information transmission system that can be connected to personal computers that perform production management and quality control to form a local area network (hereinafter referred to as LANJ) at a production site.
ＬＡＮの一つに、マルチドロップ方式というのがあり、
これは第３図に示すように共通データバス（３１）に各
端末局（３２）〜（３４）をつなぎ、中央制御局（３５
）で各端末局からの情報や指令を制御するというもので
あり、情報の記憶のために中央１個所に共通メモリ（３
６）を設置するのが、従来の構成であった。One type of LAN is the multi-drop method.
As shown in Figure 3, each terminal station (32) to (34) is connected to a common data bus (31), and a central control station (35
) to control information and commands from each terminal station, and a common memory (3
6) was the conventional configuration.
しかしながら、従来のマルチドロップ方式では、規模に
応じて共通メモリ（３６）の容量を変えなげればならず
、小規模から大規模に容量変更する場合には共通メモリ
を容量アンプする必要があり、また情報授受の途中に端
末局に瞬時停電があったときにはデータの内容が壊れて
しまうという問題があった・
本発明者は、このような従来の問題を解消するため、第
４図に示すような新方式のＬＡＮについて提真を行なっ
た（特願昭５８−１２６５３４号、昭和５８年７７１１
２ Ｅｌ出願）。即ち、共通データバス（４１）で制御
局（４２）及び複数の端末局（４３−１）〜（４３−Ｎ
）をつなぐマルチドロップ方式のＬＡＮにおいて、共通
メモリを設ける代わりに、各端末局（４３−１）〜（４
３−Ｎ）に入出力データ記憶装置としての人力データ記
憶用不揮発バッファメモリ（４４−１）〜（４４−２）
及び出力データ記憶用不揮発バッファメモリ（４５−１
）〜（４５−Ｎ）を設り、端末機器としてパソコン又は
マイコン（４６−１）〜（４６−２）を接続したもので
ある。However, in the conventional multi-drop method, the capacity of the common memory (36) must be changed depending on the scale, and when changing the capacity from a small scale to a large scale, it is necessary to amplify the capacity of the common memory. In addition, there was a problem that the data contents would be destroyed if there was a momentary power outage at the terminal station during information exchange. In order to solve this conventional problem, the present inventor proposed a system as shown in Fig. 4. proposed a new type of LAN (Patent Application No. 126534/1983, 7711/1983).
2 El application). That is, a control station (42) and a plurality of terminal stations (43-1) to (43-N) are connected via a common data bus (41).
), instead of providing a common memory, each terminal station (43-1) to (43-1) to (43-1)
3-N) Non-volatile buffer memory for human data storage as an input/output data storage device (44-1) to (44-2)
and non-volatile buffer memory for output data storage (45-1
) to (45-N) are provided, and personal computers or microcomputers (46-1) to (46-2) are connected as terminal devices.
異なるデータを複数局へ送信すると、待ち行列バッファ
からは、書き込まれた順番にしか送信できない。このた
め、相手局の内の一局でも受信できない状態（受信バッ
ファが満杯であるとか、電源が投入されていない状態）
にあると、それに続く他局への送信が停滞状態となり送
信できないという問題点がある。When different data is sent to multiple stations, it can only be sent from the queue buffer in the order in which it was written. For this reason, even one of the partner stations cannot receive data (the reception buffer is full or the power is not turned on).
, there is a problem that subsequent transmissions to other stations become stagnant and cannot be transmitted.
本発明は、このような問題点を解消して、一部に受信で
きない状態にある局が存在しても、他の受信できる状態
にある局への送信を逐次送信することのできる構成のＬ
ＡＮを提供することを目的とするものである。The present invention solves these problems by providing an L system that is configured to sequentially transmit transmissions to other stations that can receive data even if some stations are unable to receive data.
The purpose is to provide AN.
〔問題点を解決するための手段、作用〕本発明は、待ち
行列形バッファのメモリ管理機構に、通常の一列の待ち
行列管理機構の他に相手局別の待ち行列管理機構を付加
することにより、この−列の待ち行列が動的に複数列の
可変長待ち行列として機能するようにしたものである。[Means and effects for solving the problem] The present invention adds a queue management mechanism for each partner station to the memory management mechanism of the queue type buffer in addition to the usual queue management mechanism for one line. , this - column queue dynamically functions as a multi-column variable length queue.
不揮発バッファメモリとして、待ち行列バッファメモリ
を使用して端末側とネットワーク側とのデータの授受を
行なう場合、データは宛先と対になってデータバッファ
、宛先バッファに、待し行列形式で先着順に登録される
。When a queue buffer memory is used as a nonvolatile buffer memory to exchange data between the terminal side and the network side, data is paired with the destination and registered in the data buffer and destination buffer in a queue format on a first-come, first-served basis. be done.
登録された宛先は、宛先別データ数計数部により、宛先
別のデータ数を計数する。これにより読み出し側はデー
タの宛先別読み出しの制御を行ない、書き込み側は待も
行列バッファの空き状況および読め出し状況を知ること
ができる。For the registered destinations, the number of data for each destination is counted by the destination-specific data number counting section. As a result, the reading side can control the reading of data by destination, and the writing side can know the empty status of the queue buffer and the reading status.
読め出し側は、個々の宛先の書き込み順番を壊さずに、
宛先別読み出しが可能になる。これにより待ち行列が動
的に多重化される。On the reading side, without destroying the writing order of individual destinations,
Reading by destination becomes possible. This dynamically multiplexes the queues.
その結果、一部に受信できない状態にある局への送信は
保Ｗ／Ｌ、受信できる状態にある局への送信を逐次行な
うことができる。As a result, it is possible to maintain W/L for transmissions to stations that are partially unable to receive signals, and to sequentially perform transmissions to stations that are able to receive signals.
以下、本発明を図面に示す実施例に基づいて説明する。 Hereinafter, the present invention will be explained based on embodiments shown in the drawings.
第１図は、多重化待ぢ行列ハフファの構成例を示すもの
であり、データは宛先と対になってデータハソソア１〕
１〜Ｄい宛先バッファＡ１〜Ａ９に、待ら行列形式で先
着順に登録される。FIG. 1 shows an example of the configuration of a multiplexed waiting queue, in which data is paired with a destination.
They are registered in destination buffers A1 to A9 of numbers 1 to D on a first-come, first-served basis.
第２図は、制御局（２）からのデータの送受信を２木の
伝送線（ＩＡ）、（ＩＢ）で行なう場合のプロ・ツク図
であり、この図により信号の処理を説明する。FIG. 2 is a process diagram for transmitting and receiving data from the control station (2) using two transmission lines (IA) and (IB), and the signal processing will be explained with reference to this diagram.
■ 端末へに、端末Ｂ、Ｃへのデータが発生すると、送
信用待ち行列バッファの空きを確認して端末Ａから端末
局（３）への書き込みが行なわれる。(2) When data to be sent to terminals B and C is generated, the data is written from terminal A to terminal station (3) after confirming whether the transmission queue buffer is empty.
■ 制御局（２）から、端末局（３）が選択されると、
端末局（３）は送信待ち行列バッファの宛先別データ数
を送る。■ When the terminal station (3) is selected from the control station (2),
The terminal station (3) sends the number of data for each destination in the transmission queue buffer.
■ 制御局（２）は、■項の宛先別データ数より端末局
（４）へのデータ書き込みが可能かどうか、端末局（４
）の受信用待ち行列バッファの空き状態を確認する。■ The control station (2) checks whether it is possible to write data to the terminal station (4) based on the number of data by destination in section ■.
) check the free status of the reception queue buffer.
制御局（２）は０項の情報により、端末局（４）の受信
用待ち行列バッファに空きがあるならば、次の０項、０
項の処理により端末局（３）から端末局（４）へのデー
タ転送を行なう。もし、空きがなければ端末局（５）の
処理■′を行なう。Based on the information of the 0th term, the control station (2) uses the information of the 0th term, and if there is space in the receiving queue buffer of the terminal station (4), the next 0th term, 0
Data is transferred from the terminal station (3) to the terminal station (4) by the processing in section 2. If there is no vacancy, the terminal station (5) performs processing ``■''.
■ 制御局（２）は、端末局（３）から端末局（４）へ
のデータを、端末局（１）の送信用待ち行列ハ・ノファ
から読み取る。■ The control station (2) reads data from the terminal station (3) to the terminal station (4) from the transmission queue HaNofa of the terminal station (1).
■ ０項の処理により読み取られたデータは、制御局（
２）より端末局（４）の受信用待ち行列バッファへ書き
込む。■ The data read by the process in item 0 is sent to the control station (
2) writes to the receiving queue buffer of the terminal station (4).
■′ これｉＪ■項と同様に端末局（５）について調べ
る。■' Check the terminal station (5) in the same way as in section iJ■.
ここで、端末局（５）の受信用待ち行列バッファが空で
なＬ）れば、ここで端末局（３）の処理を中断し°ζ、
制御局（２）は別の端末局の処理を行なう。Here, if the reception queue buffer of the terminal station (5) is not empty, the processing of the terminal station (3) is interrupted here,
The control station (2) performs processing for another terminal station.
■′ これは０項と同様の処理を端末局（５）へ行なう
ものである。■' This is to perform the same processing as in item 0 to the terminal station (5).
■、■′ これは、端末Ｂ、端末Ｃが端末局（４）。■, ■' In this case, terminal B and terminal C are terminal stations (4).
端末局（５）の受信用データバッファを読み出すことに
より、端末Δからのデータを知るものである。By reading the reception data buffer of the terminal station (5), the data from the terminal Δ is known.
−に連したように本発明によれば、異なるデータを複数
局へ送信する場合、一旦バソファに書き込んで、一部に
受信できない状態にある局への送信は保留し、他の受信
できる状態にある局への送信を逐次行ない、前記保留し
た局が受信できる状態になった場合に送信を行なうこと
ができ、しかも限られたバッファ容量を有効に機能させ
ることができるという効果を奏するものである。According to the present invention, when transmitting different data to multiple stations, the data is once written to the bath sofa, and transmission to some stations that are unable to receive data is put on hold, and the data is transferred to other stations that are able to receive data. Transmission to a certain station can be carried out sequentially, and the transmission can be carried out when the station on hold is ready to receive data, and the limited buffer capacity can be used effectively. .
第１図は本発明に係る多重化待ち行列バッファの説明図
、第２図は異なるデータを同時に複数局へ送信するだめ
の機構の説明図、第３図は従来のマルチドロップ方式の
ローカルエリアネットワークの構成を示すブロック図、
第４図は本発明を適用するためのロー力ルエリアネソ１
−ワークの構成を示すブロック図である。
（ｌΔ）、 （ＩＢ） ：データハス
（２）二制御局
（３）〜（５）：端末局
特許出願人 株式会社コンピュータ・テクニカ代理人
小板 益（ばか２名）
第１図
第２図
１ΔFig. 1 is an explanatory diagram of a multiplexed queue buffer according to the present invention, Fig. 2 is an explanatory diagram of a mechanism for transmitting different data to multiple stations at the same time, and Fig. 3 is an explanatory diagram of a conventional multi-drop local area network. A block diagram showing the configuration of
Figure 4 shows the low force Luerianeso 1 for applying the present invention.
- It is a block diagram showing the structure of a workpiece. (lΔ), (IB): Data Hass (2) Two control stations (3) to (5): Terminal station Patent applicant Computer Technica Co., Ltd. Agent
Masu Koita (2 idiots) Figure 1 Figure 2 1Δ
Claims (1)
ータ記ｔα装置としての不揮発バッファメモリを備えた
ｌ」−カルエリアネットワークにおいて、前記不揮発バ
ッファメモリのメモリ管理機構に通當の−・列の待ち行
列管理機構の他に相手局別の待ぢ行列管理機構を付加し
て多重化待ち行列バッファメモリとし、この−列の待ち
行列を動的に複数列の可変長待ち行列として機能するよ
うにしたことを特徴とするロー力ルエリアネノＦ・ワー
ク。1. In a local area network in which each terminal station connected to a common data bus is equipped with a non-volatile buffer memory as an input/output data storage device, a column that is connected to the memory management mechanism of the non-volatile buffer memory is provided. In addition to the queue management mechanism, a queue management mechanism for each partner station is added to create a multiplexed queue buffer memory, so that this queue can dynamically function as a variable-length queue with multiple columns. A low force Luerianeno F work that is characterized by the following.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP59171726A JPS60100850A (en) | 1984-08-17 | 1984-08-17 | Local area network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP59171726A JPS60100850A (en) | 1984-08-17 | 1984-08-17 | Local area network |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP58126534A Division JPS6018039A (en) | 1983-07-12 | 1983-07-12 | Local network system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS60100850A true JPS60100850A (en) | 1985-06-04 |
| JPH0542859B2 JPH0542859B2 (en) | 1993-06-29 |
Family
ID=15928534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP59171726A Granted JPS60100850A (en) | 1984-08-17 | 1984-08-17 | Local area network |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS60100850A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS6253046A (en) * | 1985-09-02 | 1987-03-07 | Matsushita Electric Ind Co Ltd | Communication equipment for data of industrial robot |
| US5559710A (en) * | 1993-02-05 | 1996-09-24 | Siemens Corporate Research, Inc. | Apparatus for control and evaluation of pending jobs in a factory |
-
1984
- 1984-08-17 JP JP59171726A patent/JPS60100850A/en active Granted
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS6253046A (en) * | 1985-09-02 | 1987-03-07 | Matsushita Electric Ind Co Ltd | Communication equipment for data of industrial robot |
| US5559710A (en) * | 1993-02-05 | 1996-09-24 | Siemens Corporate Research, Inc. | Apparatus for control and evaluation of pending jobs in a factory |
| US5721686A (en) * | 1993-02-05 | 1998-02-24 | Siemens Corporate Research, Inc. | Method and apparatus for control and evaluation of pending jobs in a factory |
Also Published As
| Publication number | Publication date |
|---|---|
| JPH0542859B2 (en) | 1993-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JPS60100850A (en) | Local area network | |
| JPH0666061B2 (en) | Multi CPU communication device | |
| JPS6018039A (en) | Local network system | |
| CN1005658B (en) | Device Interface Controller | |
| JPS6232748A (en) | Data transfer equipment | |
| JPH0511341B2 (en) | ||
| Hedberg | The multiple crossbar network interface | |
| KR0174652B1 (en) | Method and apparatus for data transmission in burst mode multiple monitoring method | |
| JPH0410050A (en) | Computer system | |
| JPH04287153A (en) | parallel computer system | |
| JPS60220646A (en) | Inter-task communication system | |
| JPH01282663A (en) | Preferential control system | |
| JPH0681140B2 (en) | Local area network | |
| JPS6262643A (en) | Data transmission system | |
| JPS6118060A (en) | Data processing system | |
| JPS5923652A (en) | Data transfer processing system | |
| JPH04150536A (en) | Bridge device | |
| JPS5952947A (en) | Two-way communication method | |
| JPS61260350A (en) | Parallel processing control method | |
| JPS5955507A (en) | Control system of parallel processing type programmable controller | |
| JPH04274635A (en) | Multi-communication system | |
| JPH02144648A (en) | Data transfer control method | |
| JPH04283858A (en) | Order reception management system | |
| JPH063928B2 (en) | Communication device | |
| JPH02299058A (en) | Communication system between computer systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| LAPS | Cancellation because of no payment of annual fees |