---
_id: '2179'
author:
- first_name: Michele
full_name: Flammini, Michele
last_name: Flammini
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical
Networks. In: SPAA. ; 1997:170--179.'
apa: Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes
for All-Optical Networks. In SPAA (pp. 170--179).
bibtex: '@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing
Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele
and Scheideler, Christian}, year={1997}, pages={170--179} }'
chicago: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
Networks,” in SPAA, 1997, pp. 170--179.
mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
for All-Optical Networks.” SPAA, 1997, pp. 170--179.
short: 'M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.'
date_created: 2018-04-03T09:17:10Z
date_updated: 2022-01-06T06:55:13Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:06:34Z
date_updated: 2018-04-12T07:11:32Z
file_id: '2283'
file_name: SPAA97.pdf
file_size: 365709
relation: main_file
file_date_updated: 2018-04-12T07:11:32Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 170--179
publication: SPAA
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: conference
urn: '21792'
user_id: '14955'
year: '1997'
...
---
_id: '16564'
author:
- first_name: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. computational complexity. 1997:357-375.
doi:10.1007/bf01270387
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1997). A lower bound for randomized algebraic decision trees. Computational
Complexity, 357–375. https://doi.org/10.1007/bf01270387
bibtex: '@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A
lower bound for randomized algebraic decision trees}, DOI={10.1007/bf01270387},
journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek
and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375}
}'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational
Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” computational complexity,
pp. 357–375, 1997.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
short: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational
Complexity (1997) 357–375.
date_created: 2020-04-15T10:42:43Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bf01270387
language:
- iso: eng
page: 357-375
publication: computational complexity
publication_identifier:
issn:
- 1016-3328
- 1420-8954
publication_status: published
status: public
title: A lower bound for randomized algebraic decision trees
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16565'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real
Time: On the Computation Power of Reconfigurable Architectures. Information
and Computation. 1997:103-120. doi:10.1006/inco.1997.2642'
apa: 'Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.
Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642'
bibtex: '@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared
Memory in Real Time: On the Computation Power of Reconfigurable Architectures},
DOI={10.1006/inco.1997.2642},
journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der
Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }'
chicago: 'Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”
Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.'
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory
in Real Time: On the Computation Power of Reconfigurable Architectures,” Information
and Computation, pp. 103–120, 1997.'
mla: 'Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation
Power of Reconfigurable Architectures.” Information and Computation, 1997,
pp. 103–20, doi:10.1006/inco.1997.2642.'
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation
(1997) 103–120.
date_created: 2020-04-15T11:20:09Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1006/inco.1997.2642
language:
- iso: eng
page: 103-120
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: 'Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable
Architectures'
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16567'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: M.
full_name: Storch, M.
last_name: Storch
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and
Slowdown for Universal Parallel Networks. Theory of Computing Systems.
Published online 1997:627-644. doi:10.1007/s002240000071
apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks. Theory of Computing
Systems, 627–644. https://doi.org/10.1007/s002240000071
bibtex: '@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks}, DOI={10.1007/s002240000071},
journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm
and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }'
chicago: Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing
Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071.
ieee: 'F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between
Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems,
pp. 627–644, 1997, doi: 10.1007/s002240000071.'
mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and
Slowdown for Universal Parallel Networks.” Theory of Computing Systems,
1997, pp. 627–44, doi:10.1007/s002240000071.
short: F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems
(1997) 627–644.
date_created: 2020-04-15T11:31:05Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/s002240000071
language:
- iso: eng
page: 627-644
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16569'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks.
In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716'
apa: Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data
management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/bfb0002716
bibtex: '@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static
and dynamic data management in networks}, DOI={10.1007/bfb0002716},
booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
and Vöcking, Berthold}, year={1997} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic
Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin,
Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.
ieee: F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management
in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data
Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
short: 'F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-15T11:47:28Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0002716
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
isbn:
- '9783540634409'
- '9783540695493'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Static and dynamic data management in networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16604'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
citation:
ama: 'Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs
in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’97. ; 1997. doi:10.1145/258492.258522'
apa: Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating
weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium
on Parallel algorithms and architectures - SPAA ’97. https://doi.org/10.1145/258492.258522
bibtex: '@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating
weighted jobs in parallel}, DOI={10.1145/258492.258522},
booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide,
Friedhelm and Schröder, Klaus}, year={1997} }'
chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating
Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522.
ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted
jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel
algorithms and architectures - SPAA ’97, 1997.
mla: Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings
of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures -
SPAA ’97, 1997, doi:10.1145/258492.258522.
short: 'P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the
Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97,
1997.'
date_created: 2020-04-16T06:18:07Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1145/258492.258522
language:
- iso: eng
publication: Proceedings of the ninth annual ACM symposium on Parallel algorithms
and architectures - SPAA '97
publication_identifier:
isbn:
- '0897918908'
publication_status: published
status: public
title: Allocating weighted jobs in parallel
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '16605'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching.
In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg;
1997. doi:10.1007/3-540-63138-0_21'
apa: Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient
parallel searching. In Solving Irregularly Structured Problems in Parallel.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21
bibtex: '@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication
efficient parallel searching}, DOI={10.1007/3-540-63138-0_21},
booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker,
Armin and Meyer auf der Heide, Friedhelm}, year={1997} }'
chicago: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
Parallel Searching.” In Solving Irregularly Structured Problems in Parallel.
Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.
ieee: A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,”
in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg,
1997.
mla: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
Parallel Searching.” Solving Irregularly Structured Problems in Parallel,
1997, doi:10.1007/3-540-63138-0_21.
short: 'A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems
in Parallel, Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T06:22:32Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1007/3-540-63138-0_21
language:
- iso: eng
place: Berlin, Heidelberg
publication: Solving Irregularly Structured Problems in Parallel
publication_identifier:
isbn:
- '9783540631385'
- '9783540691570'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Communication efficient parallel searching
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16687'
author:
- first_name: Efstratios
full_name: Karaivazoglou, Efstratios
last_name: Karaivazoglou
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks.
In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741'
apa: Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous
processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/bfb0002741
bibtex: '@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg},
title={Routing on asyncronous processor networks}, DOI={10.1007/bfb0002741},
booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios
and Meyer auf der Heide, Friedhelm}, year={1997} }'
chicago: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing
on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing.
Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.
ieee: E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor
networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
mla: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous
Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
short: 'E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:41:06Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bfb0002741
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
isbn:
- '9783540634409'
- '9783540695493'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Routing on asyncronous processor networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16689'
author:
- first_name: B.M.
full_name: Maggs, B.M.
last_name: Maggs
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality
for data management in systems of limited bandwidth. In: Proceedings 38th Annual
Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117'
apa: Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997).
Exploiting locality for data management in systems of limited bandwidth. Proceedings
38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117
bibtex: '@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting
locality for data management in systems of limited bandwidth}, DOI={10.1109/sfcs.1997.646117},
booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science},
author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and
Westermann, Matthias}, year={1997} }'
chicago: Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias
Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”
In Proceedings 38th Annual Symposium on Foundations of Computer Science,
1997. https://doi.org/10.1109/sfcs.1997.646117.
ieee: 'B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting
locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.'
mla: Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of
Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer
Science, 1997, doi:10.1109/sfcs.1997.646117.
short: 'B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings
38th Annual Symposium on Foundations of Computer Science, 1997.'
date_created: 2020-04-16T10:44:29Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1109/sfcs.1997.646117
language:
- iso: eng
publication: Proceedings 38th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '0818681977'
publication_status: published
status: public
title: Exploiting locality for data management in systems of limited bandwidth
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '16693'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Thomas
full_name: Decker, Thomas
last_name: Decker
citation:
ama: 'Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB
376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik
’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22'
apa: 'Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn:
The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.”
In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-60831-5_22'
bibtex: '@inbook{Meyer auf der Heide_Decker_1997, place={Berlin, Heidelberg}, title={Parallel
Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design
Methods, Applications”}, DOI={10.1007/978-3-642-60831-5_22},
booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf
der Heide, Friedhelm and Decker, Thomas}, year={1997} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing
in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg,
1997. https://doi.org/10.1007/978-3-642-60831-5_22.'
ieee: 'F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The
SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in
Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.'
mla: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in
Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.'
short: 'F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:48:16Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/978-3-642-60831-5_22
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik ’97 Informatik als Innovationsmotor
publication_identifier:
isbn:
- '9783540630661'
- '9783642608315'
issn:
- 1431-472X
publication_status: published
status: public
title: 'Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms,
Design Methods, Applications”'
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16568'
abstract:
- lang: eng
text: "We present a data structure problem which describes the requirements of a
simple variant of fully dynamic walk-through animation: We assume the scene to
consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily
large and has to be stored in secondary memory (discs) with relatively slow access.
We allow a visitor to walk in the scene, and a modeler to update the scene by
insertions and deletions of balls. We focus on the realtime requirement of animation
systems: For some t (specified by the computation power of (the rendering hardware
of) the graphic workstation) the data structure has to guarantee that the balls
within distance t of the current visitor's position are presented to the rendering
hardware, 20 times per second. Insertions and deletions should also be available
to the visitor with small delay, independent of the size of the scene. We present
a data structure that fulfills the above task in realtime. Its runtime is output-sensitive,
i.e. linear in a quantity close to the output size of the query. We further present
(preliminary) experimental results indicating that our structure is efficient
in practice.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: 'Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures
for realtime management of large geometric scenes. In: 5th Annual European
Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science.
Springer; 1997:157-170. doi:10.1007/3-540-63397-9_13'
apa: Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic
data structures for realtime management of large geometric scenes. 5th Annual
European Symposium on Algorithms (ESA ’97), 1284, 157–170. https://doi.org/10.1007/3-540-63397-9_13
bibtex: '@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin,
Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures
for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13},
booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer},
author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard},
year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }'
chicago: 'Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann.
“Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In
5th Annual European Symposium on Algorithms (ESA ’97), 1284:157–70. Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.'
ieee: 'M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures
for realtime management of large geometric scenes,” in 5th Annual European
Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 157–170, doi: 10.1007/3-540-63397-9_13.'
mla: Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management
of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA
’97), vol. 1284, Springer, 1997, pp. 157–70, doi:10.1007/3-540-63397-9_13.
short: 'M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European
Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.'
date_created: 2020-04-15T11:44:36Z
date_updated: 2026-02-23T16:05:33Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_13
intvolume: ' 1284'
language:
- iso: eng
page: 157-170
place: Berlin, Heidelberg
publication: 5th Annual European Symposium on Algorithms (ESA '97)
publication_identifier:
isbn:
- '9783540633976'
- '9783540695363'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Dynamic data structures for realtime management of large geometric scenes
type: conference
user_id: '14972'
volume: 1284
year: '1997'
...
---
_id: '19958'
author:
- first_name: Frank
full_name: Schwarze, Frank
last_name: Schwarze
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
citation:
ama: Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical
Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
apa: Schwarze, F., Meyer auf der Heide, F., & Schröder, K. (1996). Routing on
Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I,
299–306.
bibtex: '@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on
Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par
1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder,
Klaus}, year={1996}, pages={299–306} }'
chicago: 'Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing
on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I
(1996): 299–306.'
ieee: F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks
of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp.
299–306, 1996.
mla: Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended
Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
short: F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996)
299–306.
date_created: 2020-10-08T12:04:41Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
language:
- iso: eng
page: 299-306
publication: Euro-Par 1996
status: public
title: Routing on Networks of Optical Crossbars (Extended Abstract).
type: journal_article
user_id: '15415'
volume: I
year: '1996'
...
---
_id: '17418'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing
Based Shared Memory Simulations.; 1996.
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention
Resolution in Hashing Based Shared Memory Simulations.
bibtex: '@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report
SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared
Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm
and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University
of Paderborn} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention
Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB,
University of Paderborn, 1996.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution
in Hashing Based Shared Memory Simulations. 1996.
mla: Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory
Simulations. 1996.
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing
Based Shared Memory Simulations, 1996.
date_created: 2020-07-27T13:03:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
language:
- iso: eng
report_number: tr-rsfb-96-005
series_title: Technical Report SFB, University of Paderborn
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: report
user_id: '15415'
year: '1996'
...
---
_id: '17419'
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: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: 'Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol
65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics
and Visualization; 1996:612-621.'
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1996). A lower bound for randomized algebraic decision trees. In Proc. of
28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel
Graphics and Visualization.
bibtex: '@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996,
series={Lecture Notes in Computer Science}, title={A lower bound for randomized
algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC},
publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev,
Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman},
year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc.
of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics
Symposium on Parallel Graphics and Visualization, 1996.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC,
1996, vol. 65453, pp. 612–621.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel
Graphics and Visualization, 1996, pp. 612–21.
short: 'D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc.
of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization,
1996, pp. 612–621.'
date_created: 2020-07-27T13:09:09Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
intvolume: ' 65453'
language:
- iso: eng
page: 612-621
publication: Proc. of 28th ACM-STOC
publisher: Eurographics Symposium on Parallel Graphics and Visualization
series_title: Lecture Notes in Computer Science
status: public
title: A lower bound for randomized algebraic decision trees
type: conference
user_id: '15415'
volume: 65453
year: '1996'
...
---
_id: '17483'
abstract:
- lang: eng
text: "In this paper we develop a model for communication time on parallel computers
consisting of processors and a service network, i.e., a network performing services
like broadcast, synchronization, and global variables. The implementation of the
service network is done on a free configurable Transputer network.\r\nOur cost
model describes the communication time of accesses to global variables and consists
of a multi-linear function. The cost model includes the parameters packet size,
send hot spot, and the number of processors accessing global variables. These
parameters influence the communication time in a high degree and capture important
parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components
algorithm (among others) and we show that our model is able to predict the communication
time within a 10% error if indirect service networks are used. The applications
show that it is easy for a programmer to determine the parameter values for our
model and that our new cost model precisely predicts the communication time of
parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses
to global variables by finding a balance between the number of messages in the
network and their size. Our model predicts the optimal values for these parameters
which we validate by experiments. A modified implementation of our routing which
determines on-line the optimal parameter values for an access to a global variable
achieves good speed ups."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jochen
full_name: Rethmann, Jochen
last_name: Rethmann
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: 'Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for
Parallel and Distributed Computing (AMW ’96). Amsterdam: IOS Press; 1996:13–27.'
apa: 'Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model
for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract
Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27).
Amsterdam: IOS Press.'
bibtex: '@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A
Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd
Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW
’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and
Wachsmann, Alf}, year={1996}, pages={13–27} }'
chicago: 'Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost
Model for the Communication Time in Parallel Programs.” In 3rd Workshop on
Abstract Machine Models for Parallel and Distributed Computing (AMW ’96),
13–27. Amsterdam: IOS Press, 1996.'
ieee: M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the
Communication Time in Parallel Programs,” in 3rd Workshop on Abstract Machine
Models for Parallel and Distributed Computing (AMW ’96), 1996, pp. 13–27.
mla: Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time
in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel
and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27.
short: 'M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine
Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam,
1996, pp. 13–27.'
date_created: 2020-07-30T14:45:12Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T10:15:36Z
date_updated: 2020-08-26T10:15:36Z
file_id: '18354'
file_name: hni-1454.pdf
file_size: 285707
relation: main_file
success: 1
file_date_updated: 2020-08-26T10:15:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 13–27
place: Amsterdam
publication: 3rd Workshop on Abstract Machine Models for Parallel and Distributed
Computing (AMW '96)
publication_identifier:
isbn:
- 905199267X
publisher: IOS Press
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs
type: conference
user_id: '15415'
year: '1996'
...
---
_id: '17564'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- 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: 'Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel
algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture
Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725'
apa: 'Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996).
Realistic parallel algorithms: Priority queue operations and selection for the
BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin,
Heidelberg. https://doi.org/10.1007/bfb0024725'
bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin,
Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and
selection for the BSP* Model}, DOI={10.1007/bfb0024725},
booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376}
}'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and
Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection
for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin,
Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.'
ieee: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic
parallel algorithms: Priority queue operations and selection for the BSP* Model,”
in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
mla: 'Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations
and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996,
pp. 369–76, doi:10.1007/bfb0024725.'
short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture
Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
date_created: 2020-08-03T13:11:02Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
doi: 10.1007/bfb0024725
language:
- iso: eng
page: 369-376
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540616276'
- '9783540706366'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Realistic parallel algorithms: Priority queue operations and selection for
the BSP* Model'
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '18352'
abstract:
- lang: eng
text: "In this report, we develop a cost model for the communication time on parallel
computers consisting of processors and a service network, i.e., a network performing
services like broadcast, synchronization, and global variables. Because we do
not have a parallel computer at our disposal that is equipped with a service network,
we emulate the service network on a reconfigurable Transputer network.\r\nOur
cost model describes the communication time of accesses to global variables and
consists of a multilinear function. The cost model includes the parameters packet
size, send hot spot (the number of messages sent out by one processor), and number
of processors accessing global variables. We show that these parameters influence
the communication time in a high degree and capture important parameters like
network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication,
and Connected Components algorithm, and we show that our model is able to predict
the communication time within a 10% error if indirect service networks are used.
The applications show that it is easy for a programer to determine the parameter
values for our model and that our new cost model precisely predicts the communication
time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony
and show that the influence of hot spots to the communication time is not as high
as one would expect from theoretical considerations in a synchronous model. Therefore,
we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize
the communication time of accesses to global variables by finding a balance between
the number of messages in the network and their size. Our model predicts the optimal
values for these parameters which we validate by experiments. A modified implementation
of our routing which determines online the optimal parameter values for an access
to a global variable achieves good speed ups.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jochen
full_name: Rethmann, Jochen
last_name: Rethmann
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
Time in Parallel Programs on Parallel Computers Using a Service Hardware.
Universität Paderborn; 1996.
apa: Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost
Model for the Communication Time in Parallel Programs on Parallel Computers Using
a Service Hardware. Universität Paderborn.
bibtex: '@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A
Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen
and Wachsmann, Alf}, year={1996} }'
chicago: Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost
Model for the Communication Time in Parallel Programs on Parallel Computers Using
a Service Hardware. Universität Paderborn, 1996.
ieee: M. Fischer, J. Rethmann, and A. Wachsmann, A Realistic Cost Model for the
Communication Time in Parallel Programs on Parallel Computers Using a Service
Hardware. Universität Paderborn, 1996.
mla: Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time
in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
short: M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication
Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität
Paderborn, 1996.
date_created: 2020-08-26T10:06:31Z
date_updated: 2022-01-06T06:53:30Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T10:05:35Z
date_updated: 2020-08-26T10:05:35Z
file_id: '18353'
file_name: tr-rsfb-96-007.pdf
file_size: 519632
relation: main_file
success: 1
file_date_updated: 2020-08-26T10:05:35Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
Computers Using a Service Hardware
type: report
user_id: '15415'
year: '1996'
...
---
_id: '2181'
author:
- first_name: Christian
full_name: Scheideler, Christian
last_name: Scheideler
citation:
ama: Scheideler C. Universal Routing Strategies. University of Paderborn,
Germany; 1996.
apa: Scheideler, C. (1996). Universal routing strategies. University of Paderborn,
Germany.
bibtex: '@book{Scheideler_1996, title={Universal routing strategies}, publisher={University
of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }'
chicago: Scheideler, Christian. Universal Routing Strategies. University
of Paderborn, Germany, 1996.
ieee: C. Scheideler, Universal routing strategies. University of Paderborn,
Germany, 1996.
mla: Scheideler, Christian. Universal Routing Strategies. University of Paderborn,
Germany, 1996.
short: C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany,
1996.
date_created: 2018-04-03T09:29:45Z
date_updated: 2022-01-06T06:55:15Z
department:
- _id: '79'
- _id: '63'
language:
- iso: eng
publisher: University of Paderborn, Germany
status: public
title: Universal routing strategies
type: dissertation
user_id: '14955'
year: '1996'
...
---
_id: '2182'
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
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy
to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281.
doi:10.1016/0304-3975(96)00032-1
apa: Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting
Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor.
Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
bibtex: '@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting
Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={10.1016/0304-3975(96)00032-1},
number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281}
}'
chicago: 'Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann.
“Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”
Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.'
ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput.
Sci., no. 2, pp. 245--281, 1996.
mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996,
pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
short: F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996)
245--281.
date_created: 2018-04-03T09:30:20Z
date_updated: 2022-01-06T06:55:16Z
department:
- _id: '79'
- _id: '63'
doi: 10.1016/0304-3975(96)00032-1
issue: '2'
language:
- iso: eng
page: 245--281
publication: Theor. Comput. Sci.
status: public
title: Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
type: journal_article
user_id: '14955'
year: '1996'
...
---
_id: '2183'
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. Deterministic Routing with Bounded Buffers:
Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing
with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp.
370--379).'
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic
Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS},
author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996},
pages={370--379} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS,
370--379, 1996.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded
Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996,
pp. 370--379.'
short: 'F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.'
date_created: 2018-04-03T09:31:52Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:01:11Z
date_updated: 2018-04-12T07:10:17Z
file_id: '2281'
file_name: FOCS96.pdf
file_size: 248409
relation: main_file
file_date_updated: 2018-04-12T07:10:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 370--379
publication: FOCS
status: public
title: 'Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols'
type: conference
urn: '21832'
user_id: '14955'
year: '1996'
...