Method and apparatus for reducing execution time for parallel support vector machine computations
First Claim
1. A method for reducing execution time of a parallel support vector machine (SVM) application, comprising:
- partitioning an input data set into chunks of data;
distributing the partitioned chunks of data across a plurality of available computing nodes;
executing the parallel SVM application on the chunks of data in parallel across the plurality of available computing nodes;
determining if a first timeout period has been exceeded before all of the plurality of available computing nodes have finished processing their respective chunks of data; and
if so, repartitioning the input data set into different chunks of data;
redistributing the repartitioned chunks of data across some or all of the plurality of available computing nodes; and
executing the parallel SVM application on the repartitioned chunks of data in parallel across some or all of the available computing nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
A system that reduces execution time of a parallel SVM application. During operation, the system partitions an input data set into chunks of data. Next, the system distributes the partitioned chunks of data across a plurality of available computing nodes and executes the parallel SVM application on the chunks of data in parallel across the plurality of available computing nodes. The system then determines if a first timeout period has been exceeded before all of the plurality of available computing nodes have finished processing their respective chunks of data. If so, the system (1) repartitions the input data set into different chunks of data; (2) redistributes the repartitioned chunks of data across some or all of the plurality of available computing nodes; and (3) executes the parallel SVM application on the repartitioned chunks of data in parallel across some or all of the available computing nodes.
27 Citations
20 Claims
-
1. A method for reducing execution time of a parallel support vector machine (SVM) application, comprising:
-
partitioning an input data set into chunks of data;
distributing the partitioned chunks of data across a plurality of available computing nodes;
executing the parallel SVM application on the chunks of data in parallel across the plurality of available computing nodes;
determining if a first timeout period has been exceeded before all of the plurality of available computing nodes have finished processing their respective chunks of data; and
if so, repartitioning the input data set into different chunks of data;
redistributing the repartitioned chunks of data across some or all of the plurality of available computing nodes; and
executing the parallel SVM application on the repartitioned chunks of data in parallel across some or all of the available computing nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for reducing execution time of a parallel support vector machine (SVM) application, the method comprising:
-
partitioning an input data set into chunks of data;
distributing the partitioned chunks of data across a plurality of available computing nodes;
executing the parallel SVM application on the chunks of data in parallel across the plurality of available computing nodes;
determining if a first timeout period has been exceeded before all of the plurality of available computing nodes have finished processing their respective chunks of data; and
if so, repartitioning the input data set into different chunks of data;
redistributing the repartitioned chunks of data across some or all of the plurality of available computing nodes; and
executing the parallel SVM application on the repartitioned chunks of data in parallel across some or all of the available computing nodes. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. An apparatus that reduces execution time of a parallel support vector machine (SVM) application, comprising:
-
a partitioning mechanism configured to partition an input data set into chunks of data;
a distributing mechanism configured to distribute the partitioned chunks of data across a plurality of available computing nodes;
an execution mechanism configured to execute the parallel SVM application on the chunks of data in parallel across the plurality of available computing nodes;
a timeout mechanism configured to;
determine if a first timeout period has been exceeded before all of the plurality of available computing nodes have finished processing their respective chunks of data; and
if so, to repartition the input data set into different chunks of data;
redistribute the repartitioned chunks of data across some or all of the plurality of available computing nodes; and
toexecute the parallel SVM application on the repartitioned chunks of data in parallel across some or all of the available computing nodes. - View Dependent Claims (18, 19, 20)
-
Specification