We examine the suitability of CORBA based solutions for meeting application requirements in the field of distributedparallel programming. We outline concepts defined within CORBA which are helpful for the development...
详细信息
We examine the suitability of CORBA based solutions for meeting application requirements in the field of distributedparallel programming. We outline concepts defined within CORBA which are helpful for the development of parallel applications, and we describe which programming techniques are at hand for this purpose. Subsequently, we present an object group service which facilitates the development of CORBA based distributed and parallel software applications. Moreover, we introduce some basic ideas of how the Unified Modeling Language (UML) can be used for modeling parallel applications.
The proceedings contain 49 papers. The topics discussed include: decision-rule solutions for data mining with missing values;getting computer systems to function as team players;case-based management of software engin...
ISBN:
(纸本)354041276X
The proceedings contain 49 papers. The topics discussed include: decision-rule solutions for data mining with missing values;getting computer systems to function as team players;case-based management of software engineering experience;handling cases and the coverage in a limited quantity of memory for case-based planning systems;integrating rules and cases in learning via case explanation and paradigm shift;personals: an intelligent agent for searching web pages;ELOPES - the java embedded object production system;global and local search for scheduling job shop with parallel machines;knowledge-based interactive scheduling of multipoint batch plants;petrolia: a new algorithm for plan generation;using and evaluating adaptive agents for electronic commerce negotiation;representing operational knowledge by contextual graphics;and a new distributed reinforcement learning algorithm for multiple objective optimization problems.
distributed applications such as teleconferencing using high-speed networks are realized by using multiple multimedia objects. It is critical to discuss how a multimedia object supports quality of service (QoS) requir...
详细信息
distributed applications such as teleconferencing using high-speed networks are realized by using multiple multimedia objects. It is critical to discuss how a multimedia object supports quality of service (QoS) required by applications in the presence of object faults. We newly define global states of objects, which are consistent with respect to QoS supported by objects. Based on the QoS-based consistency, we discuss the recovery of objects from some states which do not satisfy QoS.
There are an increasing number of applications that support communications in network communities. As the architecture of these applications, cooperative distributed agents are suitable for adapting to dynamic changes...
详细信息
There are an increasing number of applications that support communications in network communities. As the architecture of these applications, cooperative distributed agents are suitable for adapting to dynamic changes in community organizations. We are developing a platform named Shine as a common base for implementing network community applications in a cooperative distributed architecture. The paper describes the platform's significance, requirements, and design policy. We also show an example of building a network community support system on top of the platform.
parallelization of I/O using multiple disk drives is warranted for achieving high performance on systems running CPU and I/O intensive applications. This paper is concerned with the characterization of applications wi...
详细信息
parallelization of I/O using multiple disk drives is warranted for achieving high performance on systems running CPU and I/O intensive applications. This paper is concerned with the characterization of applications with parallel I/O and the derivation of analytic bounds on speedup. New characteristics for capturing parallelism in I/O are introduced. These characteristics are used in conjunction with other characteristics available in the literature for the derivation of the bounds. Both parallelism in CPU and I/O operations in applications as well as the degree of overlap between CPU and I/O are observed to have a strong impact on speedup.
When a set of geographically distributed autonomous clusters of workstations are combined into a single large-scale virtual distributed system, a control mechanism for coordinating the activities of the combined syste...
详细信息
When a set of geographically distributed autonomous clusters of workstations are combined into a single large-scale virtual distributed system, a control mechanism for coordinating the activities of the combined system for effective utilisation of the resources is indispensable. This paper presents a co-ordination mechanism suitable for scheduling and distributing services across the host of such large-scale virtual distributedsystems. The proposed scheme is scalable and reliable. Also, it combines both centralised and decentralised co-ordination mechanisms while eliminating/minimising their drawbacks.
In this paper, we propose a novel associative parallel algorithm for selecting a critical cycle in directed weighted graphs by means of an abstract model of the SIMD type with vertical data processing (the STAR-machin...
详细信息
In this paper, we propose a novel associative parallel algorithm for selecting a critical cycle in directed weighted graphs by means of an abstract model of the SIMD type with vertical data processing (the STAR-machine). This problem arises when performing J. Edmonds' (1967) algorithm for finding optimum branchings. This algorithm is represented as the corresponding STAR procedure whose correctness is verified and whose time complexity is evaluated.
The proceedings contain 50 papers. The special focus in this conference is on Knowledge Engineering, Case Based Reasoning, Planning, Scheduling and Multi-agent systems. The topics include: Decision-rule solutions for ...
ISBN:
(纸本)354041276X
The proceedings contain 50 papers. The special focus in this conference is on Knowledge Engineering, Case Based Reasoning, Planning, Scheduling and Multi-agent systems. The topics include: Decision-rule solutions for data mining with missing values;getting computer systems to function as team players;case-based management of software engineering experience ware;handling cases and the coverage in a limited quantity of memory for case-based planning systems;integrating rules and cases in learning via case explanation and paradigm shift;the java embedded object production system;global and local search for scheduling job shop with parallel machines;knowledge-based interactive scheduling of multiproduct batch plants;using and evaluating adaptive agents for electronic commerce negotiation;dependence based coalitions and contract net;scheduling meetings through multi-agent negotiation;agents working on the integration of heterogeneous information sources in distributed healthcare environments;solving conflicting beliefs with a distributed belief revision approach;an organizational model for multi-agent systems;evolving populations of agents with personalities in the minority game;using meta-cognitive conflicts to provoke strategic changes;sharing resource-sensitive knowledge using combinator logics;compiling default theory into extended logic programming;representing belief revision through default theories;representing operational knowledge by contextual graphs;a new distributed reinforcement learning algorithm for multiple objective optimization problems and cognitive multi-agent systems for integrated information retrieval and extraction over the web.
The proceedings contain 49 papers. The special focus in this conference is on Algorithms, Complexity and Models of Computation. The topics include: Theory and construction of molecular computers;approximation algorith...
ISBN:
(纸本)3540678239
The proceedings contain 49 papers. The special focus in this conference is on Algorithms, Complexity and Models of Computation. The topics include: Theory and construction of molecular computers;approximation algorithms for string folding problems;an index for two dimensional string matching allowing rotations;parallel edge coloring of a tree on a mesh connected computer;parallel approximation algorithms for maximum weighted matching in general graphs;complexity considerations for polynomial ideals;an efficient parallel algorithm for scheduling interval ordered tasks;fast interpolation using kohonen self-organizing neural networks;on the complexity of integer programming in the Blum-shub-smale computational model;on logarithmic simulated annealing;ambient groups and mobility types;an asynchronous, distributed implementation of mobile ambients;type systems for concurrent processes;from deadlock-freedom to livelock-freedom, time-boundedness;an interpretation of typed concurrent objects in the blue calculus;open ended systems, dynamic bisimulation and tile logic;on the complexity of bisimulation problems for pushdown automata;a type-theoretic study on partial continuations;partially typed terms between church-style and curry-style;hypothesis support for information integration in four-valued logics;a formal model for embedded components;a single complete refinement rule for demonic specifications;reasoning about composition using property transformers and their conjugates;new challenges for theoretical computer science;quantumization of theoretical informatics;towards a computational theory of everything and the varieties of programming language semantics.
This paper studies the application of preconditioned conjugate gradient methods in high resolution color image reconstruction problems. The high resolution color images are reconstructed from multiple undersampled, sh...
详细信息
This paper studies the application of preconditioned conjugate gradient methods in high resolution color image reconstruction problems. The high resolution color images are reconstructed from multiple undersampled, shifted, degraded color frames with subpixel displacements. The resulting degradation matrices are spatially variant. The preconditioners are derived by taking the cosine transform approximation of the degradation matrices. The resulting preconditioning matrices allow the use of fast transform methods. We show how the methods can be implemented on parallel computers, and we demonstrate their parallel efficiency using experiments on a sixteen processor IBM SP-2.
暂无评论