发明名称 Assigning tasks to threads requiring limited resources using programmable queues
摘要 Systems, methods and computer program products for assigning tasks to threads in a server process, where many threads require access to limited resources, are described herein. The system includes one or more programmable queues. Enqueued in each queue are a plurality tuples that correspond to tasks. The invention attempts to match the tuples with command processing resources and database command resources, as needed and available. Once a tuple is fully populated, the tuple is dequeued and assigned to a thread for processing. After processing of the tuple is complete, its command processing resource and any database command resource are enqueued to make them available to other tuples.
申请公布号 US9009187(B2) 申请公布日期 2015.04.14
申请号 US200611640853 申请日期 2006.12.19
申请人 iAnywhere Solutions, Inc. 发明人 Leckie Michael Andrew Kyle
分类号 G06F17/30;G06F9/50;G06F9/48 主分类号 G06F17/30
代理机构 Sterne, Kessler, Goldstein & Fox P.L.L.C. 代理人 Sterne, Kessler, Goldstein & Fox P.L.L.C.
主权项 1. A computer based method comprising: assigning a tuple template to a queue, the tuple template comprising a plurality of fields including at least a task field, a command processing resource field, and a database command resource field, wherein the tuple template (i) configures the queue to selectively process jobs and (ii) controls thread operation on the jobs; determining that at least one of the plurality of fields of the tuple template is empty; identifying a task, a command processing resource, or a database command processing resource that matches the at least one empty field; populating the at least one empty field of the tuple template with at least one of the task, the command processing resource, or the database command resource; and assigning the tuple template to a thread for processing in response to the at least one empty field of the tuple being populated.
地址 Dublin CA US