T he fastest sequential algorithm for a given problem is the best sequential algorithm. But
determining the best par-allel algorithm is considerably more complicated. A parallel …

In this paper, we present generic cloud performance models for evaluating Iaas, PaaS,
SaaS, and mashup or hybrid clouds. We test clouds with real-life benchmark programs and …

In this paper, we describe scalable parallel algorithms for symmetric sparse matrix
factorization, analyze their performance and scalability, and present experimental results for …

The scalability of a parallel algorithm on a parallel architecture is a measure of its capacity to
effectively utilize an increasing number of processors. Scalability analysis may be used to …

Honey bee colonies demonstrate robust adaptive efficient agent-based communications and
task allocations without centralized controls–desirable features in network design. This book …

Genetic algorithms, search algorithms based on the genetic processes observed in natural
evolution, have been used to solve difficult problems in many different disciplines. When …

Performance is often a key factor in determining the success of a parallel software system.
Performance evaluation techniques can be classified into three categories: measurement …

In order to solve a problem in parallel we need to undertake the fundamental step of splitting
the computational tasks into parts, ie decomposing the problem solving. A whatever …

Despite the tremendous advances in performance enabled by modern architectures, there
are always new applications and demands arising that require ever-increasing capabilities …

Population Balance Models (PBMs), a class of integro partial differential equations, are
utilized for simulating dynamics of numerous particulate systems. PBMs describe the time …