Reliable distributed sorting through the application-oriented fault tolerance paradigm

Bruce M. McMillin; Lionel M. Ni

doi:10.1109/ICDCS.1989.37983

Reliable distributed sorting through the application-oriented fault tolerance paradigm

Bruce M. McMillin^*, Lionel M. Ni

^*Corresponding author for this work

Research output: Contribution to conference › Conference Paper › peer-review

1 Citation (Scopus)

Abstract

The design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presented. The error coverage and the response of the fault-tolerant algorithm to faulty behavior are presented. Both asymptotic complexity and the results of run-time experimental measurements on an Ncube multicomputer are given. The authors demonstrate that the application-oriented fault tolerance paradigm is applicable to problems of a noniterative nature.

Original language	English
Pages	508-515
Number of pages	8
DOIs	https://doi.org/10.1109/ICDCS.1989.37983
Publication status	Published - Jun 1989
Externally published	Yes
Event	9th International Conference on Distributed Computing Systems - Newport Beach, CA, USA Duration: 5 Jun 1989 → 9 Jun 1989

Conference

Conference	9th International Conference on Distributed Computing Systems
City	Newport Beach, CA, USA
Period	5/06/89 → 9/06/89

Access to Document

10.1109/ICDCS.1989.37983

Cite this

@conference{936116f113b7441ab14176d968b9e55d,

title = "Reliable distributed sorting through the application-oriented fault tolerance paradigm",

abstract = "The design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presented. The error coverage and the response of the fault-tolerant algorithm to faulty behavior are presented. Both asymptotic complexity and the results of run-time experimental measurements on an Ncube multicomputer are given. The authors demonstrate that the application-oriented fault tolerance paradigm is applicable to problems of a noniterative nature.",

author = "McMillin, \{Bruce M.\} and Ni, \{Lionel M.\}",

year = "1989",

month = jun,

doi = "10.1109/ICDCS.1989.37983",

language = "English",

pages = "508--515",

note = "9th International Conference on Distributed Computing Systems ; Conference date: 05-06-1989 Through 09-06-1989",

}

TY - CONF

T1 - Reliable distributed sorting through the application-oriented fault tolerance paradigm

AU - McMillin, Bruce M.

AU - Ni, Lionel M.

PY - 1989/6

Y1 - 1989/6

N2 - The design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presented. The error coverage and the response of the fault-tolerant algorithm to faulty behavior are presented. Both asymptotic complexity and the results of run-time experimental measurements on an Ncube multicomputer are given. The authors demonstrate that the application-oriented fault tolerance paradigm is applicable to problems of a noniterative nature.

AB - The design and implementation of a reliable version of the distributed bitonic sorting algorithm using the application-oriented fault tolerance paradigm on a commercial multicomputer is described. Sorting assertions in general are discussed and the bitonic sort algorithm is introduced. Faulty behavior is discussed and a fault-tolerant parallel bitonic sort developed using this paradigm is presented. The error coverage and the response of the fault-tolerant algorithm to faulty behavior are presented. Both asymptotic complexity and the results of run-time experimental measurements on an Ncube multicomputer are given. The authors demonstrate that the application-oriented fault tolerance paradigm is applicable to problems of a noniterative nature.

UR - https://www.webofscience.com/wos/woscc/full-record/WOS:A1989BQ46X00060

UR - https://openalex.org/W4232488066

UR - https://www.scopus.com/pages/publications/0024681327

U2 - 10.1109/ICDCS.1989.37983

DO - 10.1109/ICDCS.1989.37983

M3 - Conference Paper

SP - 508

EP - 515

T2 - 9th International Conference on Distributed Computing Systems

Y2 - 5 June 1989 through 9 June 1989

ER -

Reliable distributed sorting through the application-oriented fault tolerance paradigm

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this