Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

Authors:
Guojing Cong;David A. Bader
Affiliations:
IBM T.J. Watson Research Center, Yorktown Heights, NY, USA;College of Computing, Georgia Institute of Technology, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2006

Citing 31
Cited 5

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Parallel ear decomposition search (EDS) and st-numbering in graphs

Theoretical Computer Science
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
A bridging model for parallel computation

Communications of the ACM
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
A methodology for implementing highly concurrent data objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Are wait-free algorithms fast?

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Software transactional memory

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Lock-free linked lists using compare-and-swap

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Finding minimum spanning forests in logarithmic time and linear work using random sampling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Lock-free data structures

Lock-free data structures
Explicit multi-threading (XMT) bridging models for instruction parallelism (extended abstract)

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Concurrent reading and writing

Communications of the ACM
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Exposure in wireless Ad-Hoc sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

SIAM Journal on Computing
Building a Multicasting Tree in a High-Speed Network

IEEE Concurrency
Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract)

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Routing using implicit connection graphs [VLSI design

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
CUBIC: Identification of Regulatory Binding Sites Through Data Clustering

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Graph-based technologies for intelligence analysis

Communications of the ACM - Homeland security
The Euler Tour Technique and Parallel Rooted Spanning Tree

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

Journal of Parallel and Distributed Computing
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer

IEEE Transactions on Computers
Visualizing evolving networks: minimum spanning trees versus pathfinder networks

INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization

Collaborative scheduling of DAG structured computations on multicore processors

Proceedings of the 7th ACM international conference on Computing frontiers
Fast PGAS connected components algorithms

Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
Fast PGAS Implementation of Distributed Graph Algorithms

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Breaking the speed and scalability barriers for graph exploration on distributed-memory machines

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Massive data analytics: the graph 500 on IBM Blue Gene/Q

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce abstract algebraic analysis of the topological structure of a banyan network, which has become the baseline for most switching networks. The analysis provides the following key results: (1) The switching elements of a switching ...