K. C. Wong
Abstract
Programs written in multiple, partially disjoint versions of a high-level language may have to migrate for program compilation in the environment in which the versions are distributed. The decisions made during program compilation concerning which node is to be selected from the possible ones supporting those disjoint features constitute a process migration path. The shortest paths which minimize the time spent in process migration can be determined using a dynamic programming approach. The approach is versatile in that it determines some of the shortest paths in a branch-and-bound way and determines all of the shortest paths in a non-brute force way by pruning those branches at the turning points that version expansion is not necessary.
Index Terms
- Determining the shortest process migration paths for program compilation using a dynamic programming approach
Recommendations
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph D = (V, A), the task is to find positive integer arc ...
Improved algorithms for the k simple shortest paths and the replacement paths problems
Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Shortest Paths with Shortest Detours
This paper is concerned with a biobjective routing problem, called the shortest path with shortest detour problem, in which the length of a route is minimized as one criterion and, as second, the maximal length of a detour route if the chosen route is ...
Comments