Parallel implementations of two computer vision algorithms on distributed cluster platforms are described. The rst algorithm is a square-error data clustering method whose parallel implementation is based on the well-known sequential CLUSTER program. The second algorithm is a motion parameter estimation algorithm used to determine correspondence between two images taken of the same scene. Both ...

As workstation clusters (WC) become more commonly used for parallel jobs, there is a growing awareness for the need of job scheduling policies. There have been a fair number of studies on how to schedule parallel applications on parallel systems and a good survey in the area can be found in [5]. It has been shown that the best solution to the processor allocation problem in a distributed multip...

Workstations provide an attractive platform to develop software. This paper describes the NXLib environment which enables users to use this platform to develop parallel applications. The source code compatibility of NXLib applications with Intel's Paragon multicomputer system easily allows to migrate these applications to a supercomputer. The performance which can be achieved with either platfo...

the advanced technology of computer network has made Vision computing involves the execution of a large number of operations on large sets of structured data. In this paper we demonstrate that such vision tasks can be implemented in parallel on a network of workstation clusters for fast processing. We introduce some techniques used in distributed systems and adopt a divide-and-conquer policy to...

We implement a prototype for a 20-GFLOP sonar beamformer with multiple frameworks for parallelism: MPI, Computational Process Networks, and a hybrid of the two. Computational Process Networks is a framework based on the formal Process Network model and Computation Graphs, implemented with lightweight POSIX threads. We benchmark these systems on a Sun Enterprise 4000. On eight UltraSPARC-II proc...

SUMMARY Multiple sequence alignment is the NP-hard problem of aligning three or more DNA or amino acid sequences in an optimal way so as to match as many characters as possible from the set of sequences. The popular sequence alignment program ClustalW uses the classical method of approximating a sequence alignment, by first computing a distance matrix and then constructing a guide tree to show ...

Networks of workstations and high-performance microcomputers have been rarely used for running highperformance applications like multimedia, simulations, scientific and engineering applications,because, although they have significant aggregate computing power, they lack the support for efficient message-passing and shared-memory communication. In this paper we present Telegraphos, a distributed...

During the last decade one of the most relevant events in the computer market has been the large diffusion of workstations. In both industrial and research environments a huge amount of computing is done on personal workstations. Despite the rapid growth in networking technologies, however, a network of workstations cannot be easily seen as a global computational resource, although it represent...

Image generation for computer movies is a good candidate application for parallelisation. This application was used as a starting point to design a fault tolerant distributed computing environment aimed to run parallel applications. The paper rst describes the context of this work, then it presents the requirements that the environment should meet. The paper then describes the use of the Distri...

Several distributed systems and software packages allow the use of workstation clusters as a virtual machine. In general, the interfaces to these environments use diierent programming paradigms for parallel and distributed computing, e.g. multithreading within a multiprocessor workstation and message passing or remote procedure calls for distributed computing. Porting applications to other dist...