Follow-ups for Google's MapReduce

Ralf Lämmel: Google's MapReduce programming model - Revisited. Sci. Comput. Program. 70(1): 1-30 (2008)
http://dx.doi.org/10.1016/j.scico.2007.07.001

Abstract:
Google’s MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including its advancement as Google’s domain-specific language Sawzall. To this end, we reverse-engineer the seminal papers on MapReduce and Sawzall, and we capture our findings as an executable specification. We also identify and resolve some obscurities in the informal presentation given in the seminal papers. We use typed functional programming (specifically Haskell) as a tool for design recovery and executable specification. Our development comprises three components: (i) the basic program skeleton that underlies MapReduce computations; (ii) the opportunities for parallelism in executing MapReduce computations; (iii) the fundamental characteristics of Sawzall’s aggregators as an advancement of the MapReduce approach. Our development does not formalize the more implementational aspects of an actual, distributed execution of MapReduce computations.

Jeffrey's MapReduce papers and Talk:

• Jeffrey Dean, Sanjay Ghemawat: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1): 107-113 (2008)
  http://doi.acm.org/10.1145/1327452.1327492
  
• Jeffrey Dean: MapReduce and Other Building Blocks for Large-Scale Distributed Systems at Google. Invited Talk at USENIX Annual Technical Conference 2007
  http://www.usenix.org/media/events/usenix07/tech/mp3/dean.mp3

Compiler Optimizations for Nondeferred Reference-Counting Garbage Collection

Compiler Optimizations for Nondeferred Reference-Counting Garbage Collection

Author:
Pramod G. Joisha

ISMM'06
Proceedings of the 5th International Symposium on Memory Management, ISMM 2006, Ottawa, Ontario, Canada, June 10-11, 2006, pp.150-161

http://doi.acm.org/10.1145/1133956.1133976

A smart hill-climbing algorithm for application server configuration

A smart hill-climbing algorithm for application server configuration

Authors:
Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. Xia, Li Zhang

WWW 2004
pp.287-296

http://portal.acm.org/citation.cfm?doid=988672.988711

Prototypes with Multiple Dispatch: An Expressive and Dynamic Object Model

Prototypes with Multiple Dispatch: An Expressive and Dynamic Object Model

Authors:
Lee Salzman, Jonathan Aldrich

Abstract:
Two object-oriented programming language paradigms—dynamic, prototype-based languages and multi-method languages—provide orthogonal benefits to software engineers. These two paradigms appear to be in conflict, however, preventing engineers from realizing the benefits of both technologies in one system. This paper introduces a novel object model, prototypes with multiple dispatch (PMD), which seamlessly unifies these two approaches. We give formal semantics for PMD, and discuss implementation and experience with PMD in the dynamically typed programming language Slate.

ECOOP 2005
pp.312-336

http://www.springerlink.com/content/540huj0bnh8ktctv/

Predicate Classes

Predicate Classes

Author:
Craig Chamber

ECOOP '93
pp.268-296

http://www.springerlink.com/content/v74k8ltwjcg4wh89/

Traits: A mechanism for fine-grained reuse

Traits: A mechanism for fine-grained reuse

Authors:
Stéphane Ducasse, Oscar Nierstrasz, Nathanael Schärli, Roel Wuyts, Andrew P. Black

Abstract:
Inheritance is well-known and accepted as a mechanism for reuse in object-oriented languages. Unfortunately, due to the coarse granularity of inheritance, it may be difficult to decompose an application into an optimal class hierarchy that maximizes software reuse. Existing schemes based on single inheritance, multiple inheritance, or mixins, all pose numerous problems for reuse. To overcome these problems we propose traits, pure units of reuse consisting only of methods. We develop a formal model of traits that establishes how traits can be composed, either to form other traits, or to form classes. We also outline an experimental validation in which we apply traits to refactor a nontrivial application into composable units.

ACM Transactions on Programming Languages and Systems (TOPLAS)
Volume 28 , Issue 2 (March 2006)
Pages: 331 - 388
Year of Publication: 2006

http://portal.acm.org/citation.cfm?doid=1119479.1119483

Finding Probably Better System Configurations Quickly

Finding Probably Better System Configurations Quickly

Authors:
Takayuki Osogami, Toshinari Itoko:

SIGMETRICS/Performance 2006
pp.264-275

http://portal.acm.org/citation.cfm?doid=1140277.1140308

The Essence of P2P: A Reference Architecture for Overlay Networks (P2P2005)

The Essence of P2P: A Reference Architecture for Overlay Networks

Authors:
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas Girdzijauskas, Seif Haridi, Manfred Hauswirth

Peer-to-Peer Computing 2005
pp.11-20

http://doi.ieeecomputersociety.org/10.1109/P2P.2005.38