A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Dynamic Creation of BSP/CGM Clusters on Cloud Computing Platforms

2013
*
2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies
*

*In*this paper, we present the MyCloud project,

*a*cloud

*computing*infrastructure

*for*the Technological University of Paraná campuses,

*in*southern Brazil. ... We show how to build and instantiate virtual machines templates

*for*

*BSP*/

*CGM*applications that can be used on private cloud

*computing*platforms. ... [34] ; Approximation Hitting set

*Algorithm*

*for*Gene Expression Analysis [35] ; Integer Sorting [36] ; List Ranking,

*Euler*

*Tour*, Connected Components, Spanning Tree, Lowest Common Ancestor, Open Ear ...

##
###
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
[chapter]

2004
*
Lecture Notes in Computer Science
*

Dehne et al. present

doi:10.1007/978-3-540-27866-5_110
fatcat:fyqyeh7gendgrimsfha6wfsnmm
*a**BSP*/*CGM**algorithm**for**computing**a*spanning tree and the connected components of*a**graph*, that requires O(log p) communication rounds, where p is the number of processors. ...*Computing**a*spanning tree and the connected components of*a**graph*are basic problems*in**Graph*Theory and arise as subproblems*in*many applications. ... Conclusion We have presented*a*CGM*algorithm**for**computing**a*spanning tree of*a**graph*and its connected components. ...##
###
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components

2010
*
2010 International Conference on High Performance Computing & Simulation
*

Dehne et al. present

doi:10.1109/hpcs.2010.5547062
dblp:conf/ieeehpcs/CaceresMNS10
fatcat:pxxd3orv6fcehj4abjgwjozhp4
*a**BSP*/*CGM**algorithm**for**computing**a*spanning tree and the connected components of*a**graph*, that requires O(log p) communication rounds, where p is the number of processors. ...*In*this paper we present experimental results of*a*parallel*algorithm*that does not depend on the solution of the*Euler**tour*or the list ranking problem. ... ACKNOWLEDGMENTS We thank the referees*for*their comments. This work has been partially supported by CNPq Proc. No ...##
###
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP

2002
*
Algorithmica
*

list ranking, (2)

doi:10.1007/s00453-001-0109-4
fatcat:luwfutwv3vaazixhpsqoy4hpee
*Euler**tour*construction*in**a*tree, (3)*computing*the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation ...*In*this paper we present deterministic parallel*algorithms**for*the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models*for*solving the following well-known*graph*problems: (1) ... Rieping*for*their helpful discussions on the first version of this paper [5] . ...##
###
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
[chapter]

1997
*
Lecture Notes in Computer Science
*

list ranking, (2)

doi:10.1007/3-540-63165-8_195
fatcat:wvubewx4nfb3zlv2gr6fqqb7f4
*Euler**tour*construction*in**a*tree, (3)*computing*the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation ...*In*this paper we present deterministic parallel*algorithms**for*the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models*for*solving the following well-known*graph*problems: (1) ... Rieping*for*their helpful discussions on the first version of this paper [5] . ...##
###
Bulk Synchronous Parallel Algorithms for the External Memory Model

2002
*
Theory of Computing Systems
*

We show that certain parallel

doi:10.1007/s00224-002-1066-2
fatcat:onmzny3fhjdzjjongxlf2sucma
*algorithms*known*for*the BSP model can be used to obtain EM*algorithms*that meet well known I/O complexity lower bounds*for*various problems, including sorting. **A*preliminary ...*In*this paper we present*a*simple, deterministic simulation technique which transforms certain Bulk Synchronous Parallel (BSP)*algorithms*into efficient parallel EM*algorithms*. ... The notion of an h-relation is often used*in*the analysis of parallel*algorithms*based on BSP-like models (e.g. BSP,*BSP**,*CGM*). ...##
###
Efficient external memory algorithms by simulating coarse-grained parallel algorithms

1997
*
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97
*

External memory (EM)

doi:10.1145/258492.258503
dblp:conf/spaa/DehneDH97
fatcat:jkafvv3cdndizcmuxlwvkvhs7u
*algorithms*are designed*for*large-scale*computational*problems*in*which the size of the internal memory of the*computer*is only*a*small fraction of the problem size. ...*In*this paper we provide*a*simulation technique which produces efficient parallel EM*algorithms*from efficient BSP-like parallel*algorithms*. ...*In*Section 2 we review previous work on EM*algorithms*as well as the BSP/*BSP**/*CGM*models. ...##
###
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms

2003
*
Algorithmica
*

External memory (EM)

doi:10.1007/s00453-002-1009-y
fatcat:nhh33dxwevhxxdwjknmqzn3rdu
*algorithms*are designed*for*large-scale*computational*problems*in*which the size of the internal memory of the*computer*is only*a*small fraction of the problem size. ...*In*this paper we provide*a*simulation technique which produces efficient parallel EM*algorithms*from efficient BSP-like parallel*algorithms*. ...*In*Section 2 we review previous work on EM*algorithms*as well as the BSP/*BSP**/*CGM*models. ...##
###
Chapter 5. Realistic Computer Models
[chapter]

2010
*
Lecture Notes in Computer Science
*

*For*instance, list ranking [733, 168] , batch filtering [349] ,

*Euler*

*tour*

*computation*[168] ,

*graph*blocking techniques [10, 615] etc. ... One restriction of the coarse-grained models

*BSP*,

*CGM*(and also PRO, which has yet to prove its broad applicability) is their disregard of actual communication patterns. ...