Scheduling graph computing on heterogeneous processing resources based on energy efficiency
US10656970B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 28, 2016 |
| Grant date | May 19, 2020 |
| Priority date | — |
| Expiry date | Apr 29, 2037 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02D10/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An apparatus and method are provided for scheduling graph computing on heterogeneous platforms based on energy efficiency. A scheduling engine receives an edge set that represents a portion of a graph comprising vertices with at least one edge connecting two or more of the vertices. The scheduling engine obtains an operating characteristic for each processing resource of a plurality of heterogeneous processing resources. The scheduling engine computes, based on the operating characteristics and an energy parameter, a set of processing speed values for the edge set, each speed value corresponding to a combination of the edge set and a different processing resource of the plurality of heterogeneous processing resources. The scheduling engine identifies an optimal processing speed value from the set of computed speed values for the edge set.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.