Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJune 2004
Optimal early stopping uniform consensus in synchronous systems with process omission failures
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 302–310https://doi.org/10.1145/1007912.1007963Consensus is a central problem of fault-tolerant distributed computing that, in the context of synchronous distributed systems, has received a lot of attention in the crash failure model and in the Byzantine failure model. This paper considers ...
- ArticleJune 2004
DCAS is not a silver bullet for nonblocking algorithm design
- Simon Doherty,
- David L. Detlefs,
- Lindsay Groves,
- Christine H. Flood,
- Victor Luchangco,
- Paul A. Martin,
- Mark Moir,
- Nir Shavit,
- Guy L. Steele
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 216–224https://doi.org/10.1145/1007912.1007945Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only single-location synchronisation primitives such as compare-and-swap (CAS) ...
- ArticleJune 2004
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 160–169https://doi.org/10.1145/1007912.1007937In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split the traffic and feed them into multiple trees. While in single-tree ...
- ArticleJune 2004
Bi-criteria algorithm for scheduling jobs on cluster platforms
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 125–132https://doi.org/10.1145/1007912.1007932We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that ...
-
- ArticleJune 2004
Balanced graph partitioning
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 120–124https://doi.org/10.1145/1007912.1007931In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • n<over>k) so that the capacity of edges between different components is ...
- ArticleJune 2004
Consistent and compact data management in distributed storage systems
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 44–53https://doi.org/10.1145/1007912.1007920In this paper we consider the problem of maintaining a consistent mapping of a virtual object space to a set of memory modules, i.e. the object space can be decomposed into a set of ranges where every module is responsible for exactly one range. A ...
- ArticleJune 2004
Simple efficient load balancing algorithms for peer-to-peer systems
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 36–43https://doi.org/10.1145/1007912.1007919Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing ...
- ArticleJune 2004
Object location in realistic networks
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architecturesJune 2004, Pages 25–35https://doi.org/10.1145/1007912.1007918We devise an object location scheme that achieves a guaranteed low stretch in a wider and more realistic class of networks than previous schemes. The distinctive feature of our scheme is that it is inherently adaptive to the underlying topology. In ...