---
_id: '19016'
abstract:
- lang: eng
text: Load balancing is an important requirement for the efficient execu-tion of
parallel numerical simulations. In particular when the simulation domainchanges
over time, the mapping of computational tasks to processors needs tobe modified accordingly. State-of-the-art libraries for this problem are basedon
graph repartitioning. They have a number of drawbacks, including the opti-mized
metric and the difficulty of parallelizing the popular repartitioning heuris-tic
Kernighan-Lin (KL).Here we further explore the very promising diffusion-based
graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009)
by adaptingDIBAP to the related problem of load balancing. Experiments with graph se-quences
that imitate adaptive numerical simulations demonstrate the applicabilityand high
quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art
repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions
with significantly fewer external edges and boundarynodes and the resulting average migration volume in the important maximumnorm
is also the best in most cases.We also prove that one of DIBAP’s key components
optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint
at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual
P2P supercomputer.
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Henning
full_name: Meyerhenke, Henning
last_name: Meyerhenke
citation:
ama: 'Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering
using Diffusion. In: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering.
; 2010.'
apa: 'Gehweiler, J., & Meyerhenke, H. (2010). On Dynamic Graph Partitioning
and Graph Clustering using Diffusion. In Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering.'
bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning
and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings
10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning},
year={2010} }'
chicago: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning
and Graph Clustering Using Diffusion.” In Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering, 2010.'
ieee: 'J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph
Clustering using Diffusion,” in Dagstuhl Seminar Proceedings 10261: Algorithm
Engineering, 2010.'
mla: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning
and Graph Clustering Using Diffusion.” Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering, 2010.'
short: 'J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm
Engineering, 2010.'
date_created: 2020-09-04T10:45:47Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
publication: 'Dagstuhl Seminar Proceedings 10261: Algorithm Engineering'
related_material:
link:
- relation: confirmation
url: https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf
status: public
title: On Dynamic Graph Partitioning and Graph Clustering using Diffusion
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19018'
author:
- first_name: Michael
full_name: Thies, Michael
last_name: Thies
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: Thies M, Gehweiler J. Thread Migration and Checkpointing in Java.; 2010.
apa: Thies, M., & Gehweiler, J. (2010). Thread Migration and Checkpointing
in Java.
bibtex: '@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in
Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }'
chicago: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing
in Java, 2010.
ieee: M. Thies and J. Gehweiler, Thread Migration and Checkpointing in Java.
2010.
mla: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing
in Java. 2010.
short: M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010.
date_created: 2020-09-04T10:54:43Z
date_updated: 2022-01-06T06:53:57Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-04T10:54:26Z
date_updated: 2020-09-04T10:54:26Z
file_id: '19020'
file_name: tr-ri-10-315.pdf
file_size: 240725
relation: main_file
success: 1
file_date_updated: 2020-09-04T10:54:26Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Thread Migration and Checkpointing in Java
type: report
user_id: '15415'
year: '2010'
...
---
_id: '19023'
author:
- first_name: Serge
full_name: Kernbach, Serge
last_name: Kernbach
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Florian
full_name: Schlachter, Florian
last_name: Schlachter
- first_name: Christopher s. F.
full_name: Schwarzer, Christopher s. F.
last_name: Schwarzer
- first_name: Alan F. T.
full_name: Winfield, Alan F. T.
last_name: Winfield
- first_name: Rene
full_name: Matthias, Rene
last_name: Matthias
citation:
ama: 'Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms
for Evolutionary Multimodular Robotics. In: Artificial Life XII (ALife XII).
MIT Press; 2010:781-788.'
apa: Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer,
C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics. In Artificial Life XII (ALife XII) (pp. 781–788).
MIT Press.
bibtex: '@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010,
title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics},
booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach,
Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter,
Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias,
Rene}, year={2010}, pages={781–788} }'
chicago: Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian
Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias.
“Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.”
In Artificial Life XII (ALife XII), 781–88. MIT Press, 2010.
ieee: S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788.
mla: Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics.” Artificial Life XII (ALife XII), MIT Press, 2010,
pp. 781–88.
short: 'S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F.
Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII),
MIT Press, 2010, pp. 781–788.'
date_created: 2020-09-04T11:53:40Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 781-788
publication: Artificial Life XII (ALife XII)
publication_status: published
publisher: MIT Press
status: public
title: Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19029'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Parinya
full_name: Chalermsook, Parinya
last_name: Chalermsook
- first_name: Sanjeev
full_name: Khanna, Sanjeev
last_name: Khanna
- first_name: Bundit
full_name: Laekhanukit, Bundit
last_name: Laekhanukit
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness
of Approximation for Stackelberg Shortest-Path Pricing. In: Workshop on Internet
and Network Economics (WINE). ; 2010. doi:10.1007/978-3-642-17572-5_37'
apa: Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., & Nanongkai,
D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
In Workshop on Internet and Network Economics (WINE). https://doi.org/10.1007/978-3-642-17572-5_37
bibtex: '@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={10.1007/978-3-642-17572-5_37},
booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest,
Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and
Nanongkai, Danupon}, year={2010} }'
chicago: Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit,
and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path
Pricing.” In Workshop on Internet and Network Economics (WINE), 2010. https://doi.org/10.1007/978-3-642-17572-5_37.
ieee: P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop
on Internet and Network Economics (WINE), 2010.
mla: Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg
Shortest-Path Pricing.” Workshop on Internet and Network Economics (WINE),
2010, doi:10.1007/978-3-642-17572-5_37.
short: 'P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in:
Workshop on Internet and Network Economics (WINE), 2010.'
date_created: 2020-09-04T12:01:18Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17572-5_37
language:
- iso: eng
publication: Workshop on Internet and Network Economics (WINE)
publication_identifier:
isbn:
- '9783642175718'
- '9783642175725'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '1903'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2
apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen
verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen
verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2},
number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={2010}, pages={468--474} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische
Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010):
468--474. https://doi.org/10.1007/s00287-010-0470-2.'
ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter
Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen
Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474,
doi:10.1007/s00287-010-0470-2.
short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
date_created: 2018-03-28T07:21:50Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s00287-010-0470-2
issue: '5'
language:
- iso: eng
page: 468--474
publication: Informatik Spektrum
status: public
title: Algorithmische Grundlagen verteilter Speichersysteme
type: journal_article
user_id: '14955'
year: '2010'
...
---
_id: '19033'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Shuchi
full_name: Chawla, Shuchi
last_name: Chawla
- first_name: Robert
full_name: Kleinberg, Robert
last_name: Kleinberg
- first_name: S. Matthew
full_name: Weinberg, S. Matthew
last_name: Weinberg
citation:
ama: 'Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations.
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.
; 2010. doi:10.1137/1.9781611973075.49'
apa: Briest, P., Chawla, S., Kleinberg, R., & Weinberg, S. M. (2010). Pricing
Randomized Allocations. In Proceedings of the Twenty-First Annual ACM-SIAM
Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611973075.49
bibtex: '@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized
Allocations}, DOI={10.1137/1.9781611973075.49},
booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert
and Weinberg, S. Matthew}, year={2010} }'
chicago: Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg.
“Pricing Randomized Allocations.” In Proceedings of the Twenty-First Annual
ACM-SIAM Symposium on Discrete Algorithms, 2010. https://doi.org/10.1137/1.9781611973075.49.
ieee: P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized
Allocations,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium
on Discrete Algorithms, 2010.
mla: Briest, Patrick, et al. “Pricing Randomized Allocations.” Proceedings of
the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010, doi:10.1137/1.9781611973075.49.
short: 'P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the
Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.'
date_created: 2020-09-04T12:15:39Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1137/1.9781611973075.49
language:
- iso: eng
publication: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms
publication_identifier:
isbn:
- '9780898717013'
- '9781611973075'
publication_status: published
status: public
title: Pricing Randomized Allocations
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19041'
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: Mahlmann P. Peer-to-Peer Networks Based on Random Graphs. Vol 283. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol.
283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann,
Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Vol.
283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-04T14:05:30Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 283'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-02-1
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Peer-to-peer networks based on random graphs
type: dissertation
user_id: '5786'
volume: 283
year: '2010'
...
---
_id: '19042'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: Degener B. Local, Distributed Approximation Algorithms for Geometric Assignment
Problems. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2010.
apa: Degener, B. (2010). Local, distributed approximation algorithms for geometric
assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Local, distributed approximation algorithms for geometric assignment
problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric
Assignment Problems. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: B. Degener, Local, distributed approximation algorithms for geometric assignment
problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2010.
mla: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric
Assignment Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2010.
short: B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment
Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-04T14:08:57Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 278'
language:
- iso: eng
publication_identifier:
isbn:
- '978-3-939350-97-2 '
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local, distributed approximation algorithms for geometric assignment problems
type: dissertation
user_id: '5786'
volume: 278
year: '2010'
...
---
_id: '18136'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: 'Fischer M, Jähn C, Suess T. Asynchronous Parallel Reliefboard Computation
for Scene Object Approximation. In: Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV). The Eurographics Association; 2010:43-51. doi:10.2312/EGPGV/EGPGV10/043-051'
apa: Fischer, M., Jähn, C., & Suess, T. (2010). Asynchronous Parallel Reliefboard
Computation for Scene Object Approximation. Eurographics Symposium on Parallel
Graphics and Visualization (EGPGV), 43–51. https://doi.org/10.2312/EGPGV/EGPGV10/043-051
bibtex: '@inproceedings{Fischer_Jähn_Suess_2010, title={Asynchronous Parallel Reliefboard
Computation for Scene Object Approximation}, DOI={10.2312/EGPGV/EGPGV10/043-051},
booktitle={Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)},
publisher={The Eurographics Association}, author={Fischer, Matthias and Jähn,
Claudius and Suess, Tim}, year={2010}, pages={43–51} }'
chicago: Fischer, Matthias, Claudius Jähn, and Tim Suess. “Asynchronous Parallel
Reliefboard Computation for Scene Object Approximation.” In Eurographics Symposium
on Parallel Graphics and Visualization (EGPGV), 43–51. The Eurographics Association,
2010. https://doi.org/10.2312/EGPGV/EGPGV10/043-051.
ieee: 'M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation
for Scene Object Approximation,” in Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV), 2010, pp. 43–51, doi: 10.2312/EGPGV/EGPGV10/043-051.'
mla: Fischer, Matthias, et al. “Asynchronous Parallel Reliefboard Computation for
Scene Object Approximation.” Eurographics Symposium on Parallel Graphics and
Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051.
short: 'M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.'
date_created: 2020-08-24T07:07:55Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.2312/EGPGV/EGPGV10/043-051
language:
- iso: eng
page: 43-51
publication: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)
publisher: The Eurographics Association
status: public
title: Asynchronous Parallel Reliefboard Computation for Scene Object Approximation
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '18289'
abstract:
- lang: eng
text: Many professional cluster systems consist of nodes with different hardware
configurations. Such heterogeneous environments require different load-balancing
techniques than homogenous environments. The c-load-collision-protocol is able
to achieve good results for data-management purposes. Using this protocol, we
propose a way for load-balancing in interactive rendering environments. For this
work, we implemented a parallel rendering system and took different picking strategies
into account to compare the results. The advantage of our approach compared to
other approaches is that we group the available nodes of a cluster into two different
categories, based on the hardware abilities. Some nodes are used solely for rendering,
while others serve as secondary storage and to assist the former ones by performing
auxiliary calculations.
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Timo
full_name: Wiesemann, Timo
last_name: Wiesemann
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Suess T, Wiesemann T, Fischer M. Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments. In: 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage. ; 2010:448-456. doi:10.1109/nas.2010.52'
apa: Suess, T., Wiesemann, T., & Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments. 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 448–456. https://doi.org/10.1109/nas.2010.52
bibtex: '@inproceedings{Suess_Wiesemann_Fischer_2010, title={Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments}, DOI={10.1109/nas.2010.52},
booktitle={2010 IEEE Fifth International Conference on Networking, Architecture,
and Storage}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010},
pages={448–456} }'
chicago: Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Evaluation of a C-Load-Collision-Protocol
for Load-Balancing in Interactive Environments.” In 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 448–56, 2010. https://doi.org/10.1109/nas.2010.52.
ieee: 'T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments,” in 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 2010, pp. 448–456, doi:
10.1109/nas.2010.52.'
mla: Suess, Tim, et al. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing
in Interactive Environments.” 2010 IEEE Fifth International Conference on Networking,
Architecture, and Storage, 2010, pp. 448–56, doi:10.1109/nas.2010.52.
short: 'T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference
on Networking, Architecture, and Storage, 2010, pp. 448–456.'
date_created: 2020-08-25T14:04:38Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1109/nas.2010.52
language:
- iso: eng
page: 448 - 456
publication: 2010 IEEE Fifth International Conference on Networking, Architecture,
and Storage
publication_identifier:
isbn:
- '9781424481330'
publication_status: published
status: public
title: Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive
Environments
type: conference
user_id: '15415'
year: '2010'
...