Abstract: In an aspect, an apparatus comprises a writer agent, wherein the writer agent may obtain exclusive access to at least one coherence granule of shared memory with respect to one or more other agents. The writer agent may mark, at the writer agent, completion of a store of the at least one coherence granule prior to receipt of data for the at least one coherence granule from the shared memory. The writer agent may receive the data from the shared memory for the at least one coherence granule. The writer agent may store the data at a local cache of the writer agent. The writer agent may modify the data at the writer agent.

Abstract: In an aspect, an apparatus comprises a writer agent, wherein the writer agent may obtain exclusive access to at least one coherence granule of shared memory with respect to one or more other agents. The writer agent may mark, at the writer agent, completion of a store of the at least one coherence granule prior to receipt of data for the at least one coherence granule from the shared memory. The writer agent may receive the data from the shared memory for the at least one coherence granule. The writer agent may store the data at a local cache of the writer agent. The writer agent may modify the data at the writer agent.

Abstract: A draw lottery ticket selling system and methods of operating the system that enable the purchase of draw lottery tickets by players, and the remote printing of the draw lottery tickets using different devices.

Abstract: Disclosed is a prefetcher, e.g., of a system with one or more cores. The prefetcher determines data dependency access (DDA) patterns, such as array indirect access, and prefetches data based on the DDA patterns.

Abstract: An apparatus and method for early page address prediction. For example, one embodiment of a processor comprises: an instruction fetch circuit to fetch a load instruction; a decoder to decode the load instruction; execution circuitry to execute the load instruction to perform a load operation, the execution circuitry including an address generation unit (AGU) to generate an effective address to be used for the load operation; and early page prediction (EPP) circuitry to use one or more attributes associated with the load instruction to predict a physical page address for the load instruction simultaneously with the AGU generating the effective address and/or prior to generation of the effective address.

Abstract: A computer implemented method of detecting execution of unregistered code in a protected networked system, comprising maintaining a pages registry record in a storage of an endpoint in a protected networked system, the pages registry record comprising a registration signature for each of a plurality of registered executable pages, monitoring a plurality of executable pages at a page management level using an adjusted page fault handler of an operating system kernel executed by one or more processors of the endpoint, detecting one or more unregistered executable pages by identifying incompliance of a runtime signature calculated in runtime for the unregistered executable page(s) with respective registration signature stored in the pages registry record and initiating one or more actions in case of the detection of the unregistered executable page(s).

Abstract: An apparatus and method for early page address prediction. For example, one embodiment of a processor comprises: an instruction fetch circuit to fetch a load instruction; a decoder to decode the load instruction; execution circuitry to execute the load instruction to perform a load operation, the execution circuitry including an address generation unit (AGU) to generate an effective address to be used for the load operation; and early page prediction (EPP) circuitry to use one or more attributes associated with the load instruction to predict a physical page address for the load instruction simultaneously with the AGU generating the effective address and/or prior to generation of the effective address.

Abstract: Among other things, flow rates of traffic among endpoints in a network are controlled. Notifications are received about flowlets originating or received at the endpoints. Each of the flowlets includes one or more packets that are in a queue associated with a corresponding flowlet. In response to the received notifications, updated flow rates are computed for the flowlets. The updated flow rates are sent to devices for use in controlling flow rates for the flowlets in accordance with the computed updated flow rates.

Abstract: Among other things, flow rates of traffic among endpoints in a network are controlled. Notifications are received about flowlets originating or received at the endpoints. Each of the flowlets includes one or more packets that are in a queue associated with a corresponding flowlet. In response to the received notifications, updated flow rates are computed for the flowlets. The updated flow rates are sent to devices for use in controlling flow rates for the flowlets in accordance with the computed updated flow rates. Also, rates of flow at endpoints of a network are controlled. A device in the network sends notification of a start or end of a flowlet at an endpoint of the network. The notification is sent to an allocator to which other devices send notifications with respect to other flowlets. At the device, a communication rate is received from the allocator. The rate is one of a set of communication rates for flowlets starting and ending at endpoints of the network.

Abstract: Described herein are new error-correction (channel) codes: permute codes, iterative ensembles of permute and spinal codes, and graphical hash codes. In one aspect, a wireless system includes an encoder configured to encode data using one of the aforementioned channel codes. The wireless system also includes a decoder configured to decode the encoded data.

Abstract: In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function.

Abstract: Described herein are new error-correction (channel) codes: permute codes, iterative ensembles of permute and spinal codes, and graphical hash codes. In one aspect, a wireless system includes an encoder configured to encode data using one of the aforementioned channel codes. The wireless system also includes a decoder configured to decode the encoded data.

Abstract: In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function.

Abstract: In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function.

Abstract: In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function.