IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0755861
(2001-01-05)
|
발명자
/ 주소 |
- Morrow,Lewis A.
- Olsen,Claus M.
|
출원인 / 주소 |
- International Business Machines Corporation
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
45 인용 특허 :
6 |
초록
▼
The energy consumption of a computing system is reduced by incorporating two or more processing units with diverse energy efficiencies and diverse processing capabilities. A scheduler intercepts an interrupt(s) from I/O space, resolves the interrupt to a task, retrieves energy and performance attrib
The energy consumption of a computing system is reduced by incorporating two or more processing units with diverse energy efficiencies and diverse processing capabilities. A scheduler intercepts an interrupt(s) from I/O space, resolves the interrupt to a task, retrieves energy and performance attributes for the task, and schedules the task for execution on the processing units such that the task will consume the least amount of energy while executing in a timely fashion.
대표청구항
▼
What is claimed is: 1. A computer system comprising: at least two processing units having different energy efficiencies and adapted to at least execute tasks based upon processing requirements of the tasks and a corresponding processing capability; and a scheduler adapted to schedule a given task f
What is claimed is: 1. A computer system comprising: at least two processing units having different energy efficiencies and adapted to at least execute tasks based upon processing requirements of the tasks and a corresponding processing capability; and a scheduler adapted to schedule a given task for execution by one of said at least two processing units so as to consume a least amount of energy, and to reschedule the given task for execution by an other of said at least two processing units when a determination indicates that said one of said at least two processing units is unable to accommodate execution of the given task based upon the processing requirements of the given task and the corresponding processing capability; wherein said scheduler is further adapted to send a first request interrupt for execution of the given task to one of said at least two processing units in an order based on an attribute list; wherein said one of said at least two processing units are further adapted to return one of an accept interrupt and a reject interrupt to said scheduler in response to said first request; wherein said scheduler is further adapted to send a second request interrupt for execution of the given task to an other of the at least two processing units in the order based on the attribute list, if said scheduler receives the reject interrupt from said one of said at least two processing units. 2. The computer system according to claim 1, wherein the processing requirements comprise an end time at which the given task is to be completed. 3. The computer system according to claim 1, wherein said scheduler is a function embodied within a hardware component other than said at least two processing units. 4. The computer system according to claim 1, wherein one of said at least two processing units comprise said scheduler. 5. The computer system according to claim 1, wherein said scheduler is further adapted to intercept interrupts from said at least two processing units and peripheral devices. 6. The computer system according to claim 1, wherein said at least two processing units share memory space. 7. The computer system according to claim 1, wherein said at least two processing units share input/output space. 8. The computer system according to claim 1, wherein said at least two processing units share input/output space, and said scheduler and said at least two processing units share memory space. 9. The computer system according to claim 1, further comprising a task attribute store adapted to store at least some of the processing requirements of at least some of the scheduled tasks. 10. The computer system according to claim 1, wherein the determination is made by said scheduler. 11. The computer system according to claim 1, wherein the determination is made by said one of said at least processing units. 12. The computer system according to claim 1, wherein the processing requirements comprise a processing capacity required to execute the given task. 13. A computer system comprising: a plurality of processing units, each of the plurality of processing units adapted to execute tasks thereon, and at least two of the plurality of processing units having different energy efficiencies; and a scheduler adapted to schedule a given task for execution by one of said plurality of processing units by querying said plurality of processing units in a partial order of descending energy efficiency to one of accept and reject the execution of the given task until one of the given task is one of accepted and executed by said one of said plurality of processing units and the given task is rejected by all of said plurality of processing units; wherein said scheduler is adapted to schedule the given task in an order based on an attribute list, wherein the attribute list comprising a plurality of attributes, said plurality of attributes comprising (a) a task identification number of the given task, (b) a quantity of said plurality of processing units capable of executing the given task, (c) a processor identification number for each of the quantity of said plurality of processing units capable of executing the given task, (d) an address of the location of the given task associated with each of the of the quantity of said plurality of processing units capable of executing the given task; and (e) a worst case quantity of processing unit cycles for timely executing the given task for each of the quantity of said plurality of processing units capable of executing the given task. 14. The computer system according to claim 13, wherein said scheduler is a function embodied within one of said plurality of processing units. 15. The computer system according to claim 13, wherein said scheduler is a function embodied within a hardware component other than one of said plurality of processing units. 16. The computer system according to claim 13, wherein said scheduler intercepts interrupts from each of said plurality of processing units and peripheral devices. 17. The computer system according to claim 13, wherein said plurality of processing units share memory space. 18. The computer system according to claim 13, wherein said plurality of processing units share input/output space. 19. The computer system according to claim 13, wherein said plurality of processing units share input/output space, and said scheduler and said plurality of processing units share memory space. 20. The computer system according to claim 13, further comprising a task attribute store adapted to store at least some of the processing requirements of at least some of the tasks. 21. The computer system according to claim 13, wherein said scheduler is further adapted to exclude any of said plurality of processing units from the partial order based upon at least one predefined condition. 22. The computer system according to claim 13, wherein the processing requirements comprise a processing capacity required to execute the given task. 23. A computer system comprising: at least two processing units having different energy efficiencies and adapted to one of accept and reject scheduled tasks based upon processing requirements of the scheduled tasks and a corresponding processing capability, and to at least execute the scheduled tasks that are accepted; and a scheduler adapted to schedule a given task for execution by one of said at least two processing units so as to consume a least amount of energy, and to rescheduled the given task for execution by an other of said at least two processing units when said one of said at least two processing units rejects the execution of the given task; wherein the scheduler is adapted to send a request interrupt to each of the at least two processing units in an attribute list, one processing unit at a time, for requesting whether the each of the at least processing units is capable of executing the given task; wherein the scheduler is adapted to send the request interrupt to each of the at least two processing units in the attribute list until one of (a) the one processing unit sends an accept interrupt to the scheduler accepting the given task, and (b) all of the at least two processing units in the attribute list send a reject interrupt to the scheduler rejecting the given task. 24. The computer system according to claim 23, wherein said scheduler is a function embodied within a hardware component other than said at least two processing units. 25. The computer system according to claim 23, wherein one of said at least two processing units comprise said scheduler. 26. The computer system according to claim 23, wherein said scheduler is further adapted to intercept interrupts from said at least two processing units and peripheral devices. 27. The computer system according to claim 23, wherein said at least two processing units share memory space. 28. The computer system according to claim 23, wherein said at least two processing units share input/output space. 29. The computer system according to claim 23, wherein said at least two processing units share input/output space, and said scheduler and said at least two processing units share memory space. 30. A computer system comprising: a plurality of processing units, each of the plurality of processing units adapted to execute tasks thereon, and at least two of the plurality of processing units having different energy efficiencies; a processor attribute table adapted to store processing capability information for at least some of said plurality of processors and to update the processing capability information dynamically when the processing capability information changes, wherein the processing capability information comprises (a) processing requirements of a given task, and (b) processing capability for at least some of the plurality of processing units for executing the given task; and a scheduler adapted, for the given task, to retrieve at least some of the processing capability information from said processor attribute table in one of a partial order and a strict order of descending energy efficiency until one of the plurality of processors is found to possess adequate processing capability with respect to task processing requirements for the given task, and to schedule the given task for execution by said one of the plurality of processors. 31. The computer system according to claim 30, wherein said computer system further comprises at least one functional block adapted to perform at least one function associated with an interrupt. 32. The computer system according to claim 30, wherein said computer system further comprises at least one functional block adapted to perform at least one function utilized by a task.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.