Bryan Carpenter, Geoffrey Fox, Sung Hoon Ko & Sang Lim (1999):
Object Serialization for Marshalling Data in a Java Interface to MPI.
In: Java Grande,
pp. 66–71,
doi:10.1145/304065.304099.
Jeffrey Dean & Sanjay Ghemawat (2008):
MapReduce: simplified data processing on large clusters.
Commun. ACM 51(1),
pp. 107–113,
doi:10.1145/1327452.1327492.
Jeff Epstein, Andrew P. Black & Simon Peyton-Jones (2011):
Towards Haskell in the Cloud.
In: Proc. Haskell Symposium.
ACM,
pp. 118–129,
doi:10.1145/2034675.2034690.
Stephan Herhut, Richard L. Hudson, Tatiana Shpeisman & Jaswanth Sreeram (2013):
River trail: a path to parallelism in JavaScript.
In: OOPSLA,
pp. 729–744,
doi:10.1145/2509136.2509516.
Ralf Lämmel (2008):
Google's MapReduce programming model - Revisited.
Sci. Comput. Program 70(1),
pp. 1–30,
doi:10.1016/j.scico.2007.07.001.
Jason Maassen, Rob van Nieuwpoort, Ronald Veldema, Henri E. Bal & Aske Plaat (1999):
An efficient implementation of Java's remote method invocation.
In: PPOPP,
pp. 173–182,
doi:10.1145/301104.301120.
Nicholas D. Matsakis (2012):
Parallel closures: a new twist on an old idea.
In: HotPar.
USENIX.
Erik Meijer (2012):
Your mouse is a database.
Commun. ACM 55(5),
pp. 66–73,
doi:10.1145/2160718.2160735.
Heather Miller, Philipp Haller, Eugene Burmako & Martin Odersky (2013):
Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization.
In: OOPSLA.
ACM,
doi:10.1145/2509136.2509547.
Heather Miller, Philipp Haller & Martin Odersky (2014):
Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution.
In: ECOOP.
Springer,
pp. 308–333,
doi:10.1007/978-3-662-44202-9_13.
Nathan Sweet et al.:
Kryo.
https://code.google.com/p/kryo/.
Accessed: 2013-08-11.
Michael Philippsen, Bernhard Haumacher & Christian Nester (2000):
More efficient serialization and RMI for Java.
Concurrency - Practice and Experience 12(7),
pp. 495–518,
doi:10.1002/1096-9128(200005)12:7<495::AID-CPE496>3.0.CO;2-W.