Theory of Distributed Systems (TDS)

	Calvin Newport: Distributed Algorithsm in a Wireless World Friday, November 15, 2013 - 1:00pm to 2:30pm This talk is about the role of distributed algorithm theory in the increasingly important wireless network setting. It presents three big ideas refined from my ten years of experience working on this topic.
	Dan Alistarh: A Practical Renaming Algorithm Friday, October 25, 2013 - 1:00pm to 2:30pm Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small set of names. It has been extensively studied from the (theoretical) point of view of
	Erez Kantor: Minimizing Storage and Communication Costs in CDNs Friday, October 4, 2013 - 1:00pm to 2:30pm In this meeting, I will talk about Content Delivery Networks (CDNs). In CDNs, a video file can be stored in multiple places so that the request of each user is served from a location that is nearby to the user. This minimizes the delivery costs, but is associated with a storage cost.
	Viveck Cadambe: Coded Atomic Shared Memory Emulation for Message Passing Architectures Friday, September 20, 2013 - 1:00pm to 2:30pm In distributed storage systems that store data, a common requirement is that the data is available to the users, even when the storage nodes fail.
	Vinod Vaikuntanathan: Tools in Multiparty Communication Complexity, and a lower-bound for Set Disjointness Friday, October 11, 2013 - 1:00pm to 2:30pm In a multiparty message-passing model of communication, there are k players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and
	Zhiyang Wang: Coding for Information Storage Friday, September 27, 2013 - 1:00pm to 2:30pm We will present coding for data storage in both the device level and the system level. For flash memory, we propose partial rank modulation, which is a scheme based on the work by Jiang et al. but has lower decoding complexity.
	Christoph Lenzen: Efficient Construction of Global Time in SoCs despite Arbitrary Faults Tuesday, August 27, 2013 - 1:15pm to 2:15pm Given a fully connected synchronous system in which rounds are labeled by integers modulo 2^lambda (i.e., nodes have small synchronized lambda-bit clocks), we would like to construct large (say 32- or 64-bit) synchronized clocks.
	Pierre Bertrand: Fast Distribution of Balls into Bins Thursday, August 15, 2013 - 11:00am to 12:15pm In the past, the theory on parallel algorithms distributing n balls into n bins has been concerned with deriving asymptotic results. However, all bounds have in common that they are very slow-growing functions, like O(log log n) or O(log* n).
	Virtual Networking Cloud Resources: Visian, Algorithms, Threats Tuesday, May 21, 2013 - 1:00pm to 2:30pm After virtualization revamped the server business, the cloud now spills over to the network. This talk first reviews the vision of distributed cloud computing and network virtualization.
	Dan Alistarh TDS Seminar Friday, May 10, 2013 - 1:00pm to 2:30pm

Pages