发明名称 Scalable task scheduling
摘要 A server system having one or more processors and memory receives, from a client, a request to perform a first task. The server system determines whether a first slot in a primary task queue having a plurality of slots is available, where the first slot was selected in accordance with a slot-selection function designed to probabilistically distribute respective target slots for a plurality of successive tasks across a plurality of different non-consecutive slots in the primary task queue. In accordance with a determination that the first slot is available, the server system inserts the first task in the first slot in the primary task queue. In accordance with a determination that the first slot is unavailable, the server system inserts the first task at an entry point of a secondary task queue.
申请公布号 US8826284(B1) 申请公布日期 2014.09.02
申请号 US201213431908 申请日期 2012.03.27
申请人 Google Inc. 发明人 Fuller Alfred R. K.
分类号 G06F9/46 主分类号 G06F9/46
代理机构 Morgan, Lewis & Bockius LLP 代理人 Morgan, Lewis & Bockius LLP
主权项 1. A method comprising: at a respective server system having one or more processors and memory storing one or more programs that when executed by the one or more processors cause the respective server system to perform the method, the method comprising: receiving, from a client, a request to perform a first task;determining whether a first slot in a primary task queue having a plurality of slots is available, wherein the first slot was selected in accordance with a slot-selection function designed to probabilistically distribute respective target slots for a plurality of successive tasks across a plurality of different non-consecutive slots in the primary task queue;in accordance with a determination that the first slot is available, inserting the first task in the first slot in the primary task queue; andin accordance with a determination that the first slot is unavailable, inserting the first task at an entry point of a secondary task queue.
地址 Mountain View CA US