Syed Muneeb Hasan

US Patent:

20160110283, Apr 21, 2016

Filed:

Oct 20, 2014

Appl. No.:

14/518995

Inventors:

- Redmond WA, US
Yevgeniy Bak - Redmond WA, US
Christopher Peter Kleynhans - Bellevue WA, US
Syed Aunn Hasan Raza - Bellevue WA, US
Thomas James Ootjers - Kirkland WA, US
Neeraj Kumar Singh - Seattle WA, US

International Classification:

G06F 12/08

Abstract:

Disclosed are techniques and systems for providing on-demand expansion of a non-cache-aware synchronization primitive to a cache-aware form. The expansion may occur on-demand when it becomes necessary to do so for performance and throughput purposes. Expansion of the synchronization primitive may be based at least in part on a level of cache-line contention resulting from operations on the non-cache-aware synchronization primitive. The synchronization primitive in the expanded (cache-aware) form may be represented by a data structure that allocates individual cache lines to respective processors of a multiprocessor system in which the synchronization primitive is implemented. Once expanded, the cache-aware synchronization primitive may be contracted to its non-cache-aware form.

US Patent:

20140359632, Dec 4, 2014

Filed:

May 31, 2013

Appl. No.:

13/907415

Inventors:

- Redmond WA, US
Neill Michael Clift - Kirkland WA, US
Mehmet Iyigun - Kirkland WA, US
Yevgeniy Bak - Redmond WA, US
Syed Aunn Hasan Raza - Bellevue WA, US

International Classification:

G06F 9/48

US Classification:

718103

Abstract:

A priority-based scheduling and execution of threads may enable the completion of higher-priority tasks above lower-priority tasks. Occasionally, a high-priority thread may request a resource that has already been reserved by a lower-priority thread, and the higher-priority thread may be blocked until the lower-priority thread relinquishes the reservation. Such prioritization may be acceptable if the lower-priority thread is able to execute comparatively unimpeded, but in some scenarios, the lower-priority thread may execute at a lower priority than a third thread that also has a lower priority than the high-priority thread. In this scenario, the third thread is effectively but incorrectly prioritized above the high-priority thread. Instead, upon detecting this scenario, the device may temporarily elevate the priority of the lower-priority thread over the priority of the third thread until the lower-priority thread relinquishes the resource, thereby reducing the waiting period of the high-priority thread for the requested resource.