Created
January 21, 2015 22:59
-
-
Save dacr/9e7d034f8ffa72f7be5f to your computer and use it in GitHub Desktop.
Akka actors primes computation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class ActorsPrimesGenerator[NUM]( | |
handler: CheckedValue[NUM] => Unit = ActorsPrimesGenerator.mkPrintHandler[NUM](), | |
name: String = "DefaultActordBasedPrimesGeneratorSystem", | |
startFrom: NUM = 2, | |
primeNth: NUM = 1, | |
notPrimeNth: NUM = 1)(implicit numops: Integral[NUM]) extends PrimesDefinitions[NUM] with Shutdownable { | |
import numops._ | |
/* | |
* To minimize the amount of messages used for back pressure regulation | |
*/ | |
val groupedAckSize = 100L | |
/* | |
* How many values to keep precomputed but not yet sent to the receiver | |
*/ | |
val precomputedCount = 150L | |
val config = ConfigFactory.load() | |
implicit val system = ActorSystem(name, config.getConfig("primes").withFallback(config)) | |
case class NextValueToCompute(value: NUM) | |
case class PartialResult(value: NUM, isPrime: Boolean, digitCount:Long) | |
object CheckerActor { | |
def props() = Props(new CheckerActor) | |
} | |
class CheckerActor extends Actor { | |
def receive = { | |
case NextValueToCompute(value) => | |
sender ! PartialResult(value, isPrime(value), value.toString.size) | |
} | |
} | |
case class CheckedValueAckMessage(count: Long) | |
class ValuesManagerActor( | |
forActor: ActorRef, | |
checkerWorkers: Int = Runtime.getRuntime.availableProcessors) extends Actor { | |
val checkerRouter = context.actorOf( | |
CheckerActor.props.withRouter(SmallestMailboxPool(checkerWorkers)), | |
"CheckerActorRouter") | |
private var nextPrimeNth = primeNth | |
private var nextNotPrimeNth = notPrimeNth | |
private var currentValue = startFrom // waiting the result for this value | |
private var nextValue = startFrom // next value to send to checker worker | |
// buffered partial results, because we need ordering to compute primes & not primes position | |
private var waitBuffer = Map.empty[NUM, PartialResult] | |
private var inpg = 0L | |
private var sentAckDelta = 0L | |
private final def processPartialResult(partial: PartialResult) { | |
currentValue += one | |
val nth = if (partial.isPrime) nextPrimeNth else nextNotPrimeNth | |
if (partial.isPrime) nextPrimeNth += one else nextNotPrimeNth += one | |
val newResult = CheckedValue[NUM](partial.value, partial.isPrime, partial.digitCount, nth) | |
forActor ! newResult | |
sentAckDelta += 1L | |
} | |
private final def flush2order() { | |
while (waitBuffer.size > 0 && waitBuffer.contains(currentValue)) { | |
val pr = waitBuffer(currentValue) | |
processPartialResult(pr) | |
waitBuffer = waitBuffer - pr.value | |
} | |
} | |
private final def prepareNexts() { | |
//if (sentAckDelta <= groupedAckSize) { | |
if (inpg < precomputedCount/2) { | |
for { _ <- inpg to precomputedCount } { | |
checkerRouter ! NextValueToCompute(nextValue) | |
nextValue += one | |
inpg += 1 | |
} | |
} | |
} | |
prepareNexts() | |
def receive = { | |
case pr: PartialResult if pr.value == currentValue => | |
inpg -= 1 | |
processPartialResult(pr) | |
flush2order() | |
prepareNexts() | |
case pr: PartialResult => // Then delay | |
inpg -= 1 | |
waitBuffer += pr.value -> pr | |
prepareNexts() | |
case CheckedValueAckMessage(count) => | |
sentAckDelta -= count | |
prepareNexts() | |
} | |
} | |
class DealerActor[NUM](handler: CheckedValue[NUM] => Unit) extends Actor { | |
var valuesCounter: Long = 0l | |
def receive = { | |
case chk: CheckedValue[NUM] => | |
handler(chk) | |
valuesCounter += 1 | |
if (valuesCounter % groupedAckSize == 0L) sender ! CheckedValueAckMessage(groupedAckSize) | |
} | |
} | |
private val dealer = actor("DealerPrinter") { | |
new DealerActor(handler) | |
} | |
private val manager = actor("ValuesManagerActor") { | |
new ValuesManagerActor(dealer) | |
} | |
override def shutdown() { | |
system.shutdown() | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment