Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,227,667 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Algorithm design
Connected component (graph theory)
Directed graph
Graph (discrete mathematics)
Expand
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
Hongyu Liang
Theory of Computing Systems
2013
Corpus ID: 253737039
In this paper, we study the pointer jumping problem under the one-way number-on-the-forehead (NOF) multiparty communication model…
Expand
2012
2012
An efficient parallel construction of optimal independent spanning trees on hypercubes
J. Werapun
,
Sarun Intakosum
,
V. Boonjing
J. Parallel Distributed Comput.
2012
Corpus ID: 40610264
2002
2002
A scalable broadcast algorithm for multiport meshes with minimum communication steps
A. Al-Dubai
,
M. Ould-Khaoua
Ninth International Conference on Parallel and…
2002
Corpus ID: 12297109
Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit…
Expand
2001
2001
A programming methodology for designing parallel prefix algorithms
Min-Hsuan Fan
,
Chua-Huang Huang
,
Yeh-Ching Chung
,
Jenshiuh Liu
,
Jei-Zhii Lee
International Conference on Parallel Processing
2001
Corpus ID: 14391528
In this paper we use the tensor product notation as the framework of a programming methodology for designing various parallel…
Expand
1999
1999
Computing robot Jacobians on meshes with multiple buses
Albert Y. Zomaya
,
H. Smith
,
S. Olariu
Microprocessors and microsystems
1999
Corpus ID: 38485701
1995
1995
Optimization of PRAM-Programs with Input-Dependent Memory Access
Welf Löwe
European Conference on Parallel Processing
1995
Corpus ID: 11799299
There exist transformations of PRAM programs with predictable communication behavior to existing architectures. We extend the…
Expand
Highly Cited
1995
Highly Cited
1995
A broadcast algorithm for all-port wormhole-routed torus networks
Y. Tsai
,
P. 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…
Expand
1994
1994
LOOK-AHEAD LEVINSON- AND SCHUR-TYPE RECURRENCES IN THE PAD ET ABLE
M. Gutknecht
,
M. Hochbruck
1994
Corpus ID: 18221426
For computing Pad e approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Pad e…
Expand
1991
1991
A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers
Xiaojing Wang
,
Z. G. Mou
Proceedings of the Third IEEE Symposium on…
1991
Corpus ID: 5220429
The authors present a new parallel algorithm, based on the divide-and-conquer (DC) strategy, for solving tridiagonal systems…
Expand
Highly Cited
1986
Highly Cited
1986
Efficient parallel algorithm for robot inverse dynamics computation
C. S. Lee
,
P. 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…
Expand
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)
ACCEPT & CONTINUE