The acceptance of parallel computing in workstation clusters has increased in the past years. One important reason for this is the cost-efficiency of workstation clusters as an alternative to specialized distributed-memory parallel computer systems. A potential bottleneck for distributedmemory architectures is the interconnection network between the processing elements. This is the main disadva...

It is important to understand and eeciently predict the behavior of large message-passing parallel programs executing on massively parallel machines, especially as these machines are becoming a dominant force in the scientiic computing arena. One important tool for this kind of research is direct-execution simulation, which provides performance and scalability analysis of application codes exec...

Network-of-Workstations (NOW) seek to leverage commercial workstation technology to produce high performance computing systems at costs appreciably lower than parallel computers speciically designed for that purpose. The capabilities of technologies emerging from the PC commodity mass market are rapidly evolving to converge with those of workstations while at signiicantly lower cost. A new oper...

Clusters of workstations are increasingly being viewed as a cost-effective alternative to parallel supercomputers. However, resource management and scheduling on workstations clusters is complicated by the fact that the number of idle workstations available for executing parallel applications is constantly fluctuating. In this paper, we present a case for scheduling parallel applications on non...

Like conventional multiprocessors, workstation clusters can provide data sharing and parallel computing. But unlike multiprocessors, these clusters provide flexible connectivity and can tolerate heterogeneous processing elements. Uniprocessor LANs are a common choice for cost-effective computing. The workstation nodes typically run a version of Unix and support common Unix services such as reli...

As workstation clusters gain popularity as a parallel computing platform,there is an increasing need for performance tools that support these platforms. Performance prediction is important for performance analysis of scalable parallel applications. Although there are several performance tools available that work with PVM programs,none are capable of performance prediction. We have developed the...

This thesis describes demand-based coscheduling, a new approach to scheduling parallel computations on multiprogrammed multiprocessors. In demand-based coscheduling, rather than making the pessimistic assumption that all the processes constituting a parallel job must be simultaneously scheduled in order to achieve good performance, information about which processes are communicating is used in ...

An efficient parallel algorithm is proposed for solving the filamentaion problem of high-power femtosecond lasers pulses in gases. It was demonstrated that the algorithm possesses the property of coarse-grained parallelism and has a good scale-up characteristics when used on workstation clusters.

Jon B. Weissman Division of Computer Science University of Texas at San Antonio San Antonio, TX 78249 USA (210-458-5689 voice, 210-458-4437 fax) ([email protected]) Abstract Obtaining efficient execution of parallel programs in workstation networks is a difficult problem for the user. Unlike dedicated parallel computer resources, network resources are shared, heterogeneous, vary in availability, ...

This paper proposes a new parallel/distributed raycasting scheme for very large volume data that can be effectively used in distributed environments. Our method, based on data compression, attempts to enhance the rendering speedups by quickly reconstructing voxel data from local memory rather than expensively fetching them from remote memory spaces. Our compression-based volume rendering scheme...