{"place":"Amsterdam","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} }","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., &#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.","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.","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."},"publication":"3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)","has_accepted_license":"1","author":[{"id":"146","first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer"},{"full_name":"Rethmann, Jochen","last_name":"Rethmann","first_name":"Jochen"},{"full_name":"Wachsmann, Alf","last_name":"Wachsmann","first_name":"Alf"}],"department":[{"_id":"63"}],"file":[{"file_id":"18354","relation":"main_file","date_updated":"2020-08-26T10:15:36Z","file_size":285707,"date_created":"2020-08-26T10:15:36Z","access_level":"closed","creator":"koala","success":1,"file_name":"hni-1454.pdf","content_type":"application/pdf"}],"publisher":"IOS Press","publication_identifier":{"isbn":["905199267X"]},"date_updated":"2022-01-06T06:53:13Z","status":"public","date_created":"2020-07-30T14:45:12Z","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."}],"_id":"17483","file_date_updated":"2020-08-26T10:15:36Z","page":"13–27","type":"conference","language":[{"iso":"eng"}],"user_id":"15415","title":"A Realistic Cost Model for the Communication Time in Parallel Programs","year":"1996","ddc":["000"]}