The design and implementation of late binding in a distributed programming language

In distributed application domains where data change rapidly, it is often desirable for programs to obtain the latest available data values to achieve accurate computations. Example applications are financial services and network management. Such data are logically shared by a network of programs. Unlike data in traditional databases, rapidly changing data are usually not lockable by (client) programs and it is crucial to the computations to access their values in a timely manner. In these application domains, a typical program usually performs computations based on recently available data values obtained from the network. However, these data values may be inconsistent or obsolete, since the real data are external to the system and may change more rapidly than can be reflected by their copies within the system. Decision making based on such inaccurate computations can lead to substantial penalties. In this paper, we propose an approach to delaying data value retrieval until needed in distributed programming, considering data and configuration change rapidly. This approach offers the advantage of obtaining more recent data values, resulting in more accurate computations and decision making.<
>