In this paper, a methodology to exploit legacy sequential libraries on a multicomputer is shown. The process of integrating such libraries is exposed as a slave pool design pattern. The proposed solution is implemented using the concurrent functional programming language Erlang, and it has been applied to extend a C++ sequential XSLT library to perform clustered XSLT processing on a Beowulf, wh...

An optically interconnected Beowulf cluster has been modelled considering the optical, optoelectronic, electronic and algorithmic behaviour of the system. A Smart Pixel Array (SPA) layer was considered to alleviate the bandwidth mismatch between the commodity IO bus of the PCs and the high bandwidth in the optics. By using the SPA layer to provide load balancing for the system it has been shown...

In this paper we investigate the convergence of iterative stationary and Krylov subspace methods for the PageRank linear system, including the convergence dependency on teleportation. We demonstrate that linear system iterations converge faster than the simple power method and are less sensitive to the changes in teleportation. In order to perform this study we developed a framework for paralle...

Clinical diagnosis environments often require the availability of processed data in real-time, unfortunately, reconstruction times are prohibitive on conventional computers, neither the adoption of expensive parallel computers seems to be a viable solution. Here, we focus on development of mathematical software on high performance architectures for Total Variation based regularization reconstru...

The propagation of seismic waves through Earth can now be modeled accurately with the recently developed spectral-element method. This method takes into account heterogeneity in Earth models, such as three-dimensional variations of seismic wave velocity, density, and crustal thickness. The method is implemented on relatively inexpensive clusters of personal computers, so-called Beowulf machines...

We present a CGM/BSP algorithm for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n. The algorithm requires O(p) communication rounds and O( p ) local computing time, on a distributed memory parallel computer of p processors each with O(nm=p) memory. We also present implementation results obtained on Beowulf machine with 64 nodes. Topic of interes...

The uncanny valley (UV) hypothesis, which predicts that almost but not fully humanlike artificial characters elicit negative evaluations, has become increasingly influential. At the same time, the hypothesis has become associated with many computer-animated films that have aimed at high realism. In the present investigation, we tested whether semirealistic animated film characters do in fact el...

This paper describes the development of the PALS system, an implementation of Prolog capable of efficiently exploiting or-parallelism on distributed-memory platforms— specifically Beowulf clusters. PALS makes use of a novel technique, called incremental stack-splitting. The technique proposed builds on the stack-splitting approach, previously described by the authors and experimentally validate...

For subsurface sensing and imaging (SSI) applications, parallel computers enable massive processing of large datasets, using shared memory processing and sophisticated restoration algorithms for higher resolution images. Techniques were developed to characterize an application's serial execution and map large data sets onto Beowulf-class clusters and shared memory multiprocessor systems using M...

| The rapid increase in performance of mass market commodity microprocessors and signiicant disparity in pricing between PCs and scientiic workstations has provided an opportunity for substantial gains in performance to cost by harnessing PC technology in parallel ensembles to provide high end capability for scien-tiic and engineering applications. The Beowulf project is a NASA initiative spons...