#### Filter Results:

- Full text PDF available (71)

#### Publication Year

1991

2017

- This year (1)
- Last 5 years (20)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Fredrik Manne, Rob H. Bisseling
- PPAM
- 2007

We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial scientific computing. Since an exact algorithm for the weighted matching problem is both fairly expensive to compute and hard to parallelise we instead consider fast approximation

- Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen
- SIAM Review
- 2005

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems occur in this context, depending on whether the matrix is a Jacobian or a Hessian, and on the specifics of the computational techniques employed. We consider… (More)

- Michelangelo Grigni, Fredrik Manne
- IRREGULAR
- 1996

We consider the problem of mapping an array onto a mesh of processors in such a way that locality is preserved. When the computational work associated with the array is distributed in an unstructured way the generalized block distribution has been recognized as an eecient way of achieving an even load balance while at the same time imposing a simple… (More)

- Fredrik Manne, Tor Sørevik
- PARA
- 1996

Achieving an even load balance with a low communication overhead is a fundamental task in parallel computing. In this paper we consider the problem of partitioning an array into a number of blocks such that the maximum amount of work in any block is as low as possible. We review diierent proposed schemes for this problem and the complexity of their… (More)

- Assefaw Hadish Gebremedhin, Fredrik Manne
- Concurrency - Practice and Experience
- 2000

Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared… (More)

DBSCAN is a well-known density based clustering algorithm capable of discovering arbitrary shaped clusters and eliminating noise data. However, parallelization of Dbscan is challenging as it exhibits an inherent sequential data access order. Moreover, existing parallel implementations adopt a master-slave strategy which can easily cause an unbalanced… (More)

- Bjørn Olstad, Fredrik Manne
- IEEE Trans. Computers
- 1995

Two trees are used sequentially to calculate an approxi-<lb>mation to lIA, where 1 I<lb>A < 2. These trees calculate the logarithm and<lb>exponential, and the division (reciprocation) process can be described by<lb>1/A<lb>= eAd. For bit skip accuracy of six to 10, this logarithmic-<lb>exponential method uses significantly less hardware with respect to… (More)

Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These results are vastly improved upon in [5] with tree rooting algorithms that require only O(n3 + n2 · ch) moves, where n is the number of nodes in the network and ch is… (More)

In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of… (More)

- Johannes Langguth, Fredrik Manne, Peter Sanders
- ACM Journal of Experimental Algorithmics
- 2010

It is a well-established result that improved pivoting in linear solvers can be achieved by computing a bipartite matching between matrix entries and positions on the main diagonal. With the availability of increasingly faster linear solvers, the speed of bipartite matching computations must keep up to avoid slowing down the main computation. Fast… (More)