JEREMY ERIC ELSON
Pilots at Terry Ave, Seattle, WA
License number
Washington A4377472
Issued Date
Apr 2016
Expiration Date
Apr 2018
Category
Airmen
Type
Authorized Aircraft Instructor
Address
Address
1420 Terry Ave UNIT 2403, Seattle, WA 98101
Professional information
Jeremy Elson
Location:
Greater Seattle Area
Industry:
Computer Software
Effective Circuits In Packet-Switched Networks
US Patent:
2012027, Nov 1, 2012
Filed:
Apr 28, 2011
Appl. No.:
13/096194
Inventors:
Jeremy E. Elson - Seattle WA, US
Edmund B. Nightingale - Redmond WA, US
Edmund B. Nightingale - Redmond WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 15/16
US Classification:
709206
Abstract:
The creation of an effective circuit between a sender device and a receiver device over the packet-switched network is described herein. To establish the effective circuit, the sender device sends a request to the receiver device through the packet-switched network. The request is associated with a bandwidth reservation from the receiver device for reception of a message from the sender device. The receiver device receives multiple requests from multiple sender devices and reserves bandwidth for at least one of the sender devices. The receiver device then sends a response to the at least one sender device providing clearance to send the message to the receiver device using the reserved bandwidth, the request and response establishing the effective circuit. The receiver device may also decline the requests of the other sender devices, causing the other sender devices to send other requests to other receiver devices.
Server Failure Recovery
US Patent:
2011025, Oct 20, 2011
Filed:
May 26, 2011
Appl. No.:
13/116270
Inventors:
Edmund B. Nightingale - Redmond WA, US
Jeremy E. Elson - Seattle WA, US
Jeremy E. Elson - Seattle WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 11/14
US Classification:
714 15, 714E11131
Abstract:
A metadata server configured to maintain storage assignment mappings in non-persistent storage is described herein. The tract storage assignment mappings associate servers with storage assignments, the storage assignments representing the data stored on the servers. Responsive to a failure, the metadata server receives the storage assignments from the servers and rebuilds the storage assignment mappings from the storage assignments. The metadata server is also configured to enable clients to operate during a recovery process for a failed server by providing the storage assignment mappings to the clients during the recovery process. Also during the recovery process, the replacement server for the failed server conditionally overwrites stored data with other data received from other servers as part of the recovery process. The replacement server conditionally overwrites based on version information associated with the data and version information associated with the other data, the version information being associated with one or more versions of the storage assignment mappings
Data Layout For Recovery And Durability
US Patent:
2011025, Oct 20, 2011
Filed:
May 20, 2011
Appl. No.:
13/112978
Inventors:
Jeremy E. Elson - Seattle WA, US
Edmund B. Nightingale - Redmond WA, US
John R. Douceur - Bellevue WA, US
Stuart Schechter - Kirkland WA, US
Peter L. Montgomery - Bellevue WA, US
Edmund B. Nightingale - Redmond WA, US
John R. Douceur - Bellevue WA, US
Stuart Schechter - Kirkland WA, US
Peter L. Montgomery - Bellevue WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 11/16, G06F 15/177
US Classification:
714 411, 709220
Abstract:
A Metadata server described herein is configured to generate a metadata table optimized for data durability and recovery. In generating the metadata table, the metadata server associates each possible combination of servers with one of the indices of the table, thereby ensuring that each server participates in recovery in the event of a server failure. In addition, the metadata server may also associate one or more additional servers with each index to provide added data durability. Upon generating the metadata table, the metadata server provides the metadata table to clients or servers. Alternatively, the metadata server may provide rules and parameters to clients to enable those clients to identify servers storing data items. The clients may use these parameters and an index as inputs to the rules to determine the identities of servers storing or designated to store data items corresponding to the index.
Parallel Serialization Of Request Processing
US Patent:
2012019, Aug 2, 2012
Filed:
Jan 31, 2011
Appl. No.:
13/017193
Inventors:
Edmund B. Nightingale - Redmond WA, US
Jeremy E. Elson - Seattle WA, US
Jeremy E. Elson - Seattle WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 15/16
US Classification:
709201
Abstract:
A plurality of servers configured to receive a plurality of requests associated with a plurality of byte sequences are described herein. The requests for each byte sequence are received by a single one of the servers. Each server is further configured to serially process the requests it receives while the other servers also perform serial processing of requests in parallel with the server. Also, the requests for each byte sequence are transmitted to the single one of the servers by a plurality of clients, each client independently identifying the single one of the servers for the byte sequence based on system metadata.
Reading And Writing During Cluster Growth Phase
US Patent:
8447833, May 21, 2013
Filed:
Mar 6, 2012
Appl. No.:
13/412944
Inventors:
Edmund B. Nightingale - Redmond WA, US
Jeremy E. Elson - Seattle WA, US
Jonathan R. Howell - Seattle WA, US
Jeremy E. Elson - Seattle WA, US
Jonathan R. Howell - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 3/16, G06F 15/16
US Classification:
709217, 709220, 709227, 709229
Abstract:
A client device configured to write to both a growth server and a live server replica that the growth server is replacing during a growth phase is described herein. The client device first determines the growth server designated to replace a corresponding live server replica of a set of server replicas associated with a storage index. The client device then transmits a write request associated with the storage index to the set of server replicas and to the growth server. The client device may perform the determining based on storage assignment mappings. The storage assignment mappings are provided to the client device by a metadata server while the growth server retrieves data associated with the storage index from the live server replica.
Block-Level Access To Parallel Storage
US Patent:
2014006, Mar 6, 2014
Filed:
Aug 30, 2012
Appl. No.:
13/598990
Inventors:
Bin Fan - Pittsburgh PA, US
Asim Kadav - Madison WI, US
Edmund Bernard Nightingale - Redmond WA, US
Jeremy E. Elson - Seattle WA, US
Richard F. Rashid - Prescott AZ, US
James W. Mickens - Bellevue WA, US
Asim Kadav - Madison WI, US
Edmund Bernard Nightingale - Redmond WA, US
Jeremy E. Elson - Seattle WA, US
Richard F. Rashid - Prescott AZ, US
James W. Mickens - Bellevue WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 12/10
US Classification:
711206, 711E12058
Abstract:
The subject disclosure is directed towards one or more parallel storage components for parallelizing block-level input/output associated with remote file data. Based upon a mapping scheme, the file data is partitioned into a plurality of blocks in which each may be equal in size. A translator component of the parallel storage may determine a mapping between the plurality of blocks and a plurality of storage nodes such that at least a portion of the plurality of blocks is accessible in parallel. Such a mapping, for example, may place each block in a different storage node allowing the plurality of blocks to be retrieved simultaneously and in its entirety.
Bandwidth-Proportioned Datacenters
US Patent:
8438244, May 7, 2013
Filed:
Apr 23, 2010
Appl. No.:
12/766726
Inventors:
Edmund B. Nightingale - Redmond WA, US
Jeremy E. Elson - Seattle WA, US
Jonathan R. Howell - Seattle WA, US
Galen C. Hunt - Bellevue WA, US
David A. Maltz - Bellevue WA, US
Jeremy E. Elson - Seattle WA, US
Jonathan R. Howell - Seattle WA, US
Galen C. Hunt - Bellevue WA, US
David A. Maltz - Bellevue WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/16
US Classification:
709219, 709231, 709235, 704261, 704262
Abstract:
A system including at least one storage node and at least one computation node connected by a switch is described herein. Each storage node has one or more storage units and one or more network interface components, the collective bandwidths of the storage units and the network interface components being proportioned to one another to enable communication to and from other nodes at the collective bandwidth of the storage units. Each computation node has logic configured to make requests of storage nodes, an input/output bus, and one or more network interface components, the bandwidth of the bus and the collective bandwidths of the network interface components being proportioned to one another to enable communication to and from other nodes at the bandwidth of the input/output bus.
Sorting A Dataset Of Incrementally Received Data
US Patent:
2012033, Dec 27, 2012
Filed:
Jun 24, 2011
Appl. No.:
13/168491
Inventors:
Jeremy Eric Elson - Seattle WA, US
Edmund Bernard Nightingale - Redmond WA, US
Owen Sebastian Hofmann - Austin TX, US
Edmund Bernard Nightingale - Redmond WA, US
Owen Sebastian Hofmann - Austin TX, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30
US Classification:
707752, 707E17005
Abstract:
A method of sorting a dataset includes incrementally receiving data from the dataset, and incrementally storing the received data as individual input data subsets as the data is received, thereby sequentially generating a plurality of filled data subsets of unsorted data. The method includes individually sorting each filled data subset of unsorted data concurrently with receiving data for a next one of the individual input data subsets, thereby sequentially generating a plurality of sorted input data subsets, and performing a merge sort on the plurality of sorted input data subsets, thereby incrementally generating a sorted version of the dataset.
Capturing Web-Based Scenarios
US Patent:
8407321, Mar 26, 2013
Filed:
Apr 21, 2010
Appl. No.:
12/764104
Inventors:
James Mickens - Bellevue WA, US
Jon Howell - Seattle WA, US
Jeremy Elson - Seattle WA, US
Jon Howell - Seattle WA, US
Jeremy Elson - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/173
US Classification:
709220, 709218, 709228, 7071041
Abstract:
This patent application pertains to capturing web-based scenarios. One example detects execution of a web application. This example also automatically captures non-deterministic events of the execution in a manner that is transparent to a user of the web application.