com.bigdata.counters.History Maven / Gradle / Ivy
package com.bigdata.counters;
import java.util.Date;
import java.util.Iterator;
import java.util.NoSuchElementException;
import org.apache.log4j.Logger;
/**
* Retains history for N periods, where the period is expressed in milliseconds.
*
* This class is thread-safe.
*
* @author Bryan Thompson
* @version $Id$
* @param
* Which must be Double, Long, or String.
*/
public class History {
protected static final Logger log = Logger.getLogger(History.class);
/**
* The period in milliseconds between each sample in the buffer. The buffer
* will not accept the next sample until this period has elapsed.
*/
public long getPeriod() {
return period;
}
/**
* The source {@link History} which feeds this one.
*
* @return The source {@link History} -or- null iff this is
* the base {@link History}.
*/
public History getSource() {
return source;
}
/**
* The #of samples that can be stored in the buffer.
*/
public int capacity() {
return capacity;
}
/**
* The #of non-missing samples that are stored in the buffer.
*/
public int size() {
return size;
}
public boolean isNumeric() {
return _numeric;
}
public boolean isLong() {
return _long;
}
public boolean isDouble() {
return _double;
}
/**
* The datatype for the individual values.
*/
public Class getValueType() {
return data.getClass().getComponentType();
}
/**
* Takes a snapshot of the samples in the {@link History} and then visits those
* samples.
*
* @author Bryan Thompson
* @version $Id$
*/
public class SampleIterator implements Iterator> {
private final int n;
private int current = -1; // until you call next().
private final long[] _timestamps;
private final int[] _counts;
private final T[] _data;
private final Entry entry = new Entry();
/**
* The #of slots with sampled data.
*/
public int getSampleCount() {
return n;
}
/**
* The timestamp associated with the first sample.
*
* @return The timestamp -or- -1 if there are no samples.
*/
public long getFirstSampleTime() {
if (n == 0)
return -1L;
return _timestamps[0];
}
/**
* The timestamp associated with the last sample.
*
* @return The timestamp -or- -1 if there are no samples.
*/
public long getLastSampleTime() {
if (n == 0)
return -1L;
return _timestamps[n - 1];
}
// public Entry getEntry(long timestamp) {
//
// }
//
// public Entry getEntry(int index) {
//
// if (index < 0 || index > n) {
//
// throw new IndexOutOfBoundsException("index=" + index
// + " must be in [0:" + n + ")");
//
// }
//
// if (data[index] == null) {
//
// return null;
//
// }
//
// return new Entry(index);
//
// }
private class Entry implements IHistoryEntry, Cloneable {
public IHistoryEntry clone() {
final int count = _counts[current];
final long lastModified = _timestamps[current];
final T total = _data[current];
final T value = getValue();
return new IHistoryEntry() {
public int getCount() {
return count;
}
public T getTotal() {
return total;
}
public T getValue() {
return value;
}
public long lastModified() {
return lastModified;
}
public String toString() {
return "(" + getValue() + ", " + getCount() + ","
+ new Date(lastModified()) + ")";
}
};
}
public long lastModified() {
return _timestamps[current];
}
public T getValue() {
final int count = _counts[current];
assert count > 0;
final T value = _data[current];
if(isNumeric()) {
// reports the average.
return valueOf(((Number) value).doubleValue() / count);
}
return value;
// return _data[current];
}
public int getCount() {
return _counts[current];
}
public T getTotal() {
return _data[current];
}
public String toString() {
return "(" + getValue() + ", " + getCount() + ","
+ new Date(lastModified()) + ")";
}
}
@SuppressWarnings("unchecked")
protected SampleIterator() {
if (lastLogicalSlot == -1) {
n = 0;
_timestamps = null;
_counts = null;
_data = null;
return;
}
/*
* Find the earliest sample in the buffer and convert to a
* [logicalSlot].
*/
final long firstSampleTime;
final long firstLogicalSlot;
{
long t = Long.MAX_VALUE;
for (int i = 0; i < capacity; i++) {
if (timestamps[i] != 0 & timestamps[i] < t) {
t = timestamps[i];
}
}
firstSampleTime = t;
firstLogicalSlot = firstSampleTime / period;
}
/*
* Count [capacity * period] samples from that [logicalSlot],
* skipping ones without data - this is the #of samples that we
* will visit [n].
*/
final long lastLogicalSlot = firstLogicalSlot + capacity;
{
int count = 0;
for (long ls = firstLogicalSlot; ls < lastLogicalSlot; ls++) {
final int physicalSlot = (int) (ls % capacity);
if (data[physicalSlot] != null) {
count++;
}
}
n = count;
}
/*
* Allocate internal buffers and produce a dense copy of the
* source samples.
*
* Note: allocate based on the type of the history.
*/
_timestamps = new long[n];
_counts = new int[n];
_data = (T[]) java.lang.reflect.Array.newInstance(data.getClass()
.getComponentType(), n);
{
int count = 0;
for (long ls = firstLogicalSlot; ls < lastLogicalSlot; ls++) {
final int physicalSlot = (int) (ls % capacity);
if (data[physicalSlot] != null) {
_timestamps[count] = timestamps[physicalSlot];
_counts[count] = counts[physicalSlot];
_data[count] = data[physicalSlot];
count++;
}
}
}
}
public boolean hasNext() {
return (current + 1) < n;
}
public IHistoryEntry next() {
if (!hasNext())
throw new NoSuchElementException();
current++;
return (IHistoryEntry) entry.clone();
}
// /**
// * Return the current sample (the one which was last visited by
// * {@link #next()}).
// *
// * @throws IllegalStateException
// * if you have not called {@link #next()}
// */
// public IHistoryEntry current() {
//
// if (current == -1)
// throw new IllegalStateException();
//
// return entry;
//
// }
public void remove() {
throw new UnsupportedOperationException();
}
}
/**
* Return a snapshot of the most recent value in the buffer -or-
* null if there are no samples in the buffer.
*/
synchronized public IHistoryEntry getSample() {
if (lastLogicalSlot == -1) {
return null;
}
/*
* Collect data while synchronized so that we can return a coherent view
* of the entry as of the time that this method executed.
*/
final int physicalSlot = (int) (lastLogicalSlot % capacity);
final long lastModified = timestamps[physicalSlot];
final T value = data[physicalSlot];
if (value == null) {
/*
* @todo I have seen a null [value] when [lastLogicalSlot != -1].
* How does this condition arise? Is there a problem elsewhere
* that only shows up here as a null [value]?
*/
return null;
}
final int count = counts[physicalSlot];
assert count >= 1;
return new IHistoryEntry() {
public long lastModified() {
return lastModified;
}
public T getValue() {
if(isNumeric()) {
// reports the average.
return valueOf(((Number) value).doubleValue() / count);
}
return value;
}
public T getTotal() {
return value;
}
public int getCount() {
return count;
}
public String toString() {
return "(" + value + ", count=" + count + ","
+ new Date(lastModified) + ")";
}
};
}
/**
* Visits a snapshot of the samples in the buffer in timestamp order.
* This includes all non-missing samples over the last N periods, where
* N is the capacity of the buffer.
*/
synchronized public SampleIterator iterator() {
return new SampleIterator();
}
/**
* Return a representation of a snapshot of the samples in buffer.
*/
synchronized public String toString() {
final StringBuilder sb = new StringBuilder();
sb.append("{");
final Iterator> itr = iterator();
int n = 0;
while (itr.hasNext()) {
final IHistoryEntry entry = itr.next();
sb.append("(" + entry.getValue() + "," + entry.getCount() + ", "
+ new Date(entry.lastModified()) + ")");
if (itr.hasNext())
sb.append(",");
n++;
}
final T average = getAverage();
sb.append("},average=" + average + ",n=" + n);
return sb.toString();
}
/**
* Computes the average of the samples.
*
* @return The average -or- null if the samples are not
* numbers (no average is reported for dates, strings, etc).
*
* @todo could report the most frequent value for non-numeric data or a list
* of the distinct values.
*/
public T getAverage() {
return getAverage(capacity);
}
/**
* Compute the average of the samples over the last N reporting periods.
*
* @param nperiods
* The #of reporting periods over which the average is to be
* computed. E.g., last 10 minutes. The reporting periods have to
* be read from the logicalSlot for 10 minutes ago up through the
* current logicalSlot.
*
* @return The average over the last N reporting periods.
*
* @throws IllegalArgumentException
* If you request data that is older (in reporting periods) that
* is stored within the history. E.g., you can not ask for more
* than a 60 minute average if the reporting period is minutes
* and the capacity is 60.
*/
synchronized public T getAverage(final int nperiods) {
if (!isNumeric()) {
/*
* Not numeric.
*/
return null;
}
if (nperiods < 1 || nperiods > capacity) {
throw new IllegalArgumentException("Must be in [0:" + capacity
+ "], not " + nperiods);
}
if(lastLogicalSlot == -1) {
// No data.
return valueOf(0d);
}
// total of the non-null values.
double total = 0d;
// #of non-null values.
int n = 0;
// @todo this is winding up with an array index of -1 for some reason.
final int tmpi = (int) (lastLogicalSlot % capacity);
assert tmpi >= 0 && tmpi < capacity : "index=" + tmpi
+ ", lastLogicalSlot=" + lastLogicalSlot + ", capacity="
+ capacity;
final long currentLogicalSlot = timestamps[tmpi] / period;
final long firstLogicalSlot = lastLogicalSlot - nperiods + 1;
// tally non-null samples within the reporting period.
for (long ls = firstLogicalSlot; ls <= currentLogicalSlot; ls++) {
final int physicalSlot = (int) (ls % capacity);
if (data[physicalSlot] == null)
continue;
// #of samples in this slot.
final int count = counts[physicalSlot];
assert count > 0;
// total for this slot.
final double value = ((Number) data[physicalSlot]).doubleValue();
total += value;
n += count;
// Note: assertion is NOT valid since a slot may have more than one sample.
// assert n <= capacity : "n=" + n + ", capacity=" + capacity;
}
// for (int i = 0; i < capacity; i++) {
//
// if (data[i] == null)
// continue;
//
// total += ((Number) data[i]).doubleValue();
//
// n++;
//
// }
/*
* Note: assertion could be violated if concurrent modifications were
* allowed.
*
* FIXME i've seen this assertion but things appear to be synchronized
* so look into this further for possible fenceposts!
*/
// assert n == size : "size=" + size + ", but n=" + n;
if (n == 0) {
// No samples found.
return valueOf(0d);
}
return valueOf(total / n);
}
/**
* Convert a double to an instance of the generic type parameter for
* this class.
*
* @param d
* The double value.
*
* @return The corresponding instance of the generic type parameter.
*/
@SuppressWarnings("unchecked")
protected T valueOf(double d) {
if (!isNumeric())
throw new UnsupportedOperationException();
if (isLong())
return (T) Long.valueOf((long) d);
if (isDouble())
return (T) Double.valueOf(d);
throw new AssertionError();
}
/**
* Adds a sample to the history. The sample is placed into a slot in this
* history that reflects its timestamp.
*
* If the history wraps around into the next period and there is another
* history that aggregates this one, then the average for the last period
* will be added to the aggregating history.
*
* Multiple samples in the same period are recorded as (a) the total of
* those samples in the period; and (b) the #of samples in the period.
*
* @param timestamp
* The timestamp associated with the sample.
* @param value
* The sampled value.
*
* @throws IllegalArgumentException
* if the timestamp is non-postitive.
* @throws TimestampOrderException
* if the timestamp is way out of the current range for the
* history buffer.
*/
synchronized public void add(final long timestamp, final T value) {
if(log.isInfoEnabled())
log.info("timestamp=" + timestamp + ", value="
+ value);
if (timestamp <= 0) {
/*
* Timestamps must be positive.
*/
throw new IllegalArgumentException("timestamp=" + timestamp
+ ", value=" + value);
}
/*
* The [logicalSlot] is the index corresponding to the #of elapsed
* periods since the epoch (when timestamp was 0).
*
* The [physicalSlot] is the index at which the sample will be placed in
* the buffer.
*
* Note: The buffer has a fixed capacity, but samples can arrive out of
* timestamp sequence. Of necessity, we can no longer record samples for
* an earlier period once that physical in the buffer has been recycled
* to represent a later period. In practice this is only a problem if a
* sample arrives so far out of sequence that its timestamp is [capacity *
* period] out of date. Such samples MUST be ignored.
*/
final long logicalSlot = timestamp / period;
if (lastLogicalSlot != -1) {
if ((lastLogicalSlot - logicalSlot) >= capacity) {
/*
* Note: OneShot counters will trigger this response. The
* problem is that the counter value initially arrives for a
* host when the first service starts on that host. If hours or
* days later you then run a task on that service, perhaps an
* application client such as the distributed data loader, then
* it will try to report the one shot counters again and they
* will still have their original timestamp, which is now hours
* or days before the current time.
*
* FIXME This should be hacked so that we do not SEND one shot
* counters unless their timestamp is very recent. That requires
* a filter on the client when the counters are serialized to
* notify the load balancer. Currently that filter can only be a
* Regex, which is not sufficient for this purpose. Once hacked,
* the exception can be re-enabled.
*/
if (log.isInfoEnabled())
log.info("Timestamp out of order?",
new TimestampOrderException("timestamp="
+ timestamp + ", value=" + value));
// throw new TimestampOrderException("timestamp=" + timestamp
// + ", value=" + value);
}
}
final int physicalSlot = (int) (logicalSlot % capacity);
if (lastLogicalSlot == -1) {
/*
* Special case when this is the first sample.
*/
assert lastLogicalSlot == -1;
assert size == 0;
timestamps[physicalSlot] = timestamp;
counts[physicalSlot] = 1;
data[physicalSlot] = value;
size = 1;
} else {
final int lastPhysicalSlot = (int) (lastLogicalSlot % capacity);
final long lastModified = timestamps[lastPhysicalSlot];
assert lastModified > 0 : "lastModified=" + lastModified;
// if (timestamp / period == lastModified / period) {
//
// /*
// * This would cause us to overwrite the last value since the
// * sample is for the same time period (same logicalSlot).
// *
// * Note: This is checked _before_ we test for time going
// * backwards since we want to allow updates of host-wide
// * counters for multiple services running on the same host,
// * in which case there will be more than one report for the
// * same time period and those reports will rarely be in
// * strict timestamp order.
// *
// * @todo probably better off replacing the existing value in
// * the same logicalSlot.
// */
//
// if (log.isInfoEnabled())
// log.info("overwrite ignored: t=" + timestamp + ", value="
// + value);
//
// return;
//
// }
// if (timestamp < lastModified) {
//
// /*
// * FIXME This can happen if there is just a smidge of latency
// * and the counter update falls right around the minute mark. By
// * ignoring this we will wind up with dropped samples when
// * aggregating data, which is not desirable. I need to verify
// * that we can let in slightly old samples (from the last
// * minute's data) without messing up the current data.
// *
// * @todo It can also happen if some sample is wildly late for
// * some reason. Those cases should be logged at WARN.
// */
//
// if (log.isInfoEnabled())
// log.info("Time goes backwards: lastModified="
// + lastModified + ", but timestamp=" + timestamp);
//
// return;
//
// }
/*
* Clear old samples in the buffer starting at one beyond the most
* recent sample previously record and continuing up to the current
* sample.
*/
for (long ls = lastLogicalSlot + 1; ls <= logicalSlot; ls++) {
final int ps = (int) (ls % capacity);
if (ps == 0 && sink != null) {
/*
* Overflow.
*
* Note: The overflow point is designed to be on an even
* period boundary for the next level of aggregation.
*/
final long t = ls * period/*timestamp*/;
final T avg = getAverage();
if (log.isInfoEnabled())
log.info("overflow: t=" + t + ", avg=" + avg);
sink.add(t, avg);
}
if (data[ps] != null) {
if(!overwrite) {
/*
* Note: Overwrite is not always desirable - there is a
* ctor option to disable it.
*/
throw new RuntimeException("Would overwrite data: ps="
+ ps + ", capacity=" + capacity + ", size="
+ size);
}
// clear old slot.
size--;
assert size >= 0 : "size=" + size;
data[ps] = null;
counts[ps] = 0;
timestamps[ps] = 0L;
}
}
/*
* Record the current sample.
*/
if (data[physicalSlot] == null) {
// another slot has its first sample.
size++;
}
// aggregate iff numeric.
data[physicalSlot] = (data[physicalSlot] == null || !isNumeric() ? value
: valueOf(((Number) data[physicalSlot]).doubleValue()
+ ((Number) value).doubleValue()));
// #of samples in that slot.
counts[physicalSlot] ++;
// most recent timestamp for that sample.
timestamps[physicalSlot] = timestamp;
if (size > capacity) {
/*
* FIXME I am seeing this exception after a few days of run
* time. The [size] appears to grow by one every minute.
* 2/22/09. The stack trace is emerging out of the LBS update
* task, but the problem is clearly in the History class itself:
*
* java.lang.AssertionError: size=1000, capacity=24
at com.bigdata.counters.History.add(History.java:938)
at com.bigdata.counters.History.add(History.java:894)
at com.bigdata.counters.HistoryInstrument.add(HistoryInstrument.java:130)
at com.bigdata.service.LoadBalancerService$UpdateTask.setupCounters(LoadBalancerService.java:1668)
at com.bigdata.service.LoadBalancerService$UpdateTask.run(LoadBalancerService.java:843)
at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:441)
at java.util.concurrent.FutureTask$Sync.innerRunAndReset(FutureTask.java:317)
at java.util.concurrent.FutureTask.runAndReset(FutureTask.java:150)
at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.access$101(ScheduledThreadPoolExecutor.java:98)
at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.runPeriodic(ScheduledThreadPoolExecutor.java:181)
at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.run(ScheduledThreadPoolExecutor.java:205)
at java.util.concurrent.ThreadPoolExecutor$Worker.runTask(ThreadPoolExecutor.java:885)
at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:907)
at java.lang.Thread.run(Thread.java:619)
*/
// log assertion but do not throw the execption.
log.warn("size=" + size + ", capacity=" + capacity);
}
}
// strictly increasing since samples may arrive out of timestamp order.
lastLogicalSlot = Math.max(lastLogicalSlot, logicalSlot);
}
/**
* Constructor used at the base collection period.
*
* @param data
* An array whose size is the capacity of the history buffer. The
* contents of the array will be used to store the data. (This
* API requirement arises since generics are fixed at compile
* time rather than runtime.)
* @param period
* The period covered by each slot in milliseconds.
* @param overwrite
* true iff overwrite of slots in the buffer is
* allowed (when false the buffer will fill up and
* then refuse additional samples if they would overwrite slots
* which are in use).
*/
@SuppressWarnings("unchecked")
public History(final T[] data, final long period, boolean overwrite) {
if (data == null)
throw new IllegalArgumentException();
if (data.length == 0)
throw new IllegalArgumentException();
if (period <= 0)
throw new IllegalArgumentException();
this.capacity = data.length;
this.source = null;
this.period = period;
this.overwrite = overwrite;
this.timestamps = new long[capacity];
this.counts = new int[capacity];
this.data = data;
final Class ctype = (Class) data.getClass().getComponentType();
this._long = ctype == Long.class;
this._double = ctype == Double.class;
_numeric = (_long || _double);
}
/**
* Constructor used when aggregating from another collection period.
*
* @param capacity
* The #of slots in the history.
* @param source
* The source whose values are aggregated each time its
* history overflows.
*/
@SuppressWarnings("unchecked")
protected History(final int capacity, final History source) {
if (capacity <= 0)
throw new IllegalArgumentException();
if (source == null)
throw new IllegalArgumentException();
this.capacity = capacity;
this.source = source;
this.period = source.period * capacity;
this.overwrite = true;
this.timestamps = new long[capacity];
this.counts = new int[capacity];
// Note: allocate based on the type of the source history.
this.data = (T[]) java.lang.reflect.Array.newInstance(source.data
.getClass().getComponentType(), capacity);
// reverse link.
source.sink = this;
final Class ctype = data.getClass().getComponentType();
this._long = ctype == Long.class;
this._double = ctype == Double.class;
_numeric = (_long || _double);
}
private final History source;
private final int capacity;
private final long period;
private final boolean overwrite;
private final boolean _numeric;
private final boolean _long;
private final boolean _double;
private History sink;
/**
* The sink on which the history writes when it overflows -or-
* null if no sink has been assigned (it is assigned by the
* alternate ctor).
*/
protected History getSink() {
return sink;
}
/**
* The timestamp of the last sample reported in a given period.
*/
final private long[] timestamps;
/**
* The sum of the samples reported in a given period.
*/
final private T[] data;
/**
* The #of samples reported in a given period.
*/
final private int[] counts;
/**
* Number of valid samples in the buffer.
*/
private int size = 0;
/**
* The last logical slot in the buffer in which a sample was written and
* -1 until the first sample has been written.
*
* The [logicalSlot] is a strictly increasing index corresponding to the #of
* elapsed periods since the epoch (when timestamp was 0).
*
* The [physicalSlot] is the index at which the new sample will be placed in
* the buffer. This is always interpreted as logically greater than the last
* sample (we have already asserted that the timestamp is greater than
* lastModified), even if the actual index is less than or equal to the
* current index.
*/
private long lastLogicalSlot = -1;
}