JPS5818747A - File controlling system - Google Patents

File controlling system

Info

Publication number
JPS5818747A
JPS5818747A JP56115941A JP11594181A JPS5818747A JP S5818747 A JPS5818747 A JP S5818747A JP 56115941 A JP56115941 A JP 56115941A JP 11594181 A JP11594181 A JP 11594181A JP S5818747 A JPS5818747 A JP S5818747A
Authority
JP
Japan
Prior art keywords
stored
memory
files
file
high speed
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
Application number
JP56115941A
Other languages
Japanese (ja)
Other versions
JPH027108B2 (en
Inventor
Takashi Ogawa
隆 小川
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 JP56115941A priority Critical patent/JPS5818747A/en
Publication of JPS5818747A publication Critical patent/JPS5818747A/en
Publication of JPH027108B2 publication Critical patent/JPH027108B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

PURPOSE:To take out highly frequently used files at high speed, by controlling files in such a way that recently used files are always stored in a random memory and, at the same time, the indexes of the files are stored in a high speed memory in the table. CONSTITUTION:Files FA-FS are stored in a random access memory 5, a disk device 6, and a magnetic tape device 7. A table T is stack type one which controls the files FA-FS and is composed of a high speed, a medium speed, and a low speed memory. Indexes A-S of the files FA-FS are stored in the table T. When the file FR is to be read out, a processor 4 searches the table T and knows that in which device the file FR is stored. Then, a memory controlling section 8 stores the file FR stored in the device 7 in a main memory 1 and performs necessary processings. After the necessary processings are performed, the file FR is again stored in the device 7 by moving the storing location of the other files. Moreover, the index R is stored in the high speed memory in the table T and the other indexes are successively moved.

Description

【発明の詳細な説明】 本発明はデータが収容されるファイルを管理するファイ
ル管理方式に関する。
DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a file management method for managing files in which data is stored.

処理システムの大型化に伴い、蓄積すべき情報量の飛躍
的な増大に伴い、データを格納する記憶部+Itとして
は高速で、しかも大容量、且つ低価格が要求される。し
かし前記3つの条件を2個々の記憶装置が同時に満たす
仁とは峻しいが、メモリシステム又はファイルシステム
としては実現は可能である。従来方式では、高速、中速
及び低速の各記憶装置にデータを格納せしめ、各記憶装
置を使い分ける方式が採用されている。このように構築
されたメモリシステムにおいても、所要のファイルにア
クセスを要する場合、その平均アクセス時間は必ずしも
短かくない欠点を有する。
As processing systems become larger and the amount of information to be stored increases dramatically, storage units +It for storing data are required to be high-speed, large-capacity, and low-priced. However, although it is difficult for two individual storage devices to simultaneously satisfy the above three conditions, it is possible to implement it as a memory system or a file system. In the conventional method, data is stored in high-speed, medium-speed, and low-speed storage devices, and each storage device is used appropriately. Even in a memory system constructed in this manner, the average access time is not necessarily short when a required file needs to be accessed.

本発明は上記の欠点を鱗決するためになされたもので、
ファイルへのアクセス時間を短縮するファイル管理方式
の提供を目的とする。
The present invention was made to solve the above-mentioned drawbacks,
The purpose is to provide a file management method that reduces file access time.

本発明は、処理装置と、記憶部とを有する処理システム
において、アクセス速度の異なる複数の記1意装置で構
成される記憶部と、該記憶部に格納されるファイルを管
理するテーブルとを備え、前記処理装置が前記記憶部か
ら所要ファイルを取出して処理を実行したのち、該ファ
イルを前記記憶部の最高速のアクセス速度を有する記憶
装置に格納せしめることを特徴とするファイル管理方式
でらる0 以下2本発明を図面によって説明する。図面は本発明の
一実施例を説明するブロック図であり。
The present invention provides a processing system having a processing device and a storage unit, which includes a storage unit configured of a plurality of memory devices having different access speeds, and a table for managing files stored in the storage unit. , wherein the processing device retrieves a required file from the storage unit and executes processing, and then stores the file in a storage device having the fastest access speed of the storage unit. 0 The present invention will be explained below with reference to the drawings. The drawing is a block diagram illustrating an embodiment of the present invention.

1は主記憶装置、2.3は領域、4はプロセサ。1 is the main memory, 2.3 is the area, and 4 is the processor.

5はランダムアクセスメモリ、6はディスク装置。5 is a random access memory, and 6 is a disk device.

7は磁気テープ装置、8はメモリ制御部# At  B
jC*  Ds  E* Gt  L  Jt Kt 
 Ot  P*  Q+  Rt  8はインデックス
、Flt FDt Flt Fx、 FOt FR+ 
Fs*はファイル、Hは高速メモリ、Mは中速メモリ。
7 is a magnetic tape device, 8 is a memory control unit # At B
jC* Ds E* Gt L Jt Kt
Ot P* Q+ Rt 8 is index, Flt FDt Flt Fx, FOt FR+
Fs* is a file, H is a high-speed memory, and M is a medium-speed memory.

Lは低速メモリ、Tはテーブルt  hIt htt 
h@。
L is low-speed memory, T is table hIt htt
h@.

1110t  tnll  ml、  ms、  ml
6 111g、   11 +   4s  j、、 
 Llnはアドレスである。図面に示すようにランダム
アクセスメモリ5.デイスク装置6及び磁気テープ装置
7でファイルシステムを構成し、これにファイルFム〜
F8が格納されている0図面におけるテーブルTは、高
速メそりH9中速メモリM及び低速メモリLで構成され
、前記ファイルFA−PIを管理するスタック形式のテ
ーブルであり、各々に。
1110t tnll ml, ms, ml
6 111g, 11 + 4s j,,
Lln is an address. 5. Random access memory as shown in the drawing. A file system is configured with the disk device 6 and the magnetic tape device 7, and the file Fm~
The table T in the drawing 0 in which F8 is stored is a stack-type table that is composed of a high-speed memory H9, a medium-speed memory M, and a low-speed memory L, and manages the files FA-PI.

ファイルFム〜F8のインデックスA−8が格納されて
いる。
Index A-8 of files Fm to F8 is stored.

図面において、プロセサ4が9例えばファイルFRにア
クセスする場合、メモリ制御部8はテーブルTをサーチ
する。紫−チの順序は高速メモリH〜低速メモリLO順
である。低速メモリLのアドレス4からファイルFlの
インデックスRが取出されると、これに基いてメモリ制
御部8は磁気テープ装置7内のファイルF、を読出して
、これを主記憶装置1の領域3に格納する◎プロセサ4
は。
In the drawing, when the processor 4 accesses the file FR, the memory controller 8 searches the table T. The order of purple-chi is from high-speed memory H to low-speed memory LO. When the index R of the file Fl is retrieved from the address 4 of the low-speed memory L, the memory control unit 8 reads the file F in the magnetic tape device 7 based on this and stores it in the area 3 of the main storage device 1. Store ◎Processor 4
teeth.

このファイルFR内のデータに関わる処理を実行し。Execute processing related to the data in this file FR.

処理完了と共に、その完了をメモリ制御部8に通知する
・メモリ制#8は、領域3のファイルFM&を、ランダ
ムアクセスメモリ5に格納し、を九ランダムアクセスメ
モリ5内のファイルF D kmディスク装置6へ転送
して格納し、さらにディスク装置6内のファイルpKを
磁気テープ装置7へ転送して格納する。一方、メモリ制
御部8はテーブルTへ前記ファイル凡のインデックスR
を格納するが、この場合は高速メモリHの最上位のアド
レスh、に格納する。既述のように高速メモリH〜低速
メモリLはスタック形式であるので、アドレスh1のイ
ンデックスAはアドレスh富へ、そしてアドレスha 
O4ンデックスBagoアドレスへとシフトされる0同
411にアドレスhIoのインデックスDは中速メモリ
Mのアドレスm1へ、を九アドレスm1(1のインデッ
クスには低速メモリLのアドレス11へとシフトされる
。このようにテーブルT内のインデックスの配列順がj
!新される。
Upon completion of the process, the memory controller 8 is notified of the completion.Memory system #8 stores the file FM& in the area 3 in the random access memory 5, and stores the file FM& in the random access memory 5 in the 9 random access memory 5. Further, the file pK in the disk device 6 is transferred to the magnetic tape device 7 and stored therein. On the other hand, the memory control unit 8 stores the index R of the file in the table T.
In this case, it is stored at the highest address h of the high-speed memory H. As mentioned above, high-speed memory H to low-speed memory L are in stack format, so index A of address h1 goes to address h, and then to address ha.
The index D of the address hIo is shifted to the address m1 of the medium-speed memory M, and the index D of the address hIo is shifted to the address m1 of the medium-speed memory M, and the index D of the address hIo is shifted to the address m1 of the low-speed memory L to the index of 9 address m1 (1). In this way, the order of the indexes in table T is j
! be renewed.

以上のように本発明は、*近時に使用噛れたファイルを
、常にランダムアクセスメモリに貯え。
As described above, the present invention *always stores recently used files in random access memory.

且つ該ファイルのインデックスもテーブル内の高速メモ
リに格納してファイルを管環するものであり、′f用s
tLの高いファイルを高速に取出し得る利点を有する。
In addition, the index of the file is also stored in the high-speed memory in the table to manage the file.
It has the advantage that files with high tL can be retrieved at high speed.

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

図面は本発明の一実施例を説明するブロック図でめり9
図中に用い九符号は次の通りである◎1は主記憶装置、
2,3は領域、4はプロセサ。 5はランダムアクセスメモリ、6はディスク装置。 7は磁気テープ装置、8はメモリ制御部I AS Bj
C*  Ds  E+  Gt  L  Jt Kt 
0+  P*  Q*  RI  Sはインデックス、
Flt FDt Fms FKt F(b Flt F
&はファイル、Hd^速メ子メモリ祉中速メモリ。 Lは低速メモリ、Tはテーブル、hI、hl、h□ht
o  s  ms +  met  mas  me 
番 ml@、  z、  I  41  z、、  z
。 はアドレスを示す。
The drawings are block diagrams illustrating one embodiment of the present invention.
The nine symbols used in the figure are as follows: ◎1 is the main memory;
2 and 3 are areas, and 4 is a processor. 5 is a random access memory, and 6 is a disk device. 7 is a magnetic tape device, 8 is a memory control unit I AS Bj
C* Ds E+ Gt L Jt Kt
0+ P* Q* RI S is index,
Flt FDt Fms FKt F(b Flt F
& is a file, Hd ^ fast memory, medium speed memory. L is low-speed memory, T is table, hI, hl, h□ht
o s ms + met mas me
Number ml@, z, I 41 z,, z
. indicates an address.

Claims (1)

【特許請求の範囲】[Claims] 処理装置と、記憶部とを有する処理システムにおいて、
アクセス速度の異なる複数の記憶装置で構成される記憶
部と、該記憶部に格納されるファイルt−管理するテー
ブルとを備え、前記処理装置が繭記記1部から所要ファ
イルを取出して処理を実行したのち、該ファイルを前記
記憶部の最高速のアクセス速度を有する記は装置に格納
せしめることを特徴とするファイル管理方式。
In a processing system including a processing device and a storage unit,
The processing device is equipped with a storage unit composed of a plurality of storage devices with different access speeds and a table for managing files stored in the storage unit, and the processing device extracts the required files from the first copy of Mayukiki and processes them. A file management method characterized in that, after execution, the file is stored in a device having the highest access speed of the storage section.
JP56115941A 1981-07-24 1981-07-24 File controlling system Granted JPS5818747A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP56115941A JPS5818747A (en) 1981-07-24 1981-07-24 File controlling system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP56115941A JPS5818747A (en) 1981-07-24 1981-07-24 File controlling system

Publications (2)

Publication Number Publication Date
JPS5818747A true JPS5818747A (en) 1983-02-03
JPH027108B2 JPH027108B2 (en) 1990-02-15

Family

ID=14674963

Family Applications (1)

Application Number Title Priority Date Filing Date
JP56115941A Granted JPS5818747A (en) 1981-07-24 1981-07-24 File controlling system

Country Status (1)

Country Link
JP (1) JPS5818747A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS63231576A (en) * 1987-03-20 1988-09-27 Fujitsu Ltd Personal verification device
JPH01128127A (en) * 1987-11-13 1989-05-19 Fujitsu Ltd Access processing method for dictionary file

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS52112256A (en) * 1976-03-17 1977-09-20 Ibm Inquiry system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS52112256A (en) * 1976-03-17 1977-09-20 Ibm Inquiry system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS63231576A (en) * 1987-03-20 1988-09-27 Fujitsu Ltd Personal verification device
JPH01128127A (en) * 1987-11-13 1989-05-19 Fujitsu Ltd Access processing method for dictionary file

Also Published As

Publication number Publication date
JPH027108B2 (en) 1990-02-15

Similar Documents

Publication Publication Date Title
JPH06110614A (en) External storage management method
JPS5818747A (en) File controlling system
JPH11327802A (en) Disk system
JPH0239256A (en) Memory system
JPH01303547A (en) Control system for information memory
JP3157673B2 (en) Virtual storage system
JP2608093B2 (en) Data management device
JP2994917B2 (en) Storage system
JPH0991195A (en) Block memory management device
JPS634356A (en) Sharing processing system for disk cache sequential mode
JPH0423143A (en) Data storing system
JPH09114737A (en) Cache disk control
JPS61272821A (en) Magnetic disc controller
JPH0289256A (en) Disk type external storage device
JPS593549A (en) File management system
JPS62239249A (en) File managing device
JPH0555902B2 (en)
JPH02213962A (en) Cache memory control system for disk cache
JPS62236049A (en) File constitution system
JPH01253049A (en) Electronic computer
JPH02143318A (en) Ras processor
JPH05233387A (en) File management method
JPS62180567A (en) High-speed data transfer method with auxiliary storage device
JPH01121951A (en) Continuously allocated file reserving device
JPH01113844A (en) Disk cache device