Jason D Jenks, 40736 Valencia St, Walla Walla, WA 99362

8606958, Dec 10, 2013

Oct 29, 2010

12/916111

Ethan Z. Evans - Snoqualmie WA, US
Jason Jenks - Lynnwood WA, US
Adam J. Overton - Redmond WA, US

Amazon Technologies, Inc. - Reno NV

G06F 15/16

709232, 709203, 709233

Techniques described herein provide a system and methods for adding latency to improve the perceived performance of computing devices. For instance, the techniques may calculate transaction latencies for a given session based on the time between sending requests for content receiving the requested content. The calculated latencies may be aggregated or averaged in such a way that a specific latency may be selected for improving the perceived performance. A client device may then render subsequent content based on the selected latency or a server may serve subsequent content based on the selected latency. This artificial addition of latency may enhance the user experience by creating a more consistent environment.

8429162, Apr 23, 2013

Sep 27, 2011

13/246371

Weinan Wang - Bellevue WA, US
Joseph E. Magerramov - Seattle WA, US
Maxym Kharchenko - Bellevue WA, US
Min Zhu - Bellevue WA, US
Aaron D. Kujat - Issaquah WA, US
Alessandro Gherardi - Bellevue WA, US
Jason C. Jenks - Lynnwood WA, US

Amazon Technologies, Inc. - Reno NV

G06F 7/00
G06F 17/30

707737, 707756

Disclosed are various embodiments for facilitating data redistribution in database sharding. A database is maintained that is horizontally partitioned into a set of first buckets using modulo-based assignments. A fixed number of the first buckets are stored in each of multiple physical data stores. The database is repartitioned into a set of second buckets using modulo-based assignments. The number of second buckets in the set is a multiple of the sum of a positive integer and the quantity of the physical data stores. The data in the database is unmoved between the physical data stores by repartitioning.

2019020, Jul 4, 2019

Dec 29, 2017

15/858602

- Menlo Park CA, US
Jason Curtis Jenks - Lynnwood WA, US
Zardosht Kasheff - New York NY, US
Samuel Rash - Fremont CA, US

H04L 12/58
H04L 29/08
G06F 17/30

Techniques for consistent writes in a split message store are described. In one embodiment, an apparatus may comprise a client front-end component of a messaging system operative to receive a message, the message comprising message metadata and a message body; and store the message in a message queue; and the message queue operative to initiate a storing of the message metadata in a metadata store; delay a storing of the message body in a message store until a metadata storage success indication is received from the metadata store; receive the metadata storage success indication from the metadata store; and store the message body in the message store in response to receiving the metadata storage success indication from the metadata store. Other embodiments are described and claimed.

2018001, Jan 18, 2018

Oct 20, 2016

15/298773

- Menlo Park CA, US
Himanshu Baweja - Sunnyvale CA, US
Edward Young Zhang - San Francisco CA, US
Pradeep Venkatachalam - Mountain View CA, US
Dheeraj Kumar Singh - San Jose CA, US
Hao Lin - Fremont CA, US
Srinivas Prasad Govindan - Sunnyvale CA, US
Jason Curtis Jenks - Lynnwood WA, US

G06Q 30/02
H04L 29/08
H04L 12/58

One or more embodiments of the disclosure provide a promotional messaging system for efficiently providing promotional messages to customers via an electronic messaging system. For example, in one or more embodiments, the promotional messaging system identifies users of the electronic messaging system that have previously communicated with a merchant as part of a customized audience. Additionally, in some embodiments, the promotional messaging system analyzes activity patterns of the users to provide improved delivery of promotional messages in a non-intrusive, private, and timely manner. Overall, the promotional messaging system described herein improves communications via an electronic messaging system between users and a merchant.

2018001, Jan 18, 2018

Oct 20, 2016

15/298763

- Menlo Park CA, US
Srinivas Prasad Govindan - Sunnyvale CA, US
Jason Curtis Jenks - Lynnwood WA, US

G06Q 30/02
H04L 12/58
G06Q 50/00

One or more embodiments of the disclosure provide a promotional messaging system for efficiently providing promotional messages to customers via an electronic messaging system. For example, in one or more embodiments, the promotional messaging system identifies users of the electronic messaging system that have previously communicated with a merchant as part of a customized audience. Additionally, in some embodiments, the promotional messaging system analyzes activity patterns of the users to provide improved delivery of promotional messages in a non-intrusive, private, and timely manner. Overall, the promotional messaging system described herein improves communications via an electronic messaging system between users and a merchant.

2017029, Oct 12, 2017

Apr 8, 2016

15/094102

- Menlo Park CA, US
Haobo Xu - Palo Alto CA, US
Jason Curtis Jenks - Lynnwood WA, US
Hairong Kuang - San Jose CA, US

G06F 11/20

The disclosure is directed to a failover mechanism for failing over an application service, e.g., a messaging service, from servers in a first region to servers in a second region. Data is stored as shards in which each shard contains data associated with a subset of the users. Data access requests are served by a primary region of the shard. A global shard manager manages failing over the application service from a current primary region to a secondary region of the shard. A leader service in the application service replicates data associated with the application service from the primary to the secondary region, and ensures that the state of various other services of the application service in the secondary region is consistent. The leader service confirms that there is no replication lag between the primary and secondary regions and fails over the application service to the secondary region.

2017029, Oct 12, 2017

Apr 8, 2016

15/094065

- Menlo Park CA, US
Haobo Xu - Palo Alto CA, US
Jason Curtis Jenks - Lynnwood WA, US
Hairong Kuang - San Jose CA, US

H04L 29/08
H04L 12/26

The disclosure is directed to moving an application, e.g., a messenger service in a social networking application, to various locations in a distributed computing system, e.g., to improve an efficiency of the application. For example, the application can be moved to a data center that is closer to a location of a user to decrease a latency associated with accessing the application. In another example, the application can be moved to a data center that is closer to a location of a storage system that stores data associated with the application to improve a throughput of the application, e.g., a rate at which data is read and/or written.

2017020, Jul 20, 2017

Jan 20, 2016

15/001741

- Menlo Park CA, US
Haobo Xu - Palo Alto CA, US
Jason Curtis Jenks - Lynnwood WA, US
Hairong Kuang - San Jose CA, US
Pierre-Luc Bertrand - New York NY, US
Andrei Lutsenko - Menlo Park CA, US
Zhenhua Guo - Woodinville WA, US
Jun Ying - Seattle WA, US

G06F 11/20
H04L 29/08

The disclosure is directed to a failover mechanism for failing over an application service, e.g., a messaging service, from servers in a first region to servers in a second region. Data is stored as shards in which each shard contains data associated with a subset of the users. Data access requests are served by a primary region of the shard. A global shard manager manages failing over the application service from a current primary region of a shard to a secondary region of the shard. The current primary determines whether a criterion for failing over, e.g., a replication lag between the primary and the secondary regions is within a threshold, and if it is within the threshold, the failover process waits until the lag is zero. After the replication lag is zero, the application service is failed over to the second region, which then becomes the primary for the shard.