On Migrating Threads

  • Authors:
  • Bernd Mathiske;Florian Matthes;Joachim W. Schmidt

  • Affiliations:
  • Arbeitsbereich Softwaresysteme, Technische Universitaet Hamburg-Harburg, Harburger Schlossstr. 20, D-21071 Hamburg, Germany/ E-mail: b.mathiske@tu-harburg.de, f.matthes@tu-harburg.de, j.w.schmidt@ ...;Arbeitsbereich Softwaresysteme, Technische Universitaet Hamburg-Harburg, Harburger Schlossstr. 20, D-21071 Hamburg, Germany/ E-mail: b.mathiske@tu-harburg.de, f.matthes@tu-harburg.de, j.w.schmidt@ ...;Arbeitsbereich Softwaresysteme, Technische Universitaet Hamburg-Harburg, Harburger Schlossstr. 20, D-21071 Hamburg, Germany/ E-mail: b.mathiske@tu-harburg.de, f.matthes@tu-harburg.de, j.w.schmidt@ ...

  • Venue:
  • Journal of Intelligent Information Systems - Special issue: next generation information technologies and systems
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Based on the notion of persistent threads in Tycoon (Matthes and Schmidt, 1994), we investigate thread migration as a programming construct for building activity-oriented distributed applications. We first show how a straight-forward extension of a higher-order persistent language can be used to define activities that span multiple (semi-) autonomous nodes in heterogeneous networks. In particular, we discuss the intricate binding issues that arise in systems where threads are first-class language citizens that may access local and remote, mobile and immobile resources.We also describe how our system model can be understood as a promising generalization of the more static architecture of first-order and higher-order distributed object systems. Finally, we give some insight into the implementation of persistent and migrating threads and we explain how to represent bindings to ubiquitous resources present at each node visited by a migrating thread on the network to avoid excessive communication or storage costs.