咨询与建议

限定检索结果

文献类型

  • 4 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 5 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 4 篇 计算机科学与技术...
    • 1 篇 交通运输工程
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 5 篇 high-performance...
  • 3 篇 shared memory
  • 2 篇 parallel algorit...
  • 2 篇 parallel graph a...
  • 2 篇 connectivity
  • 1 篇 logistics
  • 1 篇 real-life invent...
  • 1 篇 decision support...
  • 1 篇 lock-free data s...
  • 1 篇 irregular algori...
  • 1 篇 randomized local...

机构

  • 3 篇 georgia inst tec...
  • 2 篇 ibm corp tj wats...
  • 1 篇 ibm corp tj wats...
  • 1 篇 bouygues e lab f...
  • 1 篇 univ aix marseil...
  • 1 篇 univ new mexico ...

作者

  • 2 篇 cong guojing
  • 2 篇 cong gj
  • 2 篇 bader david a.
  • 1 篇 bader da
  • 1 篇 estellon bertran...
  • 1 篇 benoist thierry
  • 1 篇 gardi frederic
  • 1 篇 bader d
  • 1 篇 jeanjean antoine

语言

  • 5 篇 英文
检索条件"主题词=high-performance algorithm engineering"
5 条 记 录,以下是1-10 订阅
排序:
Randomized Local Search for Real-Life Inventory Routing
收藏 引用
TRANSPORTATION SCIENCE 2011年 第3期45卷 381-398页
作者: Benoist, Thierry Gardi, Frederic Jeanjean, Antoine Estellon, Bertrand Bouygues E Lab F-75008 Paris France Univ Aix Marseille 2 Fac Sci Luminy CNRS UMR 6166 Lab Informat Fondamentale F-13288 Marseille France
In this paper, a new practical solution approach based on randomized local search is presented for tackling a real-life inventory routing problem. Inventory routing refers to the optimization of transportation costs f... 详细信息
来源: 评论
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2006年 第11期66卷 1366-1378页
作者: Bader, David A. Cong, Guojing Georgia Inst Technol Coll Comp Atlanta GA 30332 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA
Minimum spanning tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent problems in biology and medicine such ... 详细信息
来源: 评论
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2006年 第6期66卷 854-866页
作者: Cong, Guojing Bader, David A. Georgia Inst Technol Coll Comp Atlanta GA 30332 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY USA
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an irregular application, fine-grained s... 详细信息
来源: 评论
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPS)
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2005年 第9期65卷 994-1006页
作者: Bader, DA Cong, GJ Georgia Inst Technol Coll Comp Atlanta GA 30332 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY USA
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. Many PRAM algorithms can be adapted to SMPs wit... 详细信息
来源: 评论
Lock-free parallel algorithms: An experimental study
收藏 引用
11th International Conference on high performance Computing
作者: Cong, GJ Bader, D Univ New Mexico Dept Elect & Comp Engn Albuquerque NM 87131 USA
Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include increasing fault tolerance of a (possibly heter... 详细信息
来源: 评论