MEMORY MANAGEMENT SYSTEM

PROBLEM TO BE SOLVED: To obtain a memory management system which can hunt through an easy process and easily secure a continuous area by rearranging unit memories in their original order and securing the continuous area of the unit memories if the order of the unit memories which are arranged sequen...

Full description

Saved in:
Bibliographic Details
Main Authors HIGUCHI MAMORU, MURATA SATOSHI
Format Patent
LanguageEnglish
Published 30.06.2000
Edition7
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PROBLEM TO BE SOLVED: To obtain a memory management system which can hunt through an easy process and easily secure a continuous area by rearranging unit memories in their original order and securing the continuous area of the unit memories if the order of the unit memories which are arranged sequentially to the lowest order is different from the original number order. SOLUTION: When unit memories which are hunted are released, a unit memory release part 12 sets their queue to a free state and requeue them to the end of a queue. Thus, the released unit memories are set to the lowest priority order when rehunted, so the memories will be rehunted a certain time later. If the order of the requeued queue is different from the number order, a rearranging means 10a of a unit memory queuing part 10 rearranges them in the order. Consequently, a continuous area can be secured within the time up to the rehunting.
Bibliography:Application Number: JP19980355795