How can a bridge be built between autonomic computing approaches and parallel computing systems? The work reported in this paper is motivated towards bridging this gap by proposing a swarm-array computing approach based on ‘Intelligent Agents’ to achieve autonomy for distributed parallel computing systems. In the proposed approach, a task to be executed on parallel computing cores is carried on...

Science is constantly pushing the limits of computational and storage power and even the fastest supercomputers are not capable of satisfying the computational demand. Recent advances in hardware technologies have provided more computing power than ever before and with the advent of multiple core processors we can expect this trend to continue. It is expected that processors with hundreds of co...

A major challenge for computer science in the 1990s is to determine the extent to which general purpose parallel computing can be achieved. The goal is to deliver both scalable parallel performance and architecture independent parallel software. (Work in the 1980s having shown that either of these alone can be achieved.) Success in this endeavour would permit the long overdue separation of soft...

This lecture introduces the fundamentals of parallel computing and discusses its benefits for musicians. It begins by introducing classic parallel architectures and parallel programming strategies. Next, it discusses the benefits of parallel computing for a specific area of computer music research: sound synthesis. The lecture then concludes with a brief discussion on the future of the musician...

This paper intends to discuss the role of parallel computing in computational chemistry. As the terminology implies computational chemistry is heavily dependent on the computational power available. Much of the field involved running programs and applications on single processor systems. Even though processor power has improved steadily (Moores Law [1]) over the years, the need for more CPU pow...

In principle, the idea of parallel computing applied here and many other places is quite straightforward—divide and conquer. The overall parallel approach remains the same as before— domain decomposition, single program and multiple-data model, and message passing. The linear solver used here is the popular pre-conditioned GMRES approach. This method for reservoir simulation is totally reliant ...

University Press. All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher, except for reading and browsing via the World Wide Web. Users are not permitted to mount this file on any network servers. Introduction If you wa...

A new class of parallel algorithms is introduced that can achieve a complexity of O(n 3 2 ) with respect to the interprocessor communication, in the exact computation of systems with pairwise mutual interactions of all elements. Hitherto, conventional methods exhibit a communicational complexity of O(n). The amount of computation operations is not altered for the new algorithm which can be form...