Add to ORKGAbstract. 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 dis-tributed over the nodes of a network. We extend the theory developed so far to the distributed case by introducing distributed interleaving strate-gies that support explicit thread migration and see to load balancing or capability searching by implicit thread migration
Strong mobility enables migration of entire computations combining code, data, and execution state (...
AbstractA class of sequential programs is distributed through a series of program transformations. T...
In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, pr...
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and inter...
In a previous paper we developed an algebraic theory about threads and a form of concurrency where s...
In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategi...
In a previous paper, we developed an algebraic theory about threads and multi-threading based on the...
In this paper we describe the way thread migration can be carried out in Distributed Shared Memory (...
We take a thread as the behavior of a sequential deterministic program under execution and multi-thr...
The study investigates various load balancing strategies to improve the performance of distributed c...
We present an extension of the polarized process algebra BPPA, an algebraic theory about sequential ...
In any distributed system, there are processors wherein the computational capacities are too small t...
Due to the increasing demand for high performance computing and the increasing availability of high ...
Load balancing is a powerful technique commonly used in communication and computer networks to impro...
Load balancing is a powerful technique commonly used in communication and computer networks to impro...
Strong mobility enables migration of entire computations combining code, data, and execution state (...
AbstractA class of sequential programs is distributed through a series of program transformations. T...
In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, pr...
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and inter...
In a previous paper we developed an algebraic theory about threads and a form of concurrency where s...
In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategi...
In a previous paper, we developed an algebraic theory about threads and multi-threading based on the...
In this paper we describe the way thread migration can be carried out in Distributed Shared Memory (...
We take a thread as the behavior of a sequential deterministic program under execution and multi-thr...
The study investigates various load balancing strategies to improve the performance of distributed c...
We present an extension of the polarized process algebra BPPA, an algebraic theory about sequential ...
In any distributed system, there are processors wherein the computational capacities are too small t...
Due to the increasing demand for high performance computing and the increasing availability of high ...
Load balancing is a powerful technique commonly used in communication and computer networks to impro...
Load balancing is a powerful technique commonly used in communication and computer networks to impro...
Strong mobility enables migration of entire computations combining code, data, and execution state (...
AbstractA class of sequential programs is distributed through a series of program transformations. T...
In the very large multiprocessor systems and, on a grander scale, computer networks now emerging, pr...