Skip to content
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
wants to merge 27 commits into
base: master
Choose a base branch
from

Conversation

lilyzhouZYJ
Copy link

No description provided.

lilyzhouZYJ and others added 27 commits October 31, 2023 16:35
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.
…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
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants