POJ MPI Maelstrom 1502 Dijkstra
2016-08-24 08:37
204 查看
MPI Maelstrom
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
Sample Output
反正这题目我是没看懂,就是求到各个点最短路中最大的那个值。
#include"iostream"
#include"cstring"
#include"math.h"
#include"cstdio"
#include"map"
#include"set"
#include"algorithm"
#include"vector"
#include"queue"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF=1100000000; //最大边数*最大边长+10
const int maxn=100+10;//最大点数
struct edge //边
{
int from,to,dist;edge(int u,int v,int w){from=u;to=v;dist=w;}
};
struct node
{
int d;int u;
node(){}
node(int dd,int uu){d=dd;u=uu;}
friend bool operator < (node a,node b){return a.d>b.d;}
};
struct dijkstra
{
int n,m;
vector<edge>edges;
vector<int>g[maxn];
int visit[maxn];
int d[maxn];
int p[maxn];
void init(int n){this->n=n;for(int i=0;i<n;i++)g[i].clear();edges.clear();}
void add_edge(int u,int v,int w){edges.push_back(edge(u,v,w));int m=edges.size();g[u].push_back(m-1);} //加入一条边 无向图要加两次
void djk(int s)
{
//priority_queue<node>Q;
priority_queue<pii,vector<pii>,greater<pii> >Q; //小顶堆 保存pair(d[u],u)
memset(visit,0,sizeof(visit));
for(int i=0;i<n;i++) d[i]=INF;
d[s]=0;
//Q.push(node(d[s],s));
Q.push(make_pair(d[s],s));
while(!Q.empty())
{
//node x=Q.top();Q.pop();
//int u=x.u;
pii x=Q.top();Q.pop();
int u=x.second;
visit[u]=1;//表示这个点已经用完了。
for(int i=0;i<g[u].size();i++)
{
edge& e=edges[g[u][i]];
if(!visit[e.to])
if(d[e.to]>d[e.from]+e.dist)
{
d[e.to]=d[e.from]+e.dist;
p[e.to]=g[u][i];
//Q.push(node(d[e.to],e.to));
Q.push(make_pair(d[e.to],e.to));
}
}
}
}
};
int main()
{
int n;
while(cin>>n)
{
dijkstra a,b;
int s1,s2;
a.init(n);
char s[50];
int i,j,k;
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
scanf("%s",s);
if(s[0]!='x')
{
int dist=0;for(k=0;k<strlen(s);k++) dist=dist*10+s[k]-48;
a.add_edge(i,j,dist);a.add_edge(j,i,dist);
}
}
}
a.djk(0);
cout<<*max_element(a.d,a.d+n)<<endl;
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 8517 | Accepted: 5257 |
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
反正这题目我是没看懂,就是求到各个点最短路中最大的那个值。
#include"iostream"
#include"cstring"
#include"math.h"
#include"cstdio"
#include"map"
#include"set"
#include"algorithm"
#include"vector"
#include"queue"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF=1100000000; //最大边数*最大边长+10
const int maxn=100+10;//最大点数
struct edge //边
{
int from,to,dist;edge(int u,int v,int w){from=u;to=v;dist=w;}
};
struct node
{
int d;int u;
node(){}
node(int dd,int uu){d=dd;u=uu;}
friend bool operator < (node a,node b){return a.d>b.d;}
};
struct dijkstra
{
int n,m;
vector<edge>edges;
vector<int>g[maxn];
int visit[maxn];
int d[maxn];
int p[maxn];
void init(int n){this->n=n;for(int i=0;i<n;i++)g[i].clear();edges.clear();}
void add_edge(int u,int v,int w){edges.push_back(edge(u,v,w));int m=edges.size();g[u].push_back(m-1);} //加入一条边 无向图要加两次
void djk(int s)
{
//priority_queue<node>Q;
priority_queue<pii,vector<pii>,greater<pii> >Q; //小顶堆 保存pair(d[u],u)
memset(visit,0,sizeof(visit));
for(int i=0;i<n;i++) d[i]=INF;
d[s]=0;
//Q.push(node(d[s],s));
Q.push(make_pair(d[s],s));
while(!Q.empty())
{
//node x=Q.top();Q.pop();
//int u=x.u;
pii x=Q.top();Q.pop();
int u=x.second;
visit[u]=1;//表示这个点已经用完了。
for(int i=0;i<g[u].size();i++)
{
edge& e=edges[g[u][i]];
if(!visit[e.to])
if(d[e.to]>d[e.from]+e.dist)
{
d[e.to]=d[e.from]+e.dist;
p[e.to]=g[u][i];
//Q.push(node(d[e.to],e.to));
Q.push(make_pair(d[e.to],e.to));
}
}
}
}
};
int main()
{
int n;
while(cin>>n)
{
dijkstra a,b;
int s1,s2;
a.init(n);
char s[50];
int i,j,k;
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
scanf("%s",s);
if(s[0]!='x')
{
int dist=0;for(k=0;k<strlen(s);k++) dist=dist*10+s[k]-48;
a.add_edge(i,j,dist);a.add_edge(j,i,dist);
}
}
}
a.djk(0);
cout<<*max_element(a.d,a.d+n)<<endl;
}
return 0;
}
相关文章推荐
- MPI Maelstrom poj 1502 单源最短路
- 最短路练习7/poj/1502 /MPI Maelstrom/方法:floyd和Dijkstra
- POJ 1502 MPI Maelstrom / UVA 432 MPI Maelstrom / SCU 1068 MPI Maelstrom / UVALive 5398 MPI Maelstrom /ZOJ 1291 MPI Maelstrom (最短路径)
- poj 1502 MPI Maelstrom Dijkstra
- poj&nbsp;1502&nbsp;MPI&nbsp;Maelstrom(dijkstra)
- MPI Maelstrom poj 1502
- MPI Maelstrom POJ 1502
- POJ - 1502 MPI Maelstrom Dijkstra
- MPI Maelstrom POJ - 1502
- openjudge MPI Maelstrom(dijkstra)
- POJ 2385 Apple Catching (DP)
- valgrind安装过程中无法定位libmpi.a中lam_mpi_commworld错误的解决办法。
- POJ 2513 Colored Sticks
- poj 3244 Difference between Triplets
- poj 3076 Sudoku //Dancing Links
- POJ 1840 hash
- 完全背包练习-POJ-1384-Piggy-Bank
- poj1006
- ubuntu下安装openmp和mpi环境
- POJ 1785 Binary Search Heap Construction(RMQ)