Patents by Inventor Michael Bryan Mitchell
Michael Bryan Mitchell has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20260252481Abstract: There is provided a data processing apparatus in which prediction circuitry stores a plurality of mappings from instructions to payloads. Query circuitry responds to a reference to one of the instructions provided as at least part of an input by outputting one of the payloads that maps to the one of the instructions. The payloads include one of a plurality of predictions and a prediction type that indicates which of a plurality of data speculation techniques the one of a plurality of predictions relates. The prediction circuitry stores, for each of the instructions, the prediction type as one of a plurality of different prediction types.Type: ApplicationFiled: February 27, 2025Publication date: August 27, 2026Inventors: Alexander Cole SHULYAK, Robert Douglas CLANCY, Michael Bryan MITCHELL, ABHISHEK RAJA, Rami Mohammed AL SHEIKH
-
Publication number: 20260044454Abstract: Embodiments of the present disclosure include techniques for managing dirty data. An agent receives a request for data. If the data is dirty data, the agent may use a replacement policy to determine if the data should be passed clean or dirty to the requestor. The replacement policy may correspond to how long the dirty data being stored in a cache line is to be maintained. In one embodiment, the replacement policy is a circuit, such as an SRAM and a logic circuit, for example.Type: ApplicationFiled: July 18, 2025Publication date: February 12, 2026Inventors: Kevin Neal MAGILL, Eric Francis ROBINSON, Jason Lawrence PANAVICH, Michael Bryan MITCHELL, Michael Peter WILSON
-
Patent number: 12386753Abstract: Embodiments of the present disclosure include techniques for managing dirty data. An agent receives a request for data. If the data is dirty data, the agent may use a replacement policy to determine if the data should be passed clean or dirty to the requestor. The replacement policy may correspond to how long the dirty data being stored in a cache line is to be maintained. In one embodiment, the replacement policy is a circuit, such as an SRAM and a logic circuit, for example.Type: GrantFiled: December 19, 2022Date of Patent: August 12, 2025Assignee: Microsoft Technology Licensing, LLCInventors: Kevin Neal Magill, Eric Francis Robinson, Jason Lawrence Panavich, Michael Bryan Mitchell, Michael Peter Wilson
-
Publication number: 20240202130Abstract: Embodiments of the present disclosure include techniques for managing dirty data. An agent receives a request for data. If the data is dirty data, the agent may use a replacement policy to determine if the data should be passed clean or dirty to the requestor. The replacement policy may correspond to how long the dirty data being stored in a cache line is to be maintained. In one embodiment, the replacement policy is a circuit, such as an SRAM and a logic circuit, for example.Type: ApplicationFiled: December 19, 2022Publication date: June 20, 2024Inventors: Kevin Neal MAGILL, Eric Francis ROBINSON, Jason Lawrence PANAVICH, Michael Bryan MITCHELL, Michael Peter WILSON
-
Patent number: 9201801Abstract: A computing device includes: an instruction cache storing primary execution unit instructions and auxiliary execution unit instructions in a sequential order; a primary execution unit configured to receive and execute the primary execution unit instructions from the instruction cache; an auxiliary execution unit configured to receive and execute only the auxiliary execution unit instructions from the instruction cache in a manner independent from and asynchronous to the primary execution unit; and completion circuitry configured to coordinate completion of the primary execution unit instructions by the primary execution unit and the auxiliary execution unit instructions according to the sequential order.Type: GrantFiled: September 15, 2010Date of Patent: December 1, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bechara F. Boury, Michael Bryan Mitchell, Paul Michael Steinmetz, Kenichi Tsuchiya
-
Publication number: 20120066483Abstract: A computing device includes: an instruction cache storing primary execution unit instructions and auxiliary execution unit instructions in a sequential order; a primary execution unit configured to receive and execute the primary execution unit instructions from the instruction cache; an auxiliary execution unit configured to receive and execute only the auxiliary execution unit instructions from the instruction cache in a manner independent from and asynchronous to the primary execution unit; and completion circuitry configured to coordinate completion of the primary execution unit instructions by the primary execution unit and the auxiliary execution unit instructions according to the sequential order.Type: ApplicationFiled: September 15, 2010Publication date: March 15, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bechara F. Boury, Michael Bryan Mitchell, Paul Michael Steinmetz, Kenichi Tsuchiya
-
Patent number: 7752396Abstract: Embodiments include a cache controller adapted to determine whether a memory line for which the processor is to issue an address-only kill request resides in a fill buffer for the cache line in a shared state. If so, the cache controller may mark the fill buffer as not having completed bus transactions and issue the address-only kill request for that fill buffer. The address-only kill request may transmit to other processors on the bus and the other processors may respond by invalidating the cache entries for the memory line. Upon confirmation from the other processors, a bus arbiter may confirm the kill request, promoting the memory line already in that fill buffer to exclusive state. Once promoted, the fill buffer may be marked as having completed the bus transactions and may be written into the cache.Type: GrantFiled: August 22, 2008Date of Patent: July 6, 2010Assignee: International Business Machines CorporationInventors: James Norris Dieffenderfer, Praveen G. Karandikar, Michael Bryan Mitchell, Thomas Philip Speier, Paul Michael Steinmetz
-
Patent number: 7523265Abstract: Systems and arrangements promoting a line from shared to exclusive in cache are contemplated. Embodiments include a cache controller adapted to determine whether a memory line for which the processor is to issue an address-only kill request resides in a fill buffer for the cache line in a shared state. If so, the cache controller may mark the fill buffer as not having completed bus transactions and issue the address-only kill request for that fill buffer. The address-only kill request may transmit to other processors on the bus and the other processors may respond by invalidating the cache entries for the memory line. Upon confirmation from the other processors, a bus arbiter may confirm the kill request, promoting the memory line already in that fill buffer to exclusive state. Once promoted, the fill buffer may be marked as having completed the bus transactions and may be written into the cache.Type: GrantFiled: March 18, 2005Date of Patent: April 21, 2009Assignee: International Business Machines CorporationInventors: James Norris Dieffenderfer, Praveen G. Karandikar, Michael Bryan Mitchell, Thomas Philip Speier, Paul Michael Steinmetz
-
Publication number: 20080313410Abstract: Embodiments include a cache controller adapted to determine whether a memory line for which the processor is to issue an address-only kill request resides in a fill buffer for the cache line in a shared state. If so, the cache controller may mark the fill buffer as not having completed bus transactions and issue the address-only kill request for that fill buffer. The address-only kill request may transmit to other processors on the bus and the other processors may respond by invalidating the cache entries for the memory line. Upon confirmation from the other processors, a bus arbiter may confirm the kill request, promoting the memory line already in that fill buffer to exclusive state. Once promoted, the fill buffer may be marked as having completed the bus transactions and may be written into the cache.Type: ApplicationFiled: August 22, 2008Publication date: December 18, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James Norris Dieffenderfer, Praveen G. Karandikar, Michael Bryan Mitchell, Thomas Philip Speier, Paul Michael Steinmetz