Package no.uib.cipr.matrix.distributed

Examples of no.uib.cipr.matrix.distributed.Communicator

292
293
294
295
296
297
298
299
300
301
302
        protected abstract double getVectorEntry(int i);

        protected abstract IterativeSolver createSolver(Vector x);

        public void run() {
            Communicator comm = coll.createCommunicator(rank);

            Matrix A = createMatrix(comm);
            populateMatrix(A);

            DenseVector bl = new DenseVector(localLength[rank]);
View Full Code Here
141
142
143
144
145
146
147
148
149
150
    private Thread createSender(final Object send, final int rank,
            final int peer) {
        return new Thread(new Runnable() {
            public void run() {
                Communicator c = coll.createCommunicator(rank);
                c.send(send, peer);
            }
        });
    }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
    private Thread createReceiver(final Object recv, final int rank,
            final int peer) {
        return new Thread(new Runnable() {
            public void run() {
                Communicator c = coll.createCommunicator(rank);
                c.recv(recv, peer);
            }
        });
    }
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.barrier();
                }
            });

            t[i].start();
        }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
        Thread[] t = new Thread[coll.size()];
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.broadcast(recv[rank], 0);
                }
            });

            t[i].start();
        }
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
106
        Thread[] t = new Thread[coll.size()];
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.scatter(send, recv[rank], 0);
                }
            });

            t[i].start();
        }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
        Thread[] t = new Thread[coll.size()];
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.gather(send[rank], recv, 0);
                }
            });

            t[i].start();
        }
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
166
        Thread[] t = new Thread[coll.size()];
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.allGather(send[rank], recv[rank]);
                }
            });

            t[i].start();
        }
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
197
        Thread[] t = new Thread[coll.size()];
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.allToAll(send[rank], recv[rank]);
                }
            });

            t[i].start();
        }
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
228
        Thread[] t = new Thread[coll.size()];
        for (int i = 0; i < t.length; ++i) {
            final int rank = i;
            t[i] = new Thread(new Runnable() {
                public void run() {
                    Communicator comm = coll.createCommunicator(rank);
                    comm.reduce(send[rank], recv, Reductions.sum(), 0);
                }
            });

            t[i].start();
        }
View Full Code Here
TOP

Related Classes of no.uib.cipr.matrix.distributed.Communicator

  • no.uib.cipr.matrix.distributed.CollectiveTest
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest$DistIterativeSolver
  • no.uib.cipr.matrix.distributed.PointToPointTest
  • java.util.concurrent.ThreadFactory
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.