Hosted with the Supercomputer Software Department RAS Home
Parallel Computing Technologies Third International Conference (PaCT-95) September 12-15, 1995. St.-Petersburg, Russia Proceedings Home PaCTs Prev Contents Next Authors
	Vol. 964

Data Structures, Computational, and Communication Kernels for Distributed Memory Sparse Iterative Solvers

by Y. Saad, A. V. Malevsky

Abstract:
Domain Decomposition techniques constitute an important class of methods espedally appropriate in a parallel computing environment, but only a few general purpose codes bued on these techniques have been developed so far. In this work, we attempt to develop not only algorithms but also software libraries and tools to help in the parallel implementation of such techniques. These algorithms and tools form P-SPARSLIB, a library of distributed sparse iterative solvers.

Keywords: Software



Classification:
	C.1	processor architectures
	C.2	computer-communication networks
	C.3	special-purpose and application-based systems; microprocessor/microcomputer applications; process control systems; real-time systems; signal processing systems
	C.4	performance of systems; design studies; measurement techniques; modeling techniques; performance attributes; reliability, availability, and serviceability
	D.1	programming techniques
	D.2	software engineering
	D.3	programming languages
	D.4	operating systems
	F.1	computation by abstract devices
	F.2	analysis of algorithms and problem complexity


Source:
Y. Saad, A. V. Malevsky, Data Structures, Computational, and Communication Kernels for Distributed Memory Sparse Iterative Solvers.
In V. Malyshkin (ed.), Parallel Computing Technologies: Proceedings of the 3th International Conference, Lect. Notes in Comp. Sci., Vol. 964, Springer, 1995, pp. 252-257

ISSN 0302-9743
ISBN 3-540-60222-4

Search LNCS articles for:
Saad, Y. ; Malevsky, A. V.



Scanned first page:

Designed by the Supercomputer Software Department RAS, 1998