Etzkorn, G. Change Programming in Distributed Systems. Proceedings of the International Workshop Configurable Distributed Systems, Imperial College of Science, Technology and Medicine, UK. IEE. pp 140-151. 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....states is not assured, neither is the correctness of reconfiguration state expressions. Table 2 ACM and PCM characteristics We are aware of two approaches to synchronising reconfiguration with the application: active change management (ACM) 6] and passive change management (PCM) [3]. These are summarised in Table 2. ACM requires explicit contribution to the reconfiguration process from application components. Correctness of ACM is thus dependent on the conformance of application components to the semantics of the change protocol. PCM is fundamentally different; it is based ....

....changes. We have found component addition, removal, replication, replacement and migration sufficient for reactive change. data out[1 ] alarm in[2] data out[1 ] alarm in[2] data out[2] data in I nurse[2] alarm in[1 ] data out[1 ] alarm in[2] a) Initial configuration: ward nurse[3] alarm in[1 ] data out[1 ] alarm in[2] alarm out data in I nurse[2] alarm in[1 ] data out[1 ] alarm in[2] b) Configuration after reactive change: ward new nurse[I] histo ry out alarm in[1 ] data out[1 ] alarm in[2] 1 data out[ I i I alarm out II data in new nurse[2] ....

[Article contains additional citation context not shown here]

Etzkorn, G. Change Programming in Distributed Systems. Proceedings of the International Workshop Configurable Distributed Systems, Imperial College of Science, Technology and Medicine, UK. IEE. pp 140-151. 1992.

....by their implementation using DARWIN and the NIH C class library, we can deduce that a mindful implementation should not introduce high execution disruption. In the same spirit, two approaches are based respectively on a Finite State Machine model [10] and on a CSP or CCS like process algebra [2]. They both require the formal specifications of the reconfiguration conditions, which can be seen as part of the application specifications. Hence, if the programming environment supports formal specifications, the guidance that is expected from the programmer is not very high and it amounts to ....

G. Etzkorn. Change Programming in Distributed Systems. In Proceedings of the International Workshop on Configurable Distributed Systems, pages 140--151, March 1992.

....attachment 22710 100 84 8.2 stream attachment 22640 100 77 7.4 Figure 13. Client delays caused by reconfiguration (times in ms) question of how to decide when these operations can be applied. Proxies were first introduced by Shapiro [20] as a means of hiding the distribution of objects. Etzkorn [5] describes a programming notation for scheduling reconfigurations according to the types of messages sent between processes, but does not describe an implementation. In the META system [14] a distributed computation is instrumented so that its performance and the load of the underlying system ....

Etzkorn, G. `Change programming in distributed systems', Proc. of the International Workshop on Configurable Distributed Systems, IEE, pp. 140-151, 1992.

....(as in the case of deletion) triggers the acknowledgment message changePerformed to be sent to c. Note that once agent y is thus inserted into the ring, it is guaranteed to function correctly as a member of this ring, independently of the program that drives it. Discussion Note that unlike in [9], both primitives in this suite are carried out without stopping the normal operation of any member of the ring. Moreover, the coordinator is not required to have any knowledge of the structure of the ring in order to invoke the change primitives on it. So far we have assumed the existence of a ....

G. Etzkorn. Change programming in distributed systems. In Intl. Workshop on Configurable Distributed Systems, pages 140--151, March 1992.

....require the services provided by a component whilst it is being dynamically reconfigured. Can a bound be imposed upon the service response time under these circumstances Considerable work has been undertaken on techniques and mechanisms for managing reconfigurable distributed computations [2] 11] A model has emerged in which the target of a reconfiguration is taken to consist of collections of processes with links to one another for communication by message passing (Figure 1) The graph of the collection of processes and their communications links is called the structure of a ....

....After server quiescence has been reached, a reconfiguration is possible in which some other peer s processes remaining transactions. If it processes them as s would have done had c remained associated with it, then this reconfiguration is transparent to c. A further condition has to be met to 11 ensure the correct ordering of transactions belonging to global transactions; we discuss the algorithm for re association in full below. The definition is silent with respect to processing by s of transactions from clients other than c. Assuming that transactions originating from separate ....

[Article contains additional citation context not shown here]

G. Etzkorn, "Change programming in distributed systems," Proc. of the International Workshop on Configurable Distributed Systems, IEE, pp. 140-151, 1992.

No context found.

G. Etzkorn "Change Programming In Distributed Systems", Proceedings of the International Workshop on Configurable Distributed Systems, pp. 140-151, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC