WORKSTATION CLUSTERS: ONE WAY TO PARALLEL COMPUTING

1993 ◽  
Vol 04 (06) ◽  
pp. 1307-1314
Author(s):  
MICHAEL WEBER
Keyword(s):  
Parallel Computing ◽  
Parallel Processing ◽  
Parallel Systems ◽  
Massively Parallel ◽  
Workstation Clusters ◽  
Massively Parallel Systems

The feasibility and constraints of workstation clusters for parallel processing are investigated. Measurements of latency and bandwidth are presented to fix the position of clusters in comparison to massively parallel systems. So it becomes possible to identify the kind of applications that seem to be suited for running on a cluster.

scholarly journals Parallel Computing Applications and Financial Modelling

2004 ◽  
Vol 12 (2) ◽  
pp. 81-90 ◽  
Author(s):  
Heather M. Liddell ◽  
D. Parkinson ◽  
G.S. Hodgson ◽  
P. Dzwig
Keyword(s):  
Risk Assessment ◽  
Parallel Computing ◽  
Financial Risk ◽  
Parallel Systems ◽  
Massively Parallel ◽  
Portfolio Optimisation ◽  
Financial Modelling ◽  
Finite Element Software ◽  
Massively Parallel Systems ◽  
Distributed Array

At Queen Mary, University of London, we have over twenty years of experience in Parallel Computing Applications, mostly on "massively parallel systems", such as the Distributed Array Processors (DAPs). The applications in which we were involved included design of numerical subroutine libraries, Finite Element software, graphics tools, the physics of organic materials, medical imaging, computer vision and more recently, Financial modelling. Two of the projects related to the latter are described in this paper, namely Portfolio Optimisation and Financial Risk Assessment.

Local diagnosis in massively parallel systems

1997 ◽  
Vol 23 (6) ◽  
pp. 721-731 ◽  
Author(s):  
Roman Trobec ◽  
Izidor Jerebic
Keyword(s):  
Parallel Systems ◽  
Massively Parallel ◽  
Massively Parallel Systems

Fluid-Acoustics Interaction on Massively Parallel Systems

2015 ◽  
pp. 151-165
Author(s):  
Hans-Joachim Bungartz ◽  
Harald Klimach ◽  
Verena Krupp ◽  
Florian Lindner ◽  
Miriam Mehl ◽  
...  
Keyword(s):  
Parallel Systems ◽  
Massively Parallel ◽  
Massively Parallel Systems

scholarly journals Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

2017 ◽  
Vol 28 (7) ◽  
pp. 2031-2045 ◽  
Author(s):  
Venkatesan T. Chakaravarthy ◽  
Fabio Checconi ◽  
Prakash Murali ◽  
Fabrizio Petrini ◽  
Yogish Sabharwal
Keyword(s):  
Shortest Path ◽  
Parallel Systems ◽  
Massively Parallel ◽  
Single Source ◽  
Massively Parallel Systems ◽  
Shortest Path Algorithms
Sign in / Sign up

Export Citation Format

Share Document