[{"publication":"Informatik ’97 Informatik als Innovationsmotor","place":"Berlin, Heidelberg","user_id":"15415","date_updated":"2022-01-06T06:52:54Z","citation":{"short":"F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.","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} }","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.","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","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.","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.","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"},"_id":"16693","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Decker","first_name":"Thomas","full_name":"Decker, Thomas"}],"date_created":"2020-04-16T10:48:16Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1431-472X"],"isbn":["9783540630661","9783642608315"]},"status":"public","publication_status":"published","title":"Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”","year":"1997","doi":"10.1007/978-3-642-60831-5_22","type":"book_chapter","department":[{"_id":"63"}]},{"_id":"19958","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"},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"}],"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.","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.","mla":"Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 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} }","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).,” Euro-Par 1996, vol. I, pp. 299–306, 1996."},"user_id":"15415","publication":"Euro-Par 1996","date_updated":"2022-01-06T06:54:17Z","page":"299-306","volume":"I","type":"journal_article","department":[{"_id":"63"}],"status":"public","title":"Routing on Networks of Optical Crossbars (Extended Abstract).","year":"1996","language":[{"iso":"eng"}],"date_created":"2020-10-08T12:04:41Z"},{"language":[{"iso":"eng"}],"date_created":"2020-07-27T13:03:41Z","department":[{"_id":"63"}],"type":"report","report_number":"tr-rsfb-96-005","year":"1996","title":"Contention Resolution in Hashing Based Shared Memory Simulations","status":"public","date_updated":"2022-01-06T06:53:11Z","user_id":"15415","series_title":"Technical Report SFB, University of Paderborn","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"_id":"17418","citation":{"ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, 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.","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} }","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention Resolution in Hashing Based Shared Memory Simulations.","mla":"Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996.","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."}},{"series_title":"Lecture Notes in Computer Science","volume":65453,"publication":"Proc. of 28th ACM-STOC","user_id":"15415","date_updated":"2022-01-06T06:53:11Z","page":"612-621","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.","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.","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.","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} }","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.","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.","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."},"abstract":[{"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.","lang":"eng"}],"_id":"17419","author":[{"first_name":"Dima","full_name":"Grigoriev, Dima","last_name":"Grigoriev"},{"first_name":"Marek","full_name":"Karpinski, Marek","last_name":"Karpinski"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Smolensky, Roman","last_name":"Smolensky","first_name":"Roman"}],"intvolume":" 65453","language":[{"iso":"eng"}],"date_created":"2020-07-27T13:09:09Z","publisher":"Eurographics Symposium on Parallel Graphics and Visualization","status":"public","title":"A lower bound for randomized algebraic decision trees","year":"1996","type":"conference","department":[{"_id":"63"}]},{"citation":{"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.","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} }","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.","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.","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.","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.","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."},"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":[{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Jochen","full_name":"Rethmann, Jochen","last_name":"Rethmann"},{"last_name":"Wachsmann","full_name":"Wachsmann, Alf","first_name":"Alf"}],"_id":"17483","page":"13–27","date_updated":"2022-01-06T06:53:13Z","place":"Amsterdam","user_id":"15415","publication":"3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)","year":"1996","title":"A Realistic Cost Model for the Communication Time in Parallel Programs","status":"public","ddc":["000"],"department":[{"_id":"63"}],"has_accepted_license":"1","type":"conference","file":[{"creator":"koala","file_name":"hni-1454.pdf","file_size":285707,"date_updated":"2020-08-26T10:15:36Z","access_level":"closed","content_type":"application/pdf","relation":"main_file","success":1,"file_id":"18354","date_created":"2020-08-26T10:15:36Z"}],"publication_identifier":{"isbn":["905199267X"]},"language":[{"iso":"eng"}],"date_created":"2020-07-30T14:45:12Z","file_date_updated":"2020-08-26T10:15:36Z","publisher":"IOS Press"},{"publication_status":"published","status":"public","title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model","year":"1996","doi":"10.1007/bfb0024725","type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-03T13:11:02Z","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540616276","9783540706366"],"issn":["0302-9743","1611-3349"]},"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 Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.","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} }","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.","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","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.","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","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."},"_id":"17564","author":[{"full_name":"Bäumker, Armin","last_name":"Bäumker","first_name":"Armin"},{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"}],"place":"Berlin, Heidelberg","publication":"Lecture Notes in Computer Science","user_id":"15415","date_updated":"2022-01-06T06:53:15Z","page":"369-376"},{"citation":{"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.","mla":"Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 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.","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.","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} }","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.","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."},"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"}],"_id":"18352","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Rethmann, Jochen","first_name":"Jochen","last_name":"Rethmann"},{"last_name":"Wachsmann","full_name":"Wachsmann, Alf","first_name":"Alf"}],"place":"Universität Paderborn","user_id":"15415","date_updated":"2022-01-06T06:53:30Z","status":"public","title":"A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware","year":"1996","type":"report","file":[{"date_updated":"2020-08-26T10:05:35Z","access_level":"closed","content_type":"application/pdf","date_created":"2020-08-26T10:05:35Z","file_id":"18353","relation":"main_file","success":1,"creator":"koala","file_name":"tr-rsfb-96-007.pdf","file_size":519632}],"has_accepted_license":"1","ddc":["000"],"department":[{"_id":"63"}],"date_created":"2020-08-26T10:06:31Z","language":[{"iso":"eng"}],"file_date_updated":"2020-08-26T10:05:35Z"},{"type":"dissertation","department":[{"_id":"79"},{"_id":"63"}],"status":"public","title":"Universal routing strategies","year":"1996","publisher":"University of Paderborn, Germany","language":[{"iso":"eng"}],"date_created":"2018-04-03T09:29:45Z","_id":"2181","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"citation":{"apa":"Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.","mla":"Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.","chicago":"Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.","ieee":"C. Scheideler, Universal routing strategies. University of Paderborn, Germany, 1996.","short":"C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.","bibtex":"@book{Scheideler_1996, title={Universal routing strategies}, publisher={University of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }","ama":"Scheideler C. Universal Routing Strategies. University of Paderborn, Germany; 1996."},"user_id":"14955","date_updated":"2022-01-06T06:55:15Z"},{"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","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} }","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.","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.","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.","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"},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"_id":"2182","date_updated":"2022-01-06T06:55:16Z","page":"245--281","publication":"Theor. Comput. Sci.","user_id":"14955","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","year":"1996","doi":"10.1016/0304-3975(96)00032-1","status":"public","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article","date_created":"2018-04-03T09:30:20Z","language":[{"iso":"eng"}],"issue":"2"},{"file":[{"file_size":248409,"creator":"florida","file_name":"FOCS96.pdf","file_id":"2281","date_created":"2018-04-12T07:01:11Z","relation":"main_file","date_updated":"2018-04-12T07:10:17Z","access_level":"open_access","content_type":"application/pdf"}],"type":"conference","has_accepted_license":"1","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"status":"public","title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","year":"1996","file_date_updated":"2018-04-12T07:10:17Z","language":[{"iso":"eng"}],"date_created":"2018-04-03T09:31:52Z","_id":"2183","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"urn":"21832","oa":"1","citation":{"apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 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.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996: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.","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.","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} }","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379."},"user_id":"14955","publication":"FOCS","date_updated":"2022-01-06T06:55:17Z","page":"370--379"}]