CJO - Abstract - High-level networking with mobile code and first order AND-continuations

Cambridge Journals Online

Cambridge Journals Online
Theory and Practice of Logic Programming (2001), 1 : 359-380 Cambridge University Press
Copyright © 2001 Cambridge University Press
doi:10.1017/S1471068401001193 (About doi)
Published online by Cambridge University Press 15 Jun 2001
Theory and Practice of Logic Programming (2001), 1:3:359-380 Cambridge University Press
Copyright © 2001 Cambridge University Press
doi:10.1017/S1471068401001193
Special issue
Regular Paper

High-level networking with mobile code and first order AND-continuations


PAUL TARAU a1 and VERONICA DAHL a2
a1 Department of Computer Science, University of North Texas, P.O. Box 311366, Denton, TX 76203, USA (e-mail: tarau@cs.unt.edu)
a2 Logic and Functional Programming Group, Department of Computing Sciences, Simon Fraser University, Canada (e-mail: veronica@cs.sfu.ca)

Abstract

We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehensive Logic programming based Internet programming framework. Mobile threads are implemented by capturing first order continuations in a compact data structure sent over the network. Code is fetched lazily from its original base turned into a server as the continuation executes at the remote site. Our code migration techniques, in combination with a dynamic recompilation scheme, ensure that heavily used code moves up smoothly on a speed hierarchy while volatile dynamic code is kept in a quickly updatable form. Among the examples, we describe how to build programmable client and server components (Web servers, in particular) and mobile agents.


Key Words: mobile computations; remote execution; networking; Internet programming; first order continuations; Linda coordination; blackboard-based logic programming; mobile agents; dynamic recompilation; code migration.


Cambridge University Press