当前位置:网站首页>C# Barrier class
C# Barrier class
2022-08-02 23:32:00 【biyusr】
对于同步,Barrier 类非常适用于其中工作有多个任务分支且以后又需要合并工作的情况.Barrier 类用于需要同步的参与者.激活一个任务时,就可以动态地添加其他参与者,例如,从父任务中创建子任务.参与者在继续之前,可以等待所有其他参与者完成其工作.
BarrierSample 有点复杂,但它展示了 Barrier 类型的功能.下面的应用程序使用一个包含 2 000 000 个随机字符串的集合.使用多个任务遍历该集合,并统计以 a、b、c 等开头的字符串个数.工作不仅分布在不同的任务之间,也放在一个任务中.毕竟所有的任务都迭代字符串的第一个集合,汇总结果,以后任务会继续处理下一个集合.
FillData() 方法创建一个集合,并用随机字符串填充它:
public static IEnumerable<string> FillData(int size){var r = new Random();return Enumerable.Range(0, size).Select(x => GetString(r));}private static string GetString(Random r){var sb = new StringBuilder(6);for (int i = o; i < 6; i++){sb.Append((char)(r.Next(26) + 97));}return sb.ToString();}
在 LogBarrierInformation 方法中定义一个辅助方法,来显示 Barrier 的信息:
private static void LogBarrierInformation(string info, Barrier barrier){Console.WriteLine($"Task {Task.CurrentId): {info)."+$"{barrier.ParticipantCount} current and " +$"{barrier.ParticipantsRemaining} remaining participants, " +$"phase {barrier.CurrentPhaseNumber}") ;}
CalculationInTask() 方法定义了任务执行的作业.通过参数,第 3 个参数引用 Barrier 实例.用于计算的数是数组 IList<string>.最后一个参数是 int 锯齿数组,用于在任务执行过程中写出结果.
任务把处理放在一个循环中.每一次循环中,都处理 IList<string>[] 的数组元素.每个循环完成后,任务通过调用 SignalAndWait 方法,发出做好了准备的信号,并等待,直到所有的其他任务也准备好处理为止.这个循环会继续执行,直到任务完全完成为止.接着,任务就会使用 RemoveParticipant() 方法从 Barrier 类中删除它自己:
private static void CalculationInTask(int jobNumber, int partitionSize,Barrier barrier, IList<string>[] coll, int loops, int[][] results){LogBarrierInformation("CalculationInTask started", barrier);for (int i = 0; i < loops; i++){var data = new List<string>(coll[i]);int start = jobNumber * partitionSize;int end = start + partitionSize;Console.WriteLine($"Task {Task.CurrentId) in loop {i}: partition " +$"from {start} to {end}");for (int j = start; j < end; j++){char c = data[j] [0];results[i][c - 97]++;}Console.WriteLine($"Calculation completed from task {Task.CurrentId) " +$"in loop {i}. {results[i][0]} times a, {results[i][25]} times z");LogBarrierInformation("sending signal and wait for all", barrier);barrier.SignalAndWait();LogBarrierInformation("waiting completed", barrier);}barrier.RemoveParticipant();LogBarrierInformation("finished task, removed participant", barrier);}
在 Main() 方法中创建一个 Barrier 实例.在构造函数中,可以指定参与者的数量.在该示例中,这个数量是 3(numberTasks + 1),因为该示例创建了两个任务,Main() 方法本身也是一个参与者.使用 Task.Run 创建两个任务,把遍历集合的任务分为两个部分.启动该任务后,使用 SignalAndWait() 方法,Main() 方法在完成时发出信号,并等待所有其他参与者或者发出完成的信号,或者从Barrier 类中删除它们.一旦所有的参与者都准备好,就提取任务的结果,并使用Zip() 扩展方法把它们合并起来.接着进行下一次迭代,等待任务的下一个结果:
static void Main(){const int numberTasks = 2;const int partitionSize = 1000000;const int loops = 5;var taskResults = new Dictionary<int, int[][]>();var data = new List<string>[loops];for (int i = o; i < loops; i++){data[i] = new List<string>(FillData(partitionSize * numberTasks);}var barrier = new Barrier(numberTasks + 1);LogBarrierInformation("initial participants in barrier", barrier);for (int i = 0; i < numberTasks; i++){barrier.AddParticipant();int jobNumber = i;taskResults.Add(i, new int[loops][]);for (int loop = 0; loop < loops; loop++){taskResult[i, loop] = new int[26];}Console.WriteLine("Main - starting task job {jobNumber}");Task.Run(() => CalculationInTask(jobNumber, partitionSize,barrier, data, loops, taskResults[jobNumber]));}for (int loop = 0; loop < 5; loop++){LogBarrierInformation("main task, start signaling and wait", barrier);barrier.SignalAndWait();LogBarrierInformation("main task waiting completed", barrier);int[][] resultCollection1 = taskResults[0];int[][] resultCollection2 = taskResults[1];var resultCollection = resultCollection1[loop].Zip(resultCollection2[loop],(cl, c2) => cl + c2);char ch = 'a';int sum = 0;foreach (var x in resultCollection){Console.WriteLine($"{ch++}, count: {x}");sum += x;}LogBarrierInformation($"main task finished loop {loop}, sum: {sum}",barrier);}Console.WriteLine("finished all iterations");Console.ReadLine();}
运行应用程序,输出如下所示.在输出中可以看到,每个 AddParticipant 调用都会增加参与者的数量和剩下的参与者数量.只要一个参与者调用 SignalAndWait,剩下的参与者数就会递减.当剩下的参与者数量达到0时,所有参与者的等待就结束,开始下一个阶段:
Task : initial participants in barrier. 1 current and 1 remaining participants, phase 0.
Main - starting task job 0
Main - starting task job 1
Task : main task, starting signaling and wait. 3 current and
3 remaining participants, phase 0.
Task 4: CalculationInTask started. 3 current and 2 remaining participants, phase 0.
Task 5: CalculationInTask started. 3 current and 2 remaining participants, phase 0.
Task 4 in loop 0: partition from 0 to 1000000
Task 5 in loop 0: partition from 1000000 to 2000000
Calculation completed from task 4 in loop 0. 38272 times a, 38637 times z Task 4: sending signal and wait for all. 3 current and
2 remaining participants, phase 0.
Calculation completed from task 5 in loop 0. 38486 times a, 38781 times z. Task 5: sending signal and wait for all. 3 current and
1 remaining participants, phase 0.
Task 5: waiting completed. 3 current and 3 remaining participants, phase 1 Task 4: waiting completed. 3 current and 3 remaining participants, phase 1
Task : main waiting completed. 3 current and 3 remaining participants, phase 1
边栏推荐
猜你喜欢

信息学奥赛一本通(1258:【例9.2】数字金字塔)

J9 digital theory: the Internet across chain bridge has what effect?

Implement fashion_minst clothing image classification

第七章 噪声

SQL 入门之第一讲——MySQL 8.0.29安装教程(windows 64位)

KDD 2022 | 深度图神经网络中的特征过相关:一个新视角

「 每日一练,快乐水题 」1374. 生成每种字符都是奇数个的字符串

李沐动手学深度学习V2-BERT预训练和代码实现

基于 outline 实现头像剪裁以及预览

姑姑:给小学生出点口算题
随机推荐
SCANIA SCANIA OTL tag is introduced
PG 之 SQL执行计划
OpenCV开发中的内存管理问题
【实战 已完结】WPF开发自动化生产管理平台
Likou Question of the Day - Day 46 - 344. Reverse Strings
KDD 2022 | 深度图神经网络中的特征过相关:一个新视角
"A daily practice, happy water problem" 1374. Generate a string with an odd number of each character
训练双塔检索模型,可以不用query-doc样本了?明星机构联合发文
Lvm逻辑卷
ABAP grammar small review
J9 Digital Currency Theory: Identifying Web3's New Scarcity: Open Source Developers
OP analysis and design
传感器工作原理
What is a Field Service Management System (FSM)?what is the benefit?
unittest自动化测试框架总结
golang 源码分析:uber-go/ratelimit
[安洵杯 2019]easy_web
【软件工程导论】软件工程导论笔记
The time series database has been developed for 5 years. What problem does it need to solve?
.NET如何快速比较两个byte数组是否相等