Concept

Border Gateway Protocol

Publications associées (106)

Turning PathFinder Upside -Down: 1-4,xploring FPGA Switch -Blocks by Negotiating Switch Presence

Automated switch-block exploration gains in importance as technology scaling brings more emphasis on the physical constraints, making it insufficient to rely on abstract measures of routability alone. In this work, we take an approach that significantly di ...

IEEE COMPUTER SOC2021

Two-Step Synthesis of Linear and Bent Dicarboxylic Acid Metalloligands with Lengths of up to 3 nm

Rosario Scopelliti, Kay Severin, Farzaneh Fadaei Tirani, Suzanne Maria Jansze, Ophélie Marie Planes

Nanometer-sized polycarboxylate ligands are interesting building blocks for metallasupramolecular chemistry, but access to these compounds is often limited by complicated synthetic pathways. Here, we describe a simple two-step protocol, which allows prepar ...

2020

Extending R2P2 with Congestion Control and Request-Level Scheduling

Konstantinos Prasopoulos

Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...

2020

Development of collapse-consistent loading protocols for experimental testing of steel columns

Dimitrios Lignos

In order to effectively utilize results from quasi-static cyclic testing on structural components for the earthquake-induced collapse risk quantification of structures, the need exists to establish collapse-consistent loading protocols representing the asy ...

2020

Influence of load history on the force-displacement response of in-plane loaded unreinforced masonry walls

Katrin Beyer, Bastian Valentin Wilding, Kiarash Mohtasham Dolatshahi

Empirical drift capacity models for in-plane loaded unreinforced masonry (URM) walls are derived from results of quasi-static cyclic shear-compression tests. The experimentally determined drift capacities are, however, dependent on the applied demand, i.e. ...

2017

PdII2L4-type coordination cages up to three nanometers in size

Rosario Scopelliti, Kay Severin, Suzanne Maria Jansze, Matthew David Wise

The utilization of large ligands in coordination-based self-assembly represents an attractive strategy for the construction of supramolecular assemblies more than two nanometers in size. However, the implementation of this strategy is hampered by the fact ...

2017

Evolution of grain boundary network topology in 316L austenitic stainless steel during powder hot isostatic pressing

Cyril Cayron

The grain boundary network evolution of 316L austenitic steel powder during its densification by hot isostatic pressing (HIPing) was investigated. While the as-received powder contained a network of random high angle grain boundaries, the fully consolidate ...

2017

Frugal Topology Construction for Stream Aggregation in the Cloud

Rachid Guerraoui, Rhicheek Patra, Bao Duy Tran

Aggregation of streamed data is key to the expansion of the Internet of Things. This paper addresses the problem of designing a topology for reliably aggregating data flows from many devices arriving at a datacenter. Reliability here means ensuring operati ...

Ieee2016

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Miroslav Popovic

Reliable packet delivery within stringent delay-constraints is of paramount importance to mission-critical computer applications with hard real-time constraints. Because retransmission and coding techniques counteract the delay requirements, reliability ma ...

Institute of Electrical and Electronics Engineers2016

A Full-Capacity Local Routing Architecture for FPGAs

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Xifan Tang

Reconfigurable systems employ highly-routable local routing architecture to interconnect generic fine-grain logic blocks. Commercial FPGAs employ 50% sparse crossbars rather than fully-connected crossbars in their local routing architecture to trade off be ...

2016

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search