Results 1  10
of
3,949
List ranking
"... h i g h l i g h t s • Introduce the notion of multicoreoblivious algorithms. • Propose a hierarchical multilevel caching model for multicores. • Present efficient multicoreoblivious algorithms for matrix transposition, FFT, sorting, the Gaussian Elimination Paradigm, list ranking, and connected c ..."
Abstract
 Add to MetaCart
h i g h l i g h t s • Introduce the notion of multicoreoblivious algorithms. • Propose a hierarchical multilevel caching model for multicores. • Present efficient multicoreoblivious algorithms for matrix transposition, FFT, sorting, the Gaussian Elimination Paradigm, list ranking, and connected
List Ranking on Interconnection Networks
 Proc. 2nd EuroPar Conference, LNCS 1123
, 1995
"... The listranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds k nodes of a set of singly linked lists. An easy randomized algorithm gives a considerable improvement over earlier ones. For a large class of networks, the algorithm tak ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
The listranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds k nodes of a set of singly linked lists. An easy randomized algorithm gives a considerable improvement over earlier ones. For a large class of networks, the algorithm
Ultimate Parallel List Ranking?
 Journal of Parallel and Distributed Computing
, 2000
"... Two improved listranking algorithms are presented. The "peelingoff" algorithm leads to an optimal PRAM algorithm, but was designed with application on a real parallel machine in mind. It is simpler than earlier algorithms, and in a range of problem sizes, where previously several algor ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Two improved listranking algorithms are presented. The "peelingoff" algorithm leads to an optimal PRAM algorithm, but was designed with application on a real parallel machine in mind. It is simpler than earlier algorithms, and in a range of problem sizes, where previously several
List Ranking on Meshes
 ACTA INFORMATICA
, 1998
"... The listranking problem is considered for parallel computers which communicate through an interconnection network. The algorithms are based on the idea of repeatedly removing the complement of a ruling set. By specific refinements and detailed analysis, earlier results are improved considerably. We ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The listranking problem is considered for parallel computers which communicate through an interconnection network. The algorithms are based on the idea of repeatedly removing the complement of a ruling set. By specific refinements and detailed analysis, earlier results are improved considerably
The Complexity of List Ranking of Trees
"... Abstract: A vertex kranking of a graph G is a function c: V (G) → {1,..., k} such that if c(u) = c(v), u, v ∈ V (G) then each path connecting vertices u and v contains a vertex w with c(w)> c(u). If each vertex v has a list of integers L(v) and for a vertex ranking c it holds c(v) ∈ L(v) for ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: A vertex kranking of a graph G is a function c: V (G) → {1,..., k} such that if c(u) = c(v), u, v ∈ V (G) then each path connecting vertices u and v contains a vertex w with c(w)> c(u). If each vertex v has a list of integers L(v) and for a vertex ranking c it holds c(v) ∈ L
List Ranking on Meshes and Networks
, 1996
"... The listranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds k 1 nodes of a set of linked lists. We give deterministic and randomized algorithms, which considerable improve earlier results. For the case k = 1, the algorithms are ..."
Abstract
 Add to MetaCart
The listranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds k 1 nodes of a set of linked lists. We give deterministic and randomized algorithms, which considerable improve earlier results. For the case k = 1, the algorithms
Fast and Scalable List Ranking on the GPU
"... General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest performance per dollar. The GPUs have been used extensively on regular problems that can be easily parallelized. In this paper, ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
, we describe two implementations of List Ranking, a traditional irregular algorithm that is difficult to parallelize on such massively multithreaded hardware. We first present an implementation of Wyllie’s algorithm based on pointer jumping. This technique does not scale well to large lists due
List Ranking and List Scan on the CRAY C90
 Journal of Computer and System Sciences
, 1996
"... Although parallel algorithms using linked lists, trees, and graphs have been studied extensively by the research community, implementations have met with limited success, even for the simplest algorithms. In this paper we present our results of a careful implementation study of parallel list ranking ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
ranking (and the related listscan operation) and show that it can have substantial speed up over fast workstations. Obtaining good parallel performance for list ranking is a challenge for two reasons. First, although there are many asymptotic workefficient algorithms, it is hard to keep the constants
Results 1  10
of
3,949