PROOF [1] is an extension of ROOT [2] enabling interactive analysis of large sets of files in parallel on clusters of computers. Normally users get PROOF provided by administrators as a pre-installed shared cluster. To avoid certain disadvantages of “static” PROOF clusters PoD [3] has been developed. PROOF on Demand is a tool-set, which dynamically sets up a PROOF cluster at user request, on an...

In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically. In the scheduling scheme presented in this paper, a global scheduler situated within the cluster schedules new jobs onto the computers by modelling thei...

We present an extension of many-body downfolding methods to reduce the resources required in quantum phase estimation (QPE) algorithm. In this paper, we focus on Schrieffer–Wolff (SW) transformation electronic Hamiltonians for molecular systems that provides significant simplifications circuits simulations dynamics. demonstrate by employing Fock-space variants SW (or rank-reducing similarity tr...

Procedures and results obtained in the installation process of a microcomputers cluster (Linux and PVM) to reduce processing time in MCNP simulations are described. The necessities and specificity concerned to the hardware, the Linux operational system, the PVM software package and an adequated compiled version for MCNP4B are presented. The system was tested to verify the gain in the processing...

This paper describes the implementation of a real-time power system simulator based on a distributed cluster of PC desktop computers. A Real-time power system simulator based on a PC-cluster can successfully cope with the size requirements of growing power systems and the computational demands of fast transient studies. The distributed version of OVNI is used as core solver in addition to a dev...

HMMER, based on the profile Hidden Markov Model (HMM) is one of the most widely used sequence database searching tools, allowing researchers to compare HMMs to sequence databases or sequences to HMM databases. Such searches often take many hours and consume a great number of CPU cycles on modern computers. We present a cluster-enabled hardware/software-accelerated implementation of the HMMER se...

In this research a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically. In the scheduling scheme presented in this paper, a global scheduler situated within the cluster schedules new jobs onto the computers by modelling their...

In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of documents on distributed memory multiprocessors. The algorithm exploits the inherent data-parallelism in the extended star clustering algorithm. We implemented our algorithm on a cluster of personal computers connected ...

* This work was partially sponsored by Research Grant Council (RGC) of the Hong Kong under grants No. CityU1076/00E and CityU1055/01E. Abstract This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnection of cluster computers using multicast shared tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the sh...