JPS6226547A - Storage assigning system in storage device - Google Patents

Storage assigning system in storage device

Info

Publication number
JPS6226547A
JPS6226547A JP60166204A JP16620485A JPS6226547A JP S6226547 A JPS6226547 A JP S6226547A JP 60166204 A JP60166204 A JP 60166204A JP 16620485 A JP16620485 A JP 16620485A JP S6226547 A JPS6226547 A JP S6226547A
Authority
JP
Japan
Prior art keywords
data
volume
page
storage device
stored
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
JP60166204A
Other languages
Japanese (ja)
Inventor
Yukihiro Maeda
前田 幸博
Atsushi Kai
篤 貝
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.)
Fujitsu Ltd
Original Assignee
Fujitsu 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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP60166204A priority Critical patent/JPS6226547A/en
Publication of JPS6226547A publication Critical patent/JPS6226547A/en
Pending legal-status Critical Current

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

PURPOSE:To improve the reliability of data processing by constituting a storage device of plural pieces of volumes, and also subdividing the volume so as to be designated by a table for showing assigned data of each page. CONSTITUTION:A storage device is constituted of plural volumes 1-3, and in each volume, data for laying out space ranging through plural pages is stored so as to correspond to each page. In that case, each volume is further divided into blocks 11, 12... and assigned data of each page is stored, and also its assignment is shown clearly in a table. This assignment is executed so that a busy column is stored in a different volume as equally as possible. Also, when data of a desired quantity is extracted from each volume at a desired time point and space is manufactured in the lump, maintenance of the data is executed at every prepared column (page), by which it does not occur that the whole system for preparing a newspaper becomes down. In this way, the reliability of a data processing can be improved.

Description

【発明の詳細な説明】 [1既要コ 新聞紙面製作用のデータを格納するような情報処理シス
テムの記憶装置について、複数個のボリュームで記憶装
置を構成し、且つテーブルで分割指定するように更にボ
リュームを細分化して、データ処理の信頼性を向上でき
るようにしたものである。
[Detailed Description of the Invention] [1] Regarding the storage device of an information processing system that stores data for producing newspaper pages, the storage device is configured with a plurality of volumes, and the division is specified using a table. The volume is further subdivided to improve the reliability of data processing.

[産業上の利用分野] 本発明は情報処理システムの記憶装置において、複数の
ボリュームで構成した記憶装置であって、且つ1つのボ
リュームを細分化して効率の良い割当を行う記憶装置へ
の格納割当方式に関する。
[Industrial Application Field] The present invention relates to a storage device for an information processing system, which is a storage device composed of a plurality of volumes, and which is capable of efficiently allocating storage by dividing one volume into smaller pieces. Regarding the method.

[従来の技術] 新聞紙面を作成するときなど大量のデータを記憶装置に
格納してから、電子計算機を利用し編集・訂正などを繰
返すことが実行されている。このとき記憶装置として直
接アクセス記憶装置DASDと呼ばれる大容量の記憶装
置を複数個使用している。各DASDはボリュームと呼
ばれている。新聞紙面で例えば社会面の記事のように、
ユーザ(新聞製作者)から見た論理的データの一つの固
まりが、常に単一のボリュームに存在するとは限らず、
多くの場合記事の到来時刻や記事の量に差があるため、
複数のボリュームに跨ってデータが散在することとなる
。ユーザは所望の時点で、各記憶装置から所望量のデー
タを抽出し、まとめて新聞面を製作する。
[Prior Art] When creating a newspaper page, a large amount of data is stored in a storage device and then edited and corrected repeatedly using a computer. At this time, a plurality of large-capacity storage devices called direct access storage devices (DASD) are used as storage devices. Each DASD is called a volume. For example, in a newspaper, like an article on social issues,
A logical chunk of data from the user's (newspaper producer's) perspective does not always exist in a single volume;
In many cases, there are differences in the arrival time of articles and the amount of articles, so
Data will be scattered across multiple volumes. The user extracts a desired amount of data from each storage device at a desired time and collectively creates a newspaper page.

[発明が解決しようとする問題点] 何れかのボリュームに機構的障害が発生すると、紙面作
成がストップすることになる。また記事の集まり方に時
間的ばらつきがあり、電子計算機にとって大きな負荷と
なる時間帯ができる。そして現行のやり方では負荷を分
散することは極めて難しい。
[Problems to be Solved by the Invention] If a mechanical failure occurs in any volume, paper production will stop. Additionally, there are temporal variations in the way articles are collected, creating time periods that place a heavy load on computers. And it is extremely difficult to distribute the load using current methods.

本発明の目的は前述の問題点を改善するため、記憶装置
におけるデータの信頼性を向上し、負荷を分散すること
を可能とした記憶装置へのデータ格納方式を提供するこ
とにある。
SUMMARY OF THE INVENTION An object of the present invention is to provide a method for storing data in a storage device that improves the reliability of data in the storage device and makes it possible to distribute the load in order to improve the above-mentioned problems.

[問題点を解決するための手段] 前述の目的を達成するため本発明が採用した手段は、複
数ページにわたる紙面製作用のデータを複数の異なる記
憶装置に格納し、所望の時点で各記憶装置から所望量の
データを抽出しまとめて製作する情報処理システムの前
記記憶装置への割当方式において、 記憶装置は複数のボリュームで構成して各ボリュームに
は各ページ対応のデータを格納し、更に各ボリュームを
分割して格納したページ毎の割当データを示すテーブル
を具備することである。
[Means for Solving the Problems] The means adopted by the present invention to achieve the above-mentioned object is to store data for paper production over a plurality of pages in a plurality of different storage devices, and to store data for each storage device at a desired time. In the above-mentioned storage device allocation method for an information processing system in which a desired amount of data is extracted from and collectively produced, the storage device is composed of a plurality of volumes, each volume stores data corresponding to each page, and The present invention is to provide a table showing allocation data for each page in which a volume is divided and stored.

[作用] 新聞紙面のように紙面(ページ)とボリュームと   
゛を対応付けてデータが割当格納されている。したがっ
て一旦格納の後、訂正・追加などを行う場合、テーブル
の内容をデータと対応させて目的のボリュームを見出せ
ば良い。
[Function] Like a newspaper, the paper surface (page) and volume
Data is allocated and stored in association with each other. Therefore, once stored, if corrections or additions are to be made, the target volume can be found by correlating the contents of the table with the data.

〔実施例] 第1図は本発明の実施例として新聞紙面作成に通用した
場合の構成を示す図で、第1図Aはボリュームの分は方
を、第1図Bはテーブルの例を示す。
[Example] Figure 1 is a diagram showing the configuration of an example of the present invention when it is used for creating newspaper pages. Figure 1A shows the volume, and Figure 1B shows an example of a table. .

第1図Aにおいて、 1.2.3は第1ボリユーム、第2ボリユーム、・・1
1.21.・・・・・〜は第1ボリユームの1区画、2
区画− 2L、22.−は第2ボリユームの1区画、2区画−を
示している。
In Figure 1A, 1.2.3 is the first volume, the second volume,...1
1.21.・・・・・・〜 is 1 section of the 1st volume, 2
Section - 2L, 22. - indicates the 1st section and 2nd section of the second volume.

また第1図Bにおいて、4はテーブル全体を示している
。第1図において各ボリュームの割当ては、第2図に示
すように実行する。即ち新聞作成面の「−面」 (例え
ば政治記事面)、「社会面」を縦軸に、時刻を横軸に取
り、更に各紙面について版数を更新して行くとき、横線
が集まっている時刻が仕事中のため忙しいことを示す。
Further, in FIG. 1B, 4 indicates the entire table. In FIG. 1, allocation of each volume is performed as shown in FIG. 2. In other words, when we take the "-" side of the newspaper production side (for example, the political article side), the "social side" on the vertical axis, and the time on the horizontal axis, and then update the edition number for each page, the horizontal lines converge. Indicates that you are busy because the time is at work.

例えば12時から午後1待遇ぎまでは夕刊の編集で忙し
い面が多い。
For example, from 12:00 until the first hour in the afternoon, I am often busy editing the evening edition.

そのため第1図Bに示すテーブルには忙しい面が異なる
ボリュームに、できるだけ均等に格納されるように割当
を行う。そのため「−面」が7〜9版のように更新され
るとき、「ラジオ・テレビ面」の格納・更新に影響を与
えない。
Therefore, in the table shown in FIG. 1B, the busy areas are allocated to different volumes so that they are stored as evenly as possible. Therefore, when the "- side" is updated as in the 7th to 9th editions, it does not affect the storage and updating of the "radio/television side".

作成の運用上、作成面(ページ)毎にデータの保全をは
かることで良く新聞作成のシステム全体がダウンするこ
とはない。例えば空きDASDを1個用意しておけば、
[8発生のときデータ転送を行えば良いからである。
In terms of production operations, it is best to protect the data for each production page (page) to prevent the entire newspaper production system from going down. For example, if you prepare one free DASD,
[This is because it is sufficient to perform data transfer when 8 occurs.

また、大きな記事のようにタイトル・記事本文・解説が
1まとめとなっているとき、編集終了とするためには、
各パートの完了を順次排他処理して確認していく必要が
あるが、本発明ではその処理のため他のボリュームにつ
いて排他処理を行う必要はなく、また同一ボリューム内
の他の区画についても行う必要がない。
Also, when the title, article text, and explanation are all combined into one, such as a large article, in order to finish editing,
Although it is necessary to perform exclusive processing and check the completion of each part sequentially, in this invention, it is not necessary to perform exclusive processing for other volumes, and it is also necessary to perform exclusive processing for other partitions within the same volume. There is no.

本発明は新聞紙面作成に限定されることなく、多量のデ
ータを異なる面に処理して行くときに適応できる。
The present invention is not limited to the production of newspaper pages, but can be applied to processing a large amount of data on different pages.

[発明の効果] 、このようにして本発明によると時間的に異なる密度で
入ってくるデータについて、同時間帯では異なる記憶装
置により格納させ、且つその割当をテーブルに明確にし
ておくから、障害に対しシステムダウンすることなく、
データ処理の信頼性が向上する。また中央処理装置に対
し動作上負荷となることはデータ格納を適度に行うこと
により、大きく軽減できる。
[Effects of the Invention] In this way, according to the present invention, data that comes in at different densities in time are stored in different storage devices during the same time period, and the allocation is clearly defined in the table, so that problems can be avoided. without system down.
Improved reliability of data processing. Furthermore, the operational load on the central processing unit can be greatly reduced by storing data appropriately.

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

第1図A、Bは本発明の実施例の構成を示す図、第2図
は本発明の実施例におけるテーブルを示す図である。 1.2.3−ボリューム 11.12・・・・・−21,22・・・・・・区画4
−テーブル
FIGS. 1A and 1B are diagrams showing the configuration of an embodiment of the present invention, and FIG. 2 is a diagram showing a table in the embodiment of the present invention. 1.2.3-Volume 11.12...-21,22...Partition 4
-table

Claims (1)

【特許請求の範囲】 複数ページにわたる紙面製作用のデータを複数の異なる
記憶装置に格納し、所望の時点で各記憶装置から所望量
のデータを抽出しまとめて製作する情報処理システムの
前記記憶装置への割当方式において、 記憶装置は複数のボリューム(1)(2)(3)・・・
・・で構成して、各ボリュームには各ページ対応のデー
タを格納し、更に各ボリュームを分割して格納したペー
ジ毎の割当データを示すテーブル(4)を具備すること
を特徴とする記憶装置への格納割当方式。
[Scope of Claims] The storage device of an information processing system that stores data for paper production over a plurality of pages in a plurality of different storage devices, and extracts a desired amount of data from each storage device at a desired time to collectively produce the data. In the allocation method, the storage device has multiple volumes (1) (2) (3)...
..., each volume stores data corresponding to each page, and is further equipped with a table (4) showing allocation data for each page stored by dividing each volume. storage allocation method.
JP60166204A 1985-07-27 1985-07-27 Storage assigning system in storage device Pending JPS6226547A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP60166204A JPS6226547A (en) 1985-07-27 1985-07-27 Storage assigning system in storage device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP60166204A JPS6226547A (en) 1985-07-27 1985-07-27 Storage assigning system in storage device

Publications (1)

Publication Number Publication Date
JPS6226547A true JPS6226547A (en) 1987-02-04

Family

ID=15827018

Family Applications (1)

Application Number Title Priority Date Filing Date
JP60166204A Pending JPS6226547A (en) 1985-07-27 1985-07-27 Storage assigning system in storage device

Country Status (1)

Country Link
JP (1) JPS6226547A (en)

Similar Documents

Publication Publication Date Title
CA2150745C (en) Method and apparatus for implementing partial declustering in a parallel database system
DE112018005869T5 (en) STRUCTURE ADAPTATION OF A NAME SPACE ASSIGNMENT IN NON-VOLATILE STORAGE DEVICES
CN106201355A (en) Data processing method and device and storage system
JPS6310250A (en) Managing system for virtual logical volume
DE102017118341B4 (en) Repartitioning of data in a distributed computer system
JPS6226547A (en) Storage assigning system in storage device
JP2633342B2 (en) Information retrieval device
JPS633349A (en) Processing system for allocating file space
JPH04120663A (en) System for allocating data base area
JPH07101394B2 (en) Automatic matching method
JPS58222360A (en) File management system
CN105589876A (en) Method and device for creating dynamic cursor pool for Mysql database and method and device for processing concurrent request under multithreading
JPS59216261A (en) Split formation file system
JPH0296277A (en) Picture data control system
JPS59119386A (en) Buffer area controlling system
JPH05197599A (en) File space management system
JPS62274420A (en) Automatic allocating system for data set
JPS61125671A (en) Data transfer control system
JPH03166628A (en) Memory managing method
JPH01274256A (en) Memory managing system
JPH0314042A (en) Resource management system for data base
JPH01191229A (en) File control system
JPH04223537A (en) Image file storing system
JPH0612299A (en) Space rearranging system by reallocation processing
JPS62259153A (en) Main storage management system