jihoonson commented on a change in pull request #8038: Making optimal usage of multiple segment cache locations URL: https://github.com/apache/incubator-druid/pull/8038#discussion_r327888934
########## File path: server/src/main/java/org/apache/druid/segment/loading/RoundRobinStorageLocationSelectorStrategy.java ########## @@ -0,0 +1,48 @@ +/* + * Licensed to the Apache Software Foundation (ASF) under one + * or more contributor license agreements. See the NOTICE file + * distributed with this work for additional information + * regarding copyright ownership. The ASF licenses this file + * to you under the Apache License, Version 2.0 (the + * "License"); you may not use this file except in compliance + * with the License. You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, + * software distributed under the License is distributed on an + * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY + * KIND, either express or implied. See the License for the + * specific language governing permissions and limitations + * under the License. + */ + +package org.apache.druid.segment.loading; + +import com.google.common.collect.ImmutableList; +import com.google.common.collect.Iterators; +import org.apache.druid.timeline.DataSegment; + +import java.util.Iterator; + +/** + * A {@link StorageLocation} selector strategy that selects a segment cache location in a round-robin fashion each time + * among the available storage locations. + */ +public class RoundRobinStorageLocationSelectorStrategy implements StorageLocationSelectorStrategy +{ + private Iterator<StorageLocation> cyclicIterator; + + @Override + public void setStorageLocations(ImmutableList<StorageLocation> storageLocations) + { + // cyclicIterator remembers the marker internally + cyclicIterator = Iterators.cycle(storageLocations); + } + + @Override + public Iterator<StorageLocation> getLocations(DataSegment dataSegment, String storageDirStr) + { + return cyclicIterator; Review comment: > The implementation seems slightly tricky to me. Similar to the leastBytes used selector, synchronization issues can occur with roundRobin iterator when multiple threads are loading segments. This might lead to an incorrect round robin behavior. Good point. An example implementation could be: ```java public class RoundRobinStorageLocationSelectorStrategy implements StorageLocationSelectorStrategy { private final List<StorageLocation> storageLocations; private final AtomicInteger startIndex = new AtomicInteger(0); public RoundRobinStorageLocationSelectorStrategy(List<StorageLocation> storageLocations) { this.storageLocations = storageLocations; } @Override public Iterator<StorageLocation> getLocations() { return new Iterator<StorageLocation>() { private final int numStorageLocations = storageLocations.size(); private int remainingIterations = numStorageLocations; private int i = startIndex.getAndIncrement(); @Override public boolean hasNext() { return remainingIterations > 0; } @Override public StorageLocation next() { if (!hasNext()) { throw new NoSuchElementException(); } remainingIterations--; final StorageLocation nextLocation = storageLocations.get(i++); if (i == numStorageLocations) { i = 0; } return nextLocation; } }; } } ``` ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: [email protected] With regards, Apache Git Services --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
