Normal mode acoustic propagation models. E.A. Vavalis. the computer code to a network of heterogeneous workstations using the Parallel
|
|
- Stuart Taylor
- 6 years ago
- Views:
Transcription
1 Normal mode acoustic propagation models on heterogeneous networks of workstations E.A. Vavalis University of Crete, Mathematics Department, Heraklion, GREECE and IACM, FORTH, Heraklion, GREECE. Abstract A parallel implementation on a Single Instruction Multiple Data (SIMD) platform of an operational numerical sound propagation model is presented. We describe the parallel methodology used and we present certain implementation issues for porting the computer code to a network of heterogeneous workstations using the Parallel Virtual Machine (PVM) infrastructure. 1 Introduction A parallel implementation on a Single Instruction Multiple Data (SIMD) platform of an operational numerical sound propagation model is presented. We describe the parallel methodology used and we present certain implementation issues for porting the computer code to a network of heterogeneous workstations using the Parallel Virtual Machine (PVM) infrastructure. The performance of the code on such a network is presented and analyzed. Instructions on using the parallelized computational model are also given. Parallelism in SNAP SNAP [3] is a sound propagation model based on normal mode theory design to treat a shallow-water ocean environment as realistically as possible. In this 1 Work supported in part by PENED grant Preprint submitted to Elsevier Science 19 November 1996
2 model the acoustic eld from a harmonic source at position (0; z0) can be written as P (r; z) =! 0 4 X n=1 Nu n (z0)u n (z)h (1) 0 (k n r); (1) where! is the source frequency, 0 is the water density, (u n,k n ) is the modal eigenpaire and H (1) 0 the zeroth order Hankel function of the rst kind. Most of the computation involved i this model is included into a double nested loop. The outer ones loop over a certain large set of frequencies while the inner computes the eigenpairs by solving an eigenvalue problem dened by the Helmholtz equation d! 3 u n (z)! dz + 4? k c(z) n 5 un (z) = 0; () and appropriate boundary conditions. For production runs both the number of modes n and the number of frequencies n f are large. Present day computer power limits the size of these two numbers leading to approximations that might be unsatisfactory from a physics point of view. Based on this computational structure one can exploit parallelism for both nested loops since each computational module inside can be carried out independently. Thus there are two levels of inherent parallelism and in our approach we naturally decided to parallelize the outer loop. For the parallel implementation of the SNAP code we used the PVM [] infrastructure. PVM is a software package that allows a heterogeneous network of parallel and serial computers to appear as a single concurrent computational resource. Our PVM/SNAP code consists of a host/master program which after performing certain initializations splits the rest of the computation into a set of independently tasks by simply partitioning the frequencies. The master then spawns the child/slave processes associated with each subtask, assigns them to each member of the computer network and then waits for a termination message from each child/slave process which performs all computation. The child processes after receiving the range of the frequencies assigned to it, computes the associated acoustic eld, writes it to a le on its local disc (or to a common disc if all members of the computer network are on a network le system (NFS) ), sends a completion message to the parent process and exits. It is worth to point out that there is no interprocess communication between the child processes.
3 3 Performance In this section we present some preliminary timing results that exhibit the increased eciency of the parallelized SNAP code. Specically we have considered a sound propagation problem involving 01 number of frequencies and 35 modes. We solved this problem it on a heterogeneous computer network consisting of: A SUN4 Sparcstation with domain name sonar.iacm.forth.gr. Two IBM/RS 6000 workstations. These machines with domain names akkali and apollon are coupled together with NFS, belong in the domain iesl.forth.gr. Three HP3000 workstations. Two of them (named nireas and orfeas) belong in the domain iesl.forth.gr, are congured in cluster and are connected together with NFS The third one (named n08hp) is in the cc.uch.gr domain and writes on its local disk. It should be pointed out that the above workstations are physically located in three buildings which are several kilometers apart. In Figure 1 we present the trace of the parallel execution of the program using three IBMs only which was obtained using the XPVM parallel performance tool [1]. As expected, we can easily see that the master/host program after performing a limited amount of computation spawns the three child processes which run in parallel till termination. In Table 1 we give the total wall-clock execution time (in hours and seconds) the associated speedups and the congurations of the network system used. Specically we started our measurements using sonar only and kept adding machines as shown in the second column of Table 1. In the third column we give the total execution time (obtained using the timex command) and in the fourth the speedup obtained. (As speedup with i processors we denote the ration of the total time using one processor over total time using i processors.) As this table depicts, we achieve almost optimum speed-up in all congurations and we were able to reduce the total elapse time by a factor of more than 5 using six dierent machines. It should be marked here that the workload was equally distributed along the machines which appear in the second column ordered from the slowest (sonar) to the fastest. In order to use arbitrarily selected machines a workload partition strategy based on the speed and the load of each machine should be used. 3
4 Table 1 Total execution time and speed-up processors Conguration Total Time Speed-up 1 sonar 5:11 + akkali : apollon : n08hp 1: nireas 1: proteas 1: Load balanching the normal mode computations 5 Usage We rst assume that PVM is installed on all machines we plan to use. The parallel SNAP code consists of a master/host program and a parent/node program. To build the two associated executables one needs to compile the code with the -lfpvm3 -lpvm3 ags. The node executables should be placed in the directory $(HOME)/pvm3/bin/ARCH where ARCH represents the architecture of each machine and has values HPPA for the HP-9000 workstations, SUN4 for the SUN4 Sparcstation, CNVXN for the CONVEX C and RS6K for the IBM/RS600. To specify the machines we plan to use we should create a le (named say hostfile which contains all hosts chosen to run SNAP. The rst row of this le should contain the domain name of the host machine while the rest lines hold the names of the node machines and the user ids (they do not have to be the same on all nodes) as shown below. n08hp.cc.uch.gr nireas.iesl.forth.gr lo=mav pw orpheas.iesl.forth.gr lo=mav pw ikaros.cc.uch.gr lo=mav pw athina.cc.uch.gr lo=mav pw pasifae.cc.uch.gr lo=mav pw To run SNAP now on the specied computer platform we need to have, in the $(HOME) directory, two input les named data.dat and numbers.dat. The rst one contains the data for the SNAP and the second lines with the character 'i' for i = 1; : : : ; nmachs? 1 at each line i. nmachs is the number of the machines to be used. We start the execution by typing pvmd hostfile. 4
5 Each parent process writes its output on a le named foo. Additional details on the usage of PVM and XPVM can be found in [] and [1] and a complete running example of the parallel SNAP in directory mav/snap on n08hp.cc.uch.gr. References [1] T. Dunigan, Xpvm, Tech. Report ORNL/TM-10881, Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN, Sept pages. [] A. Geist, A. Bequelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM: Parallel Virtual Machine. User's Guide and tutorial for networked Parallel Computing, The MIT Press, Cambridge, MA, [3] F. Jensen and M. Ferla, SNAP: the Saclantcen normal{mode acoustic propagation model, Tech. Report SM{11, Saclantcen ASW Research Center, Saclantcen, Italy, Jan
100 Mbps DEC FDDI Gigaswitch
PVM Communication Performance in a Switched FDDI Heterogeneous Distributed Computing Environment Michael J. Lewis Raymond E. Cline, Jr. Distributed Computing Department Distributed Computing Department
More informationMOTION ESTIMATION IN MPEG-2 VIDEO ENCODING USING A PARALLEL BLOCK MATCHING ALGORITHM. Daniel Grosu, Honorius G^almeanu
MOTION ESTIMATION IN MPEG-2 VIDEO ENCODING USING A PARALLEL BLOCK MATCHING ALGORITHM Daniel Grosu, Honorius G^almeanu Multimedia Group - Department of Electronics and Computers Transilvania University
More informationParallelizing a seismic inversion code using PVM: a poor. June 27, Abstract
Parallelizing a seismic inversion code using PVM: a poor man's supercomputer June 27, 1994 Abstract This paper presents experience with parallelization using PVM of DSO, a seismic inversion code developed
More informationn m-dimensional data points K Clusters KP Data Points (Cluster centers) K Clusters
Clustering using a coarse-grained parallel Genetic Algorithm: A Preliminary Study Nalini K. Ratha Anil K. Jain Moon J. Chung Department of Computer Science Department of Computer Science Department of
More informationCommission of the European Communities **************** ESPRIT III PROJECT NB 6756 **************** CAMAS
Commission of the European Communities **************** ESPRIT III PROJECT NB 6756 **************** CAMAS COMPUTER AIDED MIGRATION OF APPLICATIONS SYSTEM **************** CAMAS-TR-2.3.4 Finalization Report
More informationActive Motion Detection and Object Tracking. Joachim Denzler and Dietrich W.R.Paulus.
0 Active Motion Detection and Object Tracking Joachim Denzler and Dietrich W.R.Paulus denzler,paulus@informatik.uni-erlangen.de The following paper was published in the Proceedings on the 1 st International
More informationHARNESS. provides multi-level hot pluggability. virtual machines. split off mobile agents. merge multiple collaborating sites.
HARNESS: Heterogeneous Adaptable Recongurable NEtworked SystemS Jack Dongarra { Oak Ridge National Laboratory and University of Tennessee, Knoxville Al Geist { Oak Ridge National Laboratory James Arthur
More informationSupporting Heterogeneous Network Computing: PVM. Jack J. Dongarra. Oak Ridge National Laboratory and University of Tennessee. G. A.
Supporting Heterogeneous Network Computing: PVM Jack J. Dongarra Oak Ridge National Laboratory and University of Tennessee G. A. Geist Oak Ridge National Laboratory Robert Manchek University of Tennessee
More information[8] J. J. Dongarra and D. C. Sorensen. SCHEDULE: Programs. In D. B. Gannon L. H. Jamieson {24, August 1988.
editor, Proceedings of Fifth SIAM Conference on Parallel Processing, Philadelphia, 1991. SIAM. [3] A. Beguelin, J. J. Dongarra, G. A. Geist, R. Manchek, and V. S. Sunderam. A users' guide to PVM parallel
More informationTechnische Universitat Munchen. Institut fur Informatik. D Munchen.
Developing Applications for Multicomputer Systems on Workstation Clusters Georg Stellner, Arndt Bode, Stefan Lamberts and Thomas Ludwig? Technische Universitat Munchen Institut fur Informatik Lehrstuhl
More informationThe Architecture of a System for the Indexing of Images by. Content
The Architecture of a System for the Indexing of s by Content S. Kostomanolakis, M. Lourakis, C. Chronaki, Y. Kavaklis, and S. C. Orphanoudakis Computer Vision and Robotics Laboratory Institute of Computer
More informationAbstract. This paper describes the implementation of PVM in the new WIN32-bit world. There are
Another Architecture: PVM on Windows 95èNT Markus Fischer æy Jack Dongarra æ z October 4, 1996 Abstract This paper describes the implementation of PVM in the new WIN32-bit world. There are no restrictions
More informationParallel Implementation of a Unied Approach to. Image Focus and Defocus Analysis on the Parallel Virtual Machine
Parallel Implementation of a Unied Approach to Image Focus and Defocus Analysis on the Parallel Virtual Machine Yen-Fu Liu, Nai-Wei Lo, Murali Subbarao, Bradley S. Carlson yiu@sbee.sunysb.edu, naiwei@sbee.sunysb.edu
More informationRendering Computer Animations on a Network of Workstations
Rendering Computer Animations on a Network of Workstations Timothy A. Davis Edward W. Davis Department of Computer Science North Carolina State University Abstract Rendering high-quality computer animations
More informationCUMULVS: Collaborative Infrastructure for Developing. Abstract. by allowing them to dynamically attach to, view, and \steer" a running simulation.
CUMULVS: Collaborative Infrastructure for Developing Distributed Simulations James Arthur Kohl Philip M. Papadopoulos G. A. Geist, II y Abstract The CUMULVS software environment provides remote collaboration
More informationUnsupervised Distributed Clustering
Unsupervised Distributed Clustering D. K. Tasoulis, M. N. Vrahatis, Department of Mathematics, University of Patras Artificial Intelligence Research Center (UPAIRC), University of Patras, GR 26110 Patras,
More informationParallel Arch. & Lang. (PARLE 94), Lect. Notes in Comp. Sci., Vol 817, pp , July 1994
Parallel Arch. & Lang. (PARLE 94), Lect. Notes in Comp. Sci., Vol 817, pp. 202-213, July 1994 A Formal Approach to Modeling Expected Behavior in Parallel Program Visualizations? Joseph L. Sharnowski and
More informationTHE IMPLEMENTATION OF A DISTRIBUTED FILE SYSTEM SUPPORTING THE PARALLEL WORLD MODEL. Jun Sun, Yasushi Shinjo and Kozo Itano
THE IMPLEMENTATION OF A DISTRIBUTED FILE SYSTEM SUPPORTING THE PARALLEL WORLD MODEL Jun Sun, Yasushi Shinjo and Kozo Itano Institute of Information Sciences and Electronics University of Tsukuba Tsukuba,
More informationLINUX. Benchmark problems have been calculated with dierent cluster con- gurations. The results obtained from these experiments are compared to those
Parallel Computing on PC Clusters - An Alternative to Supercomputers for Industrial Applications Michael Eberl 1, Wolfgang Karl 1, Carsten Trinitis 1 and Andreas Blaszczyk 2 1 Technische Universitat Munchen
More informationEvaluation of Parallel Application s Performance Dependency on RAM using Parallel Virtual Machine
Evaluation of Parallel Application s Performance Dependency on RAM using Parallel Virtual Machine Sampath S 1, Nanjesh B R 1 1 Department of Information Science and Engineering Adichunchanagiri Institute
More informationA MATLAB Toolbox for Distributed and Parallel Processing
A MATLAB Toolbox for Distributed and Parallel Processing S. Pawletta a, W. Drewelow a, P. Duenow a, T. Pawletta b and M. Suesse a a Institute of Automatic Control, Department of Electrical Engineering,
More informationA Graphical Interface to Multi-tasking Programming Problems
A Graphical Interface to Multi-tasking Programming Problems Nitin Mehra 1 UNO P.O. Box 1403 New Orleans, LA 70148 and Ghasem S. Alijani 2 Graduate Studies Program in CIS Southern University at New Orleans
More informationNortheast Parallel Architectures Center. Syracuse University. May 17, Abstract
The Design of VIP-FS: A Virtual, Parallel File System for High Performance Parallel and Distributed Computing NPAC Technical Report SCCS-628 Juan Miguel del Rosario, Michael Harry y and Alok Choudhary
More informationDynamic Reconguration and Virtual Machine. System. Abstract. Metacomputing frameworks have received renewed attention
Dynamic Reconguration and Virtual Machine Management in the Harness Metacomputing System Mauro Migliardi 1, Jack Dongarra 23, l Geist 2, and Vaidy Sunderam 1 1 Emory University, Dept. Of Math and omputer
More informationPARALLEL PERFORMANCE DIRECTED TECHNOLOGY MAPPING FOR FPGA. Laurent Lemarchand. Informatique. ea 2215, D pt. ubo University{ bp 809
PARALLEL PERFORMANCE DIRECTED TECHNOLOGY MAPPING FOR FPGA Laurent Lemarchand Informatique ubo University{ bp 809 f-29285, Brest { France lemarch@univ-brest.fr ea 2215, D pt ABSTRACT An ecient distributed
More informationMULTILEVEL PARALLELISM APPLIED TO THE OPTIMIZATION OF MOBILE NETWORKS
MULTILEVEL PARALLELISM APPLIED TO THE OPTIMIZATION OF MOBILE NETWORKS P. Kuonen, F. Guidec, P. Calégari Computer Science Department Swiss Federal Institute of Technology CH-1015 Lausanne, Switzerland E-mail:
More informationThe PVM 3.4 Tracing Facility and XPVM 1.1 *
The PVM 3.4 Tracing Facility and XPVM 1.1 * James Arthur Kohl (kohl@msr.epm.ornl.gov) G. A. Geist (geist@msr.epm.ornl.gov) Computer Science & Mathematics Division Oak Ridge National Laboratory Oak Ridge,
More informationAccess pattern Time (in millions of references)
Visualizing Working Sets Evangelos P. Markatos Institute of Computer Science (ICS) Foundation for Research & Technology { Hellas (FORTH) P.O.Box 1385, Heraklio, Crete, GR-711-10 GREECE markatos@csi.forth.gr,
More informationTransactions on Information and Communications Technologies vol 9, 1995 WIT Press, ISSN
Finite difference and finite element analyses using a cluster of workstations K.P. Wang, J.C. Bruch, Jr. Department of Mechanical and Environmental Engineering, q/ca/z/brm'a, 5Wa jbw6wa CW 937% Abstract
More informationApplications PVM (Parallel Virtual Machine) Socket Interface. Unix Domain LLC/SNAP HIPPI-LE/FP/PH. HIPPI Networks
Enhanced PVM Communications over a HIPPI Local Area Network Jenwei Hsieh, David H.C. Du, Norman J. Troullier 1 Distributed Multimedia Research Center 2 and Computer Science Department, University of Minnesota
More informationParallel Unsupervised k-windows: An Efficient Parallel Clustering Algorithm
Parallel Unsupervised k-windows: An Efficient Parallel Clustering Algorithm Dimitris K. Tasoulis 1,2 Panagiotis D. Alevizos 1,2, Basilis Boutsinas 2,3, and Michael N. Vrahatis 1,2 1 Department of Mathematics,
More informationsizes. Section 5 briey introduces some of the possible applications of the algorithm. Finally, we draw some conclusions in Section 6. 2 MasPar Archite
Parallelization of 3-D Range Image Segmentation on a SIMD Multiprocessor Vipin Chaudhary and Sumit Roy Bikash Sabata Parallel and Distributed Computing Laboratory SRI International Wayne State University
More informationDynamic Process Management in an MPI Setting. William Gropp. Ewing Lusk. Abstract
Dynamic Process Management in an MPI Setting William Gropp Ewing Lusk Mathematics and Computer Science Division Argonne National Laboratory gropp@mcs.anl.gov lusk@mcs.anl.gov Abstract We propose extensions
More informationPOM: a Virtual Parallel Machine Featuring Observation Mechanisms
POM: a Virtual Parallel Machine Featuring Observation Mechanisms Frédéric Guidec, Yves Mahéo To cite this version: Frédéric Guidec, Yves Mahéo. POM: a Virtual Parallel Machine Featuring Observation Mechanisms.
More informationParallelizing the Unsupervised k-windows Clustering Algorithm
Parallelizing the Unsupervised k-windows Clustering Algorithm Panagiotis D. Alevizos 1,2, Dimitris K. Tasoulis 1,2, and Michael N. Vrahatis 1,2 1 Department of Mathematics, University of Patras, GR-26500
More informationParallel Algorithms for the Third Extension of the Sieve of Eratosthenes. Todd A. Whittaker Ohio State University
Parallel Algorithms for the Third Extension of the Sieve of Eratosthenes Todd A. Whittaker Ohio State University whittake@cis.ohio-state.edu Kathy J. Liszka The University of Akron liszka@computer.org
More informationParallel Processing using PVM on a Linux Cluster. Thomas K. Gederberg CENG 6532 Fall 2007
Parallel Processing using PVM on a Linux Cluster Thomas K. Gederberg CENG 6532 Fall 2007 What is PVM? PVM (Parallel Virtual Machine) is a software system that permits a heterogeneous collection of Unix
More informationSUMMARY. computationally more expensive but suitable for currently available parallel computers.
algorithms on parallel computers Suhas Phadke*, Dheeraj Bhardwaj and Sudhakar Yerneni Centre for Development of Advanced Computing, Pune University Campus, GaneshKhind, Pune 411007, India SUMMARY This
More informationexecution host commd
Batch Queuing and Resource Management for Applications in a Network of Workstations Ursula Maier, Georg Stellner, Ivan Zoraja Lehrstuhl fur Rechnertechnik und Rechnerorganisation (LRR-TUM) Institut fur
More informationDecember 28, Abstract. In this report we describe our eorts to parallelize the VGRIDSG unstructured surface
A Comparison of Using APPL and PVM for a Parallel Implementation of an Unstructured Grid Generation Program T. Arthur y M. Bockelie z December 28, 1992 Abstract In this report we describe our eorts to
More informationPARA++ : C++ Bindings for Message Passing Libraries
PARA++ : C++ Bindings for Message Passing Libraries O. Coulaud, E. Dillon {Olivier.Coulaud, Eric.Dillon}@loria.fr INRIA-lorraine BP101, 54602 VILLERS-les-NANCY, FRANCE Abstract The aim of Para++ is to
More informationMultiple Data Sources
DATA EXCHANGE: HIGH PERFORMANCE COMMUNICATIONS IN DISTRIBUTED LABORATORIES GREG EISENHAUER BETH SCHROEDER KARSTEN SCHWAN VERNARD MARTIN JEFF VETTER College of Computing Georgia Institute of Technology
More informationEvaluating Personal High Performance Computing with PVM on Windows and LINUX Environments
Evaluating Personal High Performance Computing with PVM on Windows and LINUX Environments Paulo S. Souza * Luciano J. Senger ** Marcos J. Santana ** Regina C. Santana ** e-mails: {pssouza, ljsenger, mjs,
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Collaborative Simulation for Hybrid Networks by S. Gupta, J.S. Baras, G.C. Atallah CSHCN T.R. 96-15 (ISR T.R. 96-80) The Center for Satellite and Hybrid Communication Networks
More informationPVM on Windows and NT Clusters
PVM on Windows and NT Clusters Stephen L. Scott 1,+, Markus Fischer 2, and Al Geist 1 1 Oak Ridge National Laboratory, Computer Science and Mathematics Division, P.O. Box 2008, Bldg. 6012, MS-6367, Oak
More informationCHAPTER 4 AN INTEGRATED APPROACH OF PERFORMANCE PREDICTION ON NETWORKS OF WORKSTATIONS. Xiaodong Zhang and Yongsheng Song
CHAPTER 4 AN INTEGRATED APPROACH OF PERFORMANCE PREDICTION ON NETWORKS OF WORKSTATIONS Xiaodong Zhang and Yongsheng Song 1. INTRODUCTION Networks of Workstations (NOW) have become important distributed
More informationa simple structural description of the application
Developing Heterogeneous Applications Using Zoom and HeNCE Richard Wolski, Cosimo Anglano 2, Jennifer Schopf and Francine Berman Department of Computer Science and Engineering, University of California,
More informationKevin Skadron. 18 April Abstract. higher rate of failure requires eective fault-tolerance. Asynchronous consistent checkpointing oers a
Asynchronous Checkpointing for PVM Requires Message-Logging Kevin Skadron 18 April 1994 Abstract Distributed computing using networked workstations oers cost-ecient parallel computing, but the higher rate
More informationAssignment 4. Overview. Prof. Stewart Weiss. CSci 335 Software Design and Analysis III Assignment 4
Overview This assignment combines several dierent data abstractions and algorithms that we have covered in class, including priority queues, on-line disjoint set operations, hashing, and sorting. The project
More informationApplication. CoCheck Overlay Library. MPE Library Checkpointing Library. OS Library. Operating System
Managing Checkpoints for Parallel Programs Jim Pruyne and Miron Livny Department of Computer Sciences University of Wisconsin{Madison fpruyne, mirong@cs.wisc.edu Abstract Checkpointing is a valuable tool
More informationNetwork. Department of Statistics. University of California, Berkeley. January, Abstract
Parallelizing CART Using a Workstation Network Phil Spector Leo Breiman Department of Statistics University of California, Berkeley January, 1995 Abstract The CART (Classication and Regression Trees) program,
More informationA Study of Workstation Computational Performance for Real-Time Flight Simulation
A Study of Workstation Computational Performance for Real-Time Flight Simulation Summary Jeffrey M. Maddalon Jeff I. Cleveland II This paper presents the results of a computational benchmark, based on
More informationDeveloping a Thin and High Performance Implementation of Message Passing Interface 1
Developing a Thin and High Performance Implementation of Message Passing Interface 1 Theewara Vorakosit and Putchong Uthayopas Parallel Research Group Computer and Network System Research Laboratory Department
More informationMinoru SASAKI and Kenji KITA. Department of Information Science & Intelligent Systems. Faculty of Engineering, Tokushima University
Information Retrieval System Using Concept Projection Based on PDDP algorithm Minoru SASAKI and Kenji KITA Department of Information Science & Intelligent Systems Faculty of Engineering, Tokushima University
More information2 Rupert W. Ford and Michael O'Brien Parallelism can be naturally exploited at the level of rays as each ray can be calculated independently. Note, th
A Load Balancing Routine for the NAG Parallel Library Rupert W. Ford 1 and Michael O'Brien 2 1 Centre for Novel Computing, Department of Computer Science, The University of Manchester, Manchester M13 9PL,
More informationJ.A.J.Hall, K.I.M.McKinnon. September 1996
PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing J.A.J.Hall, K.I.M.McKinnon September 1996 MS 96-012 Supported by EPSRC research grant GR/J0842 Presented at
More informationIntroduction to OpenMP
Introduction to OpenMP Ricardo Fonseca https://sites.google.com/view/rafonseca2017/ Outline Shared Memory Programming OpenMP Fork-Join Model Compiler Directives / Run time library routines Compiling and
More informationReal-Time Scalability of Nested Spin Locks. Hiroaki Takada and Ken Sakamura. Faculty of Science, University of Tokyo
Real-Time Scalability of Nested Spin Locks Hiroaki Takada and Ken Sakamura Department of Information Science, Faculty of Science, University of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113, Japan Abstract
More informationTRAPPER A GRAPHICAL PROGRAMMING ENVIRONMENT O. KR AMER-FUHRMANN. German National Research Center for Computer Science (GMD)
TRAPPER A GRAPHICAL PROGRAMMING ENVIRONMENT FOR PARALLEL SYSTEMS O. KR AMER-FUHRMANN German National Research Center for Computer Science (GMD) Schloss Birlinghoven, D-53757 Sankt Augustin, Germany L.
More informationOpenMP Shared Memory Programming
OpenMP Shared Memory Programming John Burkardt, Information Technology Department, Virginia Tech.... Mathematics Department, Ajou University, Suwon, Korea, 13 May 2009.... http://people.sc.fsu.edu/ jburkardt/presentations/
More informationStorage System. Distributor. Network. Drive. Drive. Storage System. Controller. Controller. Disk. Disk
HRaid: a Flexible Storage-system Simulator Toni Cortes Jesus Labarta Universitat Politecnica de Catalunya - Barcelona ftoni, jesusg@ac.upc.es - http://www.ac.upc.es/hpc Abstract Clusters of workstations
More informationN E T W O R K. MSC.Marc 2000 Network Version for UNIX. Installation and User Notes
N E T W O R K MSC.Marc 2000 Network Version for UNIX Installation and User Notes MSC.Marc 2000 Network Version for UNIX Installation and Usage This document describes the installation and usage of the
More informationApplication based Evaluation of Distributed Shared Memory Versus Message Passing
Application based Evaluation of Distributed Shared Memory Versus Message Passing Sumit Roy, Vipin Chaudary and Shi Jia Padmanabhan Menon Parallel and Distributed Computing Laboratory Enterprise Systems
More informationImproving PVM Performance Using ATOMIC User-Level Protocol. Hong Xu and Tom W. Fisher. Marina del Rey, CA
Improving PVM Performance Using ATOMIC User-Level Protocol Hong Xu and Tom W. Fisher Information Sciences Institute University of Southern California Marina del Rey, CA 90292-6695 Abstract Parallel virtual
More informationdirector executor user program user program signal, breakpoint function call communication channel client library directing server
(appeared in Computing Systems, Vol. 8, 2, pp.107-134, MIT Press, Spring 1995.) The Dynascope Directing Server: Design and Implementation 1 Rok Sosic School of Computing and Information Technology Grith
More informationNative Marshalling. Java Marshalling. Mb/s. kbytes
Design Issues for Ecient Implementation of MPI in Java Glenn Judd, Mark Clement, Quinn Snell Computer Science Department, Brigham Young University, Provo, USA Vladimir Getov 2 2 School of Computer Science,
More informationChapter 18: Database System Architectures.! Centralized Systems! Client--Server Systems! Parallel Systems! Distributed Systems!
Chapter 18: Database System Architectures! Centralized Systems! Client--Server Systems! Parallel Systems! Distributed Systems! Network Types 18.1 Centralized Systems! Run on a single computer system and
More informationDesign and Implementation of a Java-based Distributed Debugger Supporting PVM and MPI
Design and Implementation of a Java-based Distributed Debugger Supporting PVM and MPI Xingfu Wu 1, 2 Qingping Chen 3 Xian-He Sun 1 1 Department of Computer Science, Louisiana State University, Baton Rouge,
More informationDistributed Batch Controller. Department of Computer Science, University of Maryland, College Park, MD USA. Waterloo, ON N2L 3G1 Canada
Processing TOVS Polar Pathnder Data Using the Distributed Batch Controller James Du a, Kenneth Salem b, Axel Schweiger c, and Miron Livny d a Department of Computer Science, University of Maryland, College
More informationUsing A Network of workstations to enhance Database Query Processing Performance
Using A Network of workstations to enhance Database Query Processing Performance Mohammed Al Haddad, Jerome Robinson Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4
More informationArray Decompositions for Nonuniform Computational Environments
Syracuse University SURFACE College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects College of Engineering and Computer Science 996 Array Decompositions for Nonuniform
More informationIntroduction to Programming in C Department of Computer Science and Engineering. Lecture No. #16 Loops: Matrix Using Nested for Loop
Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #16 Loops: Matrix Using Nested for Loop In this section, we will use the, for loop to code of the matrix problem.
More informationShows nodes and links, Node pair A-B, and a route between A and B.
Solving Stochastic Optimization Problems on Computational Grids Steve Wright Argonne ational Laboratory University of Chicago University of Wisconsin-Madison Dundee, June 26, 2001. Outline Stochastic Programming
More informationDeveloping Interactive PVM-based Parallel Programs on Distributed Computing Systems within AVS Framework
Syracuse University SURFACE Northeast Parallel Architecture Center College of Engineering and Computer Science 1994 Developing Interactive PVM-based Parallel Programs on Distributed Computing Systems within
More informationThe MPBench Report. Philip J. Mucci. Kevin London. March 1998
The MPBench Report Philip J. Mucci Kevin London mucci@cs.utk.edu london@cs.utk.edu March 1998 1 Introduction MPBench is a benchmark to evaluate the performance of MPI and PVM on MPP's and clusters of workstations.
More informationFlow simulation. Frank Lohmeyer, Oliver Vornberger. University of Osnabruck, D Osnabruck.
To be published in: Notes on Numerical Fluid Mechanics, Vieweg 1994 Flow simulation with FEM on massively parallel systems Frank Lohmeyer, Oliver Vornberger Department of Mathematics and Computer Science
More informationCovering the Aztec Diamond with One-sided Tetrasticks Extended Version
Covering the Aztec Diamond with One-sided Tetrasticks Extended Version Alfred Wassermann, University of Bayreuth, D-95440 Bayreuth, Germany Abstract There are 107 non-isomorphic coverings of the Aztec
More informationSimple Nested Dielectrics in Ray Traced Images
Simple Nested Dielectrics in Ray Traced Images Charles M. Schmidt and Brian Budge University of Utah Abstract This paper presents a simple method for modeling and rendering refractive objects that are
More information/98 $10.00 (c) 1998 IEEE
CUMULVS: Extending a Generic Steering and Visualization Middleware for lication Fault-Tolerance Philip M. Papadopoulos, phil@msr.epm.ornl.gov James Arthur Kohl, kohl@msr.epm.ornl.gov B. David Semeraro,
More informationGlobal Solution of Mixed-Integer Dynamic Optimization Problems
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 25 Elsevier Science B.V. All rights reserved. Global Solution of Mixed-Integer Dynamic Optimization
More informationCSC 4320 Test 1 Spring 2017
CSC 4320 Test 1 Spring 2017 Name 1. What are the three main purposes of an operating system? 2. Which of the following instructions should be privileged? a. Set value of timer. b. Read the clock. c. Clear
More informationBLOCK COMMUNICATION BETWEEN BLOCKS BOUNDARY DATA STORAGE
Distributed-Memory Computing With the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) Christopher J. Riley and F. McNeil Cheatwood y NASA Langley Research Center, Hampton, VA 368 Paper Presented
More informationChapter 20: Database System Architectures
Chapter 20: Database System Architectures Chapter 20: Database System Architectures Centralized and Client-Server Systems Server System Architectures Parallel Systems Distributed Systems Network Types
More informationParallel Algorithm Design. CS595, Fall 2010
Parallel Algorithm Design CS595, Fall 2010 1 Programming Models The programming model o determines the basic concepts of the parallel implementation and o abstracts from the hardware as well as from the
More informationAnalytical Modeling of Parallel Systems. To accompany the text ``Introduction to Parallel Computing'', Addison Wesley, 2003.
Analytical Modeling of Parallel Systems To accompany the text ``Introduction to Parallel Computing'', Addison Wesley, 2003. Topic Overview Sources of Overhead in Parallel Programs Performance Metrics for
More informationThe Use of the MPI Communication Library in the NAS Parallel Benchmarks
The Use of the MPI Communication Library in the NAS Parallel Benchmarks Theodore B. Tabe, Member, IEEE Computer Society, and Quentin F. Stout, Senior Member, IEEE Computer Society 1 Abstract The statistical
More informationLoad Balancing of Parallel Simulated Annealing on a Temporally Heterogeneous Cluster of Workstations
Load Balancing of Parallel Simulated Annealing on a Temporally Heterogeneous Cluster of Workstations Sourabh Moharil and Soo-Young Lee Department of Electrical and Computer Engineering Auburn University,
More informationGNATDIST : a conguration language for. distributed Ada 95 applications. Yvon Kermarrec and Laurent Nana. Departement Informatique
GNATDIST : a conguration language for distributed Ada 95 applications Yvon Kermarrec and Laurent Nana ENST de Bretagne Departement Informatique Technop^ole de l'iroise F 29 285 Brest Cedex France Yvon.Kermarrec@enst-bretagne.fr
More informationTimo Lähivaara, Tomi Huttunen, Simo-Pekka Simonaho University of Kuopio, Department of Physics P.O.Box 1627, FI-70211, Finland
Timo Lähivaara, Tomi Huttunen, Simo-Pekka Simonaho University of Kuopio, Department of Physics P.O.Box 627, FI-72, Finland timo.lahivaara@uku.fi INTRODUCTION The modeling of the acoustic wave fields often
More informationA Fast Recursive Mapping Algorithm. Department of Computer and Information Science. New Jersey Institute of Technology.
A Fast Recursive Mapping Algorithm Song Chen and Mary M. Eshaghian Department of Computer and Information Science New Jersey Institute of Technology Newark, NJ 7 Abstract This paper presents a generic
More informationTransactions on Information and Communications Technologies vol 9, 1995 WIT Press, ISSN
A parallel approach to the extraction of boundary and shading information from digital images E. Ardizzone", A. Genco**, C. Lodato\ G. Lo Re\ R. Pirrone" "Dipartimento di Ingegneria Elettrica, Universita
More informationSpatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete-Event Simulations
Spatial ing for Load Balancing in Conservatively Synchronized Parallel Discrete-Event Simulations Abstract We re-examine the problem of load balancing in conservatively synchronized parallel, discrete-event
More informationExtending CRAFT Data-Distributions for Sparse Matrices. July 1996 Technical Report No: UMA-DAC-96/11
Extending CRAFT Data-Distributions for Sparse Matrices G. Bandera E.L. Zapata July 996 Technical Report No: UMA-DAC-96/ Published in: 2nd. European Cray MPP Workshop Edinburgh Parallel Computing Centre,
More informationThe Stepping Stones. to Object-Oriented Design and Programming. Karl J. Lieberherr. Northeastern University, College of Computer Science
The Stepping Stones to Object-Oriented Design and Programming Karl J. Lieberherr Northeastern University, College of Computer Science Cullinane Hall, 360 Huntington Ave., Boston MA 02115 lieber@corwin.ccs.northeastern.edu
More informationProceedings of Meetings on Acoustics
Proceedings of Meetings on Acoustics Volume 19, 2013 http://acousticalsociety.org/ ICA 2013 Montreal Montreal, Canada 2-7 June 2013 Underwater Acoustics Session 2aUW: Wave Propagation in a Random Medium
More informationObject-Oriented Design
Object-Oriented Design Lecturer: Raman Ramsin Lecture 10: Analysis Packages 1 Analysis Workflow: Packages The analysis workflow consists of the following activities: Architectural analysis Analyze a use
More informationDynamic Tuning of Parallel Programs
Dynamic Tuning of Parallel Programs A. Morajko, A. Espinosa, T. Margalef, E. Luque Dept. Informática, Unidad de Arquitectura y Sistemas Operativos Universitat Autonoma de Barcelona 08193 Bellaterra, Barcelona
More informationHeterogeneous parallel and distributed computing
Parallel Computing 25 (1999) 1699±1721 www.elsevier.com/locate/parco Heterogeneous parallel and distributed computing V.S. Sunderam a, *, G.A. Geist b a Department of Mathematics and Computer Science,
More informationInternational Journal of Foundations of Computer Science c World Scientic Publishing Company DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERA
International Journal of Foundations of Computer Science c World Scientic Publishing Company DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERATIONS KAM_IL SARAC, OMER E GEC_IO GLU, AMR EL ABBADI
More informationHardware Implementation of GA.
Chapter 6 Hardware Implementation of GA Matti Tommiska and Jarkko Vuori Helsinki University of Technology Otakaari 5A, FIN-02150 ESPOO, Finland E-mail: Matti.Tommiska@hut.fi, Jarkko.Vuori@hut.fi Abstract.
More information