返回
Parallel and distributed local search in COMET
DOI:10.1016/j.cor.2008.08.014.png)
摘要
En 中文
The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important, however, to make parallel and distributed processing easily accessible to a wide audience of optimization programmers. This paper addresses this challenge by proposing parallel and distributed programming abstractions that keep the distance from sequential local search algorithms as small as possible. The abstractions, including parallel loops, interruptions, thread pools, and shared objects, are compositional and cleanly separate the optimization program and the parallel instructions. They have been evaluated experimentally on a variety of applications, including warehouse location and coloring, for which they provide significant speedups. Published by Elsevier Ltd.
Keyword:
Combinatorial optimization
Local search
Constraint programming
Parallel
Distributed
Language
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Areca (betel) nut chewing habit among high-school children in the Commonwealth of the Northern Mariana Islands (Micronesia)在北马里亚纳群岛联邦(密克罗尼西亚)的高中生中咀嚼槟榔( Areca nut)的习惯
An Initial Feasibility Study to Identify Loneliness Among Mental Health Patients from Clinical Notes一项初步可行性研究,旨在通过临床记录识别心理健康患者中的孤独感
Identifying natural health product and dietary supplement information within adverse event reporting systems在不良事件报告系统中识别天然健康产品和膳食补充剂信息
A STUDY OF SPONTANEOUS MUTATION RATES AT TEN LOCI DETECTABLE BY STARCH GEL ELECTROPHORESIS IN DROSOPHILA MELANOGASTER
Genetics
IF0
Trophic transfer of essential elements in the clownfish Amphiprion ocellaris in the context of ocean acidification
PLOS ONE
IF0
MINIMIZING CONFLICTS - A HEURISTIC REPAIR METHOD FOR CONSTRAINT SATISFACTION AND SCHEDULING PROBLEMS

