default search action
Sven-Arne Reinemo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Andreas Thune
, Sven-Arne Reinemo, Tor Skeie, Xing Cai
Detailed Modeling of Heterogeneous and Contention-Constrained Point-to-Point MPI Communication. IEEE Trans. Parallel Distributed Syst. 34(5): 1580-1593 (2023) - 2022
- [c23]José Rocher-González, Ernst Gunnar Gran, Sven-Arne Reinemo, Tor Skeie, Jesús Escudero-Sahuquillo
Adaptive Routing in InfiniBand Hardware. CCGRID 2022: 463-472
2010 – 2019
- 2015
- [j7]Wei Lin Guay, Sven-Arne Reinemo
Early experiences with live migration of SR-IOV enabled InfiniBand. J. Parallel Distributed Comput. 78: 39-52 (2015) - 2014
- [j6]Jesús Escudero-Sahuquillo
A new proposal to deal with congestion in InfiniBand-based fat-trees. J. Parallel Distributed Comput. 74(1): 1802-1819 (2014) - [c22]Sven-Arne Reinemo
Multi-homed Fat-Tree Routing with InfiniBand. PDP 2014: 122-129 - 2013
- [c21]Bartosz Bogdanski, Bjørn Dag Johnsen, Sven-Arne Reinemo
Making the Network Scalable: Inter-subnet Routing in InfiniBand. Euro-Par 2013: 685-698 - 2012
- [j5]Bartosz Bogdanski, Sven-Arne Reinemo
sFtree: A fully connected and deadlock-free switch-to-switch routing algorithm for fat-trees. ACM Trans. Archit. Code Optim. 8(4): 55:1-55:20 (2012) - [c20]Wei Lin Guay, Sven-Arne Reinemo
A Scalable Signalling Mechanism for VM Migration with SR-IOV over Infiniband. ICPADS 2012: 384-391 - [c19]Ernst Gunnar Gran
Exploring the Scope of the InfiniBand Congestion Control Mechanism. IPDPS 2012: 1131-1143 - [c18]Bartosz Bogdanski, Bjørn Dag Johnsen, Sven-Arne Reinemo
Discovery and Routing of Degraded Fat-Trees. PDCAT 2012: 697-702 - 2011
- [c17]Wei Lin Guay, Sven-Arne Reinemo
A Scalable Method for Signalling Dynamic Reconfiguration Events with OpenSM. CCGRID 2011: 332-341 - [c16]Ernst Gunnar Gran
On the Relation between Congestion Control, Switch Arbitration and Fairness. CCGRID 2011: 342-351 - [c15]Wei Lin Guay, Bartosz Bogdanski, Sven-Arne Reinemo
vFtree - A Fat-Tree Routing Algorithm Using Virtual Lanes to Alleviate Congestion. IPDPS 2011: 197-208 - [c14]Ernst Gunnar Gran
InfiniBand congestion control: modelling and validation. SimuTools 2011: 390-397 - 2010
- [j4]Sven-Arne Reinemo
Ethernet for High-Performance Data centers: On the New IEEE Datacenter Bridging Standards. IEEE Micro 30(4): 42-51 (2010) - [c13]Wei Lin Guay, Sven-Arne Reinemo
Host Side Dynamic Reconfiguration with InfiniBand. CLUSTER 2010: 126-135 - [c12]Bartosz Bogdanski, Frank Olaf Sem-Jacobsen, Sven-Arne Reinemo
Achieving Predictable High Performance in Imbalanced Fat Trees. ICPADS 2010: 381-388 - [c11]Ernst Gunnar Gran
First experiences with congestion control in InfiniBand hardware. IPDPS 2010: 1-12 - [p1]Olav Lysne, Tor Skeie, Sven-Arne Reinemo, Frank Olaf Sem-Jacobsen, Nils Agne Nordbotten:
Scalable Interconnection Networks. Simula Research Laboratory 2010: 129-162
2000 – 2009
- 2009
- [c10]Åshild Grønstad Solheim, Olav Lysne, Tor Skeie, Thomas Sødring, Sven-Arne Reinemo
A framework for routing and resource allocation in network virtualization. HiPC 2009: 129-139 - 2008
- [j3]Olav Lysne, Sven-Arne Reinemo
Interconnection Networks: Architectural Challenges for Utility Computing Data Centers. Computer 41(9): 62-69 (2008) - [c9]Thomas Sødring, Åshild Grønstad Solheim, Tor Skeie, Sven-Arne Reinemo:
An Analysis of Connectivity and Yield for 2D Mesh Based NoC with Interconnect Router Failures. DSD 2008: 173-178 - [c8]Ernst Gunnar Gran
Dragon kill points: loot distribution in MMORPGs. NETGAMES 2008: 100-101 - 2007
- [c7]Sven-Arne Reinemo
Effective Shortest Path Routing for Gigabit Ethernet. ICC 2007: 6419-6424 - [c6]Andres Mejia, José Flich
Boosting Ethernet Performance by Segment-Based Routing. PDP 2007: 55-62 - 2006
- [j2]Sven-Arne Reinemo
An overview of QoS capabilities in infiniband, advanced switching interconnect, and ethernet. IEEE Commun. Mag. 44(7): 32-38 (2006) - [j1]Olav Lysne, Tor Skeie, Sven-Arne Reinemo
Layered Routing in Irregular Networks. IEEE Trans. Parallel Distributed Syst. 17(1): 51-65 (2006) - [c5]Andres Mejia, José Flich
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori. IPDPS 2006 - 2005
- [c4]Sven-Arne Reinemo
Ethernet as a Lossless Deadlock Free System Area Network. ISPA 2005: 901-914 - 2004
- [c3]Frank Olaf Sem-Jacobsen, Sven-Arne Reinemo, Tor Skeie, Olav Lysne:
Achieving Flow Level QoS in Cut-Through Networks Through Admission Control and DiffServ. PDPTA 2004: 1084-1090 - 2003
- [c2]Sven-Arne Reinemo
Admission Control for DiffServ Based Quality of Service in Cut-Through Networks. HiPC 2003: 118-129 - [c1]Sven-Arne Reinemo, Tor Skeie, Olav Lysne:
Applying the DiffServ Model on Cut-Through Networks. PDPTA 2003: 1089-1098
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: