Size Matters: Logarithmic Space is Real Time

We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL) can be solved in real time by a parallel machine, no matter how tight the real-time constraints are. We also show that several other real-time problems are in effect solvable in nondeterministic log...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computers & applications Jg. 29; H. 4; S. 327 - 336
Hauptverfasser: Bruda, S.D., Akl, S.G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Calgary Taylor & Francis 2007
Taylor & Francis Ltd
Schlagworte:
Algorithms
Buses
Conflict resolution
independence system
Languages
matroid
Optimization
parallel complexity
Power
Real time
Real-time computation
reconfigurable multiple bus machine
Studies
timed ω-language
ISSN:1206-212X, 1925-7074
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL) can be solved in real time by a parallel machine, no matter how tight the real-time constraints are. We also show that several other real-time problems are in effect solvable in nondeterministic logarithmic space once their real-time constraints are dropped and they become non-realtime. We thus conjecture that NL contains exactly all the problems that admit feasible real-time parallel algorithms. The issue of real-time optimization problems is also investigated. We identify the class of such problems that are solvable in real time. In the process, we determine the computational power of directed reconfigurable multiple bus machines (DRMBMs) with polynomially bounded resources and running in constant time, which is found to be the same as the power of directed reconfigurable networks with the same properties. We also show that write conflict resolution rules such as Priority or even Combining do not add computational power over the Collision rule, and that a bus of width 1 (a wire) suffices for any constant time computation on DRMBM.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1206-212X
1925-7074
DOI:10.1080/1206212X.2007.11441863