---
_id: '16473'
author:
- first_name: M.
full_name: Dynia, M.
last_name: Dynia
- first_name: J.
full_name: Kutyłowski, J.
last_name: Kutyłowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot
Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin,
Heidelberg; 2006. doi:10.1007/11821069_29'
apa: Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C.
(2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29
bibtex: '@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin,
Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={10.1007/11821069_29},
booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski,
J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006}
}'
chicago: Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian
Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In Lecture Notes
in Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11821069_29.
ieee: M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart
Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 2006.
mla: Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes
in Computer Science, 2006, doi:10.1007/11821069_29.
short: 'M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture
Notes in Computer Science, Berlin, Heidelberg, 2006.'
date_created: 2020-04-08T09:38:28Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11821069_29
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540377917'
- '9783540377931'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Smart Robot Teams Exploring Sparse Trees
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '16476'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Paweł
full_name: Lorek, Paweł
last_name: Lorek
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Dynia M, Kutyłowski J, Lorek P, Meyer auf der Heide F. Maintaining Communication
Between an Explorer and a Base Station. In: IFIP International Federation for
Information Processing. Boston, MA; 2006. doi:10.1007/978-0-387-34733-2_14'
apa: Dynia, M., Kutyłowski, J., Lorek, P., & Meyer auf der Heide, F. (2006).
Maintaining Communication Between an Explorer and a Base Station. In IFIP International
Federation for Information Processing. Boston, MA. https://doi.org/10.1007/978-0-387-34733-2_14
bibtex: '@inbook{Dynia_Kutyłowski_Lorek_Meyer auf der Heide_2006, place={Boston,
MA}, title={Maintaining Communication Between an Explorer and a Base Station},
DOI={10.1007/978-0-387-34733-2_14},
booktitle={IFIP International Federation for Information Processing}, author={Dynia,
Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm},
year={2006} }'
chicago: Dynia, Miroslaw, Jarosław Kutyłowski, Paweł Lorek, and Friedhelm Meyer
auf der Heide. “Maintaining Communication Between an Explorer and a Base Station.”
In IFIP International Federation for Information Processing. Boston, MA,
2006. https://doi.org/10.1007/978-0-387-34733-2_14.
ieee: M. Dynia, J. Kutyłowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining
Communication Between an Explorer and a Base Station,” in IFIP International
Federation for Information Processing, Boston, MA, 2006.
mla: Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and
a Base Station.” IFIP International Federation for Information Processing,
2006, doi:10.1007/978-0-387-34733-2_14.
short: 'M. Dynia, J. Kutyłowski, P. Lorek, F. Meyer auf der Heide, in: IFIP International
Federation for Information Processing, Boston, MA, 2006.'
date_created: 2020-04-08T11:13:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-0-387-34733-2_14
language:
- iso: eng
place: Boston, MA
publication: IFIP International Federation for Information Processing
publication_identifier:
isbn:
- '9780387346328'
- '9780387347332'
issn:
- 1571-5736
publication_status: published
status: public
title: Maintaining Communication Between an Explorer and a Base Station
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '17011'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Andreas
full_name: Kuhmlehn, Andreas
last_name: Kuhmlehn
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Dynia M, Kuhmlehn A, Kutylowski J, Meyer auf der Heide F, Schindelhauer C.
SmartS Simulator Design.; 2006.
apa: Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., & Schindelhauer,
C. (2006). SmartS Simulator Design.
bibtex: '@book{Dynia_Kuhmlehn_Kutylowski_Meyer auf der Heide_Schindelhauer_2006,
title={SmartS Simulator Design}, author={Dynia, Miroslaw and Kuhmlehn, Andreas
and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer,
Christian}, year={2006} }'
chicago: Dynia, Miroslaw, Andreas Kuhmlehn, Jaroslaw Kutylowski, Friedhelm Meyer
auf der Heide, and Christian Schindelhauer. SmartS Simulator Design, 2006.
ieee: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer,
SmartS Simulator Design. 2006.
mla: Dynia, Miroslaw, et al. SmartS Simulator Design. 2006.
short: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, C. Schindelhauer,
SmartS Simulator Design, 2006.
date_created: 2020-05-18T13:52:43Z
date_updated: 2022-01-06T06:53:02Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-05T10:06:52Z
date_updated: 2020-08-05T10:06:52Z
file_id: '17620'
file_name: smarts-design.pdf
file_size: 147312
relation: main_file
success: 1
file_date_updated: 2020-08-05T10:06:52Z
has_accepted_license: '1'
language:
- iso: eng
publication_status: published
status: public
title: SmartS Simulator Design
type: report
user_id: '15415'
year: '2006'
...
---
_id: '16468'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing
in Distributed Hash Tables. In: Peer-to-Peer Systems IV. Berlin, Heidelberg;
2005. doi:10.1007/11558989_20'
apa: Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic
Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV.
Berlin, Heidelberg. https://doi.org/10.1007/11558989_20
bibtex: '@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin,
Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={10.1007/11558989_20}, booktitle={Peer-to-Peer
Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf
der Heide, Friedhelm}, year={2005} }'
chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der
Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In Peer-to-Peer
Systems IV. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11558989_20.
ieee: M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load
Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin,
Heidelberg, 2005.
mla: Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”
Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.
short: 'M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer
Systems IV, Berlin, Heidelberg, 2005.'
date_created: 2020-04-08T09:18:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11558989_20
language:
- iso: eng
place: Berlin, Heidelberg
publication: Peer-to-Peer Systems IV
publication_identifier:
isbn:
- '9783540290681'
- '9783540319061'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Dynamic Load Balancing in Distributed Hash Tables
type: book_chapter
user_id: '15415'
year: '2005'
...
---
_id: '16469'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In:
Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg;
2005. doi:10.1007/11549345_1'
apa: Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic
Networks. In Mathematical Foundations of Computer Science 2005. Berlin,
Heidelberg. https://doi.org/10.1007/11549345_1
bibtex: '@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg},
title={Page Migration in Dynamic Networks}, DOI={10.1007/11549345_1},
booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski,
Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }'
chicago: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration
in Dynamic Networks.” In Mathematical Foundations of Computer Science 2005.
Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549345_1.
ieee: M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,”
in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg,
2005.
mla: Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic
Networks.” Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
short: 'M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer
Science 2005, Berlin, Heidelberg, 2005.'
date_created: 2020-04-08T09:23:36Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11549345_1
language:
- iso: eng
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2005
publication_identifier:
isbn:
- '9783540287025'
- '9783540318675'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Page Migration in Dynamic Networks
type: book_chapter
user_id: '15415'
year: '2005'
...
---
_id: '16470'
abstract:
- lang: eng
text: "We present a web computing library (PUBWCL) in Java that allows to execute
strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP)
style on PCs distributed over the internet whose owners are willing to donate
their unused computation power.\r\nPUBWCL is realized as a peer-to-peer system
and features migration and restoration of BSP processes executed on it.\r\nThe
use of Java guarantees a high level of security and makes PUBWCL platform independent.
In order to estimate the loss of efficiency inherent in such a Java-based system,
we have compared it to our C-based PUB-Library.\r\n"
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment
for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96'
apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). A Web Computing
Environment for Parallel Algorithms in Java. In Proceeedings of 6th International
Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808).
https://doi.org/10.1007/11752578_96
bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web
Computing Environment for Parallel Algorithms in Java}, DOI={10.1007/11752578_96},
booktitle={Proceeedings of 6th International Conference on Parallel Processing
and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim
and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }'
chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A
Web Computing Environment for Parallel Algorithms in Java.” In Proceeedings
of 6th International Conference on Parallel Processing and Applied Mathematics
(PPAM), 801–8, 2005. https://doi.org/10.1007/11752578_96.
ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment
for Parallel Algorithms in Java,” in Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.
mla: Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms
in Java.” Proceeedings of 6th International Conference on Parallel Processing
and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.
short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
2005, pp. 801–808.'
date_created: 2020-04-08T09:25:44Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11752578_96
language:
- iso: eng
page: 801-808
publication: Proceeedings of 6th International Conference on Parallel Processing and
Applied Mathematics (PPAM)
publication_identifier:
isbn:
- '9783540341413'
- '9783540341420'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Web Computing Environment for Parallel Algorithms in Java
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '16471'
abstract:
- lang: eng
text: "We compare different load balancing strategies for Bulk-Synchronous Parallel
(BSP) programs in a web computing environment. In order to handle the influence
of the fluctuating available computation power, we classify the external work
load.\r\n\r\nWe evaluate the load balancing algorithms using our web computing
library for BSP programs in Java (PUBWCL). Thereby we simulated the external work
load in order to have repeatable testing conditions.\r\n\r\nWith the best performing
load balancing strategy we could save 39% of the execution time averaged and even
up to 50% in particular cases."
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies
in a Web Computing Environment. In: Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101'
apa: Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). Load Balancing
Strategies in a Web Computing Environment. In Proceeedings of 6th International
Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846).
https://doi.org/10.1007/11752578_101
bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load
Balancing Strategies in a Web Computing Environment}, DOI={10.1007/11752578_101},
booktitle={Proceeedings of 6th International Conference on Parallel Processing
and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim
and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }'
chicago: Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load
Balancing Strategies in a Web Computing Environment.” In Proceeedings of 6th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
839–46, 2005. https://doi.org/10.1007/11752578_101.
ieee: O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies
in a Web Computing Environment,” in Proceeedings of 6th International Conference
on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.
mla: Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.”
Proceeedings of 6th International Conference on Parallel Processing and Applied
Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101.
short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th
International Conference on Parallel Processing and Applied Mathematics (PPAM),
2005, pp. 839–846.'
date_created: 2020-04-08T09:30:12Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/11752578_101
language:
- iso: eng
page: 839-846
publication: Proceeedings of 6th International Conference on Parallel Processing and
Applied Mathematics (PPAM)
publication_identifier:
isbn:
- '9783540341413'
- '9783540341420'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Load Balancing Strategies in a Web Computing Environment
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '17112'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Bienkowski M, Damerow V, Meyer auf der Heide F, Sohler C. Average case complexity
of Voronoi diagrams of n sites from the unit cube. In: Proceedings of the 21st
European Workshop on Computational Geometry, Eindhoven, The Netherlands, March
9-11, 2005. Technische Universiteit Eindhoven; 2005.'
apa: Bienkowski, M., Damerow, V., Meyer auf der Heide, F., & Sohler, C. (2005).
Average case complexity of Voronoi diagrams of n sites from the unit cube. In
Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven,
The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven.
bibtex: '@inproceedings{Bienkowski_Damerow_Meyer auf der Heide_Sohler_2005, title={Average
case complexity of Voronoi diagrams of n sites from the unit cube}, booktitle={Proceedings
of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands,
March 9-11, 2005}, publisher={Technische Universiteit Eindhoven}, author={Bienkowski,
Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian},
year={2005} }'
chicago: Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and
Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from
the Unit Cube.” In Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit
Eindhoven, 2005.
ieee: M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “Average
case complexity of Voronoi diagrams of n sites from the unit cube,” in Proceedings
of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands,
March 9-11, 2005, 2005.
mla: Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of
n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational
Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit
Eindhoven, 2005.
short: 'M. Bienkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, in: Proceedings
of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands,
March 9-11, 2005, Technische Universiteit Eindhoven, 2005.'
date_created: 2020-06-22T13:22:22Z
date_updated: 2022-01-06T06:53:05Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 21st European Workshop on Computational Geometry,
Eindhoven, The Netherlands, March 9-11, 2005
publisher: Technische Universiteit Eindhoven
related_material:
link:
- relation: confirmation
url: http://www.win.tue.nl/EWCG2005/Proceedings/43.pdf
status: public
title: Average case complexity of Voronoi diagrams of n sites from the unit cube
type: conference
user_id: '15415'
year: '2005'
...
---
_id: '17113'
citation:
ama: Leonardi S, Meyer auf der Heide F, Wagner D, eds. Abstracts Collection --
Algorithmic Aspects of Large and Complex Networks. Vol 05361.; 2005.
apa: Leonardi, S., Meyer auf der Heide, F., & Wagner, D. (Eds.). (2005). Abstracts
Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361).
Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.
bibtex: '@book{Leonardi_Meyer auf der Heide_Wagner_2005, series={Dagstuhl Seminar
Proceedings}, title={Abstracts Collection -- Algorithmic Aspects of Large and
Complex Networks}, volume={05361}, year={2005}, collection={Dagstuhl Seminar Proceedings}
}'
chicago: Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner,
eds. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks.
Vol. 05361. Dagstuhl Seminar Proceedings, 2005.
ieee: S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., Abstracts Collection
-- Algorithmic Aspects of Large and Complex Networks, vol. 05361. 2005.
mla: Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic
Aspects of Large and Complex Networks. Vol. 05361, 2005.
short: S. Leonardi, F. Meyer auf der Heide, D. Wagner, eds., Abstracts Collection
-- Algorithmic Aspects of Large and Complex Networks, 2005.
conference:
end_date: 2005-09-09
location: Schloss Dagstuhl, Germany
name: Dagstuhl Seminar Proceedings
start_date: 2005-09-04
date_created: 2020-06-22T13:52:52Z
date_updated: 2022-01-06T06:53:05Z
department:
- _id: '63'
editor:
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Dorothea
full_name: Wagner, Dorothea
last_name: Wagner
intvolume: ' 5361'
language:
- iso: eng
related_material:
link:
- relation: confirmation
url: https://drops.dagstuhl.de/opus/volltexte/2006/570/
series_title: Dagstuhl Seminar Proceedings
status: public
title: Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks
type: conference_editor
user_id: '15415'
volume: '05361'
year: '2005'
...
---
_id: '17346'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Michael
full_name: Heidebuer, Michael
last_name: Heidebuer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Ulrich '
full_name: 'Rückert, Ulrich '
last_name: Rückert
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
citation:
ama: 'Brinkmann A, Heidebuer M, Meyer auf der Heide F, Rückert U, Salzwedel K, Vodisek
M. V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.
In: Kobler B, Hariharan PC, eds. 21st {IEEE} Conference on Mass Storage Systems
and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and
Technologies, Greenbelt, Maryland, USA. IEEE; 2004:153--157.'
apa: Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel,
K., & Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage
Virtualization System. In B. Kobler & P. C. Hariharan (Eds.), 21st {IEEE}
Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference
on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157).
IEEE.
bibtex: '@inproceedings{Brinkmann_Heidebuer_Meyer auf der Heide_Rückert_Salzwedel_Vodisek_2004,
title={V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System},
booktitle={21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th
{NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt,
Maryland, USA}, publisher={IEEE}, author={Brinkmann, André and Heidebuer, Michael
and Meyer auf der Heide, Friedhelm and Rückert, Ulrich and Salzwedel, Kay and
Vodisek, Mario}, editor={Kobler, Ben and Hariharan, P. C.Editors}, year={2004},
pages={153--157} }'
chicago: Brinkmann, André, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich Rückert,
Kay Salzwedel, and Mario Vodisek. “V:Drive - Costs and Benefits of an Out-of-Band
Storage Virtualization System.” In 21st {IEEE} Conference on Mass Storage Systems
and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and
Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan,
153--157. IEEE, 2004.
ieee: A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel,
and M. Vodisek, “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization
System,” in 21st {IEEE} Conference on Mass Storage Systems and Technologies
/ 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt,
Maryland, USA, 2004, pp. 153--157.
mla: Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage
Virtualization System.” 21st {IEEE} Conference on Mass Storage Systems and
Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies,
Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, IEEE,
2004, pp. 153--157.
short: 'A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel,
M. Vodisek, in: B. Kobler, P.C. Hariharan (Eds.), 21st {IEEE} Conference on Mass
Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage
Systems and Technologies, Greenbelt, Maryland, USA, IEEE, 2004, pp. 153--157.'
date_created: 2020-06-26T13:30:51Z
date_updated: 2022-01-06T06:53:08Z
department:
- _id: '63'
editor:
- first_name: Ben
full_name: Kobler, Ben
last_name: Kobler
- first_name: P. C.
full_name: Hariharan, P. C.
last_name: Hariharan
language:
- iso: eng
page: 153--157
publication: 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th
{NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland,
USA
publisher: IEEE
status: public
title: V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '16474'
abstract:
- lang: eng
text: "Given n distinct points p1, p2, ... , pn in the plane, the map labeling\r\nproblem
with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn\r\nof
maximum possible size such that pi is a corner of Qi and no two squares overlap.\r\nThis
problem is NP-hard and no algorithm with approximation ratio better\r\nthan 1/2
exists unless P = NP [10].\r\nIn this paper, we consider a scenario where we want
to visualize the information\r\ngathered by smart dust, i.e. by a large set of
simple devices, each consisting of\r\na sensor and a sender that can gather sensor
data and send it to a central station.\r\nOur task is to label (the positions
of) these sensors in a way described by the\r\nlabeling problem above. Since these
devices are not positioned accurately (for\r\nexample, they might be dropped from
an airplane), this gives rise to consider the\r\nmap labeling problem under the
assumption, that the positions of the points are\r\nnot fixed precisely, but perturbed
by random noise. In other words, we consider\r\nthe smoothed complexity of the
map labeling problem. We present an algorithm\r\nthat, under such an assumption
and Gaussian random noise with sufficiently large\r\nvariance, has linear smoothed
complexity."
author:
- first_name: Vikas
full_name: Bansal, Vikas
last_name: Bansal
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: 12th
Annual European Symposium on Algorithms (ESA 2004). Vol 3221. Lecture Notes
in Computer Science. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30140-0_9'
apa: Bansal, V., Meyer auf der Heide, F., & Sohler, C. (2004). Labeling Smart
Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol.
3221). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_9
bibtex: '@inproceedings{Bansal_Meyer auf der Heide_Sohler_2004, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Labeling Smart Dust}, volume={3221},
DOI={10.1007/978-3-540-30140-0_9},
booktitle={12th Annual European Symposium on Algorithms (ESA 2004)}, author={Bansal,
Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2004},
collection={Lecture Notes in Computer Science} }'
chicago: Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling
Smart Dust.” In 12th Annual European Symposium on Algorithms (ESA 2004),
Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30140-0_9.
ieee: V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in
12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.
mla: Bansal, Vikas, et al. “Labeling Smart Dust.” 12th Annual European Symposium
on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9.
short: 'V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium
on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.'
date_created: 2020-04-08T11:07:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_9
intvolume: ' 3221'
language:
- iso: eng
place: Berlin, Heidelberg
publication: 12th Annual European Symposium on Algorithms (ESA 2004)
publication_identifier:
isbn:
- '9783540230250'
- '9783540301400'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: Labeling Smart Dust
type: conference
user_id: '15415'
volume: 3221
year: '2004'
...
---
_id: '16475'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Fighting against two
adversaries. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism
in Algorithms and Architectures - SPAA ’04. ; 2004. doi:10.1145/1007912.1007923'
apa: Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2004). Fighting
against two adversaries. In Proceedings of the sixteenth annual ACM symposium
on Parallelism in algorithms and architectures - SPAA ’04. https://doi.org/10.1145/1007912.1007923
bibtex: '@inproceedings{Bienkowski_Korzeniowski_Meyer auf der Heide_2004, title={Fighting
against two adversaries}, DOI={10.1145/1007912.1007923},
booktitle={Proceedings of the sixteenth annual ACM symposium on Parallelism in
algorithms and architectures - SPAA ’04}, author={Bienkowski, Marcin and Korzeniowski,
Miroslaw and Meyer auf der Heide, Friedhelm}, year={2004} }'
chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der
Heide. “Fighting against Two Adversaries.” In Proceedings of the Sixteenth
Annual ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’04,
2004. https://doi.org/10.1145/1007912.1007923.
ieee: M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Fighting against
two adversaries,” in Proceedings of the sixteenth annual ACM symposium on Parallelism
in algorithms and architectures - SPAA ’04, 2004.
mla: Bienkowski, Marcin, et al. “Fighting against Two Adversaries.” Proceedings
of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
- SPAA ’04, 2004, doi:10.1145/1007912.1007923.
short: 'M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Proceedings
of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
- SPAA ’04, 2004.'
date_created: 2020-04-08T11:10:54Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1007912.1007923
language:
- iso: eng
publication: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms
and architectures - SPAA '04
publication_identifier:
isbn:
- '1581138407'
publication_status: published
status: public
title: Fighting against two adversaries
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '16477'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
citation:
ama: Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Congestion,
Dilation, and Energy in Radio Networks. Theory of Computing Systems. 2004:343-370.
doi:10.1007/s00224-004-1124-z
apa: Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M.
(2004). Congestion, Dilation, and Energy in Radio Networks. Theory of Computing
Systems, 343–370. https://doi.org/10.1007/s00224-004-1124-z
bibtex: '@article{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2004, title={Congestion,
Dilation, and Energy in Radio Networks}, DOI={10.1007/s00224-004-1124-z},
journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm
and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, year={2004},
pages={343–370} }'
chicago: Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert,
and Matthias Grünewald. “Congestion, Dilation, and Energy in Radio Networks.”
Theory of Computing Systems, 2004, 343–70. https://doi.org/10.1007/s00224-004-1124-z.
ieee: F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Congestion,
Dilation, and Energy in Radio Networks,” Theory of Computing Systems, pp.
343–370, 2004.
mla: Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in
Radio Networks.” Theory of Computing Systems, 2004, pp. 343–70, doi:10.1007/s00224-004-1124-z.
short: F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, Theory
of Computing Systems (2004) 343–370.
date_created: 2020-04-08T11:17:35Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/s00224-004-1124-z
language:
- iso: eng
page: 343-370
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Congestion, Dilation, and Energy in Radio Networks
type: journal_article
user_id: '15415'
year: '2004'
...
---
_id: '16480'
author:
- first_name: S.
full_name: Leonardi, S.
last_name: Leonardi
- first_name: A.
full_name: Marchetti-Spaccamela, A.
last_name: Marchetti-Spaccamela
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Leonardi S, Marchetti-Spaccamela A, Meyer auf der Heide F. Scheduling against
an adversarial network. In: SPAA ’04: Proceedings of the Sixteenth Annual ACM
Symposium on Parallelism in Algorithms and Architectures. ; 2004. doi:10.1145/1007912.1007936'
apa: 'Leonardi, S., Marchetti-Spaccamela, A., & Meyer auf der Heide, F. (2004).
Scheduling against an adversarial network. In SPAA ’04: Proceedings of the
sixteenth annual ACM symposium on Parallelism in algorithms and architectures.
https://doi.org/10.1145/1007912.1007936'
bibtex: '@inproceedings{Leonardi_Marchetti-Spaccamela_Meyer auf der Heide_2004,
title={Scheduling against an adversarial network}, DOI={10.1145/1007912.1007936},
booktitle={SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism
in algorithms and architectures}, author={Leonardi, S. and Marchetti-Spaccamela,
A. and Meyer auf der Heide, Friedhelm}, year={2004} }'
chicago: 'Leonardi, S., A. Marchetti-Spaccamela, and Friedhelm Meyer auf der Heide.
“Scheduling against an Adversarial Network.” In SPAA ’04: Proceedings of the
Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures,
2004. https://doi.org/10.1145/1007912.1007936.'
ieee: 'S. Leonardi, A. Marchetti-Spaccamela, and F. Meyer auf der Heide, “Scheduling
against an adversarial network,” in SPAA ’04: Proceedings of the sixteenth
annual ACM symposium on Parallelism in algorithms and architectures, 2004.'
mla: 'Leonardi, S., et al. “Scheduling against an Adversarial Network.” SPAA
’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms
and Architectures, 2004, doi:10.1145/1007912.1007936.'
short: 'S. Leonardi, A. Marchetti-Spaccamela, F. Meyer auf der Heide, in: SPAA ’04:
Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms
and Architectures, 2004.'
date_created: 2020-04-09T06:51:22Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1007912.1007936
language:
- iso: eng
publication: 'SPAA ''04: Proceedings of the sixteenth annual ACM symposium on Parallelism
in algorithms and architectures'
publication_identifier:
isbn:
- '1581138407'
publication_status: published
status: public
title: Scheduling against an adversarial network
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '16399'
abstract:
- lang: eng
text: "We present a new data structure for rendering highly complex virtual environments
of arbitrary topology. The special feature of our approach is that it allows an
interactive navigation in very large scenes (30 GB/400 million polygons in our
benchmark scenes) that cannot be stored in main memory, but only on a local or
remote hard disk. Furthermore, it allows interactive rendering of substantially
more complex scenes by instantiating objects.\r\n\r\nThe sampling process is done
in the preprocessing. There, the polygons are randomly distributed in our hierarchical
data structure, the randomized sample tree. This tree only uses space that is
linear in the number of polygons. In order to produce an approximate image of
the scene, the tree is traversed and polygons stored in the visited nodes are
rendered. During the interactive walkthrough, parts of the sample tree are loaded
from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical
walkthrough system. Analysis and experiments show that the quality of our images
is comparable to images computed by the conventional z-buffer algorithm regardless
of the scene topology."
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The
Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally
Stored Virtual Environments. Presence: Teleoperators and Virtual Environments.
2004:617-637. doi:10.1162/1054746043280619'
apa: 'Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf
der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive
Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators
and Virtual Environments, 617–637. https://doi.org/10.1162/1054746043280619'
bibtex: '@article{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2004, title={The
Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally
Stored Virtual Environments}, DOI={10.1162/1054746043280619},
journal={Presence: Teleoperators and Virtual Environments}, author={Klein, Jan
and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and
Meyer auf der Heide, Friedhelm}, year={2004}, pages={617–637} }'
chicago: 'Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka,
and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure
for Interactive Walk-Throughs in Externally Stored Virtual Environments.” Presence:
Teleoperators and Virtual Environments, 2004, 617–37. https://doi.org/10.1162/1054746043280619.'
ieee: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der
Heide, “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs
in Externally Stored Virtual Environments,” Presence: Teleoperators and Virtual
Environments, pp. 617–637, 2004.'
mla: 'Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive
Walk-Throughs in Externally Stored Virtual Environments.” Presence: Teleoperators
and Virtual Environments, 2004, pp. 617–37, doi:10.1162/1054746043280619.'
short: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der
Heide, Presence: Teleoperators and Virtual Environments (2004) 617–637.'
date_created: 2020-04-03T11:42:11Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1162/1054746043280619
language:
- iso: eng
page: 617-637
publication: 'Presence: Teleoperators and Virtual Environments'
publication_identifier:
issn:
- 1054-7460
- 1531-3263
publication_status: published
status: public
title: 'The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs
in Externally Stored Virtual Environments'
type: journal_article
user_id: '15415'
year: '2004'
...
---
_id: '19790'
abstract:
- lang: eng
text: The advances in Internet technology have led to tremendous improvements in
business, education, and science and have changed the way we think, live, and
communicate. Information exchange has become ubiquitous by the possibilities offered
through modern technologies. We are able to offer information 24 hours a day through
our web sites and can leave messages every time and from anywhere in the world.
This change in communication has led to new challenges. Enterprises have to deal
with an information amount that doubles every year. The technological foundation
to cope with this information explosion is given by Storage Area Networks (SANs),
which are able to connect a great number of storage systems over a fast interconnection
network. However, to be able to use the benefits of a SAN, an easy-to-use and
efficient management support has to be given to the storage administrator. In
this paper, we will suggest new storage management concepts and we will introduce
a new management environment that is able to significantly reduce management costs
and increases the performance and resource utilization of the given SAN infrastructure.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M,
Rückert U. Storage Management as Means to cope with Exponential Information Growth.
In: Proceedings of SSGRR 2003. ; 2003.'
apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential
Information Growth. In Proceedings of SSGRR 2003.
bibtex: '@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003,
title={Storage Management as Means to cope with Exponential Information Growth},
booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel,
Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario
and Rückert, Ulrich}, year={2003} }'
chicago: Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André
Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to
Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003,
2003.
ieee: C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
and U. Rückert, “Storage Management as Means to cope with Exponential Information
Growth,” in Proceedings of SSGRR 2003, 2003.
mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
Information Growth.” Proceedings of SSGRR 2003, 2003.
short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
U. Rückert, in: Proceedings of SSGRR 2003, 2003.'
date_created: 2020-09-30T12:04:14Z
date_updated: 2022-01-06T06:54:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '58'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-30T12:03:57Z
date_updated: 2020-09-30T12:03:57Z
file_id: '19793'
file_name: pub-hni-908.pdf
file_size: 499057
relation: main_file
success: 1
file_date_updated: 2020-09-30T12:03:57Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of SSGRR 2003
status: public
title: Storage Management as Means to cope with Exponential Information Growth
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '2128'
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed
Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science.
Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17'
apa: Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler,
C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171).
Springer. https://doi.org/10.1007/978-3-540-39658-1_17
bibtex: '@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003,
series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity},
volume={2832}, DOI={10.1007/978-3-540-39658-1_17},
booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf
der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian},
year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science}
}'
chicago: Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian
Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA,
2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.
ieee: V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler,
“Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.
mla: Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832,
Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler,
in: ESA, Springer, 2003, pp. 161--171.'
date_created: 2018-04-03T05:37:10Z
date_updated: 2022-01-06T06:54:52Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-540-39658-1_17
intvolume: ' 2832'
language:
- iso: eng
page: 161--171
publication: ESA
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Smoothed Motion Complexity
type: conference
user_id: '14955'
volume: 2832
year: '2003'
...
---
_id: '16481'
abstract:
- lang: eng
text: 'ZusammenfassungVernetzte Systeme sind zu
unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner,
als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten
von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher
Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In
diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive
Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere
Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem
wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen
parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt
haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten
Datenservern führen.'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen
– Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design
Methods – Applications). it - Information Technology. 2003. doi:10.1524/itit.45.2.108.19606'
apa: 'Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications). It - Information Technology. https://doi.org/10.1524/itit.45.2.108.19606'
bibtex: '@article{Meyer auf der Heide_2003, title={Sonderforschungsbereich 376 Massive
Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel
Computing: Algorithms – Design Methods – Applications)}, DOI={10.1524/itit.45.2.108.19606},
journal={it - Information Technology}, author={Meyer auf der Heide, Friedhelm},
year={2003} }'
chicago: 'Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications).” It - Information Technology, 2003. https://doi.org/10.1524/itit.45.2.108.19606.'
ieee: 'F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications),” it - Information Technology, 2003.'
mla: 'Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität:
Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms
– Design Methods – Applications).” It - Information Technology, 2003, doi:10.1524/itit.45.2.108.19606.'
short: F. Meyer auf der Heide, It - Information Technology (2003).
date_created: 2020-04-09T07:27:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1524/itit.45.2.108.19606
language:
- iso: eng
publication: it - Information Technology
publication_identifier:
issn:
- 2196-7032
- 1611-2776
publication_status: published
status: public
title: 'Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden
– Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)'
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '16482'
author:
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on
parallel locality models. Journal of Discrete Algorithms. 2003:151-166.
doi:10.1016/s1570-8667(03)00023-6
apa: Juurlink, B., Kolman, P., Meyer auf der Heide, F., & Rieping, I. (2003).
Optimal broadcast on parallel locality models. Journal of Discrete Algorithms,
151–166. https://doi.org/10.1016/s1570-8667(03)00023-6
bibtex: '@article{Juurlink_Kolman_Meyer auf der Heide_Rieping_2003, title={Optimal
broadcast on parallel locality models}, DOI={10.1016/s1570-8667(03)00023-6},
journal={Journal of Discrete Algorithms}, author={Juurlink, Bernhardus and Kolman,
Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={2003}, pages={151–166}
}'
chicago: Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo
Rieping. “Optimal Broadcast on Parallel Locality Models.” Journal of Discrete
Algorithms, 2003, 151–66. https://doi.org/10.1016/s1570-8667(03)00023-6.
ieee: B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast
on parallel locality models,” Journal of Discrete Algorithms, pp. 151–166,
2003.
mla: Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.”
Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
short: B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete
Algorithms (2003) 151–166.
date_created: 2020-04-09T07:33:09Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/s1570-8667(03)00023-6
language:
- iso: eng
page: 151-166
publication: Journal of Discrete Algorithms
publication_identifier:
issn:
- 1570-8667
publication_status: published
status: public
title: Optimal broadcast on parallel locality models
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '16484'
citation:
ama: Rosenberg AL, Meyer auf der Heide F, eds. Proceedings of the Fifteenth Annual
ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03.; 2003.
doi:10.1145/777412
apa: Rosenberg, A. L., & Meyer auf der Heide, F. (Eds.). (2003). Proceedings
of the fifteenth annual ACM symposium on Parallel algorithms and architectures
- SPAA ’03. https://doi.org/10.1145/777412
bibtex: '@book{Rosenberg_Meyer auf der Heide_2003, title={Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03}, DOI={10.1145/777412}, year={2003} }'
chicago: Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, eds. Proceedings
of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’03, 2003. https://doi.org/10.1145/777412.
ieee: A. L. Rosenberg and F. Meyer auf der Heide, Eds., Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03.
2003.
mla: Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. Proceedings
of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’03. 2003, doi:10.1145/777412.
short: A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03, 2003.
date_created: 2020-04-09T07:41:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/777412
editor:
- first_name: Arnold L.
full_name: Rosenberg, Arnold L.
last_name: Rosenberg
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
language:
- iso: eng
publication_identifier:
isbn:
- '1581136617'
publication_status: published
status: public
title: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and
architectures - SPAA '03
type: conference_editor
user_id: '15415'
year: '2003'
...