A survey of process migration mechanisms

Smith, Jonathan M.

doi:10.1145/47671.47673

Cited by 130 publications

(58 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…While Microvisor avoids the need for extra hardware, it shares the same drawbacks as the load-balancing approach: applications must be stateless (so they can be stopped and restarted) or they must be able to save their state under the old version, and then restore the state under the new version. While checkpointing [29,8] or process migration [30] can be used to stop and restart the same version of an application, it cannot support version changes. DSU handles application state changes naturally.…”

Section: Related Workmentioning

confidence: 99%

Practical dynamic software updating for C

Neamtiu

Hicks

Stoyle

et al. 2006

Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation

141

174

View full text Add to dashboard Cite

Software updates typically require stopping and restarting an application, but many systems cannot afford to halt service, or would prefer not to. Dynamic software updating (DSU) addresses this difficulty by permitting programs to be updated while they run. DSU is appealing compared to other approaches for on-line upgrades because it is quite general and requires no redundant hardware. The challenge is in making DSU practical: it should be flexible, and yet safe, efficient, and easy to use.In this paper, we present a DSU implementation for C that aims to meet this challenge. We compile programs specially so that they can be dynamically patched, and generate most of a dynamic patch automatically. Our compiler performs a series of analyses that when combined with some simple runtime support ensure that an update will not violate type-safety while guaranteeing that data is kept up-to-date. We have used our system to construct and dynamically apply patches to three substantial open-source server programs-Very Secure FTP daemon, OpenSSH daemon, and GNU Zebra. In total, we dynamically patched each program with three years' worth of releases. Though the programs changed substantially, the majority of updates were easy to generate. Performance experiments show that all patches could be applied in less than 5 ms, and that the overhead on application throughput due to updating support ranged from 0 to at most 32%.

show abstract

Section: Related Workmentioning

confidence: 99%

Practical dynamic software updating for C

Neamtiu

Hicks

Stoyle

et al. 2006

Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation

141

174

View full text Add to dashboard Cite

show abstract

“…Thus, client services do not notice that the service has upgraded, except that client services of the new type may see improved performance and fewer rejected requests, and client services of the old type may see decreased performance and more rejected requests. We adopted checkpointing technology [4][5] [10][11] and process migration [12] technology to save the states of service states and recover the states for the new version service.…”

Section: States Managementmentioning

confidence: 99%

“…So the system updating procedure is an atom transaction [9]. The checkpointing technology [4][5] [10][11] and process migration [12] technology are adopted as state saving technology and state recovering.…”

Section: Updating Transactions Of Grid-based Systemmentioning

confidence: 99%

Research on Dynamic Updating of Grid Service

Huang

Wang

2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract. In complicated distributed system based on grid environment, the grid service is inadequate in the ability of runtime updating. While in the maintenance of systems in grid environment, it is an urgent issue to solve to support the transparent runtime updating of the services, especially in the case of services communicating with each other frequently. On the basis of researches on the implementation of grid services and interaction between them following WSRF [3], this paper introduces proxy service as the bridge of the interaction between services and achieved the ability to support the runtime dynamic updating of grid services. Gird service updating must happen gradually, and there may be long periods of time when different nodes run different service versions and need to communicate using incompatible protocols. We present a methodology and infrastructure that make it possible to upgrade grid-based systems automatically while limiting service disruption.

show abstract

“…Migration of RIBs is different from the heavy weight process migration employed by operating systems for load balancing [1], [36]. However, a programmer may not distinctly benefit from process migration mechanisms unless the program is broken into a collection of concurrent processes as in the COP model.…”

Section: The Evolution Of Ribmentioning

confidence: 99%

Anonymous remote computing: a paradigm for parallel programming on interconnected workstations

Joshi

Ram

1999

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Parallel computing on interconnected workstations is becoming a viable and attractive proposition due to the rapid growth in speeds of interconnection networks and processors. In the case of workstation clusters, there is always a considerable amount of unused computing capacity available in the network. However, heterogeneity in architectures and operating systems, load variations on machines, variations in machine availability, and failure susceptibility of networks and workstations complicate the situation for the programmer. In this context, new programming paradigms that reduce the burden involved in programming for distribution, load adaptability, heterogeneity, and fault tolerance gain importance. This paper identifies the issues involved in parallel computing on a network of workstations. The Anonymous Remote Computing (ARC) paradigm is proposed to address the issues specific to parallel programming on workstation systems. ARC differs from the conventional communicating process model by treating a program as one single entity consisting of several loosely coupled remote instruction blocks instead of treating it as a collection of processes. The ARC approach results in distribution transparency and heterogeneity transparency. At the same time, it provides fault tolerance and load adaptability to parallel programs on workstations. ARC is developed in a two-tiered architecture consisting of high level language constructs and low level ARC primitives. The paper describes an implementation of the ARC kernel supporting ARC primitives.

show abstract

A survey of process migration mechanisms

Cited by 130 publications

References 26 publications

Practical dynamic software updating for C

Practical dynamic software updating for C

Research on Dynamic Updating of Grid Service

Anonymous remote computing: a paradigm for parallel programming on interconnected workstations

Contact Info

Product

Resources

About