JPH0355643A - Memory pool control system with priority - Google Patents

Memory pool control system with priority

Info

Publication number
JPH0355643A
JPH0355643A JP19173189A JP19173189A JPH0355643A JP H0355643 A JPH0355643 A JP H0355643A JP 19173189 A JP19173189 A JP 19173189A JP 19173189 A JP19173189 A JP 19173189A JP H0355643 A JPH0355643 A JP H0355643A
Authority
JP
Japan
Prior art keywords
memory
pool
priority
memories
tasks
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
JP19173189A
Other languages
Japanese (ja)
Inventor
Hiroshi Komuro
博 小室
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.)
NEC Corp
Original Assignee
NEC 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 NEC Corp filed Critical NEC Corp
Priority to JP19173189A priority Critical patent/JPH0355643A/en
Publication of JPH0355643A publication Critical patent/JPH0355643A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To decrease the cases where the security is impossible for the tasks of high priorities by limiting the tasks that can secure the memories from a memory pool including the priority and assigning the memories with preference to the tasks having high priorities. CONSTITUTION:When the memories are secured from a certain idle memory in addition to a pool in a system, the memories are searched out of the pool control information 20 in the order of lower priorities via a memory search means 13 to a memory security task 40 of a specific priority that has the short of memories. Then the information 20 having the priority lower than that of the task 40 is selected, and the memories are secured out of the corresponding memory pool. Thus it is possible to decrease the memory security unable cases at request of memories based on the pool priority 21 without causing such a case where the memories stored in a relevant pool are used by the tasks of lower priorities.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は優先度付メモリプール管理方式に関し、特にオ
ペレーティングシステムでのメモリ管理方式の中で、一
定量毎のメモリに優先度を付与し、そのメモリを使用で
きるタスクを限定することを可能とする優先度付きメモ
リプール管理方式に関する. 〔従来の技術〕 従来のメモリ管理方式におけるメモリ確保方式では、空
きメモリを蓄えるプールの概念がないか、あるいは、プ
ールの概念があっても各プールからのメモリ確保がタス
クの優先度に関係なく許されていたため、低優先度タス
クによるメモリ大量確保を防止する手段がなく、高優先
度のタスクがメモリ確保にいった場合でもメモリ確保が
出来ず動作できない場合があった. 〔発明が解決しようとする課題〕 上述した従来の方式では、メモリの確保がタスクの優先
度に関係なく許可されているので、低優先度タスクのメ
モリ大量確保により高優先度タスクでもメモリ確保不能
となり動作できなくなってしまうという欠点があり、こ
れを回避するため、メモリを分割、プールとして管理し
、任意のタスクのみで使用するとある程度の余裕をもっ
て確保するため分割損が多くなってしまうという欠点が
ある。
[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a prioritized memory pool management method, and in particular, in a memory management method in an operating system, a priority is given to each fixed amount of memory, This paper relates to a prioritized memory pool management method that makes it possible to limit the tasks that can use the memory. [Prior art] In conventional memory management systems, memory allocation methods do not have the concept of pools for storing free memory, or even if there is a concept of pools, memory allocation from each pool is difficult regardless of the priority of the task. Because this was allowed, there was no way to prevent low-priority tasks from allocating large amounts of memory, and even when high-priority tasks tried to allocate memory, they were unable to allocate memory and could not operate. [Problems to be Solved by the Invention] In the conventional method described above, memory is allowed to be secured regardless of the priority of the task, so even high-priority tasks cannot secure memory due to large amounts of memory being secured by low-priority tasks. To avoid this, the memory is divided and managed as a pool, and if it is used only for arbitrary tasks, the disadvantage is that the memory is secured with a certain margin, resulting in a large amount of division loss. be.

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

上記の問題点を解決するため、本発明の優先度付きメモ
リプール管理方式は、メモリ管理方式において、システ
ム内の空きメモリから任意の量のメモリをプールとして
蓄えてプールの管理情報を保持するメモリプール作成手
段と、前記メモリプールからのメモリ確保を許可するタ
スクの最低優先度を付加するメモリプール優先度設定手
段と、前記プール以外のシステム内空きメモリからのメ
モリ確保時にメモリ不足により確保不能な場合は確保元
タスクの優先度より低優先度のメモリプールをサーチし
そのプールからメモリを確保するメモリサーチ手段とを
備えて構成される.〔実施例〕 まず、本発明の構或について図面を参照して説明する. 第1図は本発明の一実施例の構戒を示すブロック図であ
り、第2図は本発明の実際の処理例を示した説明図であ
る。
In order to solve the above problems, the prioritized memory pool management method of the present invention is a memory management method that stores an arbitrary amount of memory from free memory in the system as a pool, and stores memory that holds pool management information. a pool creation means; a memory pool priority setting means for adding a minimum priority to a task that is permitted to allocate memory from the memory pool; In this case, it is configured with a memory search means that searches for a memory pool with a lower priority than the priority of the source task and allocates memory from that pool. [Example] First, the structure of the present invention will be explained with reference to the drawings. FIG. 1 is a block diagram showing the structure of an embodiment of the present invention, and FIG. 2 is an explanatory diagram showing an actual processing example of the present invention.

本発明は、優先度付きメモリプール管理方式10とプー
ル優先度21とを含め、作成したメモリプールについて
情報を管理するプール管理情報20と、プール管理情報
キュー30と、メモリ確保タスク40とで構成されてい
る。
The present invention includes a prioritized memory pool management method 10 and a pool priority 21, and includes pool management information 20 for managing information about the created memory pool, a pool management information queue 30, and a memory reservation task 40. has been done.

さらに優先度付きメモリプール管理方式10は、システ
ム内の空きメモリを任意の量だけ切り出しメモリプール
として蓄え、管理情報としてプール管理情報20を作戒
し優先度順にプール管理情報キュー30にキューイング
するメモリブール作成手段11と、メモリプール作成手
段11により作成されたメモリプールの使用を許す最低
優先度をメモリプール毎のプール管理情報20中プール
優先度21として設定するメモリブール優先度設定手段
12と、メモリ確保タスJ40からのメモリ確保時にプ
ール以外のシステム内の空きメモリが不足した場合にシ
ステム内プール管理情報20に従ってメモリ確保タスク
40の優先度よりも低優先度のメモリプールをサーチし
てそのプールに蓄えられているメモリから確保するメモ
リサーチ手段13とで構威されている. 第2図(a)〜(C)は、本発明による処理の具体例を
示した説明図であり、プール管理情報20とメモリ確保
タスク40とがメモリ確保を行い、メモリ不足に遭遇し
た場合の例である.なお、図中での優先度は、値が小さ
いほど高いことを示している。第2図(a)はプール優
先度21の異なるメモリプールが3個作威された状態の
プール管理情報20の状態であり、この状態で、システ
ム内のプール以外にある空きメモリからのメモリ確保に
おいて、メモリ不足に遭遇した優先度4のメモリ確保タ
スク40に対して、メモリサーチ手段13では、プール
管理情報20の中からメモリ確保タスク40の優先度4
よりも低い優先度のプール管理情報20をサーチする. 第2図(a>の場合は、プール優先度21が7のプール
管理情報20が選択され、そのメモリプールからメモリ
を確保する.もし、プール優先度21が7のメモリブー
ルが空き無しの場合は、次に低い優先度のプール管理情
報20をサーチするが、メモリ確保タスク40の優先度
より高いプール優先度21のメモリプールからは確保し
ない。このときのプール管理情報20のサーチ範囲を示
したのが第2図(b)である。さらに、最高優先度Oの
メモリ確保タスク30がメモリ確保を行いメモリ不足に
遭遇した場合の、プール管理情報20のサーチ範囲を示
したのが、第2図(C)である. 以上のように、プール優先度21により、そのプールで
蓄えたメモリを予想外の低優先度タスクから取られる事
なく、メモリ要求時のメモリ確保不可ケースを低減させ
ることができる.〔発哄の効果〕 以上説明したように本発明は、優先度付きメモリプール
としてメモリを蓄え、そのプールからメモリ確保できる
タスクをタスク優先度で制限し、高優先度タスクへの優
先的なメモリ割付を可能とすることにより、低優先度タ
スクの大量メモリ確保による高優先度タスクのメモリ確
保不能ケースを低減させることができる.
Furthermore, the prioritized memory pool management method 10 extracts an arbitrary amount of free memory in the system and stores it as a memory pool, and uses the pool management information 20 as management information to queue it in the pool management information queue 30 in order of priority. a memory boolean creation means 11; and a memory boolean priority setting means 12 for setting the lowest priority that allows the use of the memory pool created by the memory pool creation means 11 as a pool priority 21 in the pool management information 20 for each memory pool. , If there is a shortage of free memory in the system other than the pool when memory is allocated from the memory allocation task J40, a memory pool with a lower priority than the memory allocation task 40 is searched for according to the system pool management information 20. It consists of a memory search means 13 that secures memory from memory stored in a pool. FIGS. 2(a) to 2(C) are explanatory diagrams showing specific examples of processing according to the present invention. This is an example. Note that the priority in the diagram indicates that the smaller the value, the higher the priority. Figure 2 (a) shows the state of the pool management information 20 in which three memory pools with different pool priorities 21 have been created, and in this state, memory is secured from free memory other than the pools in the system. In response to the memory reservation task 40 with priority 4 that encounters a memory shortage, the memory search means 13 selects the memory reservation task 40 with priority 4 from the pool management information 20.
Search for pool management information 20 with a lower priority than . Figure 2 (If a>, the pool management information 20 with pool priority 21 of 7 is selected and memory is secured from that memory pool. If the memory boolean with pool priority 21 is 7 is full searches for the pool management information 20 with the next lowest priority, but does not secure it from the memory pool with the pool priority 21 higher than the priority of the memory reservation task 40.The search range of the pool management information 20 at this time is shown below. Fig. 2(b) shows the search range of the pool management information 20 when the memory allocation task 30 with the highest priority O allocates memory and encounters a memory shortage. This is shown in Figure 2 (C). As described above, pool priority 21 prevents the memory stored in the pool from being taken from unexpected low-priority tasks, reducing cases where memory cannot be secured when requesting memory. [Effect of activation] As explained above, the present invention stores memory as a prioritized memory pool, limits the tasks that can allocate memory from that pool by task priority, and reduces the allocation of memory to high-priority tasks. By enabling preferential memory allocation, it is possible to reduce cases where high-priority tasks cannot allocate memory due to large amounts of memory allocated to low-priority tasks.

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

Claims (1)

【特許請求の範囲】[Claims]  メモリ管理方式において、システム内の空きメモリか
ら任意の量のメモリをプールとして蓄えてプールの管理
情報を保持するメモリプール作成手段と、前記メモリプ
ールからのメモリ確保を許可するタスクの最低優先度を
付加するメモリプール優先度設定手段と、前記プール以
外のシステム内空きメモリからのメモリ確保時にメモリ
不足により確保不能な場合は確保元タスクの優先度より
低優先度のメモリプールをサーチしそのプールからメモ
リを確保するメモリサーチ手段とを備えて成ることを特
徴とする優先度付きメモリプール管理方式。
The memory management method includes a memory pool creation means that stores an arbitrary amount of memory from free memory in the system as a pool and holds management information of the pool, and a minimum priority of a task that is allowed to secure memory from the memory pool. Added memory pool priority setting means, and if memory cannot be secured due to insufficient memory when securing memory from free memory in the system other than the above pool, searches for a memory pool with a lower priority than the priority of the securing source task and uses that pool. A memory pool management method with priority, comprising a memory search means for securing memory.
JP19173189A 1989-07-24 1989-07-24 Memory pool control system with priority Pending JPH0355643A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP19173189A JPH0355643A (en) 1989-07-24 1989-07-24 Memory pool control system with priority

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP19173189A JPH0355643A (en) 1989-07-24 1989-07-24 Memory pool control system with priority

Publications (1)

Publication Number Publication Date
JPH0355643A true JPH0355643A (en) 1991-03-11

Family

ID=16279556

Family Applications (1)

Application Number Title Priority Date Filing Date
JP19173189A Pending JPH0355643A (en) 1989-07-24 1989-07-24 Memory pool control system with priority

Country Status (1)

Country Link
JP (1) JPH0355643A (en)

Similar Documents

Publication Publication Date Title
CN109117260B (en) Task scheduling method, device, equipment and medium
CA2367982C (en) Resource scheduling
US5826082A (en) Method for reserving resources
US5325526A (en) Task scheduling in a multicomputer system
US7784053B2 (en) Management of virtual machines to utilize shared resources
EP0969381A2 (en) Method of efficient non-virtual main memory management
US20050125793A1 (en) Operating system kernel-assisted, self-balanced, access-protected library framework in a run-to-completion multi-processor environment
US8627325B2 (en) Scheduling memory usage of a workload
US7353515B1 (en) Method and apparatus for dynamic allocation and management of semaphores for accessing shared resources
US7150020B2 (en) Resource management
US6981258B1 (en) Process scheduler without long overhead and large memory and scheduling method used therein
JPH04314147A (en) Memory managing system
JPH0355643A (en) Memory pool control system with priority
JP2000259430A (en) Processing method for computer system
JPH0962564A (en) Buffer allocation control system
JPH0586574B2 (en)
JPH11175357A (en) Task management method
JPS6152761A (en) Arithmetic unit
JPS63292456A (en) Control system for medium assignment of plural medium containing type data recorder
JPS61136134A (en) Queue resource control system
JP3084812B2 (en) Program list output efficiency method
JPS63159940A (en) Control system for allocation of central processing unit
EP1037146A1 (en) Resource scheduling
JPH02304615A (en) Allocating system for parallel disk control buffer
JPH0816456A (en) Resource management device