parallel_for_each


// print_array complie with: /EHsc
#include <ppl.h>
#include <array>
#include <algorithm>
#include <iostream>

using namespace Concurrency;
using namespace std;
using namespace std::tr1;


int main()
{
    array<int, 3> a = {13, 26, 39};
    cout << "Using for_each:" << endl;
    for_each(a.begin(), a.end(), [&](int n){ cout << n << endl;} );

    // 使用 parallel_for_each来完成同样的任务
    cout << "Using parallel_for_each:" << endl;
    parallel_for_each(a.begin(), a.end(), [&](int n) {cout << n << endl;} );

    system("pause");
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Author(s) Henri Casanova (Author), Arnaud Legrand (Author), Yves Robert (Author) Publisher: Chapman and Hall/CRC (July 17, 2008) ISBN-10: 1584889454 ISBN-13: 978-1584889458 Book Description Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades. In the first section of the text, the authors cover two classical theoretical models of parallel computation (PRAMs and sorting networks), describe network models for topology and performance, and define several classical communication primitives. The next part deals with parallel algorithms on ring and grid logical topologies as well as the issue of load balancing on heterogeneous computing platforms. The final section presents basic results and approaches for common scheduling problems that arise when developing parallel algorithms. It also discusses advanced scheduling topics, such as divisible load scheduling and steady-state scheduling. With numerous examples and exercises in each chapter, this text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值