Database Globalization in Enterprise Applications

Gut, Arkadiusz; Miclea, Liviu; Enyedi, Szilard; Abrudean, Mihail; Hoka, I.

doi:10.1109/aqtr.2006.254560

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, every general-purpose computer in use today has a clock, and many computations on such machines are time-dependent. Examples of such computations that are aware of real time include scheduled virus scans, regular backups, seasonal time changes [19] and so on. Therefore, U is intended as a theoretical model that captures the capabilities of realistic computers.…”

Section: Why a New Model?mentioning

confidence: 99%

Computing with uncertainty and its implications to universality

Nagy

Akl

2012

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

It is known that there exist computational problems that can be solved on a parallel computer, yet are impossible to be solved sequentially. Specifically, no general purpose sequential model of computation, such as the Turing machine or the random access machine, can simulate a large family of computations (e.g. solutions to certain realtime problems), each of which is capable of being carried out readily by a particular parallel computer. We extend the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input data, that is when and for how long are the input data available. The second type of time constraints refers to uncertain deadlines on when outputs are to be produced. Our main objective is to exhibit computational problems in which it is very difficult to find out (read 'compute') what to do and when to do it. Furthermore, problems with uncertain time constraints, as described here, prove once more that it is impossible to define a 'universal computer', that is a computer able to perform (through simulation or otherwise) all computations that are executable on other computers. Finally, one of the contributions of this paper is to promote the study of a topic, conspicuously absent to date from theoretical computer science, namely the role of physical time and physical space in computation. The focus of our work is to analyse the effect of external natural phenomena on the various components of a computational process, namely the input phase, the calculation phase (including the algorithm and the computing agents themselves) and the output phase.

show abstract

Section: Why a New Model?mentioning

confidence: 99%

Computing with uncertainty and its implications to universality

Nagy

Akl

2012

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

show abstract

“…By contrast, every general-purpose computer in use today has a clock, and many computations on such machines are time-dependent. Examples of such computations that are aware of real time include: scheduled virus scans, regular backups, seasonal time changes [12], and so on. Therefore, U is intended as a theoretical model that captures the capabilities of realistic computers.…”

Section: Why a New Model?mentioning

confidence: 99%

Computations with Uncertain Time Constraints: Effects on Parallelism and Universality

Nagy

Akl

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

It is known that a parallel computer can solve problems that are impossible to be solved sequentially. That is, any general purpose sequential model of computation, such as the Turing machine or the random access machine (RAM), cannot simulate certain computations, for example solutions to real-time problems, that are carried out by a specific parallel computer. This paper extends the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input data, that is when and for how long are input data available. A second type of time constraints refers to uncertain deadlines for tasks. The main contribution of this paper is to exhibit computational problems in which it is very difficult to find out (read compute) what to do and when to do it. Furthermore, problems with uncertain time constraints, as described in this paper, prove once more, that it is impossible to define a universal computer, that is, a computer able to simulate all computable functions.

show abstract