This paper presents an o-line diagnosis strategy for parallel message-passing systems. This strategy, called hostdiagnosis, allows a host system to perform centralized diagnosis of the system state, given results of distributed tests performed among the system processors. It is useful for a manufact
Selection Algorithms for Parallel Disk Systems
β Scribed by Sanguthevar Rajasekaran
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 104 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
With the widening gap between processor speeds and disk access speeds, the IΓO bottleneck has become critical. Parallel disk systems have been introduced to alleviate this bottleneck. In this paper we present deterministic and randomized selection algorithms for parallel disk systems. The algorithms to be presented, in addition to being asymptotically optimal, have small underlying constants in their time bounds and hence have the potential of being practical.
π SIMILAR VOLUMES
## Abstract We present two deterministic parallel Selection algorithms for distributed memory machines, under the coarseβgrained multicomputer model. Both are based on the use of two weighted 3βmedians, that allows discarding at least 1/3 of the elements in each iteration. The first algorithm sligh
A parallel algorithm for solving the Poisson equation with either Dirichlet or Neumann conditions is presented. The solver follows some of the principles introduced in a previous fast algorithm for evaluating singular integral transforms by Daripa et al. Here we present recursive relations in Fourie
Non-stationary parallel multisplitting iterative methods are introduced for the solution of almost linear systems. A non-stationary parallel algorithm based on the AOR-type methods and its extension to asynchronous models are considered. Convergence properties of the synchronous and asynchronous ver