- talks - lists.cs.princeton.edu

Talk Today
by Ginny Hogan 12 Dec '07

12 Dec '07

Shaz Qadeer, Microsoft Research, will present his talk, "Taming Concurrency: A Program Verification Perspective", 4:15pm Computer Science room 105 -

1 0

11am Fri Dec 14 talk on routing-protocol convergence by Pierre Francois
by Jennifer Rexford 10 Dec '07

10 Dec '07

TALK ANNOUNCEMENT: Title: BGP convergence in much less than a second Speaker: Pierre Francois, Universite Catholique de Louvain Date: 11:00am on Friday December 14 Location: CS room 402 Abstract -------- This talk will about recent improvements to the Border Gateway Protocol, the routing protocol used by Internet Service Providers to exchange routing information to provide Internet-wide connectivity. It will show how a fast recovery of connectivity can now be achieved in the case of a link or node failure within an ISP network. We will emphasize that most business cases allow a local BGP recovery (convergence) in case of failure, i.e. a convergence where inter-domain path exploration is actually not required to recover the connectivity after a failure. We will show that although convergence could be local, iBGP deployements do not favor the propagation of alternate paths within an ISP network, which artificially lead to transient lack of connectivity, disclosed to neighboring peers. We will then turn to router implementation issues that could not allow a fast convergence of BGP due to the scaling factors of BGP Reaching sub-second convergence of BGP will however be shown possible by first allowing a better propagation of alternate paths within ISP networks, and second enable the recent improvements to BGP router implementations and to Forwarding Information Bases designs.

1 0

Speaker Wednesday -
by Ginny Hogan 10 Dec '07

10 Dec '07

Shaz Qadeer, Microsoft Research, will present his talk "Taming Concurrency: A Program Verification Perspective" Wednesday Dec 12th at 4:15 pm Computer Science Room 105 -

1 0

Wed. Dec 12th: Shaz Qadeer: "Taming Concurrency: A Program Verification Perspective"
by David Walker 07 Dec '07

07 Dec '07

December 12th (next Wednesday) Shaz Qadeer from Microsoft research is visiting Princeton. He is an expert in analysis of concurrent programs and will be giving a distinguished lecture entitled "Taming Concurrency: A Program Verification Perspective". If you would like to meet with him (faculty or students), please pick a timeslot on Wednesday and put yourself on his schedule by editing this file: ~dpw/qadeer His abstract and bio are list below. Thanks, Dave ********************************************************** * Taming Concurrency: A Program Verification Perspective * * Shaz Qadeer * * Microsoft Research * ********************************************************** Concurrency, as a basic primitive for software construction, is more relevant today than ever before, primarily due to the multi-core revolution. General-purpose software applications must find ways to exploit concurrency explicitly in order to take advantage of multiple cores. However, experience has shown that explicitly parallel programs are difficult to get right. To deliver compelling software products in the multi-core era, we must improve our ability to reason about concurrency. Generalizing well-known sequential reasoning techniques to concurrent programs is fundamentally difficult because of the possibility of interference among concurrently-executing tasks. In this lecture, I will present reduction and context-bounding, two ideas that alleviate the difficulty of reasoning about interference by creating a simpler view of a concurrent execution than an interleaving of thread instructions. Reduction reduces interference by making a sequence of instructions in a thread appear as a single atomic instruction; it allows the programmer to view an execution as a sequence of large atomic instructions. Context-bounding reduces interference by focusing on executions with a small number of context switches; it allows the programmer to view an execution as a sequence of large thread contexts. I will present the theory behind these two approaches and their realization in a number of program verification tools I have developed over the years. Bio: Shaz Qadeer is a researcher in the Software Reliability Research group at Microsoft Research. The goal of his research is to develop tools for improving the productivity of programmers. He has worked on many program verification tools, spanning the range from run-time verification to model checking to static analysis, with an emphasis on tools for concurrent programs. Shaz received his Ph.D. at UC Berkeley and worked at Compaq Systems Research Center before joining Microsoft Research.

1 0

Talk is starting now
by Ginny Hogan 29 Nov '07

29 Nov '07

Nancy Baym's talk, Understanding the Network Audience, is starting now - Computer Science Room 105

1 0

Cookies -
by Ginny Hogan 29 Nov '07

29 Nov '07

Cookies and goodies are now available in the tea room -

1 0

Speaker Today
by Ginny Hogan 29 Nov '07

29 Nov '07

Nancy Baym will present her talk "Understanding the Networked Audience", today at 4:30pm" Computer Science Room 105 Tea will be at 3:30.

1 0

Nancy Baym's Talk is Thursday
by Ginny Hogan 26 Nov '07

26 Nov '07

Previous mail has Nancy Talk on Wed. It is Thursday at 4:30pm - Computer Science Room 105 -

1 0

Speaker Wednesday
by Ginny Hogan 26 Nov '07

26 Nov '07

Nancy Baym, University of Kansas, will present her talk, "Understanding The Networked Audience" Wed. Nov 29th 4:15PM, Computer Science Room 105 -

1 0

K Makarychev FPO
by Melissa M Lawson 19 Nov '07

19 Nov '07

Konstantin Makarychev will present his FPO on Tuesday November 27 at 3PM in Room 402. The members of his committee are: Moses Charikar, advisor; Boaz Barak and Assaf Naor (NYU), readers; Bernard Chazelle and Bob Tarjan, nonreaders. A copy of his thesis, "Quadratic Forms on Graphs and their Applications", is on display in room 310. Everyone is invited to attend his talk.

1 0