Middleware technologies such as CORBA or Java RMI have proved their suitability for "standard" client-server applications. However, challenges from existing and new types of applications, including support f...
详细信息
Middleware technologies such as CORBA or Java RMI have proved their suitability for "standard" client-server applications. However, challenges from existing and new types of applications, including support for multimedia real-time requirements and mobility seems to indicate the need for defining a new architecture for open distributed systems. The new architecture should be designed from the beginning with flexibility and adaptability in mind. This can be achieved by defining an open engineering middleware platform that is run time configurable and allows inspection and adaptation of the underlying components. This paper proposes a next generation middleware architecture that conforms to requirements as indicated above. This architecture is characterised by being open, and adaptable based on the principle of reflection. The paper also reports on some existing research prototypes with a focus towards their suitability as next generation middleware.
Object-oriented development is a structuring paradigm. It does not provide substantial support for the specification of ‘end to end’ control and data flow. This has implications for hard real-time system development...
详细信息
The paper presents a strategy for the composition of components to meet 'end to end' timing requirements. This is a framework based approach known as transaction integration. A framework is constructed through...
详细信息
The paper presents a strategy for the composition of components to meet 'end to end' timing requirements. This is a framework based approach known as transaction integration. A framework is constructed through the use of transactions. A transaction represents a control and data flow path across a set of component interfaces, or placeholders, that must be completed by a specific deadline. Reusable real time components are 'plugged' into each placeholder. The paper provides techniques to verify that the performance characteristics of each placeholder, and the 'end to end' deadlines associated with each transaction are met.
Proposes a simple paradigm for constructing heuristics for the static assignment of parallel programs onto asynchronous, distributed memory, multiprocessor architectures. The proposed paradigm involves capturing the d...
详细信息
Proposes a simple paradigm for constructing heuristics for the static assignment of parallel programs onto asynchronous, distributed memory, multiprocessor architectures. The proposed paradigm involves capturing the dominant computation and communication components of an application and using this relatively simpler program representation to determine an assignment. Thus, the mapping problem is reduced from its most general form to a simpler form which often has optimal solutions.< >
An important question in distributedcomputing is the analysis of the influence that the amount of topological information available at the processors has on the complexity of solution algorithms for a given problem. ...
详细信息
An important question in distributedcomputing is the analysis of the influence that the amount of topological information available at the processors has on the complexity of solution algorithms for a given problem. Only few results, typically expressed in terms of lower-bounds, are known to date. In this paper, we prove lower-bounds for two well-known distributed problems: extrema-finding and minimum-weight spanning-tree construction. To establish these results, we introduce the notion of reducibility and equivalence between the elements of a class of distributed problems. We also prove the worst-case optimality of two algorithms.
暂无评论