求解单元约束问题的并行局部搜索 宽频引擎（初步结果）

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

摘要翻译：
我们探索了Cell宽带引擎（简称Cell/BE）在组合优化应用中的应用：我们提出了一个基于约束的局部搜索算法的并行版本，该算法已经在一个多处理器BladeCenter机器上实现，该机器具有双个Cell/BE处理器（每个刀片共有16个SPU）。选择该算法是因为它非常适合Cell/BE体系结构，既不需要共享内存，也不需要处理器之间的通信，同时保持了紧凑的内存占用。我们研究了在几个大型优化基准上的性能，并表明这主要实现了线性时间加速，甚至有时是超线性的。这是可能的，因为并行实现可以同时探索搜索空间的不同部分，从而更快地收敛到最佳子空间，从而收敛到解决方案。除了得到加速之外，所产生的时间还表现出更小的差异，这有利于及时答复至关重要的应用程序。
---
英文标题：
《Parallel local search for solving Constraint Problems on the Cell
  Broadband Engine (Preliminary Results)》
---
作者：
Salvator Abreu, Daniel Diaz, Philippe Codognet
---
最新提交年份：
2009
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  We explore the use of the Cell Broadband Engine (Cell/BE for short) for combinatorial optimization applications: we present a parallel version of a constraint-based local search algorithm that has been implemented on a multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16 SPUs per blade). This algorithm was chosen because it fits very well the Cell/BE architecture and requires neither shared memory nor communication between processors, while retaining a compact memory footprint. We study the performance on several large optimization benchmarks and show that this achieves mostly linear time speedups, even sometimes super-linear. This is possible because the parallel implementation might explore simultaneously different parts of the search space and therefore converge faster towards the best sub-space and thus towards a solution. Besides getting speedups, the resulting times exhibit a much smaller variance, which benefits applications where a timely reply is critical.
---
PDF链接：
https://arxiv.org/pdf/0910.1264

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：Optimization Applications Presentation SIMULTANEOUS Architecture 搜索 Engine 优化 parallel BladeCenter