John R Erickson

US Patent:

20110314338, Dec 22, 2011

Filed:

Jun 18, 2010

Appl. No.:

12/819069

Inventors:

John Erickson - Redmond WA, US
Madan Musuvathi - Redmond WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 11/26
G06F 12/00

US Classification:

714 37, 714E11159, 714 42, 711147, 711E12001

Abstract:

Described are techniques for detecting data collisions between a first portion and a second portion of an application executing on a computer, the first portion and the second portions executing concurrently with respect to each other. While the first portion and second portion are executing, before the first portion accesses a memory location shared by the first portion and the second portion, a value stored in the memory location is captured and the first portion is delayed. While the second portion continues to execute the first portion is delayed. After a period of the first portion having been paused or slowed, the current content of the memory location is compared with the captured content to determine if there is a data collision. The first and second portions may be threads, and the capturing, delaying, and determining may be performed by code inserted to the application after it has been compiled.

US Patent:

20120204062, Aug 9, 2012

Filed:

Feb 9, 2011

Appl. No.:

13/023547

Inventors:

John Erickson - Redmond WA, US
Madan Musuvathi - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/07

US Classification:

714 35, 714E11029

Abstract:

The claimed subject matter provides a method for detecting a data race. The method includes inserting a plurality of breakpoints into a corresponding plurality of program locations. Each of the program locations accesses a plurality of memory locations. Each of the program locations is selected randomly. The method also includes detecting one or more data races for the memory locations in response to one or more of the breakpoints firing. Additionally, the method includes generating a report describing the one or more data races.

US Patent:

20180293068, Oct 11, 2018

Filed:

Apr 10, 2017

Appl. No.:

15/483845

Inventors:

- Redmond WA, US
John Thomas Erickson - Mercer Island WA, US
Vinod Sridharan - Bellevue WA, US
Dandan He - Bellevue WA, US
Wolfram Schulte - Bellevue WA, US

International Classification:

G06F 9/44
G06F 12/0897

Abstract:

Technologies that allow for a significant reduction in the time required to incrementally build large computer programs, and increase in the scale of build systems that perform builds. The time reduction is caused by reducing the time required for processing systems in a distributed build system to acquire files needed for the respective processing system to perform their respective part of the build. The scale increase comes from relying on local processing systems instead of centralized processing systems. This is done by establishing a tier of cache locations on which appropriate files for a build may be found by the appropriate processing system. A system may be established that allows for the processor systems to validate that the files have not been tampered with by using signatures, and were appropriately identified.

US Patent:

20180218005, Aug 2, 2018

Filed:

Jan 28, 2017

Appl. No.:

15/418704

Inventors:

- Redmond WA, US
John Thomas ERICKSON - Mercer Island WA, US
Sudipta SENGUPTA - Redmond WA, US
Vinod SRIDHARAN - Bellevue WA, US
Xianzheng DOU - Ann Arbor MI, US
Wolfram SCHULTE - Bellevue WA, US

International Classification:

G06F 17/30
G06F 9/45
G06F 9/44

Abstract:

Deduplication is integrated with software building and chunk storing. A dedup module includes dedup software, a build graph interface, and a chunk store interface. A dedup graph includes a portion of the build graph, and a portion that represents build artifact file chunks. The dedup software queries whether chunks are present in the chunk store, submits a chunk for storage when the chunk is not already present, and avoids submitting the chunk when it is present. Queries may use hash comparisons, a hash tree dedup graph, chunk expiration dates, content addressable chunk store memory, inference of a child node's presence, recursion, and a local cache of node hashes and node expiration dates, for example. A change caused by the build impacts fewer dedup graph nodes than directory graph nodes, resulting in fewer storage operations to update the chunk storage with new or changed build artifacts.

US Patent:

20140341212, Nov 20, 2014

Filed:

Jul 30, 2014

Appl. No.:

14/447342

Inventors:

- HOLMDEL NJ, US
JOHN ERICKSON - SEATTLE WA, US
EUGENE PETER CANNON - RED BANK NJ, US

International Classification:

H04L 12/927
H04L 12/16

US Classification:

370352

Abstract:

An IP telephony system allows a user to register a telephony device that receives its native telephony service from a different telephony service provider as an extension telephone. The user can then place calls through the IP telephony system using the extension telephone. Such calls may or may not be established using the extension telephone's native telephony service provider.

US Patent:

20140341213, Nov 20, 2014

Filed:

Jul 30, 2014

Appl. No.:

14/447432

Inventors:

- HOLMDEL NJ, US
JOHN ERICKSON - SEATTLE WA, US
EUGENE PETER CANNON - RED BANK NJ, US

International Classification:

H04M 7/00
H04L 29/06

US Classification:

370352

Abstract:

An IP telephony system allows a user to register a telephony device that receives its native telephony service from a different telephony service provider as an extension telephone. The user can then place calls through the IP telephony system using the extension telephone. Such calls may or may not be established using the extension telephone's native telephony service provider.

US Patent:

20140341364, Nov 20, 2014

Filed:

Jul 30, 2014

Appl. No.:

14/447125

Inventors:

- HOLMDEL NJ, US
JOHN ERICKSON - SEATTLE WA, US
EUGENE PETER CANNON - RED BANK NJ, US

International Classification:

H04M 3/42

US Classification:

37914205

Abstract:

An IP telephony system allows a user to register a telephony device that receives its native telephony service from a different telephony service provider as an extension telephone. The user can then place calls through the IP telephony system using the extension telephone. Such calls may or may not be established using the extension telephone's native telephony service provider.

US Patent:

20140270121, Sep 18, 2014

Filed:

Jun 26, 2013

Appl. No.:

13/928057

Inventors:

- Holmdel NJ, US
CHAKRAPANI GORREPATI - MORGANVILLE NJ, US
DEEPAK OTTUR - BELLE MEAD NJ, US
JOHN ERICKSON - SEATTLE WA, US

International Classification:

H04L 29/06
H04M 3/38

US Classification:

379 9302

Abstract:

A method and apparatus for routing Application Programming Interface (API) calls from a partner entity to a telephony service provider (TSP) network are provided herein. In some embodiments, a method for routing API calls may include receiving a first message including an API call and a partner API key used to authenticate the partner entity on the TSP network to access a partner API layer disposed on the TSP network, extracting the partner API key from the first message, performing an authentication process to authenticate an identity of the partner entity using at least the extracted partner API key, and routing the first message based on results of the authentication process. In some embodiments, the first message is routed to the partner API layer disposed on the TSP network when the identity of the partner entity is authenticated.