[PRL] Fwd: [professors] Distinguished Speaker meetings

[Mitchell Wand]

This guy is a big cheese & this is an opportunity to show off.   I've asked
Mirek whether we can arrange a group meeting for you guys, or you may want
to go one-on-one.  --Mitch

---------- Forwarded message ----------
From: Mirek Riedewald <mirek at ccs.neu.edu>
Date: Tue, Nov 2, 2010 at 3:44 PM
Subject: [professors] Distinguished Speaker meetings
To: professors at lists.ccs.neu.edu, clinical-faculty at lists.ccs.neu.edu,
postdocresearchers at lists.ccs.neu.edu, research-scientists at lists.ccs.neu.edu
Cc: "Doreen L. Hodgkin" <dhodgkin at ccs.neu.edu>


Hi All,

Joe Hellerstein from UC Berkeley will visit us for a Distinguished Lecture
next Wednesday, 11/10. He will be available for meetings that day.

He is an outstanding and influential researcher (ACM Fellow, Alfred P. Sloan
Fellow, among 2010 Fortune Magazine 50 smartest people, top-10 in MIT Tech
Review Magazine list of technologies most likely to change our world, ACM
SIGMOD test of time award, etc.) and a notable jazz musician. And he is also
just a great guy to talk to.

I am putting together his meeting schedule. So if you are interested, please
let me know as soon as possible. The following time slots are available:

1. Any time between 9:30am and 11:45am.

2. After 3:30pm.

3. If none of the above work, 2-3:30pm might be possible. But I need to know
ASAP because he might have a conflict with that time range.

Thanks,
M i r e k


PS: Here is his talk info:


Disorderly Programming: Experience and Conjectures in Distributed Logic

ABSTRACT:
       The rise of multicore processors and cloud computing is putting
enormous pressure on the software community to find solutions to the
difficulty of parallel and distributed programming. At the same time, there
is more—and more varied—interest in data-centric programming languages than
at any time in computing history, in part because the inherently unordered
nature of these languages encourages programs that parallelize easily. This
juxtaposition raises the possibility that the theory of logic programming
and deductive database languages can provide a foundation for the next
generation of parallel and distributed programming languages.

In this talk I will reflect on my group’s experience over seven years using
Datalog extensions to build networking protocols and distributed systems. I
will introduce a temporal logic called Dedalus, and our plans to build upon
it in our upcoming Bloom language for cloud programming.  Time permitting, I
will also discuss a number of theoretical conjectures we have formulated,
including the CALM conjecture relating the distributed systems notion of
eventual consistency to monotonicity in logic.
-------------- next part --------------
HTML attachment scrubbed and removed