Minor Description
Currently Vortex uses an embedded random VortexWorker-Tasklet scheduling algorithm.
Once we have better understanding of key metrics(e.g. resource reliability, queue size, data locality) for making scheduling decisions we can optimize the algorithm and even make a pluggable interface for it.
For example we can maintain data structures in a way that enables fast scheduling using indices on those metrics.