JPS61279955A - List processing system - Google Patents
List processing systemInfo
- Publication number
- JPS61279955A JPS61279955A JP12046685A JP12046685A JPS61279955A JP S61279955 A JPS61279955 A JP S61279955A JP 12046685 A JP12046685 A JP 12046685A JP 12046685 A JP12046685 A JP 12046685A JP S61279955 A JPS61279955 A JP S61279955A
- Authority
- JP
- Japan
- Prior art keywords
- area
- memory
- valid data
- copy
- copying
- 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
Links
Landscapes
- Devices For Executing Special Programs (AREA)
Abstract
Description
【発明の詳細な説明】
〔発明の利用分野〕
本発明はリスト処理方式に係り1%に複数メモリ領域に
対して複写方式不用物回収を行なうのに゛メモリ有効利
用に好適な処理方式に関する。DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a list processing method, and relates to a processing method suitable for effective use of memory when copying and collecting unnecessary items from a plurality of memory areas within 1%.
リスト処理方式で、従来方式の複写方式不用物回収を行
なうと、各メモリ領域においては、複写のための領域を
確保するため有効領域は半分になるという欠点があった
。複数のメモリ領域がある場合にそのまま適用したとき
、おのおのが半分しか有効利用できない。When the list processing method is used to collect unnecessary items using the conventional copying method, there is a drawback that the effective area in each memory area is halved in order to reserve an area for copying. When applied as is when there are multiple memory areas, only half of each area can be used effectively.
本発明の目的は、複数メモリ領域に対する複写方式不用
物回収でも、メモリとして有効利用可能な領域を、もと
の領域の半分より大きくする機能を提供することにある
。SUMMARY OF THE INVENTION An object of the present invention is to provide a function that makes the area that can be effectively used as memory larger than half of the original area even in the case of copying and collecting unnecessary items for multiple memory areas.
複数メモリ領域を有する複写方式不用物回収において、
複数の不用物回収が同時には行なわれないことに着目し
、複写専用領域を各メモリ領域に共通に1つ設け、この
複写専用領域に対して、複写を行ない、再びもとのメモ
リ領域に再び複写を行なうことによって、各メモリ領域
には複写用の領域を内部にもたせないことで、メモリの
有効利用可能領域を拡げることができる。In copy method waste collection with multiple memory areas,
Focusing on the fact that multiple collections of unnecessary items cannot be performed at the same time, we set up one copy-only area in common in each memory area, perform copying in this copy-only area, and then restore the original memory area. By performing copying, each memory area does not have an internal area for copying, and the area that can be effectively used in the memory can be expanded.
以下、本発明の一実施例を従来例と比較しつつ説明する
。Hereinafter, one embodiment of the present invention will be described while comparing it with a conventional example.
第1図に、従来例での複写方式不用物回収によるメモリ
管理方式を示す。リスト処理を行なうと。FIG. 1 shows a conventional memory management system using a copying method and collection of unnecessary materials. When you perform list processing.
2〜7のような物がいくつか作られる。そのうち、2.
3.あるいは、6,7のように管理表1から辿れるもの
と、4や5のように管理表1から辿れないものとが出来
てくる。前者を有効なデータ、後者を無効なデータとよ
ぶ。リスト処理を続けていくと。Some things like 2-7 will be made. Among them, 2.
3. Alternatively, there will be items such as 6 and 7 that can be traced from the management table 1, and items such as 4 and 5 that cannot be traced from the management table 1. The former is called valid data, and the latter is called invalid data. Continuing with list processing.
ついにはメモリを使い切ってそれ以上リスト処理ができ
なくなる。複写方式不用物回収法は、メモリを8と9の
2つの部分に分け、その一方、たとえば8を使い切った
とき、管理表1から辿れる有効なデータ2.3.6.7
を他方のメモリ部分へ複写する。Eventually, the memory will be used up and no more list processing will be possible. The copy method waste collection method divides the memory into two parts, 8 and 9, and on the other hand, for example, when 8 is used up, valid data that can be traced from management table 1 2.3.6.7
Copy it to the other memory part.
このとき、無効なデータ4,5はそのまま残される。At this time, invalid data 4 and 5 are left as they are.
メモリ部分9では、8における無効データ4,5の分の
み、余分な空き領域が生じ、再びリスト処理を続けるこ
とができる。逆に9の部分が一杯になったときは、8の
領域へ有効なデータを複写するっこの方式では、有効な
データの占める有効な領域の大きさは高々全体の半分で
ある。In the memory portion 9, an extra free space is created for the invalid data 4 and 5 in 8, and the list processing can be continued again. On the other hand, when the area 9 is full, in this method of copying valid data to the area 8, the size of the valid area occupied by the valid data is at most half of the entire area.
第2図に、従来方式における。複写方式不用物回収法の
実施例で、メモリ領域が複数ある場合の例を示す。メモ
リは、1からnまでnヶの領域に分けられており、各々
の領域はさらに、複写方式不用物回収を行なうため、I
AとIB、2Aと28、・・・IImAとnBのように
半分ずつの部分に分けられている。たとえば、1のメモ
リ領域の半分IAを更い切ったときは、有効なデータの
みIBK複写する。このように、nヶの領域の各々で、
複写を行なう。FIG. 2 shows the conventional method. This is an embodiment of the copying method for collecting unnecessary items, and shows an example in which there are multiple memory areas. The memory is divided into n areas from 1 to n, and each area further has an I
It is divided into halves, such as A and IB, 2A and 28, ... IImA and nB. For example, when half IA of one memory area is used up, only valid data is copied to IBK. In this way, in each of the n regions,
Make copies.
第3図に1本発明における実施例を示す。メモリは、1
からnまでのメモリ領域の他に、複写専用領域Cをもつ
。Cの大きさは、各メモリ領域のいずれよりも小さくな
いようKとる。メモリ領域のいずれか、たとえば領域1
と使い切ったとき。FIG. 3 shows an embodiment of the present invention. Memory is 1
In addition to the memory areas from n to n, there is a copy-only area C. The size of C is set to K so that it is not smaller than any of the memory areas. Any memory area, for example area 1
and when it is used up.
1の中の有効なデータのみをCへ複写する。しかる後に
%Cの中の有効なデータを再び領域1へ複写する。本実
施例によれば、各メモリ領域の各々が複写用の領域をも
つ必要がなく、有効なデータの占める有効な領域の大き
さを全体の半分以上とする効果がある。Copy only valid data in 1 to C. After that, the valid data in %C is copied to area 1 again. According to this embodiment, there is no need for each memory area to have a copying area, and there is an effect that the size of the effective area occupied by valid data is more than half of the total.
従来例では、各メモリ領域の大きさをtl、 t2゜・
・・、t、とすると、各々の半分、即ち、t t /’
2 tt2/2. ・・・、t、/2 Lかメモ
リは最大団えないから、メモリ全体の大きさを1 (=
l t + l−2+・・・+1.)とすると、メモ
リの有効利用可能な最大の大きさはL/ 2 (= l
−1/2 +12/2+・・・+t、/2 )にしかな
らない。In the conventional example, the size of each memory area is tl, t2°・
..., t, then half of each, that is, t t /'
2 tt2/2. ..., t, /2 L or memory cannot be stored at maximum, so the total memory size is 1 (=
l t + l-2+...+1. ), the maximum size of memory that can be effectively used is L/2 (= l
-1/2 +12/2+...+t, /2).
これに対し1本発明による実施例では、各メモリ領域の
大きさをtl’、 t2’、 ・・・、t、′とす
ると。On the other hand, in an embodiment according to the present invention, let the sizes of each memory area be tl', t2', . . . , t,'.
複写専用領域Cの大きさLoはmax(tH’、 t2
’1・・・ 1./)である。メモリ全体の大きさをt
′とすると有効利用可能な最大の大きさはA I’ +
l z’+t、′、即ちt’−t、 である。t=
t’とし。The size Lo of the copy-only area C is max(tH', t2
'1... 1. /). The total memory size is t
′, the maximum size that can be effectively used is A I' +
lz'+t,', that is, t'-t. t=
Let's say t'.
今たとえば、tl′=t2′=・・・=tl(=t′/
(n+1))の場合には、t’−to=−tとなる。For example, tl'=t2'=...=tl(=t'/
(n+1)), t'-to=-t.
n + 1 n=9の場合、9割までが有効利用可能となる。n + 1 When n=9, up to 90% can be used effectively.
第1図は、従来例での複写方式メモリ割当て図を、第2
図は、複数メモリ領域をもつ従来例での複写方式メモリ
割当て図を、第3図は、本発明の一実施例による複数メ
モリ領域をもつ複写方式メモリ割当て図を示す。
冨 1 区Figure 1 shows the copying method memory allocation diagram in the conventional example, and the second
The figure shows a memory allocation diagram of a copying method in a conventional example having a plurality of memory areas, and FIG. 3 shows a memory allocation diagram of a copying method having a plurality of memory areas according to an embodiment of the present invention. Tomi 1 Ward
Claims (1)
メモリ管理システムにおいて、複写専用領域を設けたこ
とを特徴とするリスト処理方式。A list processing method characterized by providing a copy-only area in a memory management system having a plurality of memory areas and performing copy-based waste collection.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP12046685A JPS61279955A (en) | 1985-06-05 | 1985-06-05 | List processing system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP12046685A JPS61279955A (en) | 1985-06-05 | 1985-06-05 | List processing system |
Publications (1)
Publication Number | Publication Date |
---|---|
JPS61279955A true JPS61279955A (en) | 1986-12-10 |
Family
ID=14786861
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP12046685A Pending JPS61279955A (en) | 1985-06-05 | 1985-06-05 | List processing system |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPS61279955A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2011505042A (en) * | 2007-11-29 | 2011-02-17 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Memory management |
-
1985
- 1985-06-05 JP JP12046685A patent/JPS61279955A/en active Pending
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2011505042A (en) * | 2007-11-29 | 2011-02-17 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Memory management |
JP4701321B2 (en) * | 2007-11-29 | 2011-06-15 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Memory management |
US8346822B2 (en) | 2007-11-29 | 2013-01-01 | International Business Machines Corporation | Memory management |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE3280446T2 (en) | Digital data processing system. | |
DE3687724D1 (en) | DIGITAL PROCESSOR CONTROL. | |
EP0416768A3 (en) | Thread private memory storage for multi-thread digital data processors | |
JPS61279955A (en) | List processing system | |
EP0294499B1 (en) | Control scheme for segmented buffers based on a shared reference count | |
DE3280449T2 (en) | Digital data processing system. | |
JPS57162165A (en) | Re-editing system for storage area | |
EP0058846A2 (en) | Multiprocessing system with variably shared paging storage | |
JPH02211560A (en) | Information processing system | |
JP3520527B2 (en) | Data management method | |
JPS5853075A (en) | Information processor provided with high speed separation buffer | |
JPS5698766A (en) | Virtual memory control system | |
JPS5692638A (en) | Dynamic exclusive control system for edition file in indexing order | |
JPS61264456A (en) | Virtual storage system for garbage collection | |
JPS635451A (en) | Memory addressing system | |
Shen | Improved Parallel Algorithms for Finding the Most Vital Edge of A Graph with Respect to Minimum Spanning Tree | |
JPS637581A (en) | File managing device | |
JPH05225059A (en) | Cache memory management system | |
MERKLE | Multi-Hilbertian spaces and their duals | |
JPH02108131A (en) | Dynamic table control system | |
JPH05151054A (en) | Document file control system | |
JPS63149741A (en) | Descriptor table control system | |
JPS6364142A (en) | Memory management control system | |
BURRIS | Dynamic memory management algorithms in a paged memory environment[Ph. D. Thesis] | |
JPS63158641A (en) | Idle file control system |