We present a parallel approach to analyzing sequence similarity in a set of genomes that employs dynamic load balancing to address the variation in execution time for genes of different lengths and complexity, the variation in processor power in different nodes of the computer cluster, and the variation in other load on the nodes. Our approach executes using MPI on a cluster of computers. We pr...

Millions of small heterogeneous computers are poised to spread into the infrastructure of our society. Though mostly inconspicuous today, disguised as nothing more than PIM (personal information management) computers, these tiny processors will eventually pervade most aspects of civilized life. The one thing holding them back from being everyone's portal to the new electronic society and the ac...

A method for analyzing, modeling and simulating a two-level arrival-counting process is presented. This method is particularly appropriate when the number of independent processes is large. The initial motivation for this method was the need to analyze and represent computer file system trace data that involves activity on some 8,000 files. The method is also applicable to network trace data ch...

Large enterprises use clusters of computers with varying computing power to process workloads that are heterogeneous in terms of the type of jobs and the nature of their arrival processes. The scheduling of jobs from a workload has a significant impact on their execution times. This report presents a trace-driven analytic model (TDAM) method that can be used to assess the impact of different sc...

The chemistry community has long sought the exact relationship between conventional and unitary coupled cluster ansatz for a single-reference system, especially given interest in performing quantum on computers. In this work, we show how one can use operator manipulations by exponential disentangling identity Hadamard lemma to relate factorized form of coupled-cluster approximation (the is requ...

A new algorithm for molecular dynamics simulations of biological macromolecules on parallel computers, point-centered domain decomposition, is introduced. The molecular system is divided into clusters that are assigned to individual processors. Each cluster is characterized by a center point and comprises all atoms that are closer to its center point than to the center point of any other cluste...

Gardens is an integrated programming language and system designed to support parallel computing across nondedicated cluster computers, in particular networks of PCs. To utilise non-dedicated machines a program must adapt to those currently available. In Gardens this is realised by over decomposing a program into more tasks than processors, and migrating tasks to implement adaptation. Communicat...

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...