#### Filter Results:

#### Publication Year

1997

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We investigate the relative computational power of parallel models with shared memory. Based on feasibility considerations present in the literature, we split these models into " lightweight " and " heavyweight, " and then find that the heavyweight class is strictly more powerful than the lightweight class, as expected. On the other hand, we contradict the… (More)

Traditionally, interest in parallel computation centered around the speedup provided by parallel algorithms over their sequential counterparts. In this paper, we ask a diierent type of question: Can parallel computers, due to their speed, do more than simply speed up the solution to a problem? We show that for real-time optimization problems, a parallel… (More)

A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data have been processed before another datum arrives. In this paper, the class of d-algorithms is characterized. It is shown that this class is identical to the class of on-line… (More)

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… (More)

Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential computers. This fact is demonstrated by analyzing sequential and parallel solutions to numerical problems in a real-time paradigm. In this setting, numerical data required to solve… (More)

The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. H o w ever, it was shown recently that a second equally important motivation for using parallel computers exists: Within the paradigm of real-time computation, some classes of problems have the property that a solution to a… (More)

The concept of real time has different meanings in the systems and theory communities. Thus, the existing formal real-time models do not capture all the practically relevant aspects of such computations. This article proposes a new definition that, we believe, allows a unified treatment of all practically meaningful variants of real-time computations. We… (More)