org/objectweb/proactive/benchmarks/timit/util/observing/commobserv/CommEventData.java

/* 
 * ################################################################
 * 
 * ProActive: The Java(TM) library for Parallel, Distributed, 
 *            Concurrent computing with Security and Mobility
 * 
 * Copyright (C) 1997-2007 INRIA/University of Nice-Sophia Antipolis
 * Contact: proactive@objectweb.org
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or any later version.
 *  
 * This library 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
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307
 * USA
 *  
 *  Initial developer(s):               The ProActive Team
 *                        http://www.inria.fr/oasis/ProActive/contacts.html
 *  Contributor(s): 
 * 
 * ################################################################
 */ 
package org.objectweb.proactive.benchmarks.timit.util.observing.commobserv;

import org.objectweb.proactive.benchmarks.timit.util.observing.EventData;

public class CommEventData implements EventData {

    private static final long serialVersionUID = -5062574158941020818L;

    private String name;

    private int subjectRank;

    private int[] markedCommunication;

    private int[][] allValues;

    public CommEventData(String name, int groupSize, int subjectRank) {
        this.name = name;
        this.markedCommunication = new int[groupSize];
        this.subjectRank = subjectRank;
    }

    public void setData(Object object) {
        this.markedCommunication = (int[]) object;
    }

    public String getName() {
        return this.name;
    }

    public Object getData() {
        return this.markedCommunication.clone();
    }

    public Object collapseWith(EventData anotherData, int anotherRank) {
        int length = this.markedCommunication.length;
        if (this.allValues == null) {
            this.allValues = new int[length][length];
            System.arraycopy(this.markedCommunication, 0,
                    this.allValues[this.subjectRank], 0, length);
        }
        if (anotherData.equals(this)) {
            return this.allValues.clone();
        }

        int[] anotherCommArray = (int[]) anotherData.getData();

        for (int i = 0; i < length; i++) {
            this.allValues[anotherRank][i] += anotherCommArray[i];
        }

        return this.allValues.clone();
    }

    public void mark(int targetRank, double value) {
        this.markedCommunication[targetRank] += (int) value;
    }

    public Object getFinalized() {
        return this.allValues.clone();
    }

    public String toString() {

        if (this.allValues == null) {
            return "";
        }
        String res = "\n";

        int maxLength = ("" + getMaxValue(this.allValues)).length();
        StringBuilder sb = null;
        String[] lines = new String[this.allValues.length];
        int i, j;

        for (i = 0; i < this.allValues.length; i++) {
            lines[i] = "";
            for (j = 0; j < this.allValues.length; j++) {
                sb = new StringBuilder(lines[i]);
                sb.append(String.format("%1$" + maxLength + "s",
                        this.allValues[i][j])
                        + " ");
                lines[i] = sb.toString();
            }
        }

        for (i = lines.length - 1; i >= 0; i--) {
            res += lines[i] + "\n";
        }

        return res;
    }

    public static int getMaxValue(int[][] a) {
        int i, j, max = 0;

        for (i = 0; i < a.length; i++) {
            for (j = 0; j < a.length; j++) {
                if (a[i][j] > max) {
                    max = a[i][j];
                }
            }
        }
        return max;
    }
}

---