![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Exploring the optimal strategy for large-scale data movement in high-performance networks"
@inproceedings{DBLP:conf/ipccc/BrownZWYZ12, author = {Patrick Brown and Mengxia Michelle Zhu and Qishi Wu and Daqing Yun and Jason Zurawski}, title = {Exploring the optimal strategy for large-scale data movement in high-performance networks}, booktitle = {31st {IEEE} International Performance Computing and Communications Conference, {IPCCC} 2012, Austin, TX, USA, December 1-3, 2012}, pages = {181--182}, year = {2012}, crossref = {DBLP:conf/ipccc/2012}, url = {https://doi.org/10.1109/PCCC.2012.6407676}, doi = {10.1109/PCCC.2012.6407676}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipccc/BrownZWYZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ipccc/2012, title = {31st {IEEE} International Performance Computing and Communications Conference, {IPCCC} 2012, Austin, TX, USA, December 1-3, 2012}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://ieeexplore.ieee.org/xpl/conhome/6389872/proceeding}, isbn = {978-1-4673-4881-2}, timestamp = {Sun, 16 Jun 2024 19:47:07 +0200}, biburl = {https://dblp.org/rec/conf/ipccc/2012.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.