-
Notifications
You must be signed in to change notification settings - Fork 363
Increase threshold for parallelization in multi-miller loops #1041
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
Open
Pratyush
wants to merge
3
commits into
master
Choose a base branch
from
multi-pairing-parallelization
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.
Open
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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
This file contains hidden or 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
This file contains hidden or 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
This file contains hidden or 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
This file contains hidden or 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
This file contains hidden or 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
This file contains hidden or 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,33 @@ | ||
| use ark_std::cfg_chunks_mut; | ||
| #[cfg(feature = "parallel")] | ||
| use rayon::prelude::*; | ||
|
|
||
| /// Executes the function `func` over `data` in parallel if the data length exceeds a threshold, | ||
| /// otherwise processes the entire data slice sequentially. | ||
| /// | ||
| /// This is an internal helper function for use in multi-pairing and multi-miller-loop computations. | ||
| /// | ||
| /// | ||
| /// # Parameters | ||
| /// - `data`: A mutable slice of elements to be processed. | ||
| /// - `func`: A function that takes mutable chunk of `data` and returns a value of type `R`. | ||
| /// | ||
| /// # Parallelism | ||
| /// Uses parallel processing via Rayon if the `parallel` feature is enabled and the data length is greater than 1000. | ||
| /// | ||
| /// # Type Parameters | ||
| /// - `T`: The element type of the data slice. Must be `Send`. | ||
| /// - `F`: The function type. Must be `Fn(&mut [T]) -> R + Send + Sync`. | ||
| /// - `R`: The result type. Must implement `std::iter::Product` and `Send`. In internal usage, is the target field type of the pairing. | ||
| pub(super) fn threshold_chunked_loop<T, F, R>(data: &mut [T], func: F) -> R | ||
| where | ||
| F: Fn(&mut [T]) -> R + Send + Sync, | ||
| R: std::iter::Product + Send, | ||
| T: Send, | ||
| { | ||
| if data.len() > 1000 { | ||
| cfg_chunks_mut!(data, 32).map(func).product::<R>() | ||
| } else { | ||
| func(data) | ||
| } | ||
| } | ||
Oops, something went wrong.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
is there a specific reason for 1000?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Just a number I’m trying right now. I think it can be much lower.