Y. Etsion and D. G. Feitelson, Integration of Gang Scheduling and User-Level Communication. Technical Report in preparation, Hebrew University, 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Topology and Routing in Clusters: From Theory to Practice - Etsion, Raizman, Feitelson Self-citation (Etsion Feitelson) (Correct)
....functions in the ParPar daemons. This was relatively straightforward, as the required data such as job ID and logical node numbers exists in the ParPar system anyway [14] The only addition was an API that passes the data to the communication subsystem. The details are described elsewhere [13]. Routing in FM is static. Upon initialization, nodes read a configuration file that describes the network topology. They then compute minimal paths from each node to all the others, using Dijkstra s algorithm. If several minimal paths exist, the one using links with the least 4 000 001 010 ....
Y. Etsion and D. G. Feitelson, Integration of Gang Scheduling and User-Level Communication. Technical Report in preparation, Hebrew University, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC