Concept

Throughput

Publications associées (380)

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks

The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions nevertheless occur. Opportunistic routing limits these retransmissions by taking adv ...

Springer Berlin / Heidelberg2009

A Micropower Neural Recording Amplifier with Improved Noise Efficiency Factor

Alexandre Schmid, Yusuf Leblebici, Vahid Majidzadeh Bafar

This article presents a neural recording amplifier suitable for large-scale integration with multi-electrode arrays (MEAs) in very low-power microelectronic cortical implants. The proposed amplifier is the most energy-efficient structure reported to date, ...

2009

A Method for Calculating Hard QoS Guarantees for Networks-on-Chip

Giovanni De Micheli, Luca Benini, Srinivasan Murali, Federico Angiolini, Hamid Sarbazi-Azad, Dara Rahmati

Many Networks-on-Chip (NoC) applications exhibit one or more critical traffic flows that require hard Quality of Service (QoS). Guaranteeing bandwidth and latency for such real time flows is crucial. In this paper, we present novel methods to efficiently c ...

2009

ProtoFlex: Towards Scalable, Full-System Multiprocessor Simulations Using FPGAs

Babak Falsafi

Functional full-system simulators are powerful and versatile research tools for accelerating architectural exploration and advanced software development. Their main shortcoming is limited throughput when simulating large multiprocessor systems with hundred ...

2009

An analytic finite capacity queueing network model capturing the propagation of congestion and blocking

Michel Bierlaire, Carolina Osorio Pizano

Analytic queueing network models often assume infinite capacity queues due to the difficulty of grasping the between-queue correlation. This correlation can help to explain the propagation of congestion. We present an analytic queueing network model which ...

2009

ReSim, a Trace-Driven, Reconfigurable ILP Processor Simulator

Dionysios Pnevmatikatos, Sotiria Fytraki

Modern processors are becoming more complex and as features and application size increase, their evaluation is becoming more time-consuming. To date, design space exploration relies on extensive use of software simulation that when highly accurate is slow. ...

2009

Self-organized fault-tolerant routing in peer-to-peer overlays

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

One Bit Is Enough: a Framework for Deploying Explicit Feedback Congestion Control Protocols

Dejan Kostic, Nedeljko Vasic

Since the bandwidth-delay products of Internet links keep increasing, issues with TCP's convergence time, throughput, and amount of queuing in these environments are becoming more pressing. As we move toward the next-generation Internet, it is important to ...

2009

Robust IEEE 802.15.4a Energy Detection Receiver Using Statistical Interference Modeling

Jean-Yves Le Boudec, Ruben Merz, Manuel Flury

Energy-detection is appealing for IEEE 802.15.4a receivers as it allows to exploit the ranging capabilities and the multipath resistance of impulse-radio UWB at a reasonable complexity. IEEE 802.15.4a receivers operate with interference created by uncontro ...

2009

Robust Synchronization of Absolute and Difference Clocks over Networks

Satish Babu Korada

We present a detailed re-examination of the problem of inexpensive yet accurate clock synchronization for networked devices. Based on an empirically validated, parsimonious abstraction of the CPU oscillator as a timing source, accessible via the TSC regist ...

2009

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