-
Notifications
You must be signed in to change notification settings - Fork 18
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implementing deficit-based priority-queueing scheduler. #4
Draft
lilyzhouZYJ
wants to merge
27
commits into
cern-fts:master
Choose a base branch
from
jackiedong6:deficit-scheduler
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Conversation
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
Added a new directory in services/transfers introducing a class called DinicsMaximumFlow that provides the interface for creating a network graph as well as computing maximum flow.
Added new configuration for selecting the transfer service's allocator as "GREEDY" or "MAXFLOW", with default being "GREEDY". Also added configuration for selecting the transfer service's scheduling algorithm as "RANDOMIZED", "DEFICIT", or "SELECTION", with the default value being "RANDOMIZED". User's are able to override these default values via the command line.
…ll as a set of queues and returns the capacity on each queue.
Added a new class in services/transfers introducing a class called MaxiumFlow that provides the interface for creating a network graph as well as computing maximum flow. Also introduced new unit tests to test functionality.
Added new configuration for selecting the transfer service's allocator as "GREEDY" or "MAXFLOW", with default being "GREEDY". Also added configuration for selecting the transfer service's scheduling algorithm as "RANDOMIZED", "DEFICIT", or "SELECTION", with the default value being "RANDOMIZED". User's are able to override these default values via the command line. Finally, also introduced new unit tests to test reading config as well as accepting from the command line.
…ll as a set of queues and returns the capacity on each queue.
…nks their full capacity, and then removes the links from the flow network.
….com/jackiedong6/fts3 into Jackie/Add-Maximum-Flow-To-Allocator
…m will now check for starved links, allocate the full capacity for starved links, then remove them from the flow graph before running the max flow algorithm. This code replaces a previous commit by moving the code from the TransfersService.cpp to Allocator.cpp
…duler Conflicts: src/db/mysql/Config.cpp src/db/mysql/MySqlAPI.cpp src/server/services/transfers/Scheduler.cpp src/server/services/transfers/Scheduler.h src/server/services/transfers/TransfersService.cpp src/server/services/transfers/TransfersService.h
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.