youmuliu/stgsharp
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Brief solution for publishing, debuging

Browse Source
This commit is contained in:
Youmu Liu
2025-10-20 20:36:20 +08:00
parent 547ba80a01
commit 838ce73133
3 changed files with 60 additions and 42 deletions
Download Patch File Download Diff File Expand all files Collapse all files
StgSharp.Mathematics/Numeric/MatrixParallel.Publish.cs
+35 -18
View File
@@ -2,8 +2,8 @@
// -----------------------------------------------------------------------
// file="MatrixParallel.Publish"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
// AuthorGroup: Nitload
// Copyright (c) Nitload. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
@@ -812,7 +812,7 @@ namespace StgSharp.Mathematics.Numeric
PublicTaskPrivate<T>(package);
}
private static unsafe void PublicTaskPrivate<T>(MatrixParallelTaskPackage<T>* package)
private static unsafe Stack<MatrixParallelWrap> PublicTaskPrivate<T>(MatrixParallelTaskPackage<T>* package)
where T: unmanaged, INumber<T>
{
int primCount = package->PrimCount;
@@ -822,25 +822,42 @@ namespace StgSharp.Mathematics.Numeric
CapacityFixedStack<MatrixParallelWrap> wraps = LeadParallel();
int tilePerThreadLess = tileCount / Wraps.Count;
int tileToSlice = tileCount % Wraps.Count;
int slicingPerWrap = tileToSlice / Wraps.Count;
int extraTiles = tileToSlice % Wraps.Count;
int tilePerThreadLess = tileCount / wraps.Count;
int tileToSlice = tileCount % wraps.Count;
int slicingPerWrap = tileToSlice / wraps.Count;
int extraTiles = tileToSlice % wraps.Count;
int total = tileCount;
List<MatrixParallelWrap> w = new List<MatrixParallelWrap>(Wraps.Count);
int baseTile = 0;
// TODO 干脆用四个掩码分别表示各种部分算了。
for (int i = 0; i < Wraps.Count; i++)
int begin = 0;
Stack<MatrixParallelWrap> taskBunch = new Stack<MatrixParallelWrap>(wraps.Count);
while (tileCount > 0)
{
MatrixParallelWrap wrap = Wraps.Pop();
wrap.WrapTask = (MatrixParallelTaskPackageNonGeneric*)package;
wrap.WrapTaskCapacity = tilePerThreadLess + (i < extraTiles ? 1 : 0);
wrap.WrapTaskSliceCount = (i * tilePerThreadLess) + Math.Min(i, extraTiles);
w.Add(wrap);
MatrixParallelWrap wrap = wraps.Pop();
bool hasSlice = tileToSlice > 0;
bool isLargeSlice = extraTiles > 0;
// count tiles for wrap
int toSlice = wrap.WrapTaskCapacity * slicingPerWrap;
int baseTile = wrap.WrapTaskCapacity * tilePerThreadLess;
int tileInWrap = baseTile + toSlice + (isLargeSlice ? 1 : 0);
int columnInWrap = tileInWrap * tileWidth;
// set tasks
MatrixParallelTaskPackage<T>* task = MatrixParallelFactory.FromExistPackage(package);
wrap.WrapTask = (MatrixParallelTaskPackageNonGeneric*)task;
task->LeftPrimOffset += columnInWrap;
task->PrimCount = columnInWrap;
// remove tiles count
extraTiles--;
tileToSlice -= toSlice;
tileCount -= tileInWrap;
begin += tileInWrap;
taskBunch.Push(wrap);
}
ReleaseParallelLeadership(ref wraps);
return taskBunch;
}
}