[{"date_created":"2018-04-03T09:17:10Z","file":[{"creator":"florida","date_created":"2018-04-12T07:06:34Z","file_name":"SPAA97.pdf","file_size":365709,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T07:11:32Z","file_id":"2283","content_type":"application/pdf"}],"department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","citation":{"ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in <i>SPAA</i>, 1997, pp. 170--179.","apa":"Flammini, M., &#38; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In <i>SPAA</i> (pp. 170--179).","short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In <i>SPAA</i>, 170--179, 1997.","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>SPAA</i>, 1997, 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} }","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: <i>SPAA</i>. ; 1997:170--179."},"file_date_updated":"2018-04-12T07:11:32Z","publication":"SPAA","_id":"2179","urn":"21792","language":[{"iso":"eng"}],"page":"170--179","user_id":"14955","ddc":["040"],"author":[{"first_name":"Michele","last_name":"Flammini","full_name":"Flammini, Michele"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"status":"public","year":"1997","title":"Simple, Efficient Routing Schemes for All-Optical Networks","has_accepted_license":"1","date_updated":"2022-01-06T06:55:13Z"},{"publication":"computational complexity","citation":{"ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” <i>computational complexity</i>, pp. 357–375, 1997.","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Computational Complexity</i>, 1997, pp. 357–75, doi:<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>.","apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. <i>Computational Complexity</i>, 357–375. <a href=\"https://doi.org/10.1007/bf01270387\">https://doi.org/10.1007/bf01270387</a>","bibtex":"@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A lower bound for randomized algebraic decision trees}, DOI={<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>}, 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.” <i>Computational Complexity</i>, 1997, 357–75. <a href=\"https://doi.org/10.1007/bf01270387\">https://doi.org/10.1007/bf01270387</a>.","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. <i>computational complexity</i>. 1997:357-375. doi:<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>","short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375."},"date_created":"2020-04-15T10:42:43Z","type":"journal_article","department":[{"_id":"63"}],"title":"A lower bound for randomized algebraic decision trees","year":"1997","status":"public","author":[{"first_name":"Dima","last_name":"Grigoriev","full_name":"Grigoriev, Dima"},{"full_name":"Karpinski, Marek","last_name":"Karpinski","first_name":"Marek"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Smolensky","first_name":"Roman","full_name":"Smolensky, Roman"}],"publication_identifier":{"issn":["1016-3328","1420-8954"]},"date_updated":"2022-01-06T06:52:52Z","publication_status":"published","page":"357-375","_id":"16564","language":[{"iso":"eng"}],"doi":"10.1007/bf01270387","user_id":"15415"},{"date_created":"2020-04-15T11:20:09Z","type":"journal_article","department":[{"_id":"63"}],"publication":"Information and Computation","citation":{"mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” <i>Information and Computation</i>, 1997, pp. 103–20, doi:<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>.","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}, DOI={<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>}, journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. <i>Information and Computation</i>. 1997:103-120. doi:<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” <i>Information and Computation</i>, pp. 103–120, 1997.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. <i>Information and Computation</i>, 103–120. <a href=\"https://doi.org/10.1006/inco.1997.2642\">https://doi.org/10.1006/inco.1997.2642</a>","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 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.” <i>Information and Computation</i>, 1997, 103–20. <a href=\"https://doi.org/10.1006/inco.1997.2642\">https://doi.org/10.1006/inco.1997.2642</a>."},"page":"103-120","language":[{"iso":"eng"}],"_id":"16565","doi":"10.1006/inco.1997.2642","user_id":"15415","title":"Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures","status":"public","year":"1997","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"issn":["0890-5401"]},"date_updated":"2022-01-06T06:52:52Z","publication_status":"published"},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-15T11:31:05Z","citation":{"apa":"Meyer auf der Heide, F., Storch, M., &#38; Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. <i>Theory of Computing Systems</i>, 627–644. <a href=\"https://doi.org/10.1007/s002240000071\">https://doi.org/10.1007/s002240000071</a>","ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” <i>Theory of Computing Systems</i>, pp. 627–644, 1997, doi: <a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.","chicago":"Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” <i>Theory of Computing Systems</i>, 1997, 627–44. <a href=\"https://doi.org/10.1007/s002240000071\">https://doi.org/10.1007/s002240000071</a>.","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” <i>Theory of Computing Systems</i>, 1997, pp. 627–44, doi:<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>.","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. <i>Theory of Computing Systems</i>. Published online 1997:627-644. doi:<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>","bibtex":"@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}, DOI={<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }"},"publication":"Theory of Computing Systems","doi":"10.1007/s002240000071","user_id":"15415","_id":"16567","language":[{"iso":"eng"}],"page":"627-644","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Storch, M.","last_name":"Storch","first_name":"M."},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"publication_identifier":{"issn":["1432-4350","1433-0490"]},"title":"Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks","status":"public","year":"1997"},{"publication":"Euro-Par'97 Parallel Processing","citation":{"ieee":"F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1997). Static and dynamic data management in networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0002716\">https://doi.org/10.1007/bfb0002716</a>","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/bfb0002716\">https://doi.org/10.1007/bfb0002716</a>.","short":"F. Meyer auf der Heide, B. Vöcking, 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.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static and dynamic data management in networks}, DOI={<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>}, booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1997} }","ama":"Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-15T11:47:28Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","title":"Static and dynamic data management in networks","year":"1997","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"user_id":"15415","doi":"10.1007/bfb0002716","_id":"16569","language":[{"iso":"eng"}]},{"publication_status":"published","date_updated":"2022-01-06T06:52:53Z","status":"public","year":"1997","title":"Allocating weighted jobs in parallel","publication_identifier":{"isbn":["0897918908"]},"author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"}],"user_id":"15415","doi":"10.1145/258492.258522","language":[{"iso":"eng"}],"_id":"16604","publication":"Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA '97","citation":{"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.","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In <i>Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97</i>, 1997. <a href=\"https://doi.org/10.1145/258492.258522\">https://doi.org/10.1145/258492.258522</a>.","apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Schröder, K. (1997). Allocating weighted jobs in parallel. In <i>Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97</i>. <a href=\"https://doi.org/10.1145/258492.258522\">https://doi.org/10.1145/258492.258522</a>","ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in <i>Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97</i>, 1997.","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: <i>Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97</i>. ; 1997. doi:<a href=\"https://doi.org/10.1145/258492.258522\">10.1145/258492.258522</a>","bibtex":"@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating weighted jobs in parallel}, DOI={<a href=\"https://doi.org/10.1145/258492.258522\">10.1145/258492.258522</a>}, 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} }","mla":"Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” <i>Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97</i>, 1997, doi:<a href=\"https://doi.org/10.1145/258492.258522\">10.1145/258492.258522</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T06:18:07Z"},{"date_created":"2020-04-16T06:22:32Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Solving Irregularly Structured Problems in Parallel","citation":{"ama":"Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>","short":"A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.","chicago":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/3-540-63138-0_21\">https://doi.org/10.1007/3-540-63138-0_21</a>.","bibtex":"@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication efficient parallel searching}, DOI={<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>}, booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker, Armin and Meyer auf der Heide, Friedhelm}, year={1997} }","apa":"Bäumker, A., &#38; Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-63138-0_21\">https://doi.org/10.1007/3-540-63138-0_21</a>","mla":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” <i>Solving Irregularly Structured Problems in Parallel</i>, 1997, doi:<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>.","ieee":"A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in <i>Solving Irregularly Structured Problems in Parallel</i>, Berlin, Heidelberg, 1997."},"_id":"16605","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/3-540-63138-0_21","title":"Communication efficient parallel searching","year":"1997","status":"public","author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540631385","9783540691570"]},"publication_status":"published","date_updated":"2022-01-06T06:52:53Z"},{"language":[{"iso":"eng"}],"_id":"16687","doi":"10.1007/bfb0002741","user_id":"15415","title":"Routing on asyncronous processor networks","status":"public","year":"1997","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"author":[{"full_name":"Karaivazoglou, Efstratios","first_name":"Efstratios","last_name":"Karaivazoglou"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:52:54Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-16T10:41:06Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Euro-Par'97 Parallel Processing","citation":{"mla":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>.","ama":"Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>","bibtex":"@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Routing on asyncronous processor networks}, DOI={<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>}, booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}, year={1997} }","apa":"Karaivazoglou, E., &#38; Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0002741\">https://doi.org/10.1007/bfb0002741</a>","ieee":"E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.","chicago":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/bfb0002741\">https://doi.org/10.1007/bfb0002741</a>.","short":"E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997."}},{"publication_identifier":{"isbn":["0818681977"]},"author":[{"last_name":"Maggs","first_name":"B.M.","full_name":"Maggs, B.M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"year":"1997","status":"public","title":"Exploiting locality for data management in systems of limited bandwidth","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16689","doi":"10.1109/sfcs.1997.646117","user_id":"15415","citation":{"apa":"Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1997.646117\">https://doi.org/10.1109/sfcs.1997.646117</a>","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: <a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>.","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 <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>, 1997. <a href=\"https://doi.org/10.1109/sfcs.1997.646117\">https://doi.org/10.1109/sfcs.1997.646117</a>.","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.","mla":"Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>, 1997, doi:<a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>.","ama":"Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>. ; 1997. doi:<a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>","bibtex":"@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting locality for data management in systems of limited bandwidth}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>}, 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} }"},"publication":"Proceedings 38th Annual Symposium on Foundations of Computer Science","date_created":"2020-04-16T10:44:29Z","department":[{"_id":"63"}],"type":"conference"},{"publication":"Informatik ’97 Informatik als Innovationsmotor","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” <i>Informatik ’97 Informatik Als Innovationsmotor</i>, 1997, doi:<a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">10.1007/978-3-642-60831-5_22</a>.","apa":"Meyer auf der Heide, F., &#38; Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In <i>Informatik ’97 Informatik als Innovationsmotor</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">https://doi.org/10.1007/978-3-642-60831-5_22</a>","ieee":"F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in <i>Informatik ’97 Informatik als Innovationsmotor</i>, Berlin, Heidelberg, 1997.","short":"F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.","ama":"Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: <i>Informatik ’97 Informatik Als Innovationsmotor</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">10.1007/978-3-642-60831-5_22</a>","chicago":"Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” In <i>Informatik ’97 Informatik Als Innovationsmotor</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">https://doi.org/10.1007/978-3-642-60831-5_22</a>.","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={<a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">10.1007/978-3-642-60831-5_22</a>}, booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf der Heide, Friedhelm and Decker, Thomas}, year={1997} }"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-16T10:48:16Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","year":"1997","status":"public","title":"Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”","publication_identifier":{"isbn":["9783540630661","9783642608315"],"issn":["1431-472X"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Decker, Thomas","last_name":"Decker","first_name":"Thomas"}],"user_id":"15415","doi":"10.1007/978-3-642-60831-5_22","language":[{"iso":"eng"}],"_id":"16693"},{"page":"157-170","publisher":"Springer","_id":"16568","user_id":"14972","volume":1284,"status":"public","place":"Berlin, Heidelberg","citation":{"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.","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>.","ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 157–170, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","apa":"Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 157–170. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>","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={<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>}, 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} }","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science. Springer; 1997:157-170. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, vol. 1284, Springer, 1997, pp. 157–70, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>."},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/3-540-63397-9_13","year":"1997","title":"Dynamic data structures for realtime management of large geometric scenes","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard","last_name":"Strothmann"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"publication_status":"published","date_updated":"2026-02-23T16:05:33Z","intvolume":"      1284","date_created":"2020-04-15T11:44:36Z","type":"conference","department":[{"_id":"63"}],"publication":"5th Annual European Symposium on Algorithms (ESA '97)","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"}]},{"date_created":"2020-10-08T12:04:41Z","department":[{"_id":"63"}],"type":"journal_article","citation":{"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).” <i>Euro-Par 1996</i> I (1996): 299–306.","ama":"Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). <i>Euro-Par 1996</i>. 1996;I:299-306.","short":"F. Schwarze, F. Meyer auf der Heide, K. Schröder, 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).,” <i>Euro-Par 1996</i>, vol. I, pp. 299–306, 1996.","mla":"Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” <i>Euro-Par 1996</i>, vol. I, 1996, pp. 299–306.","apa":"Schwarze, F., Meyer auf der Heide, F., &#38; Schröder, K. (1996). Routing on Networks of Optical Crossbars (Extended Abstract). <i>Euro-Par 1996</i>, <i>I</i>, 299–306."},"publication":"Euro-Par 1996","_id":"19958","language":[{"iso":"eng"}],"page":"299-306","volume":"I","user_id":"15415","author":[{"full_name":"Schwarze, Frank","last_name":"Schwarze","first_name":"Frank"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Klaus","last_name":"Schröder","full_name":"Schröder, Klaus"}],"title":"Routing on Networks of Optical Crossbars (Extended Abstract).","status":"public","year":"1996","date_updated":"2022-01-06T06:54:17Z"},{"citation":{"short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>.; 1996.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Technical Report SFB, University of Paderborn, 1996.","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} }","mla":"Czumaj, Artur, et al. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. 1996.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1996). <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. 1996."},"report_number":"tr-rsfb-96-005","date_created":"2020-07-27T13:03:41Z","type":"report","department":[{"_id":"63"}],"title":"Contention Resolution in Hashing Based Shared Memory Simulations","year":"1996","status":"public","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"date_updated":"2022-01-06T06:53:11Z","series_title":"Technical Report SFB, University of Paderborn","_id":"17418","language":[{"iso":"eng"}],"user_id":"15415"},{"author":[{"last_name":"Grigoriev","first_name":"Dima","full_name":"Grigoriev, Dima"},{"first_name":"Marek","last_name":"Karpinski","full_name":"Karpinski, Marek"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Smolensky","first_name":"Roman","full_name":"Smolensky, Roman"}],"title":"A lower bound for randomized algebraic decision trees","status":"public","year":"1996","intvolume":"     65453","date_updated":"2022-01-06T06:53:11Z","language":[{"iso":"eng"}],"_id":"17419","series_title":"Lecture Notes in Computer Science","publisher":"Eurographics Symposium on Parallel Graphics and Visualization","page":"612-621","volume":65453,"user_id":"15415","citation":{"mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Proc. of 28th ACM-STOC</i>, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.","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} }","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: <i>Proc. of 28th ACM-STOC</i>. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in <i>Proc. of 28th ACM-STOC</i>, 1996, vol. 65453, pp. 612–621.","apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In <i>Proc. of 28th ACM-STOC</i> (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.","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.","chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In <i>Proc. of 28th ACM-STOC</i>, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996."},"publication":"Proc. of 28th ACM-STOC","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."}],"date_created":"2020-07-27T13:09:09Z","department":[{"_id":"63"}],"type":"conference"},{"date_updated":"2022-01-06T06:53:13Z","title":"A Realistic Cost Model for the Communication Time in Parallel Programs","year":"1996","publication_identifier":{"isbn":["905199267X"]},"author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Rethmann, Jochen","last_name":"Rethmann","first_name":"Jochen"},{"full_name":"Wachsmann, Alf","first_name":"Alf","last_name":"Wachsmann"}],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"publication":"3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)","type":"conference","department":[{"_id":"63"}],"file":[{"date_created":"2020-08-26T10:15:36Z","creator":"koala","success":1,"content_type":"application/pdf","file_id":"18354","date_updated":"2020-08-26T10:15:36Z","relation":"main_file","file_size":285707,"access_level":"closed","file_name":"hni-1454.pdf"}],"date_created":"2020-07-30T14:45:12Z","has_accepted_license":"1","status":"public","user_id":"15415","ddc":["000"],"page":"13–27","_id":"17483","publisher":"IOS Press","file_date_updated":"2020-08-26T10:15:36Z","citation":{"mla":"Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, IOS Press, 1996, pp. 13–27.","ama":"Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs. In: <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>. Amsterdam: IOS Press; 1996:13–27.","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} }","apa":"Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i> (pp. 13–27). Amsterdam: IOS Press.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the Communication Time in Parallel Programs,” in <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, 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.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost Model for the Communication Time in Parallel Programs.” In <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, 13–27. Amsterdam: IOS Press, 1996."},"place":"Amsterdam"},{"department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-08-03T13:11:02Z","place":"Berlin, Heidelberg","citation":{"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 <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996, pp. 369–376.","apa":"Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &#38; Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In <i>Lecture Notes in Computer Science</i> (pp. 369–376). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>","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.","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 <i>Lecture Notes in Computer Science</i>, 369–76. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>.","mla":"Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” <i>Lecture Notes in Computer Science</i>, 1996, pp. 369–76, doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>.","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={<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>}, 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} }","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: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996:369-376. doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>"},"publication":"Lecture Notes in Computer Science","user_id":"15415","doi":"10.1007/bfb0024725","language":[{"iso":"eng"}],"_id":"17564","page":"369-376","publication_status":"published","date_updated":"2022-01-06T06:53:15Z","author":[{"full_name":"Bäumker, Armin","first_name":"Armin","last_name":"Bäumker"},{"first_name":"Wolfgang","last_name":"Dittrich","full_name":"Dittrich, Wolfgang"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540616276","9783540706366"]},"year":"1996","status":"public","title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model"},{"department":[{"_id":"63"}],"type":"report","date_created":"2020-08-26T10:06:31Z","place":"Universität Paderborn","file":[{"date_created":"2020-08-26T10:05:35Z","creator":"koala","content_type":"application/pdf","success":1,"file_id":"18353","file_size":519632,"access_level":"closed","file_name":"tr-rsfb-96-007.pdf","date_updated":"2020-08-26T10:05:35Z","relation":"main_file"}],"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 multi­linear 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 on­line the optimal parameter values for an access to a global variable achieves good speed ups.\r\n"}],"citation":{"apa":"Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn, 1996.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn, 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.","mla":"Fischer, Matthias, et al. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. 1996.","ama":"Fischer M, Rethmann J, Wachsmann A. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn; 1996.","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} }"},"file_date_updated":"2020-08-26T10:05:35Z","user_id":"15415","ddc":["000"],"_id":"18352","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:53:30Z","author":[{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"},{"full_name":"Rethmann, Jochen","last_name":"Rethmann","first_name":"Jochen"},{"full_name":"Wachsmann, Alf","last_name":"Wachsmann","first_name":"Alf"}],"title":"A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware","year":"1996","status":"public"},{"date_created":"2018-04-03T09:29:45Z","department":[{"_id":"79"},{"_id":"63"}],"type":"dissertation","citation":{"short":"C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.","chicago":"Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn, Germany, 1996.","apa":"Scheideler, C. (1996). <i>Universal routing strategies</i>. University of Paderborn, Germany.","ieee":"C. Scheideler, <i>Universal routing strategies</i>. University of Paderborn, Germany, 1996.","ama":"Scheideler C. <i>Universal Routing Strategies</i>. University of Paderborn, Germany; 1996.","bibtex":"@book{Scheideler_1996, title={Universal routing strategies}, publisher={University of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }","mla":"Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn, Germany, 1996."},"_id":"2181","language":[{"iso":"eng"}],"publisher":"University of Paderborn, Germany","user_id":"14955","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"year":"1996","title":"Universal routing strategies","status":"public","date_updated":"2022-01-06T06:55:15Z"},{"user_id":"14955","doi":"10.1016/0304-3975(96)00032-1","page":"245--281","language":[{"iso":"eng"}],"_id":"2182","date_updated":"2022-01-06T06:55:16Z","year":"1996","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","status":"public","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"type":"journal_article","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-04-03T09:30:20Z","issue":"2","publication":"Theor. Comput. Sci.","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2, 1996, pp. 245--281, doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor Comput Sci</i>. 1996;(2):245--281. doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>","bibtex":"@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor. Comput. Sci.</i>, (2), 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” <i>Theor. Comput. Sci.</i>, no. 2, pp. 245--281, 1996.","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2 (1996): 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281."}},{"file":[{"creator":"florida","date_created":"2018-04-12T07:01:11Z","date_updated":"2018-04-12T07:10:17Z","relation":"main_file","file_size":248409,"access_level":"open_access","file_name":"FOCS96.pdf","content_type":"application/pdf","file_id":"2281"}],"date_created":"2018-04-03T09:31:52Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","file_date_updated":"2018-04-12T07:10:17Z","publication":"FOCS","citation":{"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 <i>FOCS</i>, 370--379, 1996.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: <i>FOCS</i>. ; 1996:370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in <i>FOCS</i>, 1996, pp. 370--379.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In <i>FOCS</i> (pp. 370--379).","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” <i>FOCS</i>, 1996, pp. 370--379."},"page":"370--379","_id":"2183","urn":"21832","language":[{"iso":"eng"}],"user_id":"14955","ddc":["040"],"year":"1996","title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","status":"public","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:55:17Z","has_accepted_license":"1"}]