Skip to search formSkip to main contentSkip to account menu

Pointer jumping

Known as: Path doubling, Recursive doubling 
Pointer jumping or path doubling is a design technique for parallel algorithms that operate on pointer structures, such as linked lists and directed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Algorithm designConnected component (graph theory)Directed graphGraph (discrete mathematics)

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Optimal Collapsing Protocol for Multiparty Pointer Jumping
In this paper, we study the pointer jumping problem under the one-way number-on-the-forehead (NOF) multiparty communication model… 
2002
2002
A scalable broadcast algorithm for multiport meshes with minimum communication steps
Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit… 
2001
2001
A programming methodology for designing parallel prefix algorithms
In this paper we use the tensor product notation as the framework of a programming methodology for designing various parallel… 
1999
1999
Computing robot Jacobians on meshes with multiple buses
1999
1999
A finite element solver for convection diffusion problems using a cluster of PCs
  • R. Silva
  • ICWC 99. IEEE Computer Society International…
  • 1999
  • Corpus ID: 19447562
In this work an experimental cluster of PCs is presented. Some benchmarks and a Krylov-Schwarchz solver for convection diffusion… 
1998
1998
List ranking on meshes
Abstract. The list-ranking problem is considered for parallel computers which communicate through an interconnection network. The… 
Highly Cited
1995
Highly Cited
1995
A broadcast algorithm for all-port wormhole-routed torus networks
  • Y. TsaiP. McKinley
  • Proceedings Frontiers '95. The Fifth Symposium on…
  • 1995
  • Corpus ID: 15314144
A new approach to broadcast in wormhole-routed two- and three-dimensional torus networks is proposed. The approach extends the… 
1994
1994
Unified Architecture for Divide and Conquer Based Tridiagonal System Solvers
The solution of tridiagonal systems is a topic of great interest in many areas of numerical analysis. Several algorithms have… 
1992
1992
Connected components and the interval graph
We consider the problem of finding in parallel the connected components of an undirected graph when the computation is… 
Highly Cited
1986
Highly Cited
1986
Efficient parallel algorithm for robot inverse dynamics computation
  • C. S. LeeP. Chang
  • Proceedings. IEEE International Conference on…
  • 1986
  • Corpus ID: 7164652
This paper shows that the time lower bound of computing the inverse dynamics of an n-link robot manipulator parallelly using p… 
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)