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.
机译:在线无冲突着色间隔
机译:完全动态的和动力学的冲突 - 间隔的自由间隔相对于点
机译:关于点的区间的完全动态和动力学无冲突着色
机译:削弱在线对手的能力足以获得最佳的无冲突着色间隔
机译:无冲突的着色。
机译:INTERVAL(用于实现风险可变长度可变长度的NICE技术的调查)牙科召回试验:一项多中心随机对照试验研究最佳牙科召回间隔以最佳经济有效地保持牙科初级保健就诊的成年成年人口腔健康
机译:间隔的在线无冲突着色
机译:在线测试的最佳测试间隔