The proceedings contain 33 papers. The special focus in this conference is on Keynote lectures, Cognitive and cooperative multi-agent systems, Knowledge based agent systems, Modeling and logic agents, Agent-based mode...
ISBN:
(纸本)9783319076492
The proceedings contain 33 papers. The special focus in this conference is on Keynote lectures, Cognitive and cooperative multi-agent systems, Knowledge based agent systems, Modeling and logic agents, Agent-based modeling and simulation and Learning paradigms and applications. The topics include: Bio-inspired robots;conflicts resolution in heterogenous multiagent environments inspired by social sciences;expanding the control scope of cooperative multiple robots;an agent cognitive model for visual attention and response to novelty;self-composition of services in pervasive systems;a trust-based approach to clustering agents on the basis of their expertise;indeterministic belief structures;implementation of agent-based games recommendation system on mobile platforms;combination of textual and structural context for retrieving multimedia elements;multi-agent non-linear temporal logic with embodied agent describing uncertainty;modelling travel routes in transport systems by means of timed and hybrid petri nets;distributed regret matching algorithm for a dynamic route guidance;a uniform problem solving in the cognitive algebra of bounded rational agents;a temporal logic based language for causal maps to explain agent behaviors;communication security prognosis realized as the parallel dynamic auditing intelligent system;simulation and statistical model checking of logic-based multi-agent system models;multi-agent based execution environment for task allocation via coalition formation;multi agent based dynamic task allocation;microeconomic demand functions implementation in java experiments and the alliance between optimization and multi-agent system for the management of the dynamic carpooling.
Software development for high-performance (parallel/distributed) computing (HPC) is a non-trivial process; its complexity can be primarily attributed to the increased degrees of freedom that have to be resolved and tu...
详细信息
Software development for high-performance (parallel/distributed) computing (HPC) is a non-trivial process; its complexity can be primarily attributed to the increased degrees of freedom that have to be resolved and tuned in such an environment. Performance prediction tools enable a developer to evaluate various available design alternatives and can assist in HPC application software development. In this paper, we first present a novel "interpretive" approach for accurate and cost-effective performance prediction. The approach has been used to develop an interpretive HPF/Fortran 90D application performance prediction framework. The accuracy and usability of the performance prediction framework are experimentally validated. We then outline the stages typically encountered during application software development for parallel/distributed HPC and highlight the significance and requirements of a performance prediction tool at the relevant stages. Numerical results using benchmarking kernels and application codes are presented to demonstrate the application of the interpretive performance prediction framework at different stages of the software development process.
VISPAR is a research project partially funded by the Commission of European Countries (CEC) at the National Centre for Software Technology in India for investigating the use of parallelcomputing in global illuminatio...
详细信息
VISPAR is a research project partially funded by the Commission of European Countries (CEC) at the National Centre for Software Technology in India for investigating the use of parallelcomputing in global illumination and visualization of 3D environments. A task delegation framework has been evolved based on the notion of distributed agents, which take both the responsibilities of suitably delegating tasks to other agents and of executing tasks delegated to them, based on their core competencies. The paper describes this framework and the distributed multi-agent architecture designed specifically, for obtaining high performance in interactive manipulation and walkthrough computations of very large virtual environments.
In a shared disk architecture like a SPAX system, messages for concurrency/coherency control and data transmission due to disk sharing degrade the system performance. But the network speed in a SPAX system is sufficie...
详细信息
In a shared disk architecture like a SPAX system, messages for concurrency/coherency control and data transmission due to disk sharing degrade the system performance. But the network speed in a SPAX system is sufficiently fast, and network traffic does not deteriorate the system performance. However, the number of processing nodes and that of I/O nodes for disk I/O can be a bottleneck in the SPAX system. We study the effect of the number of processing nodes and I/O nodes on the system performance.
Gang scheduling is a job scheduling policy for parallel computers that combines elements of space-sharing and time-sharing. In this paper we analyze the performance of gang scheduling policies that allow the remapping...
详细信息
Gang scheduling is a job scheduling policy for parallel computers that combines elements of space-sharing and time-sharing. In this paper we analyze the performance of gang scheduling policies that allow the remapping of an executing job to a new set of processors. Most previously proposed gang-scheduling policies do not allow such job remapping under the assumption that it is prohibitively expensive. Through a detailed trace-driven simulation, we analyze the tradeoff between the benefits and overheads of such job relocation. Our results show that gang-scheduling policies that support such job relocation offer significant performance gains over policies that do not use remapping.
The emergence of small portable computers and the advances in wireless networking have made mobile computing today a reality. Information systems and databases are among the applications that make mobile computing att...
详细信息
The emergence of small portable computers and the advances in wireless networking have made mobile computing today a reality. Information systems and databases are among the applications that make mobile computing attractive. While the topic of querying data in wireless and mobile systems has received a lot of attention, techniques to efficiently update data in these systems while providing transaction semantics are not fully developed. We present a novel protocol that uses the broadcast facility to help mobile units do some of the work of verifying if the transactions being run by them need to be aborted. Only when the mobile unit cannot detect any conflict is the server involved in completing the verification. Of course, if the transaction can commit, the server will install the valves in the central database and notify the mobile units (again, using the broadcast channel). The protocol uses a modified version of optimistic control. We study the performance of the protocol by means of a detailed simulation.
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmabil...
详细信息
Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible 'object' abstractions. Researchers have developed consistency protocols for replicated 'memory' objects. These protocols are well suited to scientific applications but less suited to multimedia or groupware applications. We address the state sharing needs of complex distributed applications with: high-frequency symmetric accesses to shared objects; unpredictable and limited locality of accesses; dynamically changing sharing behavior; and potential data races. We show that a DSO system exploiting application-level temporal and spatial constraints on shared objects can outperform shared object protocols which do not exploit application-level constraints. We compare our S(emantic) DSO against entry consistency using a sample application having the four properties mentioned above.
We have been investigating the efficiency of Genetic Algorithms (GA) for solving for a variety of real problems. During our investigations we have concluded that the large amount computational time required to find GA...
详细信息
We have been investigating the efficiency of Genetic Algorithms (GA) for solving for a variety of real problems. During our investigations we have concluded that the large amount computational time required to find GA based solutions on conventional computers is restrictive. We are therefore developing an innovative new computer architecture, suitable for the solution of large scale problems using GAs. In this paper we introduce the SIMD-GA (Single Instruction stream Multiple Data stream Genetic Algorithm), and discuss its hardware design and implementation. By taking advantage of the recent advances is HDLs (Hardware Description Language) and FPGA's (Field Programmable Gate Array) we have been able to quickly develop and prototype a PE (Processing Element) for a SIMD-GA. This approach allows us to build a cost-effective parallel processing architecture to overcome the problem of the computational time required for traditional sequential GA implementation.
The PROUD module placement algorithm mainly uses a hierarchical decomposition technique and the solution of sparse linear systems based on a resistive network analogy. It has been shown that the PROUD algorithm can ac...
详细信息
The PROUD module placement algorithm mainly uses a hierarchical decomposition technique and the solution of sparse linear systems based on a resistive network analogy. It has been shown that the PROUD algorithm can achieve a comparable design of the placement problems for very large circuits with the best placement algorithm based on simulated annealing, but with several order of magnitude faster. The modified PROUD, namely MPROUD algorithm by perturbing the coefficient matrices performs much faster that the original PROUD algorithm. Due to the instability and unguaranteed convergence of MPROUD algorithm, we have proposed a new convergent and numerically stable PROUD, namely Improved PROUD algorithm, denoted as IPROUD with attractive computational costs to solve the module placement problems by making use of the SYMMLQ and MINRES methods based on Lanczos process (Yang, 1997). We subsequently propose parallel versions of the improved PROUD algorithms. The parallel algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent. Therefore, the cost of global communication which represents the bottleneck of the parallel performance on paralleldistributed memory computers can be significantly reduced, therefore, to obtain another order of magnitude improvement in the runtime without loss of the quality of the layout.
暂无评论