238000000638 solvent extraction Methods 0.000 title claims description 37.
Assignors: BUEHRER, GREGORY T., CHEN, YEN-KUANG, KIM, DAEHYUN, LEE, VICTOR W., NGUYEN, ANTHONY D., OZGUR, AYSEL, SMELYANSKIY, MIKHAIL Publication of US20070143759A1 publication Critical patent/US20070143759A1/en Status Abandoned legal-status Critical Current Links
Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.) Filing date Publication date Application filed by Intel Corp filed Critical Intel Corp Priority to US11/300,809 priority Critical patent/US20070143759A1/en Assigned to INTEL CORPORATION reassignment INTEL CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Original Assignee Intel Corp Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.) Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.) Abandoned Application number US11/300,809 Inventor Aysel Ozgur Gregory Buehrer Anthony Nguyen Daehyun Kim Victor Lee Mikhail Smelyanskiy Yen-Kuang Chen Current Assignee (The listed assignees may be inaccurate.
#DISKKEEPER 2.0 STATIC PROBLEM PDF#
Google Patents Scheduling and partitioning tasks via architecture-aware feedback informationĭownload PDF Info Publication number US20070143759A1 US20070143759A1 US11/300,809 US30080905A US2007143759A1 US 20070143759 A1 US20070143759 A1 US 20070143759A1 US 30080905 A US30080905 A US 30080905A US 2007143759 A1 US2007143759 A1 US 2007143759A1 Authority US United States Prior art keywords processor task tasks application data Prior art date Legal status (The legal status is an assumption and is not a legal conclusion. Google Patents US20070143759A1 - Scheduling and partitioning tasks via architecture-aware feedback information US20070143759A1 - Scheduling and partitioning tasks via architecture-aware feedback information
0 kommentar(er)
