公开(公告)号：US20210110859A1

公开(公告)日：2021-04-15

申请号：US17127978

申请日：2020-12-18

Applicant: Apple Inc.

Inventor： Mark A. PAULEY

IPC: G11C11/4072 ,  G11C11/409 ,  G06F3/06 ,  G06F12/02

Abstract: A device implementing purgeable memory mapped files includes at least one processor configured to receive a first request to store a first data object in volatile memory in association with a copy of the first data object stored in non-volatile memory, the first request indicating to lock the copy in the non-volatile memory. The processor is further configured to provide for storing the first data object in the volatile memory, and lock the copy stored in the non-volatile memory. The processor is further configured to receive a second request associated with clearing a portion of the non-volatile memory, provide an indication that a second data object is available for deletion from the non-volatile memory when the first data object is locked, and provide an indication that the first data object is available for deletion from the non-volatile memory when the first data object has been unlocked.

公开(公告)号：US20180335968A1

公开(公告)日：2018-11-22

申请号：US15725175

申请日：2017-10-04

Applicant: Apple Inc.

Inventor： Mark A. PAULEY ,  Cameron S. BIRSE ,  Kazuhisa YANAGIHARA ,  Susan M. GRADY ,  Timothy P. HANNON

IPC: G06F3/06 ,  G06F12/0891

Abstract: This application sets forth techniques for managing the allocation of storage space within a storage device that is communicably coupled to a computing device. Requests are received from a plurality of applications executing on the computing device, in which each request specifies a respective amount of storage space to be reserved within the storage device. Detection is performed for the availability of a minimum amount of free space that corresponds to an optimal amount of space for executing at least one application of the plurality of applications. A respective priority ranking for each application is identified based on historical data gathered for the applications. Based on the priority rankings, a subset of requests from the plurality of requests is established. For each request of the subset, at least a portion of the respective amount of space specified by the request is reserved while maintaining the minimum amount of free space.