#### Filter Results:

#### Publication Year

1998

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Florin Dobrian, Vyas Sekar, Asad Awan, Ion Stoica, Dilip Antony Joseph, Aditya Ganjam +2 others
- SIGCOMM
- 2011

As the distribution of the video over the Internet becomes main- stream and its consumption moves from the computer to the TV screen, user expectation for high quality is constantly increasing. In this context, it is crucial for content providers to understand if and how video quality affects user engagement and how to best invest their resources to… (More)

- Xi Liu, Florin Dobrian, Henry Milner, Junchen Jiang, Vyas Sekar, Ion Stoica +1 other
- SIGCOMM
- 2012

Video traffic already represents a significant fraction of today's traffic and is projected to exceed 90% in the next five years. In parallel, user expectations for a high quality viewing experience (e.g., low startup delays, low buffering, and high bitrates) are continuously increasing. Unlike traditional workloads that either require low latency (e.g.,… (More)

A parallel, fully coupled, nonlinearly implicit Newton-Krylov-Schwarz algorithm is proposed for the numerical simulation of a magnetic reconnection problem described by a system of resistive Hall magnetohydrodynamics equations in slab symmetry. A key component of the algorithm is a restricted additive Schwarz preconditioner defined for problems with doubly… (More)

We discuss the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical graph problems, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency, poor data locality, and high ratio of data access to computation costs, making it challenging to achieve… (More)

We consider two problems related to I/O: First, find the minimum primary memory size required to factor a sparse, symmetric matrix when permitted to read and write the data exactly once. Second, find the minimum data traffic between core and external memory when permitted to read and write the data many times. These problems are likely to be intractable in… (More)

We discuss the object-oriented design of a software package for solving sparse, symmetric systems of equations (positive deenite and indeenite) by direct methods. At the highest layers, we decouple data structure classes from algorithmic classes for exibility. W e describe the important structural and algorithmic classes in our design, and discuss the… (More)

We discuss parallel algorithms for computing maximum matchings in bipartite graphs on multithreaded computers, reporting for the first time, good speedups for the maximum cardinality matching problem. Experiments with serial matching algorithms have shown that their performance is sensitive to the order in which vertices are processed. In the execution of a… (More)

- ‹
- 1
- ›