Programming model for transparent parallelization of combinatorial optimization

Patent metadata

Field	Value
Publication number	US-9052969-B2
Application number	US-201313794029-A
Country	US
Kind code	B2
Filing date	Mar 11, 2013
Priority date	Nov 21, 2011
Publication date	Jun 9, 2015
Grant date	Jun 9, 2015

Abstract

Each of a plurality of subtasks is configured to explore and assess alternative solutions for a combinatorial optimization problem by a reentrant finite state machine is represented. Each of a plurality of threads is configured to perform operations comprising a subtask until either completion or a blocked state is reached and, in the event a blocked state is reached, to move on to performing another subtask that is not currently in a blocked state.

First claim

What is claimed is:

1. A method, comprising:
dividing a query task into a plurality of subtasks, wherein the query task comprises exploring and assessing optimal solutions for determining an efficient query execution plan for a database query;
representing each subtask of the plurality of subtasks by a reentrant finite state machine;
wherein the query execution plan is represented as a query plan tree whose nodes correspond to query operators; and
using a processor to config…

Assignees

• Emc Corp

Inventors

• Waas Florian
• Soliman Mohamed
• Krikellas Konstantinos

Classifications

• G06F9/54 Primary

  Physics · mapped topic

• G06F17/30463

  Physics · mapped topic

• G06F16/24542 Primary

  Physics · mapped topic