<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>Regarding MPI_Allgather collective calls in MPI</title>
  <link rel="alternate" href="https://conferences.xsede.org/c/message_boards/find_category?p_l_id=&amp;mbCategoryId=0" />
  <subtitle>Regarding MPI_Allgather collective calls in MPI</subtitle>
  <entry>
    <title>RE: Hop distance between allocated nodes on SDSC Gordon</title>
    <link rel="alternate" href="https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=533616" />
    <author>
      <name>Mahendrakar Rao</name>
    </author>
    <id>https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=533616</id>
    <updated>2013-06-06T01:56:06Z</updated>
    <published>2013-06-06T01:56:06Z</published>
    <summary type="html">It has been 2 months since I stopped using this tool. But it must be available. To use this tool, please open a xsede ticket asking the admin to start the tool for you.  They also give examples on access and usage of the tool. &lt;br /&gt;Hope this helps.</summary>
    <dc:creator>Mahendrakar Rao</dc:creator>
    <dc:date>2013-06-06T01:56:06Z</dc:date>
  </entry>
  <entry>
    <title>How to run MPI code on Intel MIC of STAMPEDE</title>
    <link rel="alternate" href="https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=441812" />
    <author>
      <name>Mahendrakar Rao</name>
    </author>
    <id>https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=441812</id>
    <updated>2013-01-20T03:27:39Z</updated>
    <published>2013-01-19T10:19:04Z</published>
    <summary type="html">Hi everybody,&lt;br /&gt;Just got access to stempede. As most of us know Stampede is having compute nodes with intel MIC coprocessor. Unfortunately I could not find material on &amp;#034;Programming on Intel MIC using MPI&amp;#034;.&lt;br /&gt;Please tell me how to compile and run the MPI code on MIC.&lt;br /&gt;Could somebody help me in this regard.&lt;br /&gt;Thanks alot&lt;img alt="emoticon" src="https://conferences.xsede.orghttps://conferences.xsede.org/xup-alt-theme/images/emoticons/happy.gif" &gt;.</summary>
    <dc:creator>Mahendrakar Rao</dc:creator>
    <dc:date>2013-01-19T10:19:04Z</dc:date>
  </entry>
  <entry>
    <title>Hop distance between allocated nodes on SDSC Gordon</title>
    <link rel="alternate" href="https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=428164" />
    <author>
      <name>Mahendrakar Rao</name>
    </author>
    <id>https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=428164</id>
    <updated>2012-12-15T04:20:10Z</updated>
    <published>2012-12-15T04:18:07Z</published>
    <summary type="html">Hi sir,&lt;br /&gt;Is there any tool available on SDSC Gordon  to get the hop distances between the allocated nodes?.  These distances are required for me to create topology graph of allocated nodes. Please help me in this regard. Thanks in advance.</summary>
    <dc:creator>Mahendrakar Rao</dc:creator>
    <dc:date>2012-12-15T04:18:07Z</dc:date>
  </entry>
  <entry>
    <title>Problem running mpi code on two nodes of SDSC gordon</title>
    <link rel="alternate" href="https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=419288" />
    <author>
      <name>Mahendrakar Rao</name>
    </author>
    <id>https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=419288</id>
    <updated>2012-11-27T10:36:21Z</updated>
    <published>2012-11-27T10:33:51Z</published>
    <summary type="html">Hi everybody,&lt;br /&gt;When I attempted to run mpiexec with 32 processes on two compute  nodes (on SDSC gordon) in interactive mode, it prompts me for a password.  &lt;br /&gt;Enter passphrase for key &amp;#039;/home/srini09/.ssh/id_rsa&amp;#039;: &lt;br /&gt; I do not know which password to enter. When  I enter my login password, it is hanging.&lt;br /&gt;could somebody help me in this regard. &lt;br /&gt;Thanks in advance.&lt;img alt="emoticon" src="https://conferences.xsede.orghttps://conferences.xsede.org/xup-alt-theme/images/emoticons/happy.gif" &gt;</summary>
    <dc:creator>Mahendrakar Rao</dc:creator>
    <dc:date>2012-11-27T10:33:51Z</dc:date>
  </entry>
  <entry>
    <title>Regarding MPI_Allgather collective calls in MPI</title>
    <link rel="alternate" href="https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=416794" />
    <author>
      <name />
    </author>
    <id>https://conferences.xsede.org/c/message_boards/find_message?p_l_id=&amp;messageId=416794</id>
    <updated>2012-11-16T16:06:19Z</updated>
    <published>2012-11-16T16:06:19Z</published>
    <summary type="html">The implementation of MPI_Allgather uses different algorithms internally based on the message size and number of processes. For example bruck for short messages, ring for larger messages. Why do they use different implementations? Please explain.</summary>
    <dc:date>2012-11-16T16:06:19Z</dc:date>
  </entry>
</feed>

