We proposed a distributed image processing enviroment VIOS. In this paper, the third version, VIOS III is proposed. In VIOS III, a new parallel processing language VPE-p which has exible syntax for describing parallel algorithms has been developed. And the new programmable bu er for accessing global variable through local area network is also proposed. The description ability for parallel image...

We describe how the ASSIST parallel programming environment can be used to run parallel programs on collections of heterogeneous workstations and evaluate the scalability of one task-farm real application and a data-parallel benchmark, comparing the actual performance figures measured when using homogeneous and heterogeneous workstation clusters. We describe also the ASSIST approach to heteroge...

A continuing challenge to the scientiic research and engineering communities is how to fully utilize computational hardware. In particular, the proliferation of clusters of high performance workstations has become an increasingly attractive source of compute power. Developments to take advantage of this environment have previously focused primarily on managing the resources, or on providing int...

In this paper, the weakness of the traditional matrix division methods for giant matrix transpose is pointed; Specific to the nature of the giant matrixes’ transpose and based on the characteristics of asynchronous PRAM parallel computing model, some new division (such as booklet belt division, closed-loop division and Checkerboard-belt-shaped compound division) methods are proposed for improvi...

The exploitation of networked workstations as a set of under-util ized computational resources is an attractive idea for cost effective parallel computing. The use of these resources, however, raises a number of interesting policy and performance questions (e.g, what impact will a parallel application have on the normal workstation user, what performance levels can be expected when many users a...

Heterogeneous parallel systems are becoming increasingly more common, especially with the increasing use of cluster computers, such as Beowulf systems, and networks of workstations for parallel computing. Measuring and evaluating the performance of such parallel systems is not straightforward. In particular, conventional techniques such as computing speedup and efficiency are not appropriate fo...

The OMIS project aims at deening a standard interface between tools for parallel systems and monitoring systems. Monitors act as mediators between tools and the parallel program running on some target architecture. Their task is to observe and manipulate the program according to the tool's commands. A standardized interface will allow diierent research groups to develop tools which can be used ...

In this paper, the weakness of the traditional matrix division methods for giant matrix transpose is pointed; Specific to the nature of the giant matrixes’ transpose and based on the characteristics of asynchronous PRAM parallel computing model, some new division (such as booklet belt division, closed-loop division and Checkerboard-belt-shaped compound division) methods are proposed for improvi...

We study aspects of the parallel scheduling problem for a new modality of parallel computing: having one workstation “steal cycles” from another. We focus on a draconian mode of cycle-stealing, in which the owner of workstation B allows workstation A to take control of B’s processor whenever it is idle, with the promise of relinquishing control immediately upon demand. The costs for such cycle-...

Published by the IEEE Computer Society 0018-9162/09/$26.00 © 2009 IEEE existing codes. In parallel scripting, users apply parallel composition constructs to existing sequential or parallel programs. With such methods, programmers can quickly specify highly parallel applications that may, depending on problem scale, require for their execution a 16-core workstation, a 16,000-core cluster, or a 1...