The field of distributedparallel programming is predominated by tools such as the parallel Virtual Machine (PVM) and the Message Passing Interface (MPI). On the other hand, mainly standards like the Common Object Req...
详细信息
The field of distributedparallel programming is predominated by tools such as the parallel Virtual Machine (PVM) and the Message Passing Interface (MPI). On the other hand, mainly standards like the Common Object Request Broker Architecture (CORBA), Remote Method Invocation (RMI), and the distributed Component Object Model (DCOM) are used for distributed computing. In this paper, we examine the suitability of CORBA-based solutions for meeting application requirements in the field of parallel programming. We outline concepts defined within CORBA which are helpful for the development of parallel applications. Subsequently, we present our design of an Object Group Service and a Join Service which facilitate the development of CORBA-based distributed and parallelsoftware applications by transparently encapsulating typical forking and joining mechanisms often needed in that context.
The number of security-breaking attempts originated inside the organizations are increasing steadily. Attacks made in this way, usually done by 'authorized' users of the system, cannot be immediately located. ...
详细信息
The number of security-breaking attempts originated inside the organizations are increasing steadily. Attacks made in this way, usually done by 'authorized' users of the system, cannot be immediately located. As the idea of filtering the traffic at the 'entrance door' (by firewalls, for instance) is not completely successful, the use of other technologies should be considered to increase the defense capacity of a site. Therefore, the introduction of mobile agents to provide the computational security by constantly moving around within the internal infoways of an organization is presented as a natural solution to prevent both external and the internal sources of intrusion. This work presents an evaluation of the use of mobile agents mechanisms to add mobility features to the process of monitoring intrusion in computational systems. A modular approach is proposed, where independent small agents will monitor the communication paths. This approach presents significant advantages in terms of minimizing overhead, increasing scalability and flexibility and providing fault tolerance.
The concept of software architecture, also said system structure or system configuration, is especially important to design complex softwaresystems, providing a model of the large scale structural properties of syste...
详细信息
The concept of software architecture, also said system structure or system configuration, is especially important to design complex softwaresystems, providing a model of the large scale structural properties of systems. Module interconnection languages (MILs) introduced the idea of creating program modules and connecting them to form larger structures. However, MILs do not support the description of important architectural elements. A new class of description languages, referred to as architectural description languages (ADLs), have recently emerged. Most ADLs, however, support only the description of static software architectures and not dynamic or reconfigurable software architectures. A further limitation of current ADLs is that they focus mainly on the formal notation and usually do not offer proof systems and tools to enable designers to formally verify the properties of their designs. We have developed the ZCL framework, which is a formal framework, specified in Z, to describe and reason about dynamic distributedsoftware architectures. In this paper, we use a simple case study - the client-server system - to demonstrate how our formal framework ZCL can be used to specify and verify reconfigurable software architectures.
This paper presents a theoretical and practical framework for constructing and reasoning about mobile agents. The framework is formulated as a process calculus and has two contributions. One of the contributions can m...
详细信息
This paper presents a theoretical and practical framework for constructing and reasoning about mobile agents. The framework is formulated as a process calculus and has two contributions. One of the contributions can model not only individual mobile agents but also a group of mobile agents because the calculus allows more than one mobile agent to be dynamically organized into a single mobile agent. The other contribution can exactly model many features of actual mobile agents, such as mobility and marshaling, which are often ignored in other existing frameworks but may seriously affect the correctness of mobile agents. To demonstrate the utility of the calculus, we constructed a practical mobile agent system whose agents can be naturally and strictly specified and verified in the calculus. The system also offers a security mechanism for mobile agents by using well-defined properties of the calculus.
To support multimedia applications in mobile environments, it will be necessary for applications to be aware of the underlying environmental conditions, and also to be able to adapt their behaviour and that of the und...
详细信息
To support multimedia applications in mobile environments, it will be necessary for applications to be aware of the underlying environmental conditions, and also to be able to adapt their behaviour and that of the underlying platform as such conditions change. Many existing distributedsystems platforms support such adaptation only in a rather ad hoc manner. This paper presents a principled approach to supporting adaptation through the use of reflection. More specifically, the paper introduces a language-independent, component-based reflective architecture featuring a per-component meta-space, the use of meta-models to structure meta-space, and a consistent use of component graphs to represent composite components. The paper also reports on a quality of service management framework, providing sophisticated support for monitoring and adaptation functions. Finally, the paper describes a prototype implementation of this architecture using the object-oriented programming language Python.
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ever changing networks, network operato...
详细信息
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ever changing networks, network operators need to plan their networks very accurately and rapidly. Sacrificing accuracy generally has severe impacts on the scalability and maintainability of the network at a later stage. A proliferation of planning algorithms/tools exists in both the literature and industry today. These implement advanced algorithms and supply complex answers. It has been our experience that these calculations seldom have any direct use in reducing network costs through optimising network configuration in practice. It is our opinion that the key to unlocking the benefits of these planning algorithms lies in making the network planning process a generic, open standards-based and closed loop process, through the implementation of generic interfaces which abstract the information required away from the physical network details. This paper describes the design of such an interface, which was then implemented in a conceptual evaluation environment in order to gauge the complexity and practicality of the interface concept. We use the capabilities of Java and CORBA to achieve the necessary scalability and portability. The Generic Network Planning Interface (GNPI) concept is shown to be powerful enough to abstract the network information into generic network objects and provide standard method calls to access these objects in a distributed environment.
The design of PDE black-box solvers (for nonlinear systems of elliptic and parabolic PDEs) needs many compromises between efficiency and robustness which we call 'Numerical engineering'. The requirements for a...
详细信息
The design of PDE black-box solvers (for nonlinear systems of elliptic and parabolic PDEs) needs many compromises between efficiency and robustness which we call 'Numerical engineering'. The requirements for a black-box solver are formulated and the way how to meet them is presented, guided by many years of practical experience in the design of the program packages FIDISOL/CADSOL, VECFEM and LINSOL. The basic approach to the new finite difference element method (FDEM) program package, an FDM on an unstructured FEM grid, is discussed. The common feature of all these methods is the error equation that allows a transparent balancing of all errors. The discretization errors are estimated from difference formulae of different consistency orders. The error balancing must include the iterative solution of the large and sparse linear systems by the LINSOL program package. The real challenge is the parallelization on distributed memory parallel computers which is solved by corresponding data structures with optimal communication patterns and redistribution after each grid refinement cycle. (C) 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.
The pdse'99 symposium, now in its fourth successive year, is a continuation of the inaugural pdse'96 workshop held in conjunction with ICSE-18 in Berlin. This was followed by ICSE events in Boston, 1997 and in...
详细信息
ISBN:
(纸本)9781581130744
The pdse'99 symposium, now in its fourth successive year, is a continuation of the inaugural pdse'96 workshop held in conjunction with ICSE-18 in Berlin. This was followed by ICSE events in Boston, 1997 and in Kyoto, 1998. The pdsesymposiums attract up to 50 delegates from a wide range of backgrounds from both industry and academia from around the world. The papers are always published internationally, more recently as IEEE proceedings, and are refereed by a minimum of three independent experts in the field. The talks include keynote speakers with an emphasis on first hand experience of industrial applications and large-scale projects.
TACO is a template library that implements higher-order parallel operations on distributed object sets by means of reusable topology classes and C++ function templates. In this paper we discuss an experimental applica...
详细信息
ISBN:
(纸本)0769507832;0769507840
TACO is a template library that implements higher-order parallel operations on distributed object sets by means of reusable topology classes and C++ function templates. In this paper we discuss an experimental application that exploits TACO's distributed object groups and collective operations for computing the similarity between groups of molecular sequences, a computationally intensive core problem in molecular biology research. In particular we show how TACO's distributed collections can be conveniently combined with well known concepts found in the C++ standard template library (STL) to solve matching and sorting problems effectively on distributed hardware platforms. The resulting implementation is concise and gives excellent parallel performance on PC- and workstation clusters.
暂无评论