首页> 外文会议>Annual ACM symposium on Parallel algorithms and architectures >Truthful unsplittable flow for large capacity networks
【24h】

Truthful unsplittable flow for large capacity networks

机译:大容量网络的真实难以置信的流量

获取原文

摘要

This volume consists of papers that were presented at the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'07), held on June 9-11, 2007, in San Diego, CA, USA. The symposium was part of the 2007 Federated Computing Research Conference (FCRC). It was sponsored by the ACM Special Interest Groups on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science (EATCS). Financial support was provided by the Akamai, Intel and Sun Microsystems Corporations. >The 37 regular presentations that appeared at the conference were selected by the program committee after electronic discussion and a meeting of two days. The regular presentations were selected out of 130 submitted extended abstracts. The meeting took place in Munich, Germany, on February 9-10. The committee made its decisions based on perceived quality and originality, as well as appropriateness to the theme of the symposium. The mix of selected papers reflects the unique nature of SPAA in bringing together the theory and practice of parallel computing. SPAA defines parallelism very broadly to encompass any computational device or scheme that can perform multiple operations or tasks simultaneously or concurrently. This year, SPAA technical papers include, for example, algorithms for various problems in wired and wireless networks as well as parallel and multicore systems, cache-oblivious algorithms, network games and concurrent and parallel programming approaches. The technical papers in this volume are to be considered preliminary versions, and authors are generally expected to publish polished and complete versions in archival scientific journals. >In addition to the regular presentations, this volume includes 9 brief announcements presented at the SPAA review sessions. The committee's decisions were based on the perceived interest of these contributions, with the goal that they serveas bases for further significant advances in parallelism in computing. Extended versions of the SPAA brief announcements may be published later in other conferences or journals.
机译:该卷包括在2007年6月9日至11日举行的算法和架构(Spaa'07)的平行和架构(Spaa'07)中提出的论文组成。研讨会是 2007联合计算研究会议(FCRC)的一部分。它由ACM特殊兴趣集团的算法和计算理论(SIGACT)和计算机架构(SIGIGRCH)赞助,并与欧洲理论计算机科学协会(EATCS)合作组织。 Akamai,Intel和Sun Microsystems公司提供的财政支持。 >在会议上出现的37个常规演示由计划委员会在电子讨论和两天的会议上选择。定期演示选定于130名提交的扩展摘要中。会议于2月9日至10日在德国慕尼黑举行。委员会根据感知质量和原创性,以及对研讨会主题的适当来作出决定。所选论文的混合反映了Spaa的独特性,使平行计算的理论和实践汇集在一起​​。 Spaa非常广泛地定义了并行性,以包含可以同时或同时执行多个操作或任务的任何计算设备或方案。今年,SPAA技术论文包括例如有线和无线网络中各种问题的算法以及并行和多核系统,高速缓存算法,网络游戏和并行和并行编程方法。该卷中的技术论文将被视为初步版本,并且通常预计作者将在档案科学期刊上发布抛光和完整版本。 >除了常规演示之外,此卷包括9个简要公告在Spaa评论会议上。委员会的决定是基于这些捐款的感知利益,目标是他们伺服基于计算中的并行性进一步进展。 Spaa简介公告的扩展版本可能会在其他会议或期刊中发布。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号