Skip to search formSkip to main contentSkip to account menu

SPAA

Known as: Symposium on Parallel Algorithms and Architectures 
SPAA, the ACM Symposium on Parallelism in Algorithms and Architectures, is an academic conference in the fields of parallel computing and distributed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
ACM SIGACTDBL-BrowserDistributed computingEuropean Association for Theoretical Computer Science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A process calculus for energy-aware multicast communications of mobile ad hoc networks
Energy conservation is a critical issue in mobile ad hoc networks (MANETs) for both nodes and network lifetime, as only batteries… 
2012
2012
Adaptive task duplication using on-line bottleneck detection for streaming applications
In this paper we describe an approach to dynamically improve the progress of streaming applications on SMP multi-core systems. We… 
2011
2011
Lock-Free Resizeable Concurrent Tries
This paper describes an implementation of a non-blocking concurrent hash trie based on single-word compare-and-swap instructions… 
2011
2011
Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth
We deterministically compute a Δ + 1 coloring in time O(Δ5c+2 ċ (Δ5)2/c/(Δ1)e + (Δ1)e + log* n) and O(Δ5c+2 ċ (Δ5)1/c/Δe + Δe… 
2011
2011
Brief announcement: communication bounds for heterogeneous architectures
As the gap between the cost of communication (i.e., data movement) and computation continues to grow, the importance of pursuing… 
2005
2005
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment… 
2003
2003
Resource discovery in large resource-sharing environments
Opportunistic sharing of Internet-connected resources is a low cost method for obtaining access to unprecedented-scale… 
2001
2001
A cooperative file system
Highly Cited
1999
Highly Cited
1999
A closer look at coscheduling approaches for a network of workstations
Efficient scheduling of processes on processors of a Network of Workstations (NOW) is essential for good system performance… 
1996
1996
Depth optimal sorting networks resistant to k passive faults
We study the problem of constructing a sorting network that is tolerant to faults and whose running time (i.e., depth) is as… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)