Paper Info
Title
A case study in real-time parallel computation: correcting algorithms
Abstract
A correcting algorithm is one that receives an endless stream of corrections to its initial input data and terminates when all the corrections received have been taken into account. We give a characterization of correcting algorithms based on the theory of data-accumulating algorithms. In particular, it is shown that any correcting algorithm exhibits superunitary behavior in a parallel computation setting if and only if the static counterpart of that correcting algorithm manifests a strictly...
Year
DOI
Venue
2001
10.1006/jpdc.2000.1707
J. Parallel Distrib. Comput.
Keywords
DocType
Volume
case study,real-time parallel computation,real time,parallel computer
Journal
61
Issue
ISSN
Citations 
5
Journal of Parallel and Distributed Computing
9
PageRank 
References 
Authors
0.75
6
2
Name
Order
Citations
PageRank
Stefan D. Bruda16212.18
Selim G. Akl22074299.32