Consider the problem of exploring a large statespace for a goal state. Although many such states may exist, G.nding any one state satisfying the requirements is sufficient. All methods known until now for conducting such search in parallel fail to provide consistent linear speedups over sequential execution. The speedups vary between sublinear to superlinear and from run to run. Further, adding...

In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have proposed a generic MAC construction ALRED and a concrete ALRED instance Pelican. The Pelican MAC uses four rounds of AES as a building block to compute the authentication tag in a CBC-like manner. It is about 2.5 times fas...

In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, and speedup. A flow-shop scheduling problem has been implemented on a BBN Butterfly Multicomputer using up to 80 processors to empirically test this algorithm. From our experiments, this algorithm is capable of achieving...

In this paper, we discuss parallel implementation of an artificial neural network for pattern d a t i o n , the Bidirectional Associative Memory(BAM). Transputer-based parallel architecture8 like hypercube, mesh and linear array are used to exploit the parallelism in BAM. A comparitive study of utilization and speedup for various architectures is made. Hypercube performs better in terms of util...

The properties of a AB diblock copolymer chain are calculated by Monte Carlo methods. Monomer A contacting to the surface has an adsorption energy E=-1 and monomer B E= 0. The polymer chain is simulated by self-avoiding walk in simple cubic lattice.The adsorption properties and the conformation properties of the polymer chain are computed by using message passing interface (MPI). The speedup is...

Our task scheduling pass implemented in the COINS compiler uses a Binary Linear Programming model for scheduling a program into a multiprocessor system-on-chip where each processor can be accelerated with instruction set extensions. We compare our work to state of the art approaches and estimate an average speedup of 4.01 in application execution time compared to a sequential approach. We estim...