Person

Emin Gabrielyan

This person is no longer with EPFL

Related publications (11)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Rating of Routing by Redundancy Overall Need

Emin Gabrielyan

Thanks to the large buffering time of off-line streaming applications, erasure resilient Forward Error Correction (FEC) codes can improve the reliability of communication particularly well. However real-time streaming puts hard restrictions on the buffer s ...

2006

The main objectives pursued by parallelism in communications are network capacity enhancement and fault-tolerance. Efficiently enhancing the capacity of a network by parallel communications is a non-trivial task. Some applications may also allow one to spl ...

EPFL2006

Reliable multi-path routing schemes for real-time streaming

Roger Hersch, Emin Gabrielyan

In off-line streaming, packet level erasure resilient forward error correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the extremely short playback buffering time makes FEC inefficient for protecting a s ...

IEEE Comput. Soc2006

In off-line packetized streaming, rateless forward error correction (FEC) codes spectacularly improve the reliability of transmission over lossy networks. This success relies on time diversity, which in its turn relies on unrestricted buffering time at the ...

IEEE Comput. Soc2006

Using forward error correction (FEC) in off-line streaming, permitting large buffers, yields spectacular results, but real-time streaming puts hard restrictions on the buffer size and therefore does not allow FEC to deal with long link failures on a single ...

IEEE2006

Erasure resilient FEC codes in off-line packetized streaming rely on time diversity. This requires unrestricted buffering time at the receiver. In real-time streaming the playback buffering time must be very short. Path diversity is an orthogonal strategy. ...

2004

For collective communications, the upper limit of a network's capacity is its liquid throughput. The liquid throughput corresponds to the flow of a liquid in an equivalent network of pipes. However, in communication networks, the aggregate throughput of a ...

CSREA Press, Bogart, GA 30622, United States2004

Efficient liquid schedule search strategies for collective communications

Roger Hersch, Emin Gabrielyan

The upper limit of a network's capacity is its liquid throughput. The liquid throughput corresponds to the flow of a liquid in an equivalent network of pipes. However, the aggregate throughput of a collective communication pattern (traffic) scheduled accor ...

Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States2004

A method is proposed for the optimal scheduling of collective data exchanges relying on the knowledge of the underlying network topology. The concept of liquid schedules is introduced. Liquid schedules ensure the maximal utilization of a network's bottlene ...

IEEE2003

This paper presents the design and evaluation of a Striped File I/O (SFIO) library for parallel I/O within an MPI environment. We present techniques for optimizing communications and disk accesses for small striping factors. Using MPI derived datatype capa ...

IEEE Computer Society2001