List ranking

In parallel algorithms, the list ranking problem involves determining the position, or rank, of each item in a linked list. That is, the first item… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2017
0246819862017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
The advent of multicore and many-core architectures saw them being deployed to speed-up computations across several disciplines… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1998
1998
The list-ranking problem is considered for parallel computers which communicate through an interconnection network. The… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
1997
1997
Parallel list ranking is a hard problem due to its extreme degree of irregularity. Also because of its linear sequential… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
1997
1997
An earlier parallel list ranking algorithm performs well for problem sizes N that are extremely large in comparison to the number… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1997
1997
We present analytical and experimental results for ne-grained list ranking algorithms. We compare the scalability of two… (More)
Is this relevant?
1996
1996
We present a randomized parallel list ranking algorithm for distributed memory multiprocessors, using a BSP type model. We first… (More)
Is this relevant?
1996
1996
The list-ranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
List ranking and list scan are two primitive operations used in many parallel algorithms that use list, trees, and graph data… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1988
Highly Cited
1988
In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs inO(logn) time on… (More)
  • figure 1
Is this relevant?