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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of computers & applications Ročník 29; číslo 4; s. 327 - 336
Hlavní autori: Bruda, S.D., Akl, S.G.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Calgary Taylor & Francis 2007
Taylor & Francis Ltd
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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.
AbstractList 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-real-time. 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. [PUBLICATION ABSTRACT]
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.
Author Akl, S.G.
Bruda, S.D.
Author_xml – sequence: 1
  givenname: S.D.
  surname: Bruda
  fullname: Bruda, S.D.
  organization: Department of Computer Science, Bishop's University
– sequence: 2
  givenname: S.G.
  surname: Akl
  fullname: Akl, S.G.
  organization: School of Computing, Queen's University
BookMark eNqFkF1LwzAUhoNMcJv-BSle25pzmqaNd2P4BRPBTfAupFmqGW0zkw6Zv96WuWuvzjnwvO-BZ0JGrWsNIZdAE6AFvQGkHAHfE6Q0TwAYg4KnJ2QMArM4pzkb9XsPxQN1RiYhbChlOfJiTK6X9sdEz6rrjA-30cJ9KG-7z8bqaLlV2kQ2RK9G1dHKNuacnFaqDubib07J2_3dav4YL14enuazRayRYhdzxYoiQ52CqNaghBbCFKAzpnNdlCkY4DlFURpeokYt0JTIFGMs6y_DIZ2Sq0Pv1ruvnQmd3Lidb_uXEkGkFFg2QPwAae9C8KaSW28b5fcSqBzEyKMYOYiRRzF9cHYI2rZyvlHfztdr2al97XzlVattkOk_Hb9jUmmm
Cites_doi 10.1109/TEC.1962.5219459
10.1145/22145.22197
10.1093/oso/9780195085914.001.0001
10.1201/9781420049503-c28
10.1006/jpdc.1997.1385
10.1007/3-540-58355-6
10.1006/inco.1995.1122
10.1142/S0129626499000463
10.1006/jpdc.1996.0047
ContentType Journal Article
Copyright Copyright 2007 Taylor and Francis Group LLC 2007
Copyright ACTA Press 2007
Copyright_xml – notice: Copyright 2007 Taylor and Francis Group LLC 2007
– notice: Copyright ACTA Press 2007
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
8AL
8FD
8FE
8FG
8FK
8FL
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L7M
L~C
L~D
M0C
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1080/1206212X.2007.11441863
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central Database Suite (ProQuest)
Business Premium Collection (Proquest)
Technology Collection
ProQuest One
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Collection (ProQuest)
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Collection (ProQuest)
Computing Database
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business (OCUL)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList ABI/INFORM Global (Corporate)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1925-7074
EndPage 336
ExternalDocumentID 1528127451
10_1080_1206212X_2007_11441863
11441863
Genre Article
Feature
GroupedDBID .4S
.DC
0BK
0R~
29J
30N
5GY
7WY
8FE
8FG
8FL
8R4
8R5
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABUWG
ABXUL
ABXYU
ACGFS
ACTIO
ADCVX
ADGTB
ADUMR
AEISY
AEYOC
AFKRA
AFRVT
AGBKS
AGDLA
AHDZW
AI.
AIJEM
AIYEW
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
ARAPS
ARCSS
AWYRJ
AZQEC
BENPR
BEZIV
BGLVJ
BLEHA
BPHCQ
CCCUG
CCPQU
CS3
DGEBU
DKSSO
DWQXO
EBS
EDO
EJD
FRNLG
GNUQQ
H13
HCIFZ
I-F
K60
K6V
K6~
K7-
KYCEM
M0C
M4Z
MK~
ML~
P0W
P62
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
Q2X
QAV
RNANH
ROSJB
RTWRZ
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
TUS
VH1
ZGOLN
AAYXX
ACTTO
AFBWG
AFFHD
AFION
AGVKY
AGWUF
ALRRR
BWMZZ
CITATION
CYRSC
DAOYK
IPNFZ
LJTGL
OPCYK
RIG
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c202t-6a48852c319fd1a9c99e81c54c7c8b31e167029be6b2c2c92eb24a4445c2ce613
IEDL.DBID M0C
ISSN 1206-212X
IngestDate Sun Nov 30 04:12:31 EST 2025
Sat Nov 29 05:31:29 EST 2025
Mon Oct 20 23:47:00 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c202t-6a48852c319fd1a9c99e81c54c7c8b31e167029be6b2c2c92eb24a4445c2ce613
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 219301451
PQPubID 42900
PageCount 10
ParticipantIDs proquest_journals_219301451
informaworld_taylorfrancis_310_1080_1206212X_2007_11441863
crossref_primary_10_1080_1206212X_2007_11441863
PublicationCentury 2000
PublicationDate 2007-00-00
PublicationDateYYYYMMDD 2007-01-01
PublicationDate_xml – year: 2007
  text: 2007-00-00
PublicationDecade 2000
PublicationPlace Calgary
PublicationPlace_xml – name: Calgary
PublicationTitle International journal of computers & applications
PublicationYear 2007
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0010
CIT0012
CIT0011
CIT0014
CIT0002
CIT0013
CIT0005
CIT0016
CIT0004
CIT0015
CIT0007
CIT0006
CIT0009
CIT0008
References_xml – ident: CIT0015
– ident: CIT0002
  doi: 10.1109/TEC.1962.5219459
– ident: CIT0016
– ident: CIT0013
  doi: 10.1145/22145.22197
– ident: CIT0014
– ident: CIT0008
– ident: CIT0010
– ident: CIT0011
  doi: 10.1093/oso/9780195085914.001.0001
– ident: CIT0005
  doi: 10.1201/9781420049503-c28
– ident: CIT0009
  doi: 10.1006/jpdc.1997.1385
– ident: CIT0012
  doi: 10.1007/3-540-58355-6
– ident: CIT0006
  doi: 10.1006/inco.1995.1122
– ident: CIT0004
  doi: 10.1142/S0129626499000463
– ident: CIT0007
  doi: 10.1006/jpdc.1996.0047
SSID ssj0047268
Score 1.6655924
Snippet 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...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Index Database
Publisher
StartPage 327
SubjectTerms Algorithms
Buses
Conflict resolution
independence system
Languages
matroid
Optimization
parallel complexity
Power
Real time
Real-time computation
reconfigurable multiple bus machine
Studies
timed ω-language
SummonAdditionalLinks – databaseName: Taylor and Francis Online Journals
  dbid: TFW
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxcBC-RSlgDwwYrV2bCfuhhAVQ-lAi-gWJRcbOtCiJjDw67HjWGqFEAOMGc6yLn73YfneQ-jSdhGG8zgj2iggXESK5EnBiaFcqESDZFCrlozi8TiZzdT6LIx7Vul6aOOJIupY7cCd5WV4EdejrC9txJ15AkLqWoJEOsJPm_sdNqfDpxCMecz8NJw1Ic4mDAn_uMxGftpgL_0WresUNGz_x-b30G5TgOJrf2L20ZZeHKB2EHfADdYP0dVk_qnxvaffHODR8tl21dXL6xzwxPbZGs9L_GCrTOyGSI7Q4_B2enNHGmkFAqzPKiIzC1zBwALQFDRToJROKAgOMSR5RDWVcZ-pXMucAQPFbAPOM865sF_algDHqLVYLvQJwtRIqQXkcc40zwqdGUoNmEIJYQpbjnVQLzg0ffMMGiltiEmDM5wYZpwGZ3TQYN3vaVXfXRgvNJJGvxl3w19KGziWqQ3LUa1JfPqXpbtox9_suguYM9SqVu_6HG3DRzUvVxf1ufsCpUTSTA
  priority: 102
  providerName: Taylor & Francis
Title Size Matters: Logarithmic Space is Real Time
URI https://www.tandfonline.com/doi/abs/10.1080/1206212X.2007.11441863
https://www.proquest.com/docview/219301451
Volume 29
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 20090430
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: 7WY
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 20090430
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: M0C
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 20090430
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: P5Z
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 20090430
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: K7-
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 20090430
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: BENPR
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAWR
  databaseName: Taylor & Francis
  customDbUrl:
  eissn: 1925-7074
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0047268
  issn: 1206-212X
  databaseCode: TFW
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV05T8MwFH7iGli4EWflgRGrtWPHMQsKVQoVbanaIApLlDi2xFKOFn4_dg4EQoKBxZIdRYq--J1-fh_AiY0iDGMixdpIhRn3JM6CnGFDGJeBVj5VBWtJTwwGwWQih1Vtzqwqq6x1YqGo8yflcuRNK1leQSt7_vyCHWmUO1ytGDQWYdk5Nq6ir99q14qYCVrehKM2aLYaelJfEA5aTbfmlsoehsRFFYHvfbNN3zqX_tDUhfnprP_zwzdgrfI7UVhulE1Y0NMtWK85HVAl4ttwOu4-RKgfxtbNHZ-h3s1lOOrGV_ZnofEwbEeoO0ajKOyhuNuPduC2E8XtK1wxKmBFW3SO_dTKK6fKyp3JSSqVlDogijMlVJB5RBNftKjMtJ9RRZWkNu5mKWOM25m2ln8XlqZPU70HiBjf11xlIqOapblODSFGmVxybnLrhe1Ds8YyeS4bZySk6kdao-84MEVSo78PZ18hT-ZFysKU_CKJ99fLhzX6SSWFs-QT-oNfnx7CapmxdYmVI1iav77pY1hR7_PH2WsDFsXdfQOWL6LBcGRn1wI3in1mxyF_sGPcufsAQhHQAw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4BrQQXKAVUoA8f6K3WYseJYySEIhq00T6E2FRacQmJY0u9LI9dQPyo_seOk7gqqtSeOPQYR4msfPN2Zj6AA8wirBCypMYqTUUYKFrFtaCWiVDFRkdcN6wlQzkex9OpOl-CH74Xxv1W6W1iY6jra-1q5D3UrKChlT25uaWONModrnoGjVYqBubpETO2-XH2FeH9zPlZmp_2aUcqQDXm-QsalSiyIdcoerZmpdJKmZjpUGip4ypghkXykKvKRBXXXCuOqacohRAhXhl0fvjeZXglglg6tRpI6g2_kLztvOOYpKNHmPqG5Piw59bcUjszkbksJo6CZ77w2aTUPzxD4-7ONv6zD_UG1ru4miStImzCkpm9hQ3PWUE6E7YFXybZZUpGSY5h_OSI4GaSiyzvozCSyXlympJsQi7SZEjybJRuw7cX2fMOrMyuZ-YdEGajyIS6khU3oqxNaRmz2tYqDG2NUeYu9Dx2xU07GKRg3bxVj7bj-JSFR3sXjn6HuFg0JRnb8qcUwb8e3vdoF52VmRe_oN77691PsNrPR8NimI0H-7DWVqddEek9rCzu7s0HeK0fFt_ndx8beSZw9dJy8ROHayZt
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3PT9swFH4CNiEudAzQ-LHNB3ZbVOzYSYyEUERTNaJUFS1SxSUkji3t0gItIP40_juek3gCTdpOHHaMo0RW3uf3_L08vw_gAFmE4TzMPW2k8rjwpVdEJfcM5UJGWgVMVaol_XAwiCYTOVyCZ3cWxpZVOp9YOepypmyOvI0ry69kZdumqYoYdronN7eeFZCyP1qdmkaNkDP99IjsbX6cdtDUPxjrJuPTntcIDHgKOf_CC3KEr2AKYWhKmkslpY6oElyFKip8qmkQHjJZ6KBgiinJkIbynHMu8EpjIMT3LsOHECmmrSYciisXBHjI6lN4DAk7RoeJO5wcHbbtmB2q-ydSy2iiwH8TF990Tf0jSlShr9v6jz_aJ1hv9tskrhfIBizp6WdoOS0L0ri2Tfg5Sq8Sch6PcXs_OiI4mfgiHfcQpGQ0jE8Tko7IRRL3yTg9T7bg8l3mvA0r09lUfwFCTRBooYqwYJrnpc4NpUaZUgphStx97kDb2TG7qRuGZLTpw-osb7U_w8xZfgeOXps7W1SpGlPrqmT-vx7ec5bPGu8zz36bffevd7_DKsIh66eDsz1Yq5PWNre0DyuLu3v9FT6qh8Wv-d23CtoErt8bFi_SzC-R
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Size+Matters%3A+Logarithmic+Space+is+Real+Time&rft.jtitle=International+journal+of+computers+%26+applications&rft.au=Bruda%2C+S.D.&rft.au=Akl%2C+S.G.&rft.date=2007&rft.issn=1206-212X&rft.eissn=1925-7074&rft.volume=29&rft.issue=4&rft.spage=327&rft.epage=336&rft_id=info:doi/10.1080%2F1206212X.2007.11441863&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_1206212X_2007_11441863
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1206-212X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1206-212X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1206-212X&client=summon