Thread selection according to power characteristics during context switching on compute nodes
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-009/48
G06F-001/32
G06F-009/50
G06F-009/46
출원번호
US-0783968
(2013-03-04)
등록번호
US-9459917
(2016-10-04)
발명자
/ 주소
Archer, Charles J.
Blocksome, Michael A.
Randles, Amanda E.
Ratterman, Joseph D.
Smith, Brian E.
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Kennedy, Brandon C.
인용정보
피인용 횟수 :
1인용 특허 :
51
초록▼
Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting,
Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switch if the criteria for a thread context switch are satisfied, including executing the next thread of execution.
대표청구항▼
1. A method of thread selection for context switching on a plurality of compute nodes, the method comprising: executing, by a compute node of the plurality of compute nodes, a plurality of threads of execution for an application;predefining power characteristics of each thread available for executio
1. A method of thread selection for context switching on a plurality of compute nodes, the method comprising: executing, by a compute node of the plurality of compute nodes, a plurality of threads of execution for an application;predefining power characteristics of each thread available for execution of the application;selecting, by the compute node from the plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads according to a power mode switching algorithm by: determining a current power mode for the compute node while executing a thread of the application, wherein the current power mode comprises a description of a power consumption of the compute node, wherein the power mode switching algorithm specifies that a period of processing in a high power mode is to be followed by a period of processing in a low power mode associated with less power consumption than the high power mode; andselecting, from the available threads of execution, the next thread of execution according to the power mode switching algorithm, the next thread having predefined power characteristics that enable the compute node to enter the low power mode; andexecuting the selected next thread. 2. The method of claim 1 wherein the next thread of execution is a software thread. 3. The method of claim 1 wherein the next thread of execution is a hardware thread in a Symmetric Multi-Processing (‘SMP’) architecture. 4. The method claim 1 wherein the plurality of compute nodes are connected together for data communications using a plurality of data communications networks, at least one of the data communications networks optimized for point to point operations, and at least one of the data communications networks optimized for collective operations. 5. A parallel computer configured to thread selection for context switching on a plurality of compute nodes, the parallel computer comprising the plurality of compute nodes, each of the compute nodes comprising one or more computer processors and computer memory operatively coupled to the computer processors, the computer memory having disposed within it computer program instructions capable of: executing, by a compute node of the plurality of compute nodes, a plurality of threads of execution for an application;predefining power characteristics of each thread available for execution of the application;selecting, by the compute node from the plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads according to a power mode switching algorithm by: determining a current power mode for the compute node while executing a thread of the application, wherein the current power mode comprises a description of a power consumption of the compute node, wherein the power mode switching algorithm specifies that a period of processing in a high power mode is to be followed by a period of processing in a low power mode associated with less power consumption than the high power mode; andselecting, from the available threads of execution, the next thread of execution according to the power mode switching algorithm, the next thread having predefined power characteristics that enable the compute node to enter the low power mode; andexecuting the selected next thread. 6. A computer program product for thread selection for context switching on a plurality of compute nodes, the computer program product disposed upon a non-transitory computer readable recordable medium, the computer program product comprising computer program instructions configured for: executing, by a compute node of the plurality of compute nodes, a plurality of threads of execution for an application;predefining power characteristics of each thread available for execution of the application;selecting, by the compute node from the plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads according to a power mode switching algorithm by: determining a current power mode for the compute node while executing a thread of the application, wherein the current power mode comprises a description of a power consumption of the compute node, wherein the power mode switching algorithm specifies that a period of processing in a high power mode is to be followed by a period of processing in a low power mode associated with less power consumption than the high power mode; andselecting, from the available threads of execution, the next thread of execution according to the power mode switching algorithm, the next thread having predefined power characteristics enable the compute node to enter the low power mode; andexecuting the selected next thread. 7. The computer program product of claim 6 wherein the next thread of execution is a software thread. 8. The computer program product of claim 6 wherein the next thread of execution is a hardware thread in a Symmetric Multi-Processing (‘SMP’) architecture. 9. The computer program product of claim 6 wherein the plurality of compute nodes are connected together for data communications using a plurality of data communications networks, at least one of the data communications networks optimized for point to point operations, and at least one of the data communications networks optimized for collective operations.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (51)
Kim, Seo Kwang, Apparatus and method for managing power in computer system.
Reilly,Patrick L., Apparatus, system and method for adjusting a set of actual power states according to a function depending on a set of desired power states.
Cook Matthew Damian ; Hensley Roberta Walton ; Adkins Barry Donald ; Peterson Erik Stefan ; Roesler Richard Frederick ; Parks James Michael, Automated system for facilitating creation of a rack-mountable component personal computer.
Weinberger,Guenter; Glossner,C. John, Convergence device with dynamic program throttling that replaces noncritical programs with alternate capacity programs based on power indicator.
Blackard Joe Wayne ; Gillaspy Richard Adams ; Henthorn William John ; Petersen Lynn Erich ; Russell Lance W. ; Shippy Gary Roy, Data processing system and method for pacing information transfers in a communications network.
Fujiyama, Kenichiro; Nakamura, Nobutatsu, Fault tolerant multi-node computing system using periodically fetched configuration status data to detect an abnormal node.
Barzilai Tsipora P. (Millwood NY) Chen Mon-Song (Katonah NY) Kadaba Bharath K. (Peekskill NY) Kaplan Marc A. (Purdys NY), Flow control for high speed networks.
Burns, Randal Chilton; Goel, Atul; Long, Darrell D. E.; Rees, Robert Michael, Lease based safety protocol for distributed system with multiple networks.
Ohneda, Taku; Kanno, Shinichi; Tarui, Masaya; Miyamoto, Yukimasa; Ogawa, Riku, Logic circuit apparatus for selectively assigning a plurality of circuit data to a plurality of programmable logic circuits for minimizing total power while maintaining necessary processing performance.
Richard Alan Diedrich ; Harvey Gene Kiel, Method and apparatus for multimedia data interchange with pacing capability in a distributed data processing system.
Shtayer Ronen (Tel-Aviv ILX) Alon Naveh (Ranat Hashnron ILX) Alexander Joffe (Rehovot ILX), Method and apparatus for pacing asynchronous transfer mode (ATM) data cell transmission.
Levin Vladimir K.,RUX ; Karatanov Vjacheslav V.,RUX ; Jalin Valerii V.,RUX ; Titov Alexandr,RUX ; Agejev Vjacheslav M.,RUX ; Patrikeev Andrei,RUX ; Jablonsky Sergei V.,RUX ; Korneev Victor V.,RUX ; M, Method for deadlock-free message passing in MIMD systems using routers and buffers.
Rasmussen, Neil; VanGilder, James W.; Buell, Scott Douglass; Shrivastava, Saurabh Kumar; Dalgas, Mikkel, Methods and systems for managing facility power and cooling.
Saito, Masahiko; Mizuyama, Masashige, Multiprocessor control apparatus for controlling a plurality of processors sharing a memory and an internal bus and multiprocessor control method and multiprocessor control circuit for performing the same.
Armstrong, Brian S. R.; Pereira, Luis R.; Das, Sujit R.; Rentel, Carlos H., Packet sniffer node and system including the same to assess wireless communication performance.
Olnowich Howard T. (Endwell NY), Protocol-to-protocol translator for interfacing disparate serial network nodes to a common parallel switching network.
Daruwalla, Feisal; Forster, James R.; Roeck, Guenter E.; Woundy, Richard M.; Thomas, Michael A., Routing protocol based redundancy design for shared-access networks.
Kalgren, Patrick W.; Ginart, Antonio E.; Nanduri, Sashank; Boodhansingh, Anthony J.; Byington, Carl S.; Orsagh, Rolf F.; Sipos, Brian J.; Brown, Douglas W.; Minnella, Christopher M.; Baybutt, Mark, Systems and methods for predicting failure of electronic systems and assessing level of degradation and remaining useful life.
Levy Henry M. ; Feeley Michael J.,CAX ; Karlin Anna R. ; Morgan William E. ; Thekkath Chandramohan A., Using global memory information to manage memory in a computer network.
Advani Deepak Mohan ; Byron Michael Justin ; Hansell Steven Robert ; Ming Chun Li Todd ; Marino John Paul ; Panda Rajendra Datta ; Pierce James Andrew ; Wang Ko-Yang ; Weinel Dennis George ; Welch Ro, Visualization tool for graphically displaying trace data.
Advani Deepak Mohan ; Byron Michael Justin ; Hansell Steven Robert ; Li Todd Ming Chun ; Marino John Paul ; Panda Rajendra Datta ; Pierce James Andrew ; Wang Ko-Yang ; Weinel Dennis George ; Welch Ro, Visualization tool for graphically displaying trace data produced by a parallel processing computer.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.