Peer To Patent

1

A method for allocating memory freed by applications in a computer system having an operating system (O/S), said method comprising: a) designating a status of said one or more freed memory units previously associated with an application as available for reuse;

b) organizing one or more freed memory units having said available for reuse status into one or more free memory pools, wherein freed memory units in a pool are directly allocated to an application requiring backing physical memory store without the O/S deleting data in the freed memory units.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

2

The method as claimed in Claim 1, further comprising maintaining information about said application and said free memory pools, said information used to directly allocate said freed memory units to an application.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

3

The method as claimed in Claim 2, wherein said maintained information comprises information representing how one or more pools are organized, said one or more pools being organized according to a criteria selected from the following: a process, a user, a security context, a processor, an applications node's status as being a Non-Uniform Memory Access (NUMA) node, or, a memory zone where fixed size freed memory units are made available.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

4

The method as claimed in Claim 3, wherein a pool is further organized according to one or more dimensions based on a combination of said criteria.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

5

The method as claimed in Claim 2, wherein prior to said designating, performing: implementing a system function to determine whether said freed memory spans one or more fixed size freed memory units in virtual memory space, said fixed size memory unit corresponding to a size of a physical memory page frame.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

6

The method as claimed in Claim 1, further comprising: receiving, by said O/S instruction to allocate memory for an application; and,

in response, said O/S determining if a pool having freed memory units available for reuse will not result in a data security breach if data included in said freed memory units of said pool is allocated to said application; and,

if no data security breach results, allocating said freed memory units of that pool to said application without the O/S expending overhead of deleting data included in said freed memory units.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

7

The method as claimed in Claim 6, wherein said determining if a pool having said freed memory units available for reuse will not result in a data security breach, is based on one or more of the following: a process, a user, or a security context, or combinations thereof.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

8

The method as claimed in Claim 6, wherein said O/S tracks freed memory units that are available system-wide, wherein if it is determined that no pool having freed memory units available for that reuse will not result in a data security breach, said method including: determining if there are any freed memory units available in system-wide free memory for allocation; and, if no freed memory units are available system-wide,

reclaiming said freed memory units from a pool.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

9

The method as claimed in Claim 8, wherein said freed memory units designated as available for reuse from a pool are reclaimed based on criteria including: a size of said free memory pool; an allocation rate from the pool; a rate at which memory is freed into the pool; a net allocation rate of the pool; and a length of time memory has been assigned to the pool, or combinations of these.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

10

The method as claimed in Claim 8, further comprising: determining whether freed memory units marked as available for reuse in a free memory pool are available for reclaiming and, if it is determined that freed memory units marked as available for reuse from a free memory pool are not available for reclaiming, said O/S further:

designating the freed memory units as no longer being available for reuse; and,

removing the freed memory unit from the free memory pool.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

11

The method as claimed in Claim 10, further including: invoking pageout mechanism for transferring contents of said freed memory units removed from said pool into another storage media thereby increasing availability of system-wide memory.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

12

A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform allocations of memory freed by applications executing in a computer system according to Claim 1.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

13

A method for managing memory freed by processes executing in a virtual memory space in a computer system implementing means for mapping virtual memory addresses into physical memory locations accessible by an operating system (O/S), said method comprising: receiving, by said O/S, an indication of freed memory in said virtual memory space that spans one or more fixed size memory units in physical memory; and,

adding said fixed size memory units to a free memory pool, said fixed size memory units in a free memory pool being directly allocatable to a process requiring backing physical memory store without the O/S deleting data in the freed fixed size memory units.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

14

The method as claimed in Claim 13, further comprising: maintaining information about said process and one or more free memory pools having fixed size memory units, said information used to directly allocate said freed fixed size memory units to a process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

15

The method as claimed in Claim 14, wherein said one or more free memory pools having freed fixed size memory units are organized according to criteria selected from the following: a process, a user, a security context, a processor, an applications node's status as being a Non-Uniform Memory Access (NUMA) node, and, a memory zone where fixed size freed memory units are made available, or combinations thereof.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

16

The method as claimed in Claim 14, wherein said fixed size memory unit comprises a physical memory page frame, and prior to said O/S adding one or more fixed size memory units into a free memory pool, unmapping a physical memory page frame from virtual memory space.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

17

The method as claimed in Claim 14, wherein said fixed size memory unit comprises a physical memory page frame, and prior to said O/S adding one or more fixed size memory units into a free memory pool, designating said physical memory page frame as read-only by a process while leaving said physical memory page frame mapped to said process's virtual memory space.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

18

The method as claimed in Claim 14, wherein said fixed size memory unit comprises a physical memory page frame, and prior to said O/S adding one or more fixed size memory units into a free memory pool, rendering said physical memory page frame as available for reuse by a process while leaving said physical memory page frame mapped to said process's virtual memory space.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

19

The method as claimed in Claim 16, wherein said O/S receives a page fault exception, and in response, said O/S: determining if a pool having freed memory units will not result in a data security breach if data included in said freed memory units corresponding to said pool is accessed by said process; and,

if no data security breach results, allocating one or more freed memory page frames of that pool for said process without the O/S expending overhead of deleting data included in said one or more freed memory units.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

20

The method as claimed in Claim 19, wherein if no free page is available in a suitable free page pool: determining if a memory page frame is available in a system wide free memory pool, and if a page frame is available in a system wide free memory pool,

deleting data included in said memory page frame; and,

allocating memory page frames from a system wide free memory pool for said process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

21

The method as claimed in Claim 20, wherein if a memory page frame is not available in a system wide free memory pool, invoking pageout mechanism for increasing availability of system-wide free memory pages.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

22

The method as claimed in Claim 17, wherein said O/S receives a page fault exception, and in response, said O/S: determining whether a memory page frame needs to be allocated, and, if a memory page frame does not need to be allocated, then:

determining whether a free memory pool includes a physical memory page frame designated as read-only by said process, and if said free memory pool includes a physical memory page frame designated as read-only,

removing said page from said free memory pool and designating said memory page frame as available for reuse by re-enabling a process's write access to its associated memory page frames.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

23

The method as claimed in Claim 22, wherein if it is determined that a memory page frame needs to be allocated, said O/S: determining if a memory page frame is available for reuse in said free memory pool; and,

allocating said freed memory page frame of that pool for said process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

24

The method as claimed in Claim 23, wherein if it is determined that a memory page frame is not available for reuse in said free memory pool: determining if a memory page frame is available in a system wide free memory pool, and if a page frame is available in a system wide free memory pool,

deleting data included in said memory page frame; and,

allocating memory page frames from a system wide free memory pool for said process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

25

The method as claimed in Claim 24, wherein if a memory page frame is not available in a system wide free memory pool, invoking pageout mechanism for increasing availability of system-wide free memory pages.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

26

The method as claimed in Claim 22, wherein if it is determined that a memory page frame needs to be allocated, said O/S determining whether said process allocates memory elsewhere in its virtual memory space, said O/S further: unmapping said freed page frame associated with that page frame's old virtual memory address in the process's virtual memory space, and

marking said freed page frame as no longer available for reuse, and,

mapping said freed page frame associated with said process to a new virtual address.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

27

The method as claimed in Claim 18, wherein said O/S receives a page fault exception, and in response, said O/S: determining whether a free memory pool includes a physical memory page available for reuse, and if said free memory pool includes a physical memory page frame available for reuse:

removing said page from said free memory pool;

determining whether the freed memory page is to be used by a process that freed it, and

allocating said page if said page is to be used by said freeing process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

28

The method as claimed in Claim 27, wherein if it is determined that a memory page frame is not available for reuse in said free memory pool: determining if a memory page frame is available in a system wide free memory pool, and if a page frame is available in a system wide free memory pool,

deleting data included in said memory page frame; and,

allocating memory page frames from a system wide free memory pool for said process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

29

The method as claimed in Claim 28, wherein if a memory page frame is not available in a system wide free memory pool, invoking pageout mechanism for increasing availability of system-wide free memory pages.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

30

The method as claimed in Claim 13, wherein said O/S tracks fixed size memory units that are available system-wide, said method including: determining whether an amount of fixed size memory units tracked system-wide is below a threshold amount.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

31

The method as claimed in Claim 30, wherein if said amount of fixed size memory units tracked system-wide is below a threshold amount said O/S: determining if a suitable free page pool to reclaim freed fixed size memory units from; and,

reclaiming said freed fixed size memory units from that free memory pool.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

32

The method as claimed in Claim 31, wherein said freed memory units designated as available for reuse from a pool are reclaimed based on criteria including: a size of said free memory pool; an allocation rate from the pool; a rate at which memory is freed into the pool; a net allocation rate of the pool; and a length of time memory has been assigned to the pool, or combinations of these.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

33

The method as claimed in Claim 31, wherein if it is determined that no page frames are available in said free memory pools, or no suitable free page pool exists to reclaim freed memory pages from, then invoking pageout mechanism for increasing availability of system-wide free memory pages.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

34

The method as claimed in Claim 30, wherein a process having freed fixed size memory units marked available for reuse is associated with an executing parent process, wherein upon determination of said process terminating, said method further comprising the step of: determining that said process does not present a security conflict with said parent process; and,

upon determining no security conflict exists, releasing said freed fixed size memory units marked available for reuse to said parent process.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

35

The method as claimed in Claim 34, further comprising: the step of releasing said freed fixed size memory units into said system wide free memory pool when a process terminates, wherein said freed fixed size memory units of said system-wide free pool are available system-wide.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

36

The method as claimed in Claim 35, wherein said process having freed fixed size memory units marked available for reuse is associated with an executing parent process, wherein when said process terminates, said method further comprising: comparing computer system performance for executing a step of releasing said freed fixed size memory units marked available for reuse by a terminating process to its parent process against a computer system performance for executing a step of releasing said freed fixed size memory units marked available for reuse into a global free pool of fixed size memory units when said process terminates; and,

choosing a method of releasing said freed fixed size memory units marked available for reuse according to said performance comparison.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

37

The method as claimed in Claim 36, wherein said comparing comprises: measuring the computer system performance for releasing said freed fixed size memory units marked available for reuse at one of: a computer system start-up time, or at a computer system run time when said freed fixed size memory units marked available for reuse are to be allocated.

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

38

A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to manage memory freed by processes executing in a virtual memory space of a computer system according to [[claim 13.]]

Relevance

The article claims that this is both a function of the hardware and that software is not 'novel' as it creation can be brute forced by an automated process.

Claim Chart

All

Type of Prior Art	Online Publication

URL	http://deepthought.newsvine.com...

Author/Creator	Deep_Thought

Title	Software Patents - A Modern Fool's Gold?

Publication Date	July 11, 2005

Publisher	NewsVine

Directions to Document Location

Additional Information

Summary / Description	An arguement that software patents cannot be granted as by default they constitute prior art.

Notes