Struct AdmittedDistributedRun
pub struct AdmittedDistributedRun<'group, 'model> { /* private fields */ }Description
A collectively admitted, plan-sealed distributed execution.
This token is the only public route to MPI numerical communication. It borrows the execution group mutably, preventing overlapping collective streams, and owns every dynamically sized workspace required through host reacceptance.
Implementations§
§impl AdmittedDistributedRun<'_, '_>
impl AdmittedDistributedRun<'_, '_>
pub const fn system(&self) -> &DistributedLinearSystem
pub const fn system(&self) -> &DistributedLinearSystem
Exact distributed algebra object sealed by admission.
pub const fn complete(&self) -> &CanonicalCsrSystemView
pub const fn complete(&self) -> &CanonicalCsrSystemView
Exact complete host verifier sealed by admission.
pub const fn plan(&self) -> SolverPlan
pub const fn plan(&self) -> SolverPlan
The sole solver plan sealed by collective admission.
pub const fn admission_fingerprint(&self) -> DistributedAdmissionFingerprintV1
pub const fn admission_fingerprint(&self) -> DistributedAdmissionFingerprintV1
Exact system/layout/plan identity agreed by every rank.
pub fn solve_and_replicate(self) -> Result<LinearSolution, Diagnostic>
pub fn solve_and_replicate(self) -> Result<LinearSolution, Diagnostic>
Solve owned rows, reconstruct by explicit global indices on every rank, and independently reaccept the replicated vector through host CSR.
§Errors
Returns a common stable diagnostic for synchronized action, preconditioner, reduction, producer, gather, or host-verifier failure.
pub fn solve_and_replicate_with_trace(
self,
) -> Result<MpiLinearSolveResult, Diagnostic>
pub fn solve_and_replicate_with_trace( self, ) -> Result<MpiLinearSolveResult, Diagnostic>
Solve and return the complete accepted vector with the exact collective sequence that produced and agreed it.
The trace storage is reserved during admission from a checked bound on the maximum Krylov iteration count. Recording a collective boundary cannot allocate after the admitted run exists.
§Errors
Returns a common stable diagnostic for synchronized action,
preconditioner, reduction, producer, gather, or host-verifier failure,
or EQ0807 if the runtime exceeds its pre-admitted trace bound.
pub fn solve_and_replicate_with_local_action(
self,
action: &mut dyn MpiRankLocalCsrAction,
) -> Result<MpiLinearSolveResult, Diagnostic>
pub fn solve_and_replicate_with_local_action( self, action: &mut dyn MpiRankLocalCsrAction, ) -> Result<MpiLinearSolveResult, Diagnostic>
Solve with a caller-owned rank-local CSR action and return the complete accepted vector plus the exact MPI collective trace.
Only owned-row sparse action is delegated. MPI continues to own halo exchange, Krylov vectors, reductions, gather, and host reacceptance.
§Errors
Returns a common stable diagnostic for any synchronized execution failure, including an injected action failure.
Trait Implementations§
Auto Trait Implementations§
impl<'group, 'model> Freeze for AdmittedDistributedRun<'group, 'model>
impl<'group, 'model> !RefUnwindSafe for AdmittedDistributedRun<'group, 'model>
impl<'group, 'model> !Send for AdmittedDistributedRun<'group, 'model>
impl<'group, 'model> !Sync for AdmittedDistributedRun<'group, 'model>
impl<'group, 'model> Unpin for AdmittedDistributedRun<'group, 'model>
impl<'group, 'model> UnsafeUnpin for AdmittedDistributedRun<'group, 'model>
impl<'group, 'model> !UnwindSafe for AdmittedDistributedRun<'group, 'model>
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.