Establishing a group of endpoints in a parallel computer
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-009/46
G06F-009/54
출원번호
US-0231326
(2011-09-13)
등록번호
US-9250948
(2016-02-02)
발명자
/ 주소
Archer, Charles J.
Blocksome, Michael A.
Ratterman, Joseph D.
Smith, Brian E.
Xue, Hanhong
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Lenart, Edward J.
인용정보
피인용 횟수 :
0인용 특허 :
86
초록▼
A parallel computer executes a number of tasks, each task includes a number of endpoints and the endpoints are configured to support collective operations. In such a parallel computer, establishing a group of endpoints receiving a user specification of a set of endpoints included in a global collect
A parallel computer executes a number of tasks, each task includes a number of endpoints and the endpoints are configured to support collective operations. In such a parallel computer, establishing a group of endpoints receiving a user specification of a set of endpoints included in a global collection of endpoints, where the user specification defines the set in accordance with a predefined virtual representation of the endpoints, the predefined virtual representation is a data structure setting forth an organization of tasks and endpoints included in the global collection of endpoints and the user specification defines the set of endpoints without a user specification of a particular endpoint; and defining a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification.
대표청구항▼
1. An apparatus for establishing a group of endpoints configured to support collective operations in a parallel computer, the parallel computer comprising a plurality of compute nodes coupled for data communications in a point-to-point multi-dimensional data communications network, wherein each comp
1. An apparatus for establishing a group of endpoints configured to support collective operations in a parallel computer, the parallel computer comprising a plurality of compute nodes coupled for data communications in a point-to-point multi-dimensional data communications network, wherein each compute node executes one or more processes for execution of a parallel application, the apparatus comprising a computer processor and a computer memory operatively coupled to the computer processor, the computer memory having disposed within computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of: receiving a user specification of a set of endpoints included in a global collection of endpoints,wherein each endpoint is a data communications process executing within the one or more processes that supports communications among other endpoints, each endpoint is a rank in the message passing interface (MPI), and the global collection of endpoints includes all available endpoints,the user specification defining the set of endpoints in accordance with a predefined virtual representation of the endpoints,wherein the predefined virtual representation of the endpoints comprises a data structure setting forth an organization of processes and endpoints included in the global collection of endpoints,wherein the data structure comprises a table of columns and rows, each column specifying a process, each field of the column specifying an endpoint for the process, and each row specifying an endpoint of all processes,wherein the user specification defines the set of endpoints in relation to the data structure of the predefined virtual representation and without specifying a unique identifier for any particular endpoint in the set of endpoints, andwherein the user specification comprises a specification of all endpoints included in a column stride, the column stride comprising endpoints of a process included in alternating columns;defining, as an operational group, a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification; andexecuting one or more collective operations using the operational group defined by the group of endpoints. 2. The apparatus of claim 1 wherein: receiving a user specification of a set of endpoints further comprises receiving a plurality of user specifications of a set of endpoints, each specification defining a different group of endpoints in accordance with the predefined virtual representation of the endpoints without uniquely specifying a particular endpoint; anddefining a group of endpoints further comprises defining a group of endpoints comprising each set defined by the plurality of user specifications. 3. The apparatus of claim 2 wherein receiving a user specification of a set of endpoints further comprises receiving a specification of all endpoints included in a row stride, the row stride comprising endpoints of all tasks included in alternating rows. 4. The apparatus of claim 2 wherein receiving a user specification of a set of endpoints further comprises receiving a specification of all endpoints included in a checkerboard pattern of the table, the checkerboard pattern of the table comprising: for alternating columns: endpoints of alternating rows beginning at a first row in the column; andfor all other columns: endpoints of alternating rows beginning at a second row in the column. 5. The apparatus of claim 1 wherein the predefined virtual representation of the endpoints comprises a multi-dimensional matrix of endpoints, with each dimension of the matrix corresponding to a dimension of the point-to-point multi-dimensional data communications network of the parallel computer, with each field of the multi-dimensional matrix representing an endpoint executing on a compute node in the parallel computer. 6. The apparatus of claim 5 wherein receiving a user specification of a set of endpoints further comprises receiving a specification of endpoints executing on compute nodes comprising a nearest neighbor of a compute node upon which a particular endpoint is executing without uniquely identifying the particular endpoints. 7. The apparatus of claim 1 wherein the user specification defines at least one endpoint that does not exist. 8. A computer program product for establishing a group of endpoints configured to support collective operations in a parallel computer, the parallel computer comprising a plurality of compute nodes coupled for data communications in a point-to-point multi-dimensional data communications network, wherein each compute node executes an endpoint, the computer program product disposed upon a computer readable medium, wherein the computer readable medium is not a signal, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of: receiving a user specification of a set of endpoints included in a global collection of endpoints,wherein each endpoint is a data communications process executing within the one or more processes that supports communications among other endpoints, each endpoint is a rank in the message passing interface (MPI), and the global collection of endpoints includes all available endpoints,the user specification defining the set of endpoints in accordance with a predefined virtual representation of the endpoints,wherein the predefined virtual representation of the endpoints comprises a data structure setting forth an organization of processes and endpoints included in the global collection of endpoints,wherein the data structure comprises a table of columns and rows, each column specifying a process, each field of the column specifying an endpoint for the process, and each row specifying an endpoint of all processes,wherein the user specification defines the set of endpoints in relation to the data structure of the predefined virtual representation and without specifying a unique identifier for any particular endpoint in the set of endpoints, andwherein the user specification comprises a specification of all endpoints included in a column stride, the column stride comprising endpoints of a process included in alternating columns;defining, as an operational group, a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification; andexecuting one or more collective operations using the operational group defined by the group of endpoints. 9. The computer program product of claim 8 wherein: receiving a user specification of a set of endpoints further comprises receiving a plurality of user specifications of a set of endpoints, each specification defining a different group of endpoints in accordance with the predefined virtual representation of the endpoints without uniquely specifying a particular endpoint; anddefining a group of endpoints further comprises defining a group of endpoints comprising each set defined by the plurality of user specifications. 10. The computer program product of claim 9 wherein receiving a user specification of a set of endpoints further comprises receiving a specification of all endpoints included in a row stride, the row stride comprising endpoints of all tasks included in alternating rows. 11. The computer program product of claim 9 wherein receiving a user specification of a set of endpoints further comprises receiving a specification of all endpoints included in a checkerboard pattern of the table, the checkerboard pattern of the table comprising: for alternating columns: endpoints of alternating rows beginning at a first row in the column; andfor all other columns: endpoints of alternating rows beginning at a second row in the column. 12. The computer program product of claim 8 wherein the predefined virtual representation of the endpoints comprises a multi-dimensional matrix of endpoints, with each dimension of the matrix corresponding to a dimension of the point-to-point multi-dimensional data communications network of the parallel computer, with each field of the multi-dimensional matrix representing an endpoint executing on a compute node in the parallel computer. 13. The computer program product of claim 12 wherein receiving a user specification of a set of endpoints further comprises receiving a specification of endpoints executing on compute nodes comprising a nearest neighbor of a compute node upon which a particular endpoint is executing without uniquely identifying the particular endpoints.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (86)
Cavanagh,Carl; Sivier,Steven A., Applying distributed simulation techniques to hardware emulation.
Gorin Allen L. (Fairlawn NJ) Lewine Robert N. (Hanover Township ; Morris County NJ) Makofsky Patrick A. (Randolph NJ) Shively Richard R. (Convent Station NJ), Binary tree multiprocessor.
Takata Yukari,JPX ; Satou Mitsugu,JPX ; Kondo Hiroyuki,JPX ; Sawai Katsunori,JPX, Bus interface unit in a microprocessor for facilitating internal and external memory accesses.
Wingard Drew E. ; Rosseel Geert Paul ; Tomlinson Jay S. ; Robinson Lisa A., Communications system and method with multilevel connection identification.
Wingard, Drew Eric; Rosseel, Geert Paul; Tomlinson, Jay S.; Robinson, Lisa A., Communications system and method with multilevel connection identification.
Willis John Christopher ; Newshutz Robert Neill, Compiler-oriented apparatus for parallel compilation, simulation and execution of computer programs and hardware models.
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.
Basso, Claude; Calvignac, Jean Louis; Heddes, Marco C.; Logan, Joseph Franklin; Verplanken, Fabrice Jean, Data structures for efficient processing of multicast transmissions.
Kloth,Axel K.; Andrews,Warner; Bergantino,Paul; Bicknell,Jeremy; Fu,Daniel; De Leon,Moshe; Mills,Stephen M., Dynamic bandwidth allocation for wide area networks.
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.
Blackmore, Robert S.; Chang, Fu Chung; Chaudhary, Piyush; Gildea, Kevin J.; Goscinski, Jason E.; Govindaraju, Rama K.; Grice, Donald G.; Helmer, Jr., Leonard W.; Heywood, Patricia E.; Hochschild, Peter H.; Houston, John S.; Kim, Chulho; Martin, Steven J., Half RDMA and half FIFO operations.
Burns, Randal Chilton; Goel, Atul; Long, Darrell D. E.; Rees, Robert Michael, Lease based safety protocol for distributed system with multiple networks.
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.
Crawley Eric S. ; Zhang Zhaohui ; Salkewicz William M. ; Sanchez Cheryl A., Method and apparatus for providing quality of service routing in a network.
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.
Arimilli, Lakshminarayana B.; Arimilli, Ravi K.; Rajamony, Ramakrishnan; Speight, William E., Performing collective operations using software setup and partial software execution at leaf nodes in a multi-tiered full-graph interconnect architecture.
Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E., Reducing power consumption while performing collective operations on a plurality of compute nodes.
Daruwalla, Feisal; Forster, James R.; Roeck, Guenter E.; Woundy, Richard M.; Thomas, Michael A., Routing protocol based redundancy design for shared-access networks.
Ray, Amar N.; Bugenhagen, Michael K.; Morrill, Robert J.; Chakravarthy, Cadathur V., System and method for adjusting the window size of a TCP packet through network elements.
Blandy Geoffrey Owen ; Saba Maher Afif, System and method for instruction burst performance profiling for single-processor and multi-processor systems.
Verbeke,Jerome M.; Nadgir,Neelakanth M.; Ruetsch,Gregory R.; Sharapov,Ilya A.; Vernik,Michael J.; Trang,Vu, System and method for submitting and performing computational tasks in a distributed heterogeneous networked environment.
Schumacher, Larry Lee; Gonzales-Tuchmann, Agustin; Yogman, Laurence Tobin; Dingman, Paul C., System for deadlock condition detection and correction by allowing a queue limit of a number of data tokens on the queue to increase.
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는 부적절한 답변을 할 수 있습니다.