Memory Management Scheme Based on the Quasi-Linear Type System

点击翻译按钮获取中文摘要

The aim of this research project was to establish a new scheme for memory management based on the quasi-linear type system which Kobayashi has proposed. With the quasi-linear type system, we can find the last access to each heap data and insert an instruction for deallocation at compile-time, by which we can construct a more efficient, safe memory management system. Main results are summarized as follows.Insertion of memory allocation/deallocation instructions based on the quasi-linear type systemWe devised an algorithm for finding the last access point for each heap data and inserting allocation/deallocation instructions, based on the quasi-linear type system. We incorporated it into a functional programming language ML.Design and implementation of a bytecode language for our memory management schemeWe designed and implemented a bytecode language that is suitable for our memory management scheme based on the quasi-linear type system.Integration with garbage collectionSince not all heap data can be maintained by our memory management scheme, integration with conventional memory management schemes (GC) is necessary. The main issues are how to improve GC on multiprocessors and how to deal with dangling pointers produced by our memory management scheme. We dealt with these issues and established a method to integrate the two schemes for memory management.Resource usage analysisWe generalized the quasi-linear type system and constructed a type system for checking usage of not only the memory but also other resources such as files, networks, etc.