Interface for determining the Alluxio worker location to serve a block write or UFS block read.
The factory for the
A policy that pseudo-randomly distributes blocks between workers according to their capacity, so that the probability a worker is chosen is equal to the ratio of its capacity over total capacity of all workers, provided that the blocks requested follow a uniform distribution.
Randomly distribute workload based on the worker capacities so bigger workers get more requests.
This policy maps the blockId to several deterministic Alluxio workers.
A policy that returns the local worker first, and if the local worker doesn't exist or doesn't have enough availability, will select the nearest worker from the active workers list with sufficient availability.
A policy that returns the local worker first, and if the local worker doesn't exist or doesn't have enough capacity, will select the nearest worker from the active workers list with sufficient capacity.
A policy that returns the worker with the most available bytes.
A policy that chooses the worker for the next block in a round-robin manner and skips workers that do not have enough space.
Always returns a worker with the hostname specified by
Copyright © 2023. All Rights Reserved.