Randomized Load Balancing in Large Bandwidth Sharing Systems

Seminar

Speaker:

Ravi R. Mazumdar

Organisers:

Sandeep K Juneja

Time:

Thursday, 7 August 2014, 16:00 to 17:00

Venue:

AG-80

Webpage:

https://ece.uwaterloo.ca/~mazum/

Abstract: Processor sharing models occur in a wide variety of situations for example in models of internet bottlenecks. They are good models for bandwidth sharing as well as being solutions to NUM for logarithmic utilities.

Test-Driven Detection and Repair of Data Races in Structured Parallel Programs

Seminar

Speaker:

Vivek Sarkar

Organisers:

R K Shyamasundar

Time:

Wednesday, 30 July 2014, 11:30 to 12:30

Venue:

AG-80

Webpage:

http://vsarkar.blogs.rice.edu/

Abstract: In this talk, we focus on a programmability challenge for parallel computing that can be captured by the following question: how easy or difficult is it to identify and repair bugs when developing a parallel program?

Communication Complexity

VSRP Talk

Speaker:

Arkadev Chattopadhyay, TIFR

Organisers:

Rahul Vaze

Time:

Friday, 4 July 2014, 14:30 to 15:30

Venue:

AG-80

Webpage:

http://www.tcs.tifr.res.in/~arkadev/

Abstract: Alice and Bob want to compute jointly/collaboratively a function. They are both super-computers. However, part of the input is with Alice and the other part is with Bob.

Minimizing the Number of Unhappy Singles: An Improved Approximation Algorithm for the Stable Marriage Problem With One-sided Ties

Seminar

Speaker:

Chien-Chung Huang

Organisers:

Kavitha Telikepalli

Time:

Friday, 13 June 2014, 11:30 to 12:30

Venue:

AG-80

Webpage:

http://www.cse.chalmers.se/~huangch/

Abstract: We consider the problem of computing a large stable matching in a bipartite graph G = (A U B, E) where each vertex ranks its neighbors in an order of preference, perhaps involving ties.The goal is to compute a large stable matching.