POJ 1502 - MPI Maelstrom(单源最短路)

原创 2013年12月04日 18:18:05

MPI Maelstrom
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 4531   Accepted: 2744

Description

BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advisor, Jack Swigert, has asked her to benchmark the new system. 
``Since the Apollo is a distributed shared memory machine, memory access and communication times are not uniform,'' Valentine told Swigert. ``Communication is fast between processors that share the same memory subsystem, but it is slower between processors that are not on the same subsystem. Communication between the Apollo and machines in our lab is slower yet.'' 

``How is Apollo's port of the Message Passing Interface (MPI) working out?'' Swigert asked. 

``Not so well,'' Valentine replied. ``To do a broadcast of a message from one processor to all the other n-1 processors, they just do a sequence of n-1 sends. That really serializes things and kills the performance.'' 

``Is there anything you can do to fix that?'' 

``Yes,'' smiled Valentine. ``There is. Once the first processor has sent the message to another, those two can then send messages to two other hosts at the same time. Then there will be four hosts that can send, and so on.'' 

``Ah, so you can do the broadcast as a binary tree!'' 

``Not really a binary tree -- there are some particular features of our network that we should exploit. The interface cards we have allow each processor to simultaneously send messages to any number of the other processors connected to it. However, the messages don't necessarily arrive at the destinations at the same time -- there is a communication cost involved. In general, we need to take into account the communication costs for each link in our network topologies and plan accordingly to minimize the total time required to do a broadcast.''

Input

The input will describe the topology of a network connecting n processors. The first line of the input will be n, the number of processors, such that 1 <= n <= 100. 

The rest of the input defines an adjacency matrix, A. The adjacency matrix is square and of size n x n. Each of its entries will be either an integer or the character x. The value of A(i,j) indicates the expense of sending a message directly from node i to node j. A value of x for A(i,j) indicates that a message cannot be sent directly from node i to node j. 

Note that for a node to send a message to itself does not require network communication, so A(i,i) = 0 for 1 <= i <= n. Also, you may assume that the network is undirected (messages can go in either direction with equal overhead), so that A(i,j) = A(j,i). Thus only the entries on the (strictly) lower triangular portion of A will be supplied. 

The input to your program will be the lower triangular section of A. That is, the second line of input will contain one entry, A(2,1). The next line will contain two entries, A(3,1) and A(3,2), and so on.

Output

Your program should output the minimum communication time required to broadcast a message from the first processor to all the other processors.

Sample Input

5
50
30 5
100 20 50
10 x x 10

Sample Output

35


=========================

一个无向图,输入的是一个不含对角线的下三角,三角阵里面每个值表示两点之间连接的时间,求1能连接到全部点的最小时间

也就是求1到各点的最短路,找出最大值

单源最短路应该用dijkstra的吧,数据很小只有100简单的用floyd也过了


dijkstra:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>

const int INF=0x3f3f3f;
int n;
int map[111][111],dis[111],vis[111];
char str[5];

void dijkstra(int s)
{
    memset(vis,0,sizeof(vis));
    memset(dis,INF,sizeof(dis));
    dis[s]=0;
    for(int rp=1;rp<=n;rp++)
    {
        int u=0,temp=INF;
        for(int i=1;i<=n;i++)
        {
            if(!vis[i]&&dis[i]<temp)
            {
                temp=dis[i];
                u=i;
            }
        }
        if(u==0) return;
        vis[u]=true;
        for(int i=1;i<=n;i++)
        {
            if(map[u][i]<INF&&dis[i]>dis[u]+map[u][i])
                dis[i]=dis[u]+map[u][i];
        }
    }
}

int main()
{
    scanf("%d",&n);
    memset(map,INF,sizeof(map));
    for(int i=1;i<=n;i++) map[i][i]=0;
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<i;j++)
        {
            scanf("%s",str);
            if(str[0]!='x') map[i][j]=map[j][i]=atoi(str);
        }
    }
    dijkstra(1);
    int ans=-1;
    for(int i=2;i<=n;i++)
    {
        if(dis[i]>ans) ans=dis[i];
    }
    printf("%d\n",ans);
    return 0;
}


floyd:

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>

using namespace std;

const int INF=0x3f3f3f;
int n;
int dis[111][111];
char str[5];

void floyd()
{
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
}

int main()
{
    scanf("%d",&n);
    memset(dis,INF,sizeof(dis));
    for(int i=1;i<=n;i++) dis[i][i]=0;
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<i;j++)
        {
            scanf("%s",str);
            if(str[0]!='x') dis[i][j]=dis[j][i]=atoi(str);
        }
    }
    floyd();
    int ans=-1;
    for(int i=2;i<=n;i++)
    {
        if(dis[1][i]>ans) ans=dis[1][i];
    }
    printf("%d\n",ans);
    return 0;
}


Floyd-Warshall算法及其并行化实现(基于MPI)

Floyd-Warshall算法是用于寻找加权图中非固定起止点间最短路径的经典算法,它是基于动态规划思想设计的。Floyd算法也是并行计算中常常用来作为范例进行演示的一个算法。本文将主要讨论基于MPI...
  • baimafujinji
  • baimafujinji
  • 2016年10月19日 12:59
  • 5580

MPI实现有向图所有点间最短路径

由矩阵相乘的MPI实现改造得到,把矩阵相乘时候的*改为+,+改为min,调用ceil(log(n-1))次。 优化: 不用每次收集C,把C作为A,再把A分发出去,等价于开始分发A,执行ceil(l...
  • Jackyguo1992
  • Jackyguo1992
  • 2013年12月12日 19:11
  • 1677

poj1502 MPI Maelstrom,单源最短路的最长距离,dijkstra + 优先队列

点击打开链接 求顶点1到其他点的最短距离的最长距离。。 测试。。dijkstra + 优先队列 #include #include #include #...
  • yew1eb
  • yew1eb
  • 2014年09月26日 14:53
  • 1738

POJ 1502 MPI Maelstrom 单源最短路 Floyd Dijkstra

题目大意: 处理器之前要传递信息
  • Orzmyk
  • Orzmyk
  • 2014年08月04日 18:07
  • 419

poj1502 MPI Maelstrom,单源最短路的最长距离,dijkstra + 优先队列

点击打开链接 求顶点1到其他点的最短距离的最长距离。。 测试。。dijkstra + 优先队列 #include #include #include #...
  • yew1eb
  • yew1eb
  • 2014年09月26日 14:53
  • 1738

poj_1502_MPI Maelstrom(Dijkstra求单源最短路径)

题型:图论 题意:        话说这个题还真心难读(或许是个人英语水平过次o_O),给出n个处理器,处理器之间可以相互联系,可以看作一个无向图,输入部分为邻接矩阵下三角,x代表相应两个...
  • u010770930
  • u010770930
  • 2013年10月31日 19:51
  • 520

POJ1502_MPI Maelstrom_最短路::朴素的dijkstra

MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 9173   Accepted: 56...
  • yuege38
  • yuege38
  • 2017年03月13日 21:00
  • 148

POJ 1502 MPI Maelstrom 【最短路(迪杰斯特拉)】

Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odysse...
  • Young_12138
  • Young_12138
  • 2017年01月21日 23:22
  • 179

poj 1502 MPI Maelstrom([kuangbin带你飞]专题四 最短路练习)

Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Ody...
  • HAHAAC
  • HAHAAC
  • 2016年11月01日 17:10
  • 150

最短路spfa POJ 1502 MPI Maelstrom

最短路 spfa POJ 1502 MPI Maelstrom
  • Dafang_Xu
  • Dafang_Xu
  • 2016年03月12日 15:00
  • 319
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1502 - MPI Maelstrom(单源最短路)
举报原因:
原因补充:

(最多只允许输入30个字)