1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
|
//******************************************************************************
//
// File: ReplicatedLong.java
// Package: edu.rit.pj.replica
// Unit: Class edu.rit.pj.replica.ReplicatedLong
//
// This Java source file is copyright (C) 2008 by Alan Kaminsky. All rights
// reserved. For further information, contact the author, Alan Kaminsky, at
// ark@cs.rit.edu.
//
// This Java source file is part of the Parallel Java Library ("PJ"). PJ is free
// software; you can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation; either
// version 3 of the License, or (at your option) any later version.
//
// PJ is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
// A PARTICULAR PURPOSE. See the GNU General Public License for more details.
//
// Linking this library statically or dynamically with other modules is making a
// combined work based on this library. Thus, the terms and conditions of the
// GNU General Public License cover the whole combination.
//
// As a special exception, the copyright holders of this library give you
// permission to link this library with independent modules to produce an
// executable, regardless of the license terms of these independent modules, and
// to copy and distribute the resulting executable under terms of your choice,
// provided that you also meet, for each linked independent module, the terms
// and conditions of the license of that module. An independent module is a
// module which is not derived from or based on this library. If you modify this
// library, you may extend this exception to your version of the library, but
// you are not obligated to do so. If you do not wish to do so, delete this
// exception statement from your version.
//
// A copy of the GNU General Public License is provided in the file gpl.txt. You
// may also obtain a copy of the GNU General Public License on the World Wide
// Web at http://www.gnu.org/licenses/gpl.html.
//
//******************************************************************************
package edu.rit.pj.replica;
import edu.rit.mp.LongBuf;
import edu.rit.mp.buf.LongItemBuf;
import edu.rit.pj.Comm;
import edu.rit.pj.reduction.LongOp;
import java.io.IOException;
import java.util.concurrent.atomic.AtomicLong;
/**
* Class ReplicatedLong provides a replicated, shared reduction variable for
* a value of type <TT>long</TT>.
* <P>
* A replicated, shared reduction variable is intended to be used in a cluster
* or hybrid parallel program for a data item shared among all the processes in
* the program and all the threads in each process. To use a replicated, shared
* reduction variable, do the following in each process of the parallel program:
* <OL TYPE=1>
* <LI>
* Construct an instance of class ReplicatedLong, specifying the reduction
* operator (class {@linkplain edu.rit.pj.reduction.Op}) to use when performing
* updates, and specifying the communicator (class {@linkplain edu.rit.pj.Comm})
* and the message tag to use for sending updates among the processes. At this
* point a <I>replica</I> of the variable exists in each process.
* <P><LI>
* To read the variable, call the <TT>get()</TT> method. The current value of
* the local process's replicated variable is returned.
* <P><LI>
* To update the variable, call the <TT>reduce()</TT> method, specifying a new
* value. The <TT>reduce()</TT> method performs an <I>atomic reduction</I>
* (described below) on the local process's replicated variable with the new
* value. If the variable changed as a result of the reduction, the variable's
* (updated) value is flooded to all the processes in the communicator. Finally,
* the <TT>reduce()</TT> method returns the variable's value.
* <P>
* Whenever one of the aforementioned flooded messages arrives, a separate
* thread performs an atomic reduction on the local process's variable with the
* received value.
* <P>
* An atomic reduction consists of these steps, performed atomically: Call the
* reduction operator's <TT>op()</TT> method, passing in the current value of
* the local process's replicated variable and the new value (either the new
* value specified as an argument of <TT>reduce()</TT>, or the new value
* received in a flooded message). Then store the <TT>op()</TT> method's return
* value back into the local process's replicated variable.
* </OL>
* <P>
* Class ReplicatedLong does not itself guarantee consistency of the
* replicas' values. This is to avoid the message passing overhead of a
* distributed state update protocol. Instead, the parallel program must be
* written to operate correctly when the variable is updated as described above.
* Note that the value of a process's local replica can change asynchronously at
* any time, either because a thread in the current process updated the
* variable, or because a flooded message updated the variable.
* <P>
* Class ReplicatedLong is multiple thread safe. The methods use lock-free
* atomic compare-and-set.
* <P>
* <I>Note:</I> Class ReplicatedLong is implemented using class
* java.util.concurrent.atomic.AtomicLong.
*
* @author Alan Kaminsky
* @version 13-Sep-2008
*/
public class ReplicatedLong
extends Number
{
// Hidden data members.
private LongOp myOp;
private AtomicLong myValue;
private int myTag;
private Comm myComm;
private Receiver myReceiver;
// Hidden helper classes.
/**
* Class Receiver receives and processes flooded messages to update this
* replicated, shared reduction variable.
*
* @author Alan Kaminsky
* @version 13-Sep-2008
*/
private class Receiver
extends Thread
{
public void run()
{
LongItemBuf buf = LongBuf.buffer();
try
{
for (;;)
{
// Receive a flooded message.
myComm.floodReceive (myTag, buf);
// Do an atomic reduction.
long oldvalue, newvalue;
do
{
oldvalue = myValue.get();
newvalue = myOp.op (oldvalue, buf.item);
}
while (! myValue.compareAndSet (oldvalue, newvalue));
}
}
catch (Throwable exc)
{
exc.printStackTrace (System.err);
}
}
}
// Exported constructors.
/**
* Construct a new replicated, shared long reduction variable with the
* given reduction operator. The initial value is 0. A message tag of 0 is
* used. The world communicator is used.
*
* @param op Reduction operator.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>op</TT> is null.
*/
public ReplicatedLong
(LongOp op)
{
this (op, 0L, 0, Comm.world());
}
/**
* Construct a new replicated, shared long reduction variable with the
* given reduction operator and initial value. A message tag of 0 is used.
* The world communicator is used.
*
* @param op Reduction operator.
* @param initialValue Initial value.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>op</TT> is null.
*/
public ReplicatedLong
(LongOp op,
long initialValue)
{
this (op, initialValue, 0, Comm.world());
}
/**
* Construct a new replicated, shared long reduction variable with the
* given reduction operator, initial value, and message tag. The world
* communicator is used.
*
* @param op Reduction operator.
* @param initialValue Initial value.
* @param tag Message tag.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>op</TT> is null. Thrown if
* <TT>comm</TT> is null.
*/
public ReplicatedLong
(LongOp op,
long initialValue,
int tag)
{
this (op, initialValue, tag, Comm.world());
}
/**
* Construct a new replicated, shared long reduction variable with the
* given reduction operator, initial value, message tag, and communicator.
*
* @param op Reduction operator.
* @param initialValue Initial value.
* @param tag Message tag.
* @param comm Communicator.
*
* @exception NullPointerException
* (unchecked exception) Thrown if <TT>op</TT> is null. Thrown if
* <TT>comm</TT> is null.
*/
public ReplicatedLong
(LongOp op,
long initialValue,
int tag,
Comm comm)
{
if (op == null)
{
throw new NullPointerException
("ReplicatedLong(): op is null");
}
if (comm == null)
{
throw new NullPointerException
("ReplicatedLong(): comm is null");
}
myOp = op;
myValue = new AtomicLong (initialValue);
myTag = tag;
myComm = comm;
myReceiver = new Receiver();
myReceiver.setDaemon (true);
myReceiver.start();
}
// Exported operations.
/**
* Returns this replicated, shared reduction variable's current value.
*
* @return Current value.
*/
public long get()
{
return myValue.get();
}
/**
* Update this replicated, shared reduction variable's current value. This
* variable is combined with the given value using the reduction operation
* specified to the constructor (<I>op</I>). The result is stored back into
* this variable and is returned; the result may also be flooded to all
* processes in the communicator.
*
* @param value Value.
*
* @return (This variable) <I>op</I> (<TT>value</TT>).
*
* @exception IOException
* Thrown if an I/O error occurred.
*/
public long reduce
(long value)
throws IOException
{
// Do an atomic reduction.
long oldvalue, newvalue;
do
{
oldvalue = myValue.get();
newvalue = myOp.op (oldvalue, value);
}
while (! myValue.compareAndSet (oldvalue, newvalue));
// If value changed, send a flooded message.
if (newvalue != oldvalue)
{
myComm.floodSend (myTag, LongBuf.buffer (newvalue));
}
// Return updated value.
return newvalue;
}
/**
* Returns a string version of this reduction variable.
*
* @return String version.
*/
public String toString()
{
return Long.toString (get());
}
/**
* Returns this reduction variable's current value converted to type
* <TT>int</TT>.
*
* @return Current value.
*/
public int intValue()
{
return (int) get();
}
/**
* Returns this reduction variable's current value converted to type
* <TT>long</TT>.
*
* @return Current value.
*/
public long longValue()
{
return (long) get();
}
/**
* Returns this reduction variable's current value converted to type
* <TT>float</TT>.
*
* @return Current value.
*/
public float floatValue()
{
return (float) get();
}
/**
* Returns this reduction variable's current value converted to type
* <TT>double</TT>.
*
* @return Current value.
*/
public double doubleValue()
{
return (double) get();
}
}
|