Abstract: A method for managing objects stored in memory is presented. The method may include receiving, by a memory allocator in a garbage collected system, a first free memory chunk. The method may include creating a node to associate with the first free memory chunk and ensuring that a first memory region containing the node will be considered to be free memory during a sweeping phase of the garbage collected system.

Abstract: Examples disclosed herein relate to pointers in a memory managed system. A garbage collection thread in a garbage collection system indicates via a first indication, that the garbage collection system has entered a marking phase, the garbage collection system managing a heap of memory. The garbage collection thread attempts to modify a conversion status variable, associated with a mutator thread belonging to a set of mutator threads associated with the garbage collection system, from a first conversion status value, indicating that the mutator thread is performing a weak pointer conversion operation, to a second conversion status value indicating that a handshake is required between the garbage collection thread and the mutator thread. The garbage collection thread determines that the conversion status variable does not contain the second conversion status value. The garbage collection thread determines that a set of pointers is empty.

Abstract: Determining cache value currency using persistent markers is disclosed herein. In one example, a cache entry is retrieved from a local cache memory device. The cache entry includes a key, a value to be used by the computing device, and a marker flag to determine whether the cache entry is current. The local cache memory device also includes a marker location that indicates a location of a marker in a shared persistent fabric-attached memory (FAM). Using a marker location, the marker is retrieved from the shared persistent FAM. From the marker and the marker flag, it is determined whether the cache entry is current. The shared FAM pool is connected to the local cache memory devices of multiple computing devices.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method includes receiving location-locked data (LLD), receiving at least location information related to a permitted region, and deterministically generating at least one location-specific encryption key (LSK) based at least on the location information related to the permitted region. The method further includes encrypting the LLD such that the encrypted LLD can be decrypted using one of the at least on LSK.

Abstract: A method for managing objects stored in memory is presented. The method may include receiving, by a memory allocator in a garbage collected system, a first free memory chunk. The method may include creating a node to associate with the first free memory chunk and ensuring that a first memory region containing the node will be considered to be free memory during a sweeping phase of the garbage collected system.

Abstract: Determining cache value currency using persistent markers is disclosed herein. In one example, a cache entry is retrieved from a local cache memory device. The cache entry includes a key, a value to be used by the computing device, and a marker flag to determine whether the cache entry is current. The local cache memory device also includes a marker location that indicates a location of a marker in a shared persistent fabric-attached memory (FAM). Using a marker location, the marker is retrieved from the shared persistent FAM. From the marker and the marker flag, it is determined whether the cache entry is current. The shared FAM pool is connected to the local cache memory devices of multiple computing devices.

Abstract: Examples disclosed herein relate to pointers in a memory managed system. A garbage collection thread in a garbage collection system indicates via a first indication, that the garbage collection system has entered a marking phase, the garbage collection system managing a heap of memory. The garbage collection thread attempts to modify a conversion status variable, associated with a mutator thread belonging to a set of mutator threads associated with the garbage collection system, from a first conversion status value, indicating that the mutator thread is performing a weak pointer conversion operation, to a second conversion status value indicating that a handshake is required between the garbage collection thread and the mutator thread. The garbage collection thread determines that the conversion status variable does not contain the second conversion status value. The garbage collection thread determines that a set of pointers is empty.

Abstract: Techniques disclosed herein relate to a method performed on a computing device. The method includes receiving a request to execute an instruction specified to access a first unit of memory identified by a target address. The instruction is associated with a second unit of memory associated with a source address. The method also includes determining whether the request to execute the instruction is trusted to access the first memory unit based on the target address and the source address.

Abstract: Techniques disclosed herein relate to a method performed on a computing device in response to a request to identify a segment of memory. The method includes determining a desired sensitivity value for the request and determining a desired trust value for the request. The method also includes producing a memory segment identification result based on the desired sensitivity value and based on the desired trust value.

Abstract: In one example in accordance with the present disclosure, a method may include identifying, by a first operating system process in a computer system accessing a shared memory heap, a first object at a first memory address in the shared memory heap. The first object may have been previously allocated in the shared memory heap by a second operating system process. The method may also include identifying an object descriptor associated with the first object at a second memory address in the shared memory heap. The object descriptor occupies a number of bits of memory independent of the type. The method may also include determining a size of the first object based on the object descriptor, enumerating, based on the object descriptor, fields associated with the first object and performing an action based on each field of the enumerated fields.

Abstract: In one example in accordance with the present disclosure, a method for managing objects stored in memory may include identifying a first object in a heap. The heap may be accessed by a plurality of mutator threads executing within a first plurality of operating system processes. The method may also include determining that the first object is a reachable object and determining that a first range of memory locations in the heap does not contain any reachable object. The method may also include receiving an allocation request from a second mutator thread from the plurality of mutator threads and allocating a first free chunk of memory including at least a part of the first range of memory locations to the second mutator thread.

Abstract: In one example in accordance with the present disclosure, a method may include identifying, by a first operating system process in a computer system accessing a shared memory heap, a first object at a first memory address in the shared memory heap. The first object may have been previously allocated in the shared memory heap by a second operating system process. The method may also include identifying an object descriptor associated with the first object at a second memory address in the shared memory heap. The object descriptor occupies a number of bits of memory independent of the type. The method may also include determining a size of the first object based on the object descriptor, enumerating, based on the object descriptor, fields associated with the first object and performing an action based on each field of the enumerated fields.

Abstract: In one example in accordance with the present disclosure, a method for managing objects stored in memory may include identifying a first object in a heap. The heap may be accessed by a plurality of mutator threads executing within a first plurality of operating system processes. The method may also include determining that the first object is a reachable object and determining that a first range of memory locations in the heap does not contain any reachable object. The method may also include receiving an allocation request from a second mutator thread from the plurality of mutator threads and allocating a first free chunk of memory including at least a part of the first range of memory locations to the second mutator thread.

Abstract: A method and system of providing training information for training a categorizer includes receiving a query relating to at least one category and identifying at least one case within a data set that matches the query. The method and system receives one of a first indication that the identified at least one case belongs to the category, and a second indication that the identified at least one case does not belong to the category. Training information is modified based on receiving one of the first indication and second indication.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method includes receiving location-locked data (LLD), receiving at least location information related to a permitted region, and deterministically generating at least one location-specific encryption key (LSK) based at least on the location information related to the permitted region. The method further includes encrypting the LLD such that the encrypted LLD can be decrypted using one of the at least on LSK.

Abstract: Techniques disclosed herein relate to a method performed on a computing device in response to a request to identify a segment of memory. The method includes determining a desired sensitivity value for the request and determining a desired trust value for the request. The method also includes producing a memory segment identification result based on the desired sensitivity value and based on the desired trust value.

Abstract: Techniques disclosed herein relate to a method performed on a computing device. The method includes receiving a request to execute an instruction specified to access a first unit of memory identified by a target address. The instruction is associated with a second unit of memory associated with a source address. The method also includes determining whether the request to execute the instruction is trusted to access the first memory unit based on the target address and the source address.

Abstract: The present disclosure provides a computer-implemented method of processing Web activity data. The method includes obtaining a collection of Web activity data generated by a plurality of users at a plurality of Webpages, wherein the Webpages are from a plurality of unaffiliated Websites. The method also includes extracting a plurality of search terms from the Web activity data and associating each of the plurality of search terms with a corresponding Webpage. The method also includes generating statistical data from the Web activity data based, at least in part, on the search terms, the statistical data corresponding to the online activity at one or more Webpages.

Abstract: Provided are, among other things, systems, methods, apparatuses and techniques for storing access grants. In one implementation, a blinding factor and access information for accessing a restricted object are obtained; blinded access information is generated for the restricted object based on the access information and the blinding factor; and an anchor node is stored into a data store, with the anchor node being accessible by submission of an identifier, the anchor node at least one of containing or referring to sufficient information to obtain access to the blinding factor and the blinded access information, and the identifier for the anchor node being independent of the blinding factor.

Abstract: Plural change events are associated with corresponding listeners, where the plural change events represent distinct groups of one or more changes made to a collection of items. In response to a further change of the collection of items, the plural change events are modified to include the further change. The listeners are notified of respective plural change events.