Object

edu.berkeley.ce.sparkrocks

SeedJointSelector

Related Doc: package sparkrocks

Permalink

object SeedJointSelector

Selects joints from the input joint set that will be used to seed the RDD in order to maintain approximately balanced loads among processors.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SeedJointSelector
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val LOWER_BOUND: Double

    Permalink
  5. val THRESHOLD: Double

    Permalink
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def findSeedBlocks(jointSets: Seq[Seq[Joint]], inputVolume: Block, numPartitions: Int, jointSetSpan: Int, seedBlocks: Seq[Block] = Seq.empty[Block], remainingJoints: Seq[Joint] = Seq.empty[Joint]): (Seq[Block], Seq[Joint])

    Permalink

    Find specified number of seed blocks by cycling through persistent joint sets, searching for joints that divide input volume into approximately equal volumes.

    Find specified number of seed blocks by cycling through persistent joint sets, searching for joints that divide input volume into approximately equal volumes.

    jointSets

    Seq of Seq's of Joints representing input joint sets

    inputVolume

    Block representing input rock volume

    numPartitions

    Number of partitions desired

    jointSetSpan

    Number of joint sets to search at a time for partition generation

    seedBlocks

    Blocks that will serve as partitions

    remainingJoints

    Seq of joints that were not used in seed block generation

    returns

    Returns a tuple containing a Seq of blocks and a Seq of joints. The Seq of blocks are the the desired partitions. The Seq of joints are the remaining joints that were not used to generate the partitions.

    Annotations
    @tailrec()
  12. def findSeedJoints(jointSet: Seq[Joint], initialVolume: Block, totalVolume: Double, volumePerPiece: Double, selectedJoints: Seq[Joint] = Seq.empty[Joint], remainingJoints: Seq[Joint] = Seq.empty[Joint]): (Seq[Joint], Seq[Joint])

    Permalink

    Cycles through persistent joint set to find joints that approximately balances load across processes

    Cycles through persistent joint set to find joints that approximately balances load across processes

    jointSet

    Seq of Joints representing a persistent joint set

    initialVolume

    Block representing input rock volume that should be divided into approximately equal pieces for each process to operate on

    totalVolume

    Total volume of rock volume in analysis

    volumePerPiece

    Ideal volume per partition for load balance

    selectedJoints

    Seq of joints that have been identified as seed joints

    remainingJoints

    Seq of joints that were not selected as seed joints

    returns

    Tuple containing two Seq's of joints. The first Seq contains joints that divide initial block into approximately equal volumes. The second Seq is the joints remaining from the input joint set.

    Annotations
    @tailrec()
  13. def generateSeedBlocks(jointSets: Seq[Seq[Joint]], inputVolume: Block, numPartitions: Int, jointSetSpan: Int = 1): (Seq[Block], Seq[Joint])

    Permalink

    Generate specified number of partitions using input joint sets

    Generate specified number of partitions using input joint sets

    jointSets

    Seq of Seq's of Joints representing input joint sets

    inputVolume

    Block representing input rock volume

    numPartitions

    Number of partitions desired

    jointSetSpan

    Number of joint sets to search at a time for partition generation

    returns

    Returns a tuple containing a Seq of blocks and a Seq of joints. The Seq of blocks are the the desired partitions. The Seq of joints are the remaining joints that were not used to generate the partitions.

    Annotations
    @tailrec()
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. def searchJointSets(jointSets: Seq[Seq[Joint]], inputVolume: Block, numPartitions: Int, jointSetSpan: Int, spanCount: Int = 1, seedJoints: Seq[Joint] = Seq.empty[Joint], remainingJoints: Seq[Joint] = Seq.empty[Joint]): (Seq[Joint], Seq[Joint])

    Permalink

    Search input joint sets for joints that divide input volume into approximately equal volumes based on desired number of partitions.

    Search input joint sets for joints that divide input volume into approximately equal volumes based on desired number of partitions.

    jointSets

    Seq of Seq's of Joints representing input joint sets

    inputVolume

    Block representing input rock volume

    numPartitions

    Number of partitions desired

    jointSetSpan

    Number of joint sets to search at a time for partition generation

    spanCount

    Number or joint sets to search for seed joints

    seedJoints

    Seq of joints that were not used in seed block generation

    remainingJoints

    Seq of joints that were not selected seed joints

    returns

    Returns a tuple containing two Seq's of Joints. The first Seq contains the seed joints that best divide the input volume. The second Seq contains the joints that remain from the joint sets that have been checked.

    Annotations
    @tailrec()
  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def testVolumes(joint: Joint, initialVolume: Block, desiredVolume: Double): Option[Block]

    Permalink

    Test whether input joint divides initial volume into blocks of approximately the desired volume

    Test whether input joint divides initial volume into blocks of approximately the desired volume

    joint

    Joint to test

    initialVolume

    Volume that is to be subdivided

    desiredVolume

    Desired volume of subdivision

    returns

    If joint satisfactorily subdivides initial volume, returns remaining volume that is to be further subdivided. Otherwise, returns None.

  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped