Distributed strategic interleaving with load balancing

Authors:
J. A. Bergstra;C. A. Middelburg
Affiliations:
Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands and Department of Philosophy, Utrecht University, P.O. Box 80126, 3508 TC Utrecht, The Nethe ...;Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands
Venue:
Future Generation Computer Systems
Year:
2008

Citing 14
Cited 2

Communicating sequential processes

Communicating sequential processes
Computer viruses: theory and experiments

Computers and Security
Algebraic specification

Handbook of theoretical computer science (vol. B)
A short course on computer viruses (2nd ed.)

A short course on computer viruses (2nd ed.)
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Communication and Concurrency

Communication and Concurrency
The Java Language Specification

The Java Language Specification
C# Language Specification

C# Language Specification
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Modular verification of multithreaded programs

Theoretical Computer Science
Splitting bisimulations and retrospective conditions

Information and Computation
Thread Algebra with Multi-Level Strategies

Fundamenta Informaticae
A Thread Algebra with Multi-Level Strategic Interleaving

Theory of Computing Systems
Thread algebra for strategic interleaving

Formal Aspects of Computing

Instruction Sequences with Dynamically Instantiated Instructions

Fundamenta Informaticae
A thread calculus with molecular dynamics

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction of threads with services. In the current paper, we assume that the threads and services are distributed over the nodes of a network. We extend the theory developed so far to the distributed case by introducing distributed interleaving strategies that support explicit thread migration and see to load balancing or capability searching by implicit thread migration. The extension to the distributed case provides insight into details of multi-threading that come up in a networked environment.