Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Andreas Ripke"'
Publikováno v:
CloudNet
Deploying applications in federated clouds is becoming increasingly important. The ability to place application components in various locations is appealing to a large set of distributed applications. Components spread across a number of clouds still
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa94a96abc8847151af1f4ec9beec066
http://juuli.fi/Record/0283740717
http://juuli.fi/Record/0283740717
Autor:
Jesper Larsson Träff, Christian H. Siebert, Andreas Ripke, Pavan Balaji, William Gropp, Rajeev Thakur
Publikováno v:
The International Journal of High Performance Computing Applications. 24:58-68
We describe and evaluate a new pipelined algorithm for large, irregular all-gather problems. In the irregular allgather problem each process in a set of processes contributes individual data of possibly different size, and all processes have to colle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c66b30ae5a5b6264021cd93a875f81a
https://doi.org/10.1177/1094342009359013
https://doi.org/10.1177/1094342009359013
Autor:
Andreas Ripke, Jesper Larsson Träff
Publikováno v:
Journal of Parallel and Distributed Computing. 68:887-901
We develop and implement an optimal broadcast algorithm for fully connected processor networks under a bidirectional communication model in which each processor can simultaneously send a message to one processor and receive a message from another, po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4061458c451d5786ce15149aa8e5b1ae
https://doi.org/10.1016/j.jpdc.2007.12.001
https://doi.org/10.1016/j.jpdc.2007.12.001
Autor:
Simon Oechsner, Andreas Ripke
Publikováno v:
NetSoft
In the context of virtualization and cloud computing, a currently interesting topic is the movement of network functions into the cloud. Since these Virtualized Network Functions have high performance and availability requirements, the placement and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e47c40a92b2ca3144a859425df571fb
https://doi.org/10.1109/netsoft.2015.7116178
https://doi.org/10.1109/netsoft.2015.7116178
Publikováno v:
ICUMT
Moving services to the cloud is a trend that has been going on for years now, with a constant increase in sophistication and complexity of such services. Today, even critical infrastructure operators are considering moving their services and data to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5570fd82abf7ce9c0ab32ce38005d382
https://doi.org/10.1109/icumt.2013.6798428
https://doi.org/10.1109/icumt.2013.6798428
Publikováno v:
GLOBECOM
The looming depletion of the public IPv4 address space has recently inspired a number of proposals intended to work around the inevitable address shortage. Broadly, all of these can be classified as address sharing, tunneling and translation mechanis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2acf7c5ced9ee9719c62f68ef6f2ab99
https://doi.org/10.1109/glocom.2010.5683449
https://doi.org/10.1109/glocom.2010.5683449
Autor:
Andreas Ripke, William Gropp, Rajeev Thakur, Jesper Larsson Träff, Pavan Balaji, Christian H. Siebert
Publikováno v:
Recent Advances in Parallel Virtual Machine and Message Passing Interface ISBN: 9783540874744
PVM/MPI
PVM/MPI
We present and evaluate a new, simple, pipelined algorithm for large, irregularall-gather problems, useful for the implementation of the MPI_Allgatherv collective operation of MPI. The algorithm can be viewed as an adaptation of a linear ring algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7806e3d9ece0cf546b823c479d2abff
https://doi.org/10.1007/978-3-540-87475-1_16
https://doi.org/10.1007/978-3-540-87475-1_16
Autor:
Jesper Larsson Träff, Andreas Ripke
Publikováno v:
High Performance Computing and Communications ISBN: 9783540290315
HPCC
HPCC
We develop and implement a new optimal broadcast algorithm for fully connected, bidirectional, one-ported networks under a linear communication cost model. For any number of processors p the number of communication rounds required to broadcast N bloc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe3c001ee48fe9e322bb67d0cbd700d6
https://doi.org/10.1007/11557654_8
https://doi.org/10.1007/11557654_8
Autor:
Jesper Larsson Träff, Andreas Ripke
Publikováno v:
Recent Advances in Parallel Virtual Machine and Message Passing Interface ISBN: 9783540290094
PVM/MPI
PVM/MPI
We describe and and evaluate the adaption of a new, optimal broadcast algorithm for “flat”, fully connected networks to clusters of SMP nodes. The optimal broadcast algorithm improves over other commonly used broadcast algorithms (pipelined binar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0245a76b8563ba173d4a2ae4abe63cdb
https://doi.org/10.1007/11557265_11
https://doi.org/10.1007/11557265_11