Filters








838 Hits in 3.8 sec

Deterministic versus nondeterministic space in terms of synchronized alternating machines

Juraj Hromkovicˇ, Branislav Rovan, Anna Slobodova
1994 Theoretical Computer Science  
., Deterministic versus nondeterministic space in terms of synchronized alternating machines, Theoretical Computer Science 132 (1994) 3199336.  ...  Acknowledgment We would like to thank the unknown referees for their comments and suggestions which improved the presentation of this paper.  ...  Analogous results for alternating, nondeterministic and deterministic machines would yield collapse of some fundamental complexity classes.  ... 
doi:10.1016/0304-3975(94)90238-0 fatcat:lic4dnrljbge3l2akwyo6no7ti

Page 6943 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
versus nondeterministic space in terms of synchronized alternating machines.  ...  They also prove that globally deterministic synchronized alternating space has the stan- dard type of space hierarchy.  ... 

Author index volume 132 (1994)

1994 Theoretical Computer Science  
Slobodova, Deterministic versus nondeterministic space in terms of synchronized alternating machines Ilie, L., On a conjecture about slender context-free languages (Note) Juedes, D.W., J.I.  ...  Diestel Leiss, E.L., Unrestricted complementation in language equations over a one-letter alphabet Lescanne, P., On termination of one rule rewrite systems (Note) Lutz, J., see D.W.  ... 
doi:10.1016/0304-3975(94)90240-2 fatcat:nl7cda6rv5aujncx7kxgty377u

Efficient System-Enforced Deterministic Parallelism [article]

Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
2010 arXiv   pre-print
Determinator's kernel provides only single-threaded, "shared-nothing" address spaces interacting via deterministic synchronization.  ...  The system runs parallel applications deterministically both on multicore PCs and across nodes in a cluster.  ...  In a process that uses nondeterministic synchronization, the process's initial master space never runs application code directly, but instead runs a deterministic scheduler.  ... 
arXiv:1005.3450v1 fatcat:2zzzgu5q3vcltklzvmlc6b4ccq

Efficient system-enforced deterministic parallelism

Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
2012 Communications of the ACM  
Determinator's microkernel API provides only "shared-nothing" address spaces and deterministic interprocess communication primitives to make execution of all unprivileged code-well-behaved or notprecisely  ...  Coarse-grained parallel benchmarks perform and scale comparably to nondeterministic systems, on both multicore PCs and across nodes in a distributed cluster.  ...  In a process that uses nondeterministic synchronization, the process's initial master space never runs application code directly, but instead acts as a deterministic scheduler.  ... 
doi:10.1145/2160718.2160742 fatcat:7ptdywth7jffvawn7vsatlmts4

Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines

Martin Sauerhoff
2003 Journal of computer and system sciences (Print)  
It is well known that a nondeterministic Turing machine can be simulated in polynomial time by a so-called guess-and-verify machine.  ...  It is an open question whether an analogous simulation exists in the context of space-bounded computation.  ...  Acknowledgments Thanks to Ingo Wegener for proofreading and improving the upper bound of Theorem 13 and to Klaus-Jo¨rn Lange for the pointer to the literature on one-way TMs and especially reference [  ... 
doi:10.1016/s0022-0000(03)00037-0 fatcat:vtv33exhxzhvzpei343pruvnue

The Problem with Threads

E.A. Lee
2006 Computer  
In the upper program, an adaptation of an example from Farhad Arbab's work, 15 the system deterministically interleaves successive outputs from Data source 1 and 2, which appear in alternating order  ...  Yet this argument is not a resurrection of the old shared-memory versus message-passing debate. Message passing can be made as nondeterministic and difficult to understand as threads.  ... 
doi:10.1109/mc.2006.180 fatcat:2xr64ouajvd5flqceb7sfrrzq4

A Survey of Lower Bounds for Satisfiability and Related Problems

Dieter van Melkebeek
2006 Foundations and Trends® in Theoretical Computer Science  
In this article we survey the known lower bounds for the time and space complexity of satisfiability and closely related problems on deterministic, randomized, and quantum models with random access.  ...  We discuss the state-of-the-art results and present the underlying arguments in a unified framework.  ...  Sudan for the opportunity and incentive to write this survey, James Finlay for his patience while I was writing it, all my coauthors for their collaboration and discussions that shaped my understanding of  ... 
doi:10.1561/0400000012 fatcat:vsdohimqr5a5zlbat3l37uwdem

Page 5094 of Mathematical Reviews Vol. , Issue 93i [page]

1993 Mathematical Reviews  
both in the deterministic and nondeterministic  ...  in terms of alternations between universal and existential blocks).  ... 

Subject index volumes 1–200

1999 Theoretical Computer Science  
synchronizations, 1391 synchronized alternating finite automata, 1835, 2124, 2511 machine, 1790 machines, 25 11 space SASPACE, 2511 Turing machines, 1790, 1835 synchronized alternation, 1790  ...  608, 691 synchronized alternating Turing machines, 1790, over finite fields, 3103 1835 space-bounded TM simulations, 1281 of one-way conglomerates, 1281 space-bounded TM's, 1281 Turing machines  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

DMP

Joseph Devietti, Brandon Lucia, Luis Ceze, Mark Oskin
2009 SIGARCH Computer Architecture News  
In this paper we make the case for fully deterministic shared memory multiprocessing (DMP). The behavior of an arbitrary multithreaded program on a DMP system is only a function of its inputs.  ...  In contrast, while DMP systems are directly useful for debugging by offering repeatability by default, we argue that parallel programs should execute deterministically in the field as well.  ...  We also thank Karin Strauss, Dan Grossman, Susan Eggers, Martha Kim, Andrew Putnam, Tom Bergan and Owen Anderson from the University of Washington for their feedback on the manuscript.  ... 
doi:10.1145/2528521.1508255 fatcat:i53avj67uvfg5dovopb6p7xjfi

DMP

Joseph Devietti, Brandon Lucia, Luis Ceze, Mark Oskin
2009 Proceeding of the 14th international conference on Architectural support for programming languages and operating systems - ASPLOS '09  
In this paper we make the case for fully deterministic shared memory multiprocessing (DMP). The behavior of an arbitrary multithreaded program on a DMP system is only a function of its inputs.  ...  In contrast, while DMP systems are directly useful for debugging by offering repeatability by default, we argue that parallel programs should execute deterministically in the field as well.  ...  We also thank Karin Strauss, Dan Grossman, Susan Eggers, Martha Kim, Andrew Putnam, Tom Bergan and Owen Anderson from the University of Washington for their feedback on the manuscript.  ... 
doi:10.1145/1508244.1508255 dblp:conf/asplos/DeviettiLCO09 fatcat:hm2rmz7qe5cbbepymg22fro3xe

DMP

Joseph Devietti, Brandon Lucia, Luis Ceze, Mark Oskin
2009 SIGPLAN notices  
In this paper we make the case for fully deterministic shared memory multiprocessing (DMP). The behavior of an arbitrary multithreaded program on a DMP system is only a function of its inputs.  ...  In contrast, while DMP systems are directly useful for debugging by offering repeatability by default, we argue that parallel programs should execute deterministically in the field as well.  ...  We also thank Karin Strauss, Dan Grossman, Susan Eggers, Martha Kim, Andrew Putnam, Tom Bergan and Owen Anderson from the University of Washington for their feedback on the manuscript.  ... 
doi:10.1145/1508284.1508255 fatcat:nzvvj2kxerc3vlph4typ5qq5hy

Computability vs. Nondeterministic and P vs. NP [article]

Jian-Ming Zhou
2013 arXiv   pre-print
P versus NP is the relativity of Computability and Nondeterministic, P/=NP. The NP-algorithm is effective approximate way to NP by TM.  ...  This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time.  ...  …The term NP comes from nondeterministic polynomial time and is derived from an alternative characterization by using nondeterministic polynomial time Turing machines.  ... 
arXiv:1305.4029v1 fatcat:yy6qt2g75fhj3fcb4mveymvqc4

Complexity: A Language-Theoretic Point of View [chapter]

Cristian Calude, Juraj Hromkovič
1997 Handbook of Formal Languages  
Indeed, the material of this chapter represents little more than our belated understanding and organization of their original work.  ...  Acknowledgement We are deeply indebted to all authors of referenced works.  ...  A further extension to synchronized alternating Turing machines shows the importance of communication facilities in parallel computing.  ... 
doi:10.1007/978-3-662-07675-0_1 fatcat:kr42xoceznhavgrikienelte6e
« Previous Showing results 1 — 15 out of 838 results