Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

The Declarative Imperative: Experiences and Conjectures in Distributed Logic

Joseph M. Hellerstein

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2010-90
June 1, 2010

http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-90.pdf

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 these languages parallelize naturally. This juxtaposition raises the possibility that the theory of declarative database query languages can provide a foundation for the next generation of parallel and distributed programming languages. In this paper I reflect on my group's experience over seven years using Datalog extensions to build networking protocols and distributed systems. Based on that experience, I present a number of theoretical conjectures that may both interest the PODS community, and clarify important practical issues in distributed computing. Most importantly, I make a case for PODS researchers to take a leadership role in addressing the impending programming crisis. This is an extended version of an invited lecture at the ACM PODS 2010 conference entitled ``Datalog Redux: Experience and Conjecture.''


BibTeX citation:

@techreport{Hellerstein:EECS-2010-90,
    Author = {Hellerstein, Joseph M.},
    Title = {The Declarative Imperative: Experiences and Conjectures in Distributed Logic},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2010},
    Month = {Jun},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-90.html},
    Number = {UCB/EECS-2010-90},
    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 these languages parallelize naturally. This juxtaposition raises the possibility that the theory of declarative database query languages can provide a foundation for the next generation of parallel and distributed programming languages.
	
In this paper I reflect on my group's experience over seven years using Datalog extensions to build networking protocols and distributed systems.  Based on that experience, I present a number of theoretical conjectures that may both interest the PODS community, and clarify important practical issues in distributed computing.	Most importantly, I make a case for PODS researchers to take a leadership role in addressing the impending programming crisis.
	
This is an extended version of an invited lecture at the ACM PODS 2010 conference entitled ``Datalog Redux: Experience and Conjecture.''}
}

EndNote citation:

%0 Report
%A Hellerstein, Joseph M.
%T The Declarative Imperative: Experiences and Conjectures in Distributed Logic
%I EECS Department, University of California, Berkeley
%D 2010
%8 June 1
%@ UCB/EECS-2010-90
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-90.html
%F Hellerstein:EECS-2010-90