Stefan D. Bruda

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 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)
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)