公开(公告)号：AU2012279345B2

公开(公告)日：2016-02-18

申请号：AU2012279345

申请日：2012-06-27

Applicant: APPLE INC

Inventor： BARBOU-DES-PLACES FRANCOIS ,  CRANE NEIL G ,  DESAI LIONEL D ,  SOKOL JOSEPH

IPC: G06F12/02 ,  G06F12/12

Abstract: A two-level paging mechanism. The first level gathers data from reclaimable memory locations for a process and compacts the data into a single container. The second level sends the compact container's contents to a swap file and may use optimal I/O operations to the target memory device. On-demand paging is made possible by having a first pager locate the requested data in the compact container and then having a second pager retrieve the corresponding data from the swap file.

公开(公告)号：AU2012279345A1

公开(公告)日：2014-01-09

申请号：AU2012279345

申请日：2012-06-27

Applicant: APPLE INC

Inventor： BARBOU-DES-PLACES FRANCOIS ,  CRANE NEIL G ,  DESAI LIONEL D ,  SOKOL JOSEPH

IPC: G06F12/02 ,  G06F12/12

Abstract: A two-level paging mechanism. The first level gathers data from reclaimable memory locations for a process and compacts the data into a single container. The second level sends the compact container's contents to a swap file and may use optimal I/O operations to the target memory device. On-demand paging is made possible by having a first pager locate the requested data in the compact container and then having a second pager retrieve the corresponding data from the swap file.

公开(公告)号：WO2013180871A3

公开(公告)日：2014-09-12

申请号：PCT/US2013038679

申请日：2013-04-29

Applicant: APPLE INC

Inventor： DESAI LIONEL D ,  CRANE NEIL G ,  SORRESSO DAMIEN P ,  SOKOL JOSEPH JR

IPC: G06F9/50

CPC classification number: G06F9/4881 ,  G06F9/5016 ,  G06F9/5022 ,  G06F9/5038 ,  G06F9/528

Abstract: A method for resource management of a data processing system is described herein. According to one embodiment, a token is periodically pushed into a memory usage queue, where the token includes a timestamp indicating time entering the memory usage queue. The memory usage queue stores a plurality of memory page identifiers (IDs) identifying a plurality of memory pages currently allocated to a plurality of programs running within the data processing system. In response to a request to reduce memory usage, a token is popped from the memory usage queue. A timestamp of the popped token is then compared with current time to determine whether a memory usage reduction action should be performed.

Abstract translation: 这里描述了数据处理系统的资源管理方法。 根据一个实施例，令牌被周期地推入存储器使用队列中，其中令牌包括指示进入存储器使用队列的时间的时间戳。 存储器使用队列存储识别当前分配给在数据处理系统内运行的多个程序的多个存储器页的多个存储器页标识符（ID）。 响应于减少内存使用的请求，令牌从内存使用队列弹出。 然后将弹出的令牌的时间戳与当前时间进行比较，以确定是否应执行内存使用减少动作。