Workshop on High Performance Computing and Gigabit Local Area Networks

by G. Cooperman (Editor), G. Michler (Editor), H. Vinck (Editor)

Overview

The combination of fast, low-latency networks and high-performance, distributed tools for mathematical software has resulted in widespread, affordable scientific computing facilities. Practitioners working in the fields of computer communication networks, distributed computing, computational algebra and numerical analysis have been brought together to contribute to this volume and explore the emerging distributed and parallel technology in a scientific environment. This collection includes surveys and original research on both software infrastructure for parallel applications and hardware and architecture infrastructure. Among the topics covered are switch-based high-speed networks, ATM over local and wide area networks, network performance, application support, finite element methods, eigenvalue problems, invariant subspace decomposition, QR factorization and Todd-Coxseter coset enumeration.

Product Details

ISBN-13:	9783540761693
Publisher:	Springer Berlin Heidelberg
Publication date:	08/08/1997
Series:	Lecture Notes in Control and Information Sciences , #226
Pages:	237
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

Introduction: High performance computing and the technology of switch-based computer networks.- High Performance Computing and Communication research at the National Science Foundation.- Practical parallel coset enumeration.- High performance computing over switch-based high-speed networks.- ATM High Performance Distributed Computing Laboratory.- Switched Virtual Networking.- Parallel large scale finite element computations.- Employing Deterministic and Shastic Petri Nets for the analysis of Usage Parameter Control in ATM-networks.- Parallel algorithms for computing rank-revealing QR factorizations.- A distributed algorithm for the construction of invariant subspaces.- ATM in practice.- Measurements, proper scaling and application of communication parameters.- Matrix multiplication over small finite fields on MIMD architectures.- Parallel algorithms for dense eigenvalue problems.- Enhanced communication support for networked applications.