On the necessity of formal models for real-time parallel computations

Parallel Processing Letters

Volumn 11, Issue 2-3, 2001, Pages 353-361

  Bruda, S D ^a   Akl, S G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Computational complexity; Multitape Turing machines; Parallel computation; Real time computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; SET THEORY; THEOREM PROVING; TURING MACHINES;

MULTITAPE TURING MACHINES; REAL-TIME PARALLEL COMPUTATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 0035354671     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0129-6264(01)00064-6     Document Type: Article

References (22)

1. Secure file transfer: A computational analog to the furniture moving paradigm
2. Parallel real-time optimization: Beyond speedup
3. Parallel real-time cryptography: Beyond speedup II
4. Parallel real-time numerical computation: Beyond speedup III
5. Paradigms admitting superunitary behaviour in parallel computation
6. On the data-accumulating paradigm
7. The characterization of data-accumulating algorithms
8. A case study in real-time parallel computation: Correcting algorithms
9. Computing with time-varying data: Sequential complexity and parallel speed-up
10. Online computation
11. Real-time computation and recursive functions not real-time computable
12. On k-tape versus (k - 1)-tape real time computation
13. Turing machines with a schedule to keep
14. Real time computations
15. Real-time definable languages
16. On the independence of real-time definability and certain structural properties of context-free languages
17. Real-time computations with restricted nondeterminism
18. Quasy-realtime languages