--- _id: '18145' abstract: - lang: ger text: Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem Internet" - lang: eng text: Award for the Article "Multimedia-based Expedition of our World with the Internet" author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Tamás full_name: Lukovszki, Tamás last_name: Lukovszki citation: ama: Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998. apa: Ziegler, M., Fischer, M., & Lukovszki, T. (1998). Multimediale Entdeckungsreisen unserer Welt mit dem Internet. bibtex: '@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}, year={1998} }' chicago: Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998. ieee: M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998. mla: Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998. short: M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998. date_created: 2020-08-24T09:55:41Z date_updated: 2022-01-06T06:53:26Z department: - _id: '63' language: - iso: eng status: public title: Multimediale Entdeckungsreisen unserer Welt mit dem Internet type: report user_id: '15415' year: '1998' ... --- _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: '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: '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 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" 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' ...