ePrints

Fault-tolerant parallel applications using queues and actions

Lookup NU author(s): Emeritus Professor Santosh Shrivastava

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

There are many techniques supporting execution of large computations over a network of workstations (NOW) but data intensive computations are usually run on high performance parallel machines. A NOW comprising individual user's machines typically has a low performance interconnect and suffers arbitrary changes of availability. Exploiting such resources to execute data intensive computations is difficult, but even in a more constrained environment there is an unfulfilled need for fault-tolerance. The structuring approach presented fulfills this need. Performance exceeding 100 Mflop/s is demonstrated for large fault-tolerant out of core examples of matrix multiplication and Cholesky factorization using five 133 MHz Pentium compute machines.

Publication metadata

Author(s): Smith J, Shrivastava SK

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Proceedings of the International Conference on Parallel Processing

Year of Conference: 1997

Pages: 145-149

ISSN: 9780818681080

Publisher: IEEE Computer Society

Library holdings: Search Newcastle University Library for this item

ISBN: 081868108X

Share