An Architecture Supporting Security and Persistent Object Storage

Concurrency: Pract. Exper.

2000

SUMMARYWith reference to a distributed context consisting of computers connected by a local area network, we present the organization of a memory management system giving physical support to a uniform, persistent vision of storage according to a single address space paradigm. Our system implements a two-layer storage hierarchy in which the distributed secondary memory stores the valid data items and the primary memory supports a form of data caching, for fast processor access.The proposed system defines a small, powerful set of operations that allow application programs to exert explicit control over the memory management activities at the levels of physical storage allocation, data migration across the network, and the data movements between the secondary memory and the primary memory. The system, that has been implemented in prototype form, is assessed from a number of viewpoints. We show that the storage requirements of the information for memory management are negligible. Moreover, the number of messages necessary to determine the network location of a given data item is low and independent of both the network size and the past movements of this data item in the distributed storage.

Section: Introductionmentioning

confidence: 99%

Single address space implementation in distributed systems

Bartoli

Dini

Concurrency: Pract. Exper.

2000

“…The secondary memory is used for permanent storage of the information presently active in the virtual space, and the primary memory implements a form of caching of this information, for fast processor access. In this approach, we have a persistent vision of storage in which an information item created by a given process at a given virtual address maintains this address for its entire lifetime, irrespective of its position in the primary memory or secondary memory of any node [2][3][4][5][6][7]. The uniform storage model is well accommodated by a single address space memory addressing paradigm, in which the meaning of an address is unique and independent of the process issuing this address [8][9][10].…”

Section: Introductionmentioning

confidence: 99%

Single address space implementation in distributed systems

Bartoli

Dini

Concurrency: Pract. Exper.

2000

With reference to a distributed context consisting of computers connected by a local area network, we present the organization of a memory management system giving physical support to a uniform, persistent vision of storage according to a single address space paradigm. Our system implements a two‐layer storage hierarchy in which the distributed secondary memory stores the valid data items and the primary memory supports a form of data caching, for fast processor access. The proposed system defines a small, powerful set of operations that allow application programs to exert explicit control over the memory management activities at the levels of physical storage allocation, data migration across the network, and the data movements between the secondary memory and the primary memory. The system, that has been implemented in prototype form, is assessed from a number of viewpoints. We show that the storage requirements of the information for memory management are negligible. Moreover, the number of messages necessary to determine the network location of a given data item is low and independent of both the network size and the past movements of this data item in the distributed storage.Copyright © 2000 John Wiley & Sons, Ltd.

An implementation of storage management in capability environments

Corsini

1995

Softw Pract Exp

The exploitation of the salient features of capability‐based addressing environments leads to a high number of small objects existing in memory at the same time. It is thus necessary to enhance the efficiency of the mechanisms for object relocation, and to avoid congestion of input/output devices due to swapping. In this paper, we present an approach to the management of a large virtual memory space aimed at solving these problems. We insert partial information concerning the physical allocation of each object into the virtual identifier of this object. Objects are grouped into large swapping units, called pages. The page size is independent of the average object size. This results in enhanced efficiency in managing the relocation information both with regard to memory requirements and access times. The allocation of objects into pages, and the movement of pages through the memory hierarchy, are controlled by user processes. This means that programs which have knowledge of their own use of virtual memory can increase their locality of reference, diminish the number of swap operations and reduce fragmentation.