The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Oct. 06, 2015
Filed:
Apr. 06, 2013
Method for simultaneous scheduling of processes and offloading computation on many-core coprocessors
Nec Laboratories America, Inc., Princeton, NJ (US);
Srihari Cadambi, Princeton Junction, NJ (US);
Kunal Rao, Princeton, NJ (US);
Srimat T. Chakradhar, Manalapan, NJ (US);
Rajat Phull, Monmouth Junction, NJ (US);
Giuseppe Coviello, Plainsboro, NJ (US);
Murugan Sankaradass, Dayton, NJ (US);
Cheng-Hong Li, New Brunswick, NJ (US);
NEC Laboratories America, Inc., Princeton, NJ (US);
Abstract
A method is disclosed to manage a multi-processor system with one or more manycore devices, by managing real-time bag-of-tasks applications for a cluster, wherein each task runs on a single server node, and uses the offload programming model, and wherein each task has a deadline and three specific resource requirements: total processing time, a certain number of manycore devices and peak memory on each device; when a new task arrives, querying each node scheduler to determine which node can best accept the task and each node scheduler responds with an estimated completion time and a confidence level, wherein the node schedulers use an urgency-based heuristic to schedule each task and its offloads; responding to an accept/reject query phase, wherein the cluster scheduler send the task requirements to each node and queries if the node can accept the task with an estimated completion time and confidence level; and scheduling tasks and offloads using a aging and urgency-based heuristic, wherein the aging guarantees fairness, and the urgency prioritizes tasks and offloads so that maximal deadlines are met.