检索结果-内蒙古大学图书馆

fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Bhaskar, Raghav Dubey, Pradeep K. Kumar, Vijay Rudra, Atri Sharma, Animesh Project CODES INRIA Rocquencourt Le Chesnay France Strat. Plan. and Optimization Team *** Seattle WA United States Department of Computer Science University of Texas at Austin Austin TX United States Fiorano Software Ltd New Delhi India

The use of efficient Galois Field Arithmetic on SIMD architecture was presented. SIMD architectures were used for obtaining high speed implementation in the fields where data parallelism was encountered. In regard wit... 详细信息

ISBN: (纸本)9781581136616

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Foreword: parallelism in algorithms and architectures

引用

THEORY OF COMPUTING SYSTEMS 2014年第3期55卷 449-450页

作者： Pucci, Geppino Luchangco, Victor Rajaraman, Rajmohan Univ Padua Padua Italy Oracle Burlington MA USA Northeastern Univ Boston MA 02115 USA

This special issue contains 6 selected papers whose preliminary versions appeared in the Proceedings of the 23rd annual acm symposium on parallelism in algorithms and architectures (SPAA), held June 2011, in San Jose, California, USA. These papers were selected by the special issue co-editors from 35 papers that were presented at the conference. The authors were invited to submit full versions of their papers, which were then fully refereed according to the usual standards of Theory of Computing Systems. The selected papers are representative of the breadth and depth of the research in parallelism in algorithms and architectures that was presented at SPAA 2011.

关键词： COMPUTER network protocols algorithms COMPUTER networks CONGRESSES SPECIAL issues of periodicals BOUNDS (Mathematics) SYNCHRONIZATION

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Communication Bounds for Heterogeneous architectures 11

Brief Announcement: Communication Bounds for Heterogeneous A...

引用

23rd annual symposium on parallelism in algorithms and architectures

作者： Ballard, Grey Demmel, James Gearhart, Andrew UC Berkeley Berkeley CA USA

ISBN: (纸本)9781450307437

As the gap between the cost of communication (i.e., data movement) and computation continues to grow, the importance of pursuing algorithms which minimize communication also increases. Toward this end, we seek asymptotic communication lower bounds for general memory models and classes of algorithms. Recent work [2] has established lower bounds for a wide set of linear algebra algorithms on a sequential machine and on a parallel machine with identical processors. This work extends these previous bounds to a heterogeneous model in which processors access data and perform floating point operations at differing speeds. We also present an algorithm for dense matrix multiplication which attains the lower bound.

关键词： communication-avoiding heterogeneity

来源：评论

学校读者我要写书评

暂无评论

Towards Optimizing Energy Costs of algorithms for Shared Memory architectures 10

Towards Optimizing Energy Costs of Algorithms for Shared Mem...

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Korthikanti, Vijay Anand Agha, Gul Univ Illinois Dept Comp Sci Urbana IL USA

ISBN: (纸本)9781450300797

Energy consumption by computer systems has emerged as an important concern However, the energy consumed in executing an algorithm cannot be inferred from its performance alone it must be modeled explicitly This paper analyzes energy consumption of parallel algorithms executed on shared memory multicore processors Specifically, we develop a methodology to evaluate how energy consumption of a given parallel algorithm changes as the number of cores and their frequency is varied We use this analysis to establish the optimal number of cores to minimize the energy consumed by the execution of a parallel algorithm for a specific problem size while satisfying a given performance requirement We study the sensitivity of our analysis to changes in parameters such as the ratio of the power consumed by a computation step versus the power consumed in accessing memory The results show that the relation between the problem size and the optimal number of cores is relatively unaffected for a wide range of these parameters.

关键词： Energy Performance Parallel algorithms Shared Memory architectures

来源：评论

学校读者我要写书评

暂无评论

SPAA'21 panel paper: Architecture-friendly algorithms versus algorithm-friendly architectures 21

SPAA'21 panel paper: Architecture-friendly algorithms versus...

引用

33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021

作者： Blelloch, Guy Dally, William Martonosi, Margraret Vishkin, Uzi Yelick, Katherine Carnegie Mellon University Pittsburgh United States NVIDIA Santa Clara United States Pricneton University Princeton United States College Park United States University of California Berkeley Electrical Engineering and Computer Sciences Berkeley United States

The current paper provides preliminary statements of the panelists ahead of a panel discussion at the acm SPAA 2021 conference on the topic: algorithm-friendly architecture versus architecture-friendly algorithms. ... 详细信息

ISBN: (纸本)9781450380706

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Buffer-space Efficient and Deadlock-free Scheduling of Stream Applications on Multi-core architectures 10

Buffer-space Efficient and Deadlock-free Scheduling of Strea...

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Park, Jongsoo Dally, William J. Stanford Univ Comp Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9781450300797

We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling Compared to previous multi-core stream scheduling algorithms, team scheduling achieves 1) similar synchronization overhead, 2) coverage of a larger class of applications, 3) better control over buffer space, 4) deadlock-free feedback loops, and 5) lower latency We compare team scheduling to the latest stream scheduling algorithm, SGMS, by evaluating 14 applications on a multi-core architecture with 16 cores. Team scheduling successfully targets applications that cannot be validly scheduled by SGMS clue to excessive buffer requirement or deadlocks in feedback loops (e.g., GSM and W-cDmA) For applications that can be validly scheduled by SGMS, team scheduling shows on average 37% higher throughput within the same buffer space constraints

关键词： Compiler and Tools for Concurrent Programming Stream Programming Green Computing and Power-Efficient architectures Multi-core architectures

来源：评论

学校读者我要写书评

暂无评论

Novel architectures for P2P applications: The continuous-discrete approach 03

Novel architectures for P2P applications: The continuous-dis...

引用

fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Naor, Moni Wieder, Udi Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9781581136616

We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to processors. We demonstrate the power of these design rules by suggesting two new architectures, one for DHT (Distributed Hash Table) and the other for dynamic expander networks. The DHT network, which we call Distance Halving allows logarithmic routing and load, while preserving constant degrees. It offers an optimal tradeoff between the degree and the dilation in the sense that degree d guarantees a dilation of O(logdn). Another advantage over previous constructions is its relative simplicity. A major new contribution of this construction is a dynamic caching technique that maintains low load and storage even under the occurrence of hot spots. Our second construction builds a network that is guaranteed to be an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. A small variation yields a DHT which is robust against random faults. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worst parameters. Therefore we expect that more distributed data structures could be designed and implemented in a dynamic environment.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

SuperMatrix Out-of-Order Scheduling of Matrix Operations for SMP and Multi-Core architectures 07

SuperMatrix Out-of-Order Scheduling of Matrix Operations for...

引用

19th annual symposium on parallelism in algorithms and architectures

作者： Chan, Ernie Quintana-Orti, Enrique S. Quintana-Orti, Gregorio van de Geijn, Robert Univ Texas Austin Dept Comp Sci Austin TX 78712 USA Univ Jaume 1 Dept Ingn & Ciencia Computad Castellon de La Plana Spain

ISBN: (纸本)9781595936677

We discuss the high-performance parallel implementation and execution of dense linear algebra matrix operations on SMP architectures;with an eye towards multi-core processors with many cores. We argue that traditional implementations, as those incorporated in LAPACK, cannot be easily modified to render high performance as well as scalability on these architectures. The solution we propose is to arrange the data structures and algorithms so that matrix blocks become the fundamental units of data;and operations on these blocks become the fundamental units of computation, resulting in algorithms-by-blocks as opposed to the snore traditional blocked algorithms. We show that this facilitates the adoption of techniques akin to dynamic scheduling and out-of-order execution usual in superscalar processors;which we name SuperMatrix Out-of-Order scheduling. Performance results on a 16 CPU Itanium2-based server are used to highlight opportunities and issues related to this new approach.

关键词： data affinity data-flow parallelism dense linear algebra libraries dynamic scheduling out-of-order execution

来源：评论

学校读者我要写书评

暂无评论

The effect of communication costs in solid-state quantum computing architectures 03

The effect of communication costs in solid-state quantum com...

引用

fifteenth annual acm symposium on parallelism in algorithms and architectures

作者： Copsey, Dean Oskin, Mark Metodiev, Tzvetan Chong, Frederic T. Chuang, Isaac Kubiatowicz, John University of Washington Seattle WA United States University of California at Davis Davis CA United States University of California Berkeley Berkeley CA United States

ISBN: (纸本)9781581136616

Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed under idealized assumptions without important physical constraints in mind. In this paper, we analyze two key constraints: the short spatial distance of quantum interactions and the short temporal life of quantum data. In particular, quantum computations must make use of extremely robust error correction techniques to extend the life of quantum data. We present optimized spatial layouts of quantum error correction circuits for quantum bits embedded in silicon. We analyze the complexity of error correction under the constraint that interaction between these bits is near neighbor and data must be propagated via swap operations from one part of the circuit to another. We discover two interesting results from our quantum layouts. First, the recursive nature of quantum error correction circuits requires a additional communication technique more powerful than near-neighbor swaps - too much error accumulates if we attempt to swap over long distances. We show that quantum teleportation can be used to implement recursive structures. We also show that the reliability of the quantum swap operation is the limiting factor in solid-state quantum computation.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

Multicore Paging algorithms Cannot Be Competitive 20

Multicore Paging Algorithms Cannot Be Competitive

引用

32nd acm symposium on parallelism in algorithms and architectures, SPAA 2020

作者： Kamali, Shahin Xu, Helen Department of Computer Science University of Manitoba WinnipegMB Canada Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology CambridgeMA United States

ISBN: (纸本)9781450369350

Every processor with multiple cores sharing a cache needs to implement a page-replacement algorithm. Lopez-Ortiz and Salinger [ITCS 2012] demonstrated that competitive ratio of canonical paging algorithms such as Least-Recently-Used (LRU) and Furthest-In-Future (FIF) grows with the length of the input. In this paper, we answer an open question about the existence of competitive multicore paging algorithms in the negative. Specifically, we show that all lazy algorithms, which include all practical algorithms, cannot be competitive against the optimal offline algorithm. © 2020 Owner/Author.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：