2010-06-17 15:49:42 -04:00
|
|
|
package spark
|
|
|
|
|
|
|
|
import java.util.concurrent.atomic.AtomicLong
|
|
|
|
import java.util.concurrent.ConcurrentHashMap
|
|
|
|
import java.util.HashSet
|
|
|
|
|
|
|
|
import scala.collection.mutable.ArrayBuffer
|
|
|
|
import scala.collection.mutable.Map
|
|
|
|
|
|
|
|
import nexus._
|
|
|
|
|
|
|
|
import com.google.common.collect.MapMaker
|
|
|
|
|
|
|
|
@serializable
|
|
|
|
abstract class RDD[T: ClassManifest, Split](
|
|
|
|
@transient sc: SparkContext) {
|
|
|
|
def splits: Array[Split]
|
|
|
|
def iterator(split: Split): Iterator[T]
|
2010-06-27 18:21:54 -04:00
|
|
|
def preferredLocations(split: Split): Seq[String]
|
2010-06-17 15:49:42 -04:00
|
|
|
|
|
|
|
def taskStarted(split: Split, slot: SlaveOffer) {}
|
|
|
|
|
|
|
|
def sparkContext = sc
|
|
|
|
|
|
|
|
def map[U: ClassManifest](f: T => U) = new MappedRDD(this, sc.clean(f))
|
|
|
|
def filter(f: T => Boolean) = new FilteredRDD(this, sc.clean(f))
|
|
|
|
def cache() = new CachedRDD(this)
|
|
|
|
|
|
|
|
def foreach(f: T => Unit) {
|
|
|
|
val cleanF = sc.clean(f)
|
|
|
|
val tasks = splits.map(s => new ForeachTask(this, s, cleanF)).toArray
|
|
|
|
sc.runTaskObjects(tasks)
|
|
|
|
}
|
|
|
|
|
|
|
|
def collect(): Array[T] = {
|
|
|
|
val tasks = splits.map(s => new CollectTask(this, s))
|
|
|
|
val results = sc.runTaskObjects(tasks)
|
|
|
|
Array.concat(results: _*)
|
|
|
|
}
|
|
|
|
|
|
|
|
def toArray(): Array[T] = collect()
|
|
|
|
|
|
|
|
def reduce(f: (T, T) => T): T = {
|
|
|
|
val cleanF = sc.clean(f)
|
|
|
|
val tasks = splits.map(s => new ReduceTask(this, s, f))
|
|
|
|
val results = new ArrayBuffer[T]
|
|
|
|
for (option <- sc.runTaskObjects(tasks); elem <- option)
|
|
|
|
results += elem
|
|
|
|
if (results.size == 0)
|
|
|
|
throw new UnsupportedOperationException("empty collection")
|
|
|
|
else
|
|
|
|
return results.reduceLeft(f)
|
|
|
|
}
|
|
|
|
|
|
|
|
def take(num: Int): Array[T] = {
|
|
|
|
if (num == 0)
|
|
|
|
return new Array[T](0)
|
|
|
|
val buf = new ArrayBuffer[T]
|
|
|
|
for (split <- splits; elem <- iterator(split)) {
|
|
|
|
buf += elem
|
|
|
|
if (buf.length == num)
|
|
|
|
return buf.toArray
|
|
|
|
}
|
|
|
|
return buf.toArray
|
|
|
|
}
|
|
|
|
|
|
|
|
def first: T = take(1) match {
|
|
|
|
case Array(t) => t
|
|
|
|
case _ => throw new UnsupportedOperationException("empty collection")
|
|
|
|
}
|
|
|
|
|
|
|
|
def count(): Long =
|
|
|
|
try { map(x => 1L).reduce(_+_) }
|
|
|
|
catch { case e: UnsupportedOperationException => 0L }
|
2010-06-18 15:54:33 -04:00
|
|
|
|
|
|
|
def union[OtherSplit](other: RDD[T, OtherSplit]) =
|
|
|
|
new UnionRDD(sc, this, other)
|
|
|
|
|
|
|
|
def ++[OtherSplit](other: RDD[T, OtherSplit]) = this.union(other)
|
2010-06-17 15:49:42 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
@serializable
|
|
|
|
abstract class RDDTask[U: ClassManifest, T: ClassManifest, Split](
|
|
|
|
val rdd: RDD[T, Split], val split: Split)
|
|
|
|
extends Task[U] {
|
2010-06-27 18:21:54 -04:00
|
|
|
override def preferredLocations() = rdd.preferredLocations(split)
|
2010-06-17 15:49:42 -04:00
|
|
|
override def markStarted(slot: SlaveOffer) { rdd.taskStarted(split, slot) }
|
|
|
|
}
|
|
|
|
|
|
|
|
class ForeachTask[T: ClassManifest, Split](
|
|
|
|
rdd: RDD[T, Split], split: Split, func: T => Unit)
|
|
|
|
extends RDDTask[Unit, T, Split](rdd, split) {
|
|
|
|
override def run() {
|
|
|
|
println("Processing " + split)
|
|
|
|
rdd.iterator(split).foreach(func)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
class CollectTask[T, Split](
|
|
|
|
rdd: RDD[T, Split], split: Split)(implicit m: ClassManifest[T])
|
|
|
|
extends RDDTask[Array[T], T, Split](rdd, split) {
|
|
|
|
override def run(): Array[T] = {
|
|
|
|
println("Processing " + split)
|
|
|
|
rdd.iterator(split).toArray(m)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
class ReduceTask[T: ClassManifest, Split](
|
|
|
|
rdd: RDD[T, Split], split: Split, f: (T, T) => T)
|
|
|
|
extends RDDTask[Option[T], T, Split](rdd, split) {
|
|
|
|
override def run(): Option[T] = {
|
|
|
|
println("Processing " + split)
|
|
|
|
val iter = rdd.iterator(split)
|
|
|
|
if (iter.hasNext)
|
|
|
|
Some(iter.reduceLeft(f))
|
|
|
|
else
|
|
|
|
None
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
class MappedRDD[U: ClassManifest, T: ClassManifest, Split](
|
|
|
|
prev: RDD[T, Split], f: T => U)
|
|
|
|
extends RDD[U, Split](prev.sparkContext) {
|
|
|
|
override def splits = prev.splits
|
2010-06-27 18:21:54 -04:00
|
|
|
override def preferredLocations(split: Split) = prev.preferredLocations(split)
|
2010-06-17 15:49:42 -04:00
|
|
|
override def iterator(split: Split) = prev.iterator(split).map(f)
|
|
|
|
override def taskStarted(split: Split, slot: SlaveOffer) = prev.taskStarted(split, slot)
|
|
|
|
}
|
|
|
|
|
|
|
|
class FilteredRDD[T: ClassManifest, Split](
|
|
|
|
prev: RDD[T, Split], f: T => Boolean)
|
|
|
|
extends RDD[T, Split](prev.sparkContext) {
|
|
|
|
override def splits = prev.splits
|
2010-06-27 18:21:54 -04:00
|
|
|
override def preferredLocations(split: Split) = prev.preferredLocations(split)
|
2010-06-17 15:49:42 -04:00
|
|
|
override def iterator(split: Split) = prev.iterator(split).filter(f)
|
|
|
|
override def taskStarted(split: Split, slot: SlaveOffer) = prev.taskStarted(split, slot)
|
|
|
|
}
|
|
|
|
|
|
|
|
class CachedRDD[T, Split](
|
|
|
|
prev: RDD[T, Split])(implicit m: ClassManifest[T])
|
|
|
|
extends RDD[T, Split](prev.sparkContext) {
|
|
|
|
val id = CachedRDD.newId()
|
2010-06-27 18:21:54 -04:00
|
|
|
@transient val cacheLocs = Map[Split, List[String]]()
|
2010-06-17 15:49:42 -04:00
|
|
|
|
|
|
|
override def splits = prev.splits
|
|
|
|
|
2010-06-27 18:21:54 -04:00
|
|
|
override def preferredLocations(split: Split) = {
|
2010-06-17 15:49:42 -04:00
|
|
|
if (cacheLocs.contains(split))
|
2010-06-27 18:21:54 -04:00
|
|
|
cacheLocs(split)
|
2010-06-17 15:49:42 -04:00
|
|
|
else
|
2010-06-27 18:21:54 -04:00
|
|
|
prev.preferredLocations(split)
|
2010-06-17 15:49:42 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
override def iterator(split: Split): Iterator[T] = {
|
|
|
|
val key = id + "::" + split.toString
|
|
|
|
val cache = CachedRDD.cache
|
|
|
|
val loading = CachedRDD.loading
|
|
|
|
val cachedVal = cache.get(key)
|
|
|
|
if (cachedVal != null) {
|
|
|
|
// Split is in cache, so just return its values
|
|
|
|
return Iterator.fromArray(cachedVal.asInstanceOf[Array[T]])
|
|
|
|
} else {
|
|
|
|
// Mark the split as loading (unless someone else marks it first)
|
|
|
|
loading.synchronized {
|
|
|
|
if (loading.contains(key)) {
|
|
|
|
while (loading.contains(key)) {
|
|
|
|
try {loading.wait()} catch {case _ =>}
|
|
|
|
}
|
|
|
|
return Iterator.fromArray(cache.get(key).asInstanceOf[Array[T]])
|
|
|
|
} else {
|
|
|
|
loading.add(key)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// If we got here, we have to load the split
|
|
|
|
println("Loading and caching " + split)
|
|
|
|
val array = prev.iterator(split).toArray(m)
|
|
|
|
cache.put(key, array)
|
|
|
|
loading.synchronized {
|
|
|
|
loading.remove(key)
|
|
|
|
loading.notifyAll()
|
|
|
|
}
|
|
|
|
return Iterator.fromArray(array)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
override def taskStarted(split: Split, slot: SlaveOffer) {
|
|
|
|
val oldList = cacheLocs.getOrElse(split, Nil)
|
2010-06-27 18:21:54 -04:00
|
|
|
val host = slot.getHost
|
|
|
|
if (!oldList.contains(host))
|
|
|
|
cacheLocs(split) = host :: oldList
|
2010-06-17 15:49:42 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private object CachedRDD {
|
|
|
|
val nextId = new AtomicLong(0) // Generates IDs for cached RDDs (on master)
|
|
|
|
def newId() = nextId.getAndIncrement()
|
|
|
|
|
|
|
|
// Stores map results for various splits locally (on workers)
|
|
|
|
val cache = new MapMaker().softValues().makeMap[String, AnyRef]()
|
|
|
|
|
|
|
|
// Remembers which splits are currently being loaded (on workers)
|
|
|
|
val loading = new HashSet[String]
|
|
|
|
}
|
2010-06-18 15:54:33 -04:00
|
|
|
|
|
|
|
@serializable
|
|
|
|
abstract class UnionSplit[T: ClassManifest] {
|
|
|
|
def iterator(): Iterator[T]
|
2010-06-27 18:21:54 -04:00
|
|
|
def preferredLocations(): Seq[String]
|
2010-06-18 15:54:33 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
@serializable
|
|
|
|
class UnionSplitImpl[T: ClassManifest, Split](
|
|
|
|
rdd: RDD[T, Split], split: Split)
|
|
|
|
extends UnionSplit[T] {
|
|
|
|
override def iterator() = rdd.iterator(split)
|
2010-06-27 18:21:54 -04:00
|
|
|
override def preferredLocations() = rdd.preferredLocations(split)
|
2010-06-18 15:54:33 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
@serializable
|
|
|
|
class UnionRDD[T: ClassManifest, Split1, Split2](
|
|
|
|
sc: SparkContext, rdd1: RDD[T, Split1], rdd2: RDD[T, Split2])
|
|
|
|
extends RDD[T, UnionSplit[T]](sc) {
|
|
|
|
|
|
|
|
@transient val splits_ : Array[UnionSplit[T]] = {
|
|
|
|
val a1 = rdd1.splits.map(s => new UnionSplitImpl(rdd1, s))
|
|
|
|
val a2 = rdd2.splits.map(s => new UnionSplitImpl(rdd2, s))
|
|
|
|
(a1 ++ a2).toArray
|
|
|
|
}
|
|
|
|
|
|
|
|
override def splits = splits_
|
|
|
|
|
|
|
|
override def iterator(s: UnionSplit[T]): Iterator[T] = s.iterator()
|
|
|
|
|
2010-06-27 18:21:54 -04:00
|
|
|
override def preferredLocations(s: UnionSplit[T]): Seq[String] =
|
|
|
|
s.preferredLocations()
|
2010-06-18 15:54:33 -04:00
|
|
|
}
|