A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Filters
A Layered Persistent Architecture for Napier88
[chapter]
1990
Workshops in Computing
Preserved Fulltext
This paper presents the design of one such layered architecture that can be used to support a persistent object store where the protection is enforced by a high level type system. ...
In recent years a range of single programming language systems have been developed that are supported by a persistent store. Examples of such systems include Argus, Galileo, PS-algol and Smalltalk. ...
Store Address Data The Store The Object The Address Figure 3 : Addressing data within an object using a direct address. ...
doi:10.1007/978-1-4471-3178-6_11
fatcat:clmaev3q35hrbcr4risbcoivzi
Efficient Tracking of Mobile Objects in Globe
2001
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A stable location for an object is a directory node that always stores a contact address for the object. A lookup operation visiting such a node finds the address stored there. ...
To further improve performance, a contact address can be stored at an intermediate node. The current address of our mobile object would therefore be stored in node France. ...
doi:10.1093/comjnl/44.5.340
fatcat:rekjwdjkyvfcvfokeji2ae6mni
Algorithmic Design of the Globe Wide-Area Location Service
1998
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our design is based on a worldwide distributed search tree in which addresses are stored at different levels, depending on the migration pattern of the object. ...
A distributed object can reside at multiple locations at the same time, and offers a set of addresses to allow client processes to contact it. ...
to store addresses at a higher level node that covers the smallest domain in which the object is moving. ...
doi:10.1093/comjnl/41.5.297
fatcat:bdjol34dsbbddilm6xzlrgewbe
Distributed persistent stores
1993
Microprocessors and microsystems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
These generally did not provide for concurrent access to the store, and included no support for distribution. ...
We then examine and contrast two examples of distributed persistent stores, the Monads DSM and distributed Napier. ...
This store implements a heap of persistent objects which are addressed using their virtual addresses. ...
doi:10.1016/0141-9331(93)90045-9
fatcat:qn73sfazuzc7reineqz7zeanb4
Architectures for persistence
1993
Microprocessors and microsystems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Each machine's object management model is explained, along with an analysis of the design decisions made. ...
Ideally one would have liked to incorporate all of the discs as part of the permanent address space of the machine. In that case a disc file would just be a particular range of addresses. ...
Heap or Object Store, into which currently active objects are loaded. ...
doi:10.1016/0141-9331(93)90042-6
fatcat:3ed7krl6hvbzlizxhgkc32xlga
A generic persistent object store
1992
Software Engineering Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In particular the provision of an object store is highlighted, outlining its design aims and resultant structure. ...
The store is designed as a modularised tool set with a high degree of reuseability as a main design goal. ...
These conventions ensure that objects can only be accessed by following object addresses starting from the root object of the persistent store. ...
doi:10.1049/sej.1992.0017
fatcat:gfooa3cs4zefjc7wgw4bdzupp4
Page 582 of Communications of the Association for Computing Machinery Vol. 3, Issue 10
[page]
1960
Communications of the Association for Computing Machinery
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
the main store address. ...
The only store protection that need be provided by hardware is to prevent object programs fouling the directories. ...
Cloud storage for Small Cell Networks
2012
2012 IEEE 1st International Conference on Cloud Networking (CLOUDNET)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Retrieving data To retrieve data, the connected user retrieves all the addresses of immutable objects via the DAG root address stored in the private user object. ...
Address topology Every storage system has the concept of address, that allows it to know where an object can be stored inside its containers. ...
doi:10.1109/cloudnet.2012.6483659
dblp:conf/cloudnet/BastugGD12
fatcat:7wfwlkr27bckpfbdv7ydznx5xe
Memories
2006
Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications - ACL2 '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We do not use single-threaded objects or ACL2 arrays, which frees the user from syntactic restrictions and slow-array warnings. ...
Space is not allocated until locations are used, so large address spaces can be represented. ...
By the definitions of store and load, this is the same as: ( from-mem ( store addr ( load addr ( to-mem mem) | {z } a memory-p object ) ( to-mem mem) | {z } a memory-p object )) This call of store now ...
doi:10.1145/1217975.1217986
dblp:conf/acl2/Davis06
fatcat:nqwa2tls7neibfyenemnvj72oy
Isolated Storage of Multi-Tenant Data Based on Shared Schema
2016
Cybernetics and Information Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we focus on disk storage method of multi-tenant data based on shared schema to address the above low efficiency of data access. ...
According to isolation requirement of multitenant data, we store a tenant's data in some contiguous disk blocks. ...
It stores the tuples in universal table to disk through mapping address. Given the tuple identifier, it gets physical address of the tuple using address mapping method and stores it. ...
doi:10.1515/cait-2016-0036
fatcat:2racq5my5bgsrbgipficflsucu
Failure-tolerant parallel programming and its supporting system architecture
1976
Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One set of modules provides the main working store for the object processor. The other set, together with the set of content-addressable memory modules, provides the VR-store. ...
Local variable sections of VR-store-segments are mapped to location-addressed memory modules in the same manner as the main working store is mapped to location-addressed memory modules. ...
doi:10.1145/1499799.1499860
dblp:conf/afips/KimR76
fatcat:lkuzw66oc5gfbjnv55gkt4yzdm
Application Source Codes Profiling for ASIP Memory Subsystem Design
2012
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The memory profiler proposed in the paper uses dynamic profiling technique to generate memory traces, and the live intervals of memory objects are computed by load-store information. ...
The end address of the memory object is the sum of start address and the type size. Every memory access is represented by load and store intermediate representation of the compiler. ...
The live time of a memory object is defined as the first store to the memory object and the last load to the memory object. ...
doi:10.1016/j.proeng.2012.01.458
fatcat:4lewnewonregfi52y6hmisa23a
HEAPO
2014
ACM Transactions on Storage
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we developed a Heap-Based Persistent Object Store (HEAPO) to manage persistent objects in byte-addressable Nonvolatile RAM (NVRAM). ...
store. ...
Static address binding relieves HEAPO from the overhead caused by object store relocation, for example, inter-and intraobject store pointer resolution. ...
doi:10.1145/2629619
fatcat:y2s5qs5uzrc6vlol4zdomdlzse
Symbolic Data Structure for Postal Address Representation and Address Validation Through Symbolic Knowledge Base
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A symbolic data structure is proposed to represent the postal address and the information relevant for validating the postal address is stored in a newly devised symbolic knowledge base. ...
The postal address data and the domain information for address validation contain qualitative, numeric, interval and other types of data. ...
The symbolic knowledge base is stored as a separate sorted flat file for every assertion object. The text strings forming the postal address object are input to the system. ...
doi:10.1007/11590316_59
fatcat:iyi4rbq3vbbpxmpw6shzf2n6gq
Alias types for "environment-aware" computations
2003
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The calculus is an imperative, object-based language (with extensible objects and primitives for discriminating the presence or absence of attributes of objects) equipped with a small-step operational ...
An expression evaluates to a value that can be either an integer or the address of an object. Stores maps addresses to objects. ...
They specify the restrictions on the shape of the objects in the store: for an address ι, if Γ(ι) = Undf then nothing is required for the object at the address ι, otherwise the object at the address ι ...
doi:10.1016/s1571-0661(04)80805-3
fatcat:gqx7fwseqjfdxbjggzm3jonjbu
« Previous
Showing results 1 — 15 out of 1,123,445 results