论文信息 - Start-phase control of distributed systems

Start-phase control of distributed systems

This paper presents a realization for the reliable and fast startup of distributed systems written in Erlang. The traditional startup provided by the Erlang/OTP library is sequential, parallelization usually requires unsafe and ad-hoc solutions. The proposed method calls only for slight modications in the Erlang/OTP stdlib by applying a system dependency graph. It makes the startup safe, quick, and it is equally easy to use in newly developed and legacy systems.

Attila Kov

[1] Joe Armstrong,et al. Making reliable distributed systems in the presence of software errors , 2003 .

[2] Konstantinos Sagonas,et al. Heap architectures for concurrent languages using message passing , 2002, ISMM '02.

[3] Thomas W. Reps,et al. The use of program dependence graphs in software engineering , 1992, International Conference on Software Engineering.

[4] Konstantinos Sagonas,et al. Efficient memory management for concurrent programs that use message passing , 2006, Sci. Comput. Program..

[5] Fiffi Hellstrand,et al. AXD 301: A new generation ATM switching system , 1999, Comput. Networks.

[6] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[7] Joe L. Armstrong,et al. One Pass Real-Time Generational Mark-Sweep Garbage Collection , 1995, IWMM.