Christopher Kleynhans

US Patent:

20210109795, Apr 15, 2021

Filed:

Oct 11, 2019

Appl. No.:

16/599195

Inventors:

- Redmond WA, US
Rahul NAIR - Bellevue WA, US
Mark Allan BELLON - Seattle WA, US
Christopher Peter KLEYNHANS - Bothell WA, US
Jason LIN - Bellevue WA, US
Ojasvi CHOUDHARY - Seattle WA, US
Tristan Anthony BROWN - Seattle WA, US

Assignee:

Microsoft Technology Licensing, LLC - Redmond WA

International Classification:

G06F 9/50
G06F 9/48

Abstract:

Described herein is a system and method for latency-aware thread scheduled. For each processor core, an estimated cost to schedule a particular thread on the processor core is calculated. The estimated cost to schedule can be a period of time between the scheduling decision and the point in time where the scheduled thread begins to run. For each processor core, an estimated cost to execute the particular thread on the processor core is calculated. The estimated cost to execute can be a period of time spent actually running the particular thread on a particular processor core. A determination as to which processor core to utilize for execution of the particular thread based, at least in part, upon the calculated estimated costs to schedule the particular thread and/or the calculated estimated costs to execute the particular thread. The particular thread can be scheduled to execute on the determined processor core.

US Patent:

20200218560, Jul 9, 2020

Filed:

Jan 9, 2019

Appl. No.:

16/243938

Inventors:

- Redmond WA, US
Gregory John COLOMBO - Kirkland WA, US
Mehmet IYIGUN - Kirkland WA, US
Yevgeniy BAK - Redmond WA, US
Christopher Peter KLEYNHANS - Bellevue WA, US
Stephen Louis-Essman HUFNAGEL - Northville MI, US
Michael EBERSOL - Woodinville WA, US
Ahmed Saruhan KARADEMIR - Seattle WA, US
Shawn Michael DENBOW - Bellevue WA, US
Kevin BROAS - Kirkland WA, US
Wen Jia LIU - Seattle WA, US

International Classification:

G06F 9/455

Abstract:

Communicating a low-latency event across a virtual machine boundary. Based on an event signaling request by a first process running at a first virtual machine, the first virtual machine updates a shared register that is accessible by a second virtual machine. Updating the shared register includes updating a signal stored in the shared register. The first virtual machine sends an event signal message, which includes a register identifier, through a virtualization fabric to the second virtual machine. The second virtual machine receives the event signaling message and identifies the register identifier from the message. Based on the register identifier, the second virtual machine reads the shared register, identifying a value of the signal stored in the shared register. Based at least on the value of the signal comprising a first value, the second virtual machine signals a second process running at the second virtual machine.

US Patent:

20180314547, Nov 1, 2018

Filed:

Apr 26, 2017

Appl. No.:

15/497482

Inventors:

- Redmond WA, US
Mehmet Iyigun - Kirkland WA, US
Christopher Peter Kleynhans - Bellevue WA, US
Syed A. Raza - Chicago IL, US

Assignee:

Microsoft Technology Licensing, LLC - Redmond WA

International Classification:

G06F 9/48
G06F 9/50

Abstract:

The threads of a user mode process can access various different resources of a computing device, and such access can be serialized. To access a serialized resource, a thread acquires a lock for the resource. For each context switch in the computing device, a module of the operating system kernel checks for priority inversions, which is a situation in which a higher priority thread of the user mode process is waiting for (blocking on) a resource for which a lower priority thread has acquired a lock. In response to detecting such a priority inversion, the priority of the lower priority thread is boosted to allow the priority thread to execute and eventually release the lock that the higher priority thread is waiting for.

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:

20140372356, Dec 18, 2014

Filed:

Jun 12, 2013

Appl. No.:

13/915870

Inventors:

- Redmond WA, US
Mehmet Iyigun - Kirkland WA, US
Milos Kralj - Bellevue WA, US
Christopher Kleynhans - Redmond WA, US
Hari Pulapaka - Redmond WA, US
Arun Kishan - Kirkland WA, US
Asela Gunawardana - Seattle WA, US
Paul Koch - Redmond WA, US
Christopher Meek - Kirkland WA, US
Eric Horvitz - Kirkland WA, US
Rich Caruana - Redmond WA, US
Michael Fortin - Redmond WA, US

International Classification:

G06N 5/02

US Classification:

706 46

Abstract:

Systems and methods of pre-launching applications in a computer system, said applications being likely to be activated by a user from a terminated and/or suspended process state, are disclosed. The pre-launching of an application may be based on the assessed probability of the application being activated—as well as the level of availability of system resources to affect such pre-launching. Applications may be pre-launched based on these and other conditions/considerations, designed to improve the user's experience of a quick launch of applications in the background. Several prediction models are presented to provide a good estimate of the likelihood of an application being activated by a user. Such prediction models may comprise an adaptive predictor (based on past application usage situations) and/or a switch rate predictor (based on historic data of an application being switched and, possibly, having a decay rate applied to such switch rate measure).