The paper presents an enhancement to the OSF DCE platform for distributed computing that is designed to enhance interoperability of applications. Concepts from Open distributed Processing have been taken, extended and...
详细信息
The processing of a join query in a distributed environment exacts the usage of both the network and its computational facilities. A formulation that accounts for both, and felicitously constructed as an integer linea...
详细信息
The processing of a join query in a distributed environment exacts the usage of both the network and its computational facilities. A formulation that accounts for both, and felicitously constructed as an integer linear program, is proposed. Information disseminated among the sites of a distributed system is to be amalgamated and presented to a user, in response to his request. From all possible strategies by which this might be achieved, one necessitating the smallest usage of system resources is to be chosen. The data transferal resources of the network are usually presumed to be of greatest significance, and therefore, an optimal strategy is most often defined to be one which minimizes the total transmission cost. One model conforming to this philosophy, appearing in [1), expediently takes the form of a linear integer program, and so forms the basis for further refinement. In the omission of processing costs, the various processor elements of the network are treated homologously;dissimilarities in processing ability are also ignored. By analyzing the nature of join computations at a single processor, the minimal transmission cost model can be hybridized to incorporate the cost of such computations and differences in processing power.
It is proposed that the execution of a chain query in a distributed system can be usefully and appropriately modeled as an integer linear program. In response to a user request, information in the form of relational t...
详细信息
It is proposed that the execution of a chain query in a distributed system can be usefully and appropriately modeled as an integer linear program. In response to a user request, information in the form of relational tables scattered across the network is to be combined and made available to the user. The formulation initially attained by considering the behavior of the distributed system in processing such a query is then reduced by removing redundant linear constraints, to produce a model of minimal transmission cost execution. In view of varying properties displayed by the possibly many optima of this problem, further attention is devoted to discriminating between them. By perturbing the objective function, those solutions requiring fewer network transmissions can be favored at the expense of equal-cost, but more complicated, strategies. This includes those strategies that may specify the transmission of a relation around a cycle;when the costs of transmission between sites forming the cycle are zero, such a solution might otherwise be optimal. Many different ways have been devised to solve programs having some number of variables restricted to taking only integer values in some interval, and virtually any of these might be used to solve the join query model. One possible method, using a tree-search approach, is discussed here.
Presents an enhancement to the OSF DCE platform for distributed computing that is designed to enhance the interoperability of applications. Concepts from open distributed processing (ODP) have been taken, extended and...
详细信息
Presents an enhancement to the OSF DCE platform for distributed computing that is designed to enhance the interoperability of applications. Concepts from open distributed processing (ODP) have been taken, extended and applied to DCE, to improve the capacity for late binding, system evolution, resource discovery and software reusability. This paper analyzes approaches to application interoperability in a number of distributed computing platforms and based on the results, describes an enhancement for the DCE platform. The paper focuses on one component of this enhancement: a type manager that is able to canonically describe types of interacting objects and types of relationships between them.< >
The development of a cooperative user interface is a vital and interesting issue due to the lack of common access and limited sharing of data among applications. In this paper, we propose a new design framework which ...
详细信息
The development of a cooperative user interface is a vital and interesting issue due to the lack of common access and limited sharing of data among applications. In this paper, we propose a new design framework which can be used as a platform to access and integrate applications in a cooperative manner. In particular, the paper describes how applications can be integrated by using an object-oriented database approach. With this approach, the mapping between the application input/output streams and the database objects promotes the transparency of information transfer among applications.
Transitive closure operation is an important extension to relational algebra. The two most well-known methods to compute transitive closure are naive and semi-naive approaches. We give the optimal parallel versions of...
详细信息
Transitive closure operation is an important extension to relational algebra. The two most well-known methods to compute transitive closure are naive and semi-naive approaches. We give the optimal parallel versions of these two algorithms by using double-hash relation distribution for SIMD meshes.< >
computer networks are growing in number and capacity, and internetworking allows users to access services globally. An inherent problem of such large networks is managing the heterogeneity of applications, hardware an...
详细信息
computer networks are growing in number and capacity, and internetworking allows users to access services globally. An inherent problem of such large networks is managing the heterogeneity of applications, hardware and supporting software. Open distributed Processing (ODP) introduces type description and type management functions as a mechanism for overcoming this heterogeneity. This paper considers issues surrounding the construction of an ODP-based type manager. It sets requirements for such a type manager and describes a canonical type model for ODP-based systems. The functionality and structure of the type manager are given and then this approach is compared with the type management facilities in existing platforms for distributed computing.
The implementation details of a Lisp environment built on top of a distributed operating system are presented. The system provides transparent distribution, protected large-grain persistent heaps, concurrency within e...
详细信息
The implementation details of a Lisp environment built on top of a distributed operating system are presented. The system provides transparent distribution, protected large-grain persistent heaps, concurrency within e...
详细信息
The implementation details of a Lisp environment built on top of a distributed operating system are presented. The system provides transparent distribution, protected large-grain persistent heaps, concurrency within each environment and seamless sharing of Lisp data structures between separate environments.< >
Clouds LISP distributed environments (CLIDE) is a distributed, persistent object-based symbolic programming system being implemented on the Clouds distributed operating system. LISP environment instances are stored as...
详细信息
Clouds LISP distributed environments (CLIDE) is a distributed, persistent object-based symbolic programming system being implemented on the Clouds distributed operating system. LISP environment instances are stored as large-grained persistent objects, enabling users on many machines to share the contents of these environments through interenvironment evaluations. CLIDE provides a comprehensive research environment for distributed symbolic language, invocation and consistency semantics, and an implementation vehicle for the construction of the symbolic processing portions of complex megaprogrammed systems.< >
暂无评论