Log in

Relevant bibliographies by topics / Parallel Automata

Academic literature on the topic 'Parallel Automata'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parallel Automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parallel Automata"

1

CSUHAJ-VARJÚ, ERZSÉBET, CARLOS MARTÍN-VIDE, VICTOR MITRANA, and GYÖRGY VASZIL. "PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS." International Journal of Foundations of Computer Science 11, no. 04 (December 2000): 631–50. http://dx.doi.org/10.1142/s0129054100000338.

Full text

Abstract:

We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.

APA, Harvard, Vancouver, ISO, and other styles

2

Subramaniyan, Arun, and Reetuparna Das. "Parallel Automata Processor." ACM SIGARCH Computer Architecture News 45, no. 2 (September 14, 2017): 600–612. http://dx.doi.org/10.1145/3140659.3080207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tachon, Thibaut, Chong Li, Gaétan Hains, and Frédéric Loulergue. "Automated Generation of BSP Automata." Parallel Processing Letters 27, no. 01 (March 2017): 1740002. http://dx.doi.org/10.1142/s0129626417400023.

Full text

Abstract:

Bulk-Synchronous Parallel (BSP) is a bridging model between abstract execution and concrete parallel architectures that retains enough information to model performance scalability. In order to model BSP program executions, Hains adapted the theory of finite automata to the BSP paradigm by introducing BSP automata [12]. In the initial description of the theory, BSP automata had to be explicitly defined as structured sets of states and transitions. The lack of a clean and efficient algorithm for generating them from regular expressions would have prevented this theory from being used in practice. To alleviate this problem we introduce in this paper an algorithm that generates a BSP automaton recognizing a BSP language defined by a BSP regular expression. The main practical use of BSP automata developed in this paper is the parallelization of finite state automata with an explicit distribution and a performance model, that enable parallel matching of regular expressions. Secondarily, BSP regular expressions provide a convenient structure for automatic code generation of imperative BSP programs that is also developed in this paper.

APA, Harvard, Vancouver, ISO, and other styles

4

CANTONE, DOMENICO, and SIMONE FARO. "A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM." International Journal of Foundations of Computer Science 17, no. 06 (December 2006): 1235–51. http://dx.doi.org/10.1142/s0129054106004388.

Full text

Abstract:

Finite (nondeterministic) automata are very useful building blocks in the field of string matching. This is particularly true in the case of multiple pattern matching, where the use of factor-based automata can reduce substantially the number of computational steps when the patterns have large common factors. Direct simulation of nondeterministic automata can be performed very efficiently using the bit-parallelism technique, though this is not necessarily true for factor-based automata. In this paper we present an algorithm for the multiple string matching problem, based on the bit-parallel simulation of nondeterministic factor-based automata which satisfy a particular ordering condition. We also show how to enforce such condition by suitably modifying a minimal initial automaton, through equivalence preserving transformations. The resulting automaton turns out to be smaller than the corresponding maximal automata used by existing bit-parallel algorithms, as they do not take any advantage of common factors in patterns.

APA, Harvard, Vancouver, ISO, and other styles

5

Bruchertseifer, Jens, and Henning Fernau. "Synchronizing series-parallel deterministic finite automata with loops and related problems." RAIRO - Theoretical Informatics and Applications 55 (2021): 7. http://dx.doi.org/10.1051/ita/2021005.

Full text

Abstract:

We study the problem DFA-SW of determining if a given deterministic finite automaton A possesses a synchronizing word of length at most k for automata whose (multi-)graphs are TTSPL, i.e., series-parallel, plus allowing some self-loops. While DFA-SW remains NP-complete on TTSPL automata, we also find (further) restrictions with efficient (parameterized) algorithms. We also study the (parameterized) complexity of related problems, for instance, extension variants of the synchronizing word problem, or the problem of finding smallest alphabet-induced synchronizable sub-automata.

APA, Harvard, Vancouver, ISO, and other styles

6

LI, GUOQIANG, XIAOJUAN CAI, and SHOJI YUEN. "MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS." International Journal of Foundations of Computer Science 23, no. 04 (June 2012): 831–51. http://dx.doi.org/10.1142/s0129054112400382.

Full text

Abstract:

Timed automata are commonly recognized as a formal behavioral model for real-time systems. For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful. Although parallel composition provides a general method for system construction, in the low level behavior, components often behave sequentially by passing control via communication. This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components. In a controller automaton, to each state a timed automaton is assigned. A timed automaton at a state may be preempted by the control passing to another state by a global labeled transition. A controller automaton properly extends the expressive power because of the stack, but this can make the reachability problem undecidable. Given a strict partial order over states, we show that this problem can be avoided and a controller automaton can be faithfully translated into a timed automaton.

APA, Harvard, Vancouver, ISO, and other styles

7

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA." Parallel Processing Letters 19, no. 01 (March 2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Full text

Abstract:

The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. Although many of the framework elements that we describe here are not new, we group them into a consistent framework and show that they can all be implemented on a traditional cellular automaton, which means that they are merely more human-friendly ways of describing simple cellular automata rules, and not foreign structures that require changing the traditional cellular automaton model.

APA, Harvard, Vancouver, ISO, and other styles

8

Morales, D. G., F. Almeida, C. Rodrı́guez, J. L. Roda, I. Coloma, and A. Delgado. "Parallel dynamic programming and automata theory." Parallel Computing 26, no. 1 (January 2000): 113–34. http://dx.doi.org/10.1016/s0167-8191(99)00098-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Vollweiler, Marcel, and Friedrich Otto. "Systems of parallel communicating restarting automata." RAIRO - Theoretical Informatics and Applications 48, no. 1 (January 2014): 3–22. http://dx.doi.org/10.1051/ita/2013046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bordihn, Henning, and György Vaszil. "Reversible parallel communicating finite automata systems." Acta Informatica 58, no. 4 (July 19, 2021): 263–79. http://dx.doi.org/10.1007/s00236-021-00396-9.

Full text

Abstract:

AbstractWe study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Parallel Automata"

1

Vollweiler, Marcel [Verfasser]. "Systems of Parallel Communicating Restarting Automata / Marcel Vollweiler." Kassel : Universitätsbibliothek Kassel, 2013. http://d-nb.info/1043824987/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Slotta, Douglas J. "Structural Design Using Cellular Automata." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33368.

Full text

Abstract:

Traditional parallel methods for structural design do not scale well. This thesis discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one used to propagate stresses and strains, and one to perform design analysis. These rules can be applied serially, periodically, or concurrently, and Jacobi or Gauss-Seidel style updating can be done. These options are compared with respect to convergence, speed, and stability.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

3

Xu, Hao, and 許浩. "On the computational ability of cellular automata." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Xu, Hao. "On the computational ability of cellular automata /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Torbey, Sami. "Towards a framework for intuitive programming of cellular automata." Thesis, Kingston, Ont. : [s.n.], 2007. http://hdl.handle.net/1974/929.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Zhengping. "A parallel implementation of a cellular automata based earthquake model." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq22145.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Šoustar, Jakub. "Syntaktická analýza založená na systémech hlubokých zásobníkových automatů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363793.

Full text

Abstract:

This thesis investigates deep pushdown automata and introduces their modification called controlled deep pushdown automata. Distributed deep pushdown automata systems and parallel communicating deep pushdown automata systems are described. Their accepting power and properties are investigated and several variants are introduced. This thesis proves that the accepting power of one such variant of parallel communicating deep pushdown automata systems is equal to the accepting power of Turing machines. A method for syntactical analysis based on the previously introduced automata systems is described.

APA, Harvard, Vancouver, ISO, and other styles

8

Castro, Antonio Paulo. "Dynamic water quality modeling using cellular automata." Diss., This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-06062008-151210/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Krčmář, Radim. "Regulované systémy automatů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255359.

Full text

Abstract:

This thesis defines and studies two new types of automata, cooperating distributed pushdown automata systems (CDPDAS) and parallel communicating pushdown automata systems (PCPDAS). CDPDAS and PCPDAS adapt the main concept of cooperating distributed grammar systems (CDGS) and parallel communicating automata systems (PCPDAS), respectively. CDPDAS are proven to have the same power as PDA and this thesis further explores the reason why CDPDAS do not increase power while CDGS do and introduces an automata system inspired by CDPDAS that does increase the power. PCGS have similar power as CDGS, but PCPDAS are equvalent with TM, which is proven by creating a communication protocol to access a second stack.

APA, Harvard, Vancouver, ISO, and other styles

10

Kučera, Jiří. "A Combination of Automata and Grammars." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236222.

Full text

Abstract:

V této práci byly zavedeny a studovány nové systémy formálních modelů, zvané stavově synchronizované automatové systémy stupně n . Výpočet je v těchto prezentovaných systémech řízen pomocí slov patřících do konečného řídícího jazyka, kde každé slovo z tohoto jazyka je složeno ze stavů komponent systému. Dále byla v této práci studována výpočetní síla zavedených systémů. Praktické použití zavedených systémů bylo demonstrováno na příkladu z oblasti překladu přirozených jazyků a dále na příkladu z oblasti paralelního překladu.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Parallel Automata"

1

Automata, neural networks, and parallel machines: Some emerging principles. Singapore: World Scientific, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Evolution of parallel cellular machines: The cellular programming approach. Berlin: Springer, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tamas, Legendi, ed. Parallel processing by cellular automata and arrays: Proceedings of the Third International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, GDR, 9-11 September 1986. Amsterdam: North-Holland, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Aladʹev, V. Z. Odnorodnye struktury: Teoreticheskie i prikladnye aspekty. Kiev: ʺTėkhnikaʺ, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Automata, Workshop on Cellular. Workshop on Cellular Automata proceedings: Centre for Scientific Computing, Espoo, Finland, April 17-18, 1991. Espoo, Finland: Centre for Scientific Computing, Finnish State Computer Centre, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Models of massive parallelism: Analysis of cellular automata and neural networks. Berlin: Springer, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Rodolfo, Gomez, ed. Concurrency theory: Calculi and automata for modelling untimed and timed concurrent systems. London: Springer, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

International Workshop on Parallel Processing by Cellular Automata and Arrays (3rd 1986 East Berlin, Germany). Parallel processing by cellular automata and arrays: Proceedings of the Third International Workshop on Parallel Processing by Cellular Aotomata and Arrays, Berlin,GDR, 9-11 September 1986. Amsterdam: North Holland, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

International, Workshop on Parallel Processing by Cellular Automata and Arrays (5th 1990 Berlin Germany). Parcella '90: Proceedings of the V. International Workshop on Parallel Processing by Cellular Automata and Arrays, held in Berlin, September 17-21, 1990. Berlin: Akademie-Verlag, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

International Workshop on Parallel Processing by Cellular Automata and Arrays (4th 1988 Berlin, Germany). Parcella '88: Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, GDR, October 17-21, 1988 : proceedings. Berlin: Springer-Verlag, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Parallel Automata"

1

Steele, Guy L., Xiaowei Shen, Josep Torrellas, Mark Tuckerman, Eric J. Bohm, Laxmikant V. Kalé, Glenn Martyna, et al. "Cellular Automata." In Encyclopedia of Parallel Computing, 241–47. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Vishkin, Uzi. "Structural parallel algorithmics." In Automata, Languages and Programming, 363–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54233-7_148.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Worsch, Thomas. "Cellular Automata as Models of Parallel Computation." In Cellular Automata, 493–511. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_49.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pan, Linqiang, and Gheorghe Păun. "On Parallel Array P Systems." In Automata, Universality, Computation, 171–81. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-09039-9_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ranade, Abhiram. "Bandwidth efficient parallel computation." In Automata, Languages and Programming, 4–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61440-0_114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kirousis, Lefteris M. "Fast parallel constraint satisfaction." In Automata, Languages and Programming, 418–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56939-1_91.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gil, Joseph, and Yossi Matias. "Simple fast parallel hashing." In Automata, Languages and Programming, 239–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58201-0_72.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ramesh, R., R. M. Verma, T. Krishnaprasad, and I. V. Ramakrishnan. "Term matching on parallel computers." In Automata, Languages and Programming, 336–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18088-5_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hagerup, Torben, and Manfred Nowak. "Parallel retrieval of scattered information." In Automata, Languages and Programming, 439–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0035775.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Berman, Piotr, Marek Karpinski, and Yakov Nekrich. "Approximating Huffman Codes in Parallel." In Automata, Languages and Programming, 845–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45465-9_72.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parallel Automata"

1

Davydov, A., A. Larionov, and N. Nagul. "PCF-based formalization of the parallel composition of automata." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments 2019. Crossref, 2019. http://dx.doi.org/10.47350/iccs-de.2019.03.

Full text

Abstract:

The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.

APA, Harvard, Vancouver, ISO, and other styles

2

Subramaniyan, Arun, and Reetuparna Das. "Parallel Automata Processor." In ISCA '17: The 44th Annual International Symposium on Computer Architecture. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3079856.3080207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Windmann, Stefan, Dorota Lang, and Oliver Niggemann. "Learning parallel automata of PLCs." In 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA). IEEE, 2017. http://dx.doi.org/10.1109/etfa.2017.8247693.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sateesh, Vipula, Connor Mckeon, Jared Winograd, and Andre DeHon. "Pipelined Parallel Finite Automata Evaluation." In 2019 International Conference on Field-Programmable Technology (ICFPT). IEEE, 2019. http://dx.doi.org/10.1109/icfpt47387.2019.00021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Subramaniyan, Arun, Jingcheng Wang, Ezhil R. M. Balasubramanian, David Blaauw, Dennis Sylvester, and Reetuparna Das. "Cache Automaton: Repurposing Caches for Automata Processing." In 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 2017. http://dx.doi.org/10.1109/pact.2017.51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Jinglei Liu and Yongjuan Wang. "Execution Semantics of Parallel Finite Automata." In 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5367159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Duchier, Denys, Jerome Durand-Lose, and Maxime Senot. "Massively Parallel Automata in Euclidean Space-Time." In 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop (SASOW). IEEE, 2010. http://dx.doi.org/10.1109/sasow.2010.23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Roy, Indranil, Ankit Srivastava, Matt Grimm, and Srinivas Aluru. "Parallel Interval Stabbing on the Automata Processor." In 2016 6th Workshop on Irregular Applications: Architecture and Algorithms (IA3). IEEE, 2016. http://dx.doi.org/10.1109/ia3.2016.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kim, Seong-Wan, and Earl E. Swartzlander. "Parallel multipliers for Quantum-Dot Cellular Automata." In 2009 IEEE Nanotechnology Materials and Devices Conference (NMDC). IEEE, 2009. http://dx.doi.org/10.1109/nmdc.2009.5167566.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Shuai, Dianxun, Li D. Xu, and Bin Zhang. "Parallel Optimization Based on Generalized Cellular Automata." In 2006 IEEE International Conference on Systems, Man and Cybernetics. IEEE, 2006. http://dx.doi.org/10.1109/icsmc.2006.384723.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Parallel Automata"

1

Abarbanel, H., K. Case, A. Despain, F. Dyson, and M. Freeman. Cellular Automata and Parallel Processing for Practical Fluid-Dynamics Problems. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada229234.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yepez, Jeffrey. AFOSR Initiative Element: Lattice-Gas Automata and Lattice Boltzmann Methods as a Novel Parallel Computing Strategy. Fort Belvoir, VA: Defense Technical Information Center, March 1993. http://dx.doi.org/10.21236/ada421677.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Robert, Kirby. Automatic parallel finite elements. Office of Scientific and Technical Information (OSTI), September 2013. http://dx.doi.org/10.2172/1093683.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Owen, Steven, Corey Ernst, and Clinton Stimpson. Sculpt: Automatic Parallel Hexahedral Mesh Generation. Office of Scientific and Technical Information (OSTI), June 2019. http://dx.doi.org/10.2172/1762652.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Midkiff, S. P. Automatic generation of synchronization instructions for parallel processors. Office of Scientific and Technical Information (OSTI), May 1986. http://dx.doi.org/10.2172/5768416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Yau, Stephen S., Changju Gao, Debin Jia, Jun Wang, and Jiazheng Wu. Automated Object-Oriented Software Development for Parallel Processing Systems. Fort Belvoir, VA: Defense Technical Information Center, February 1998. http://dx.doi.org/10.21236/ada341223.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Hinkins, R. L. Parallel computation of automatic differentiation applied to magnetic field calculations. Office of Scientific and Technical Information (OSTI), September 1994. http://dx.doi.org/10.2172/10107439.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Karavanic, K. Final report for''automated diagnosis of large scale parallel applications''. Office of Scientific and Technical Information (OSTI), November 2000. http://dx.doi.org/10.2172/15005433.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

David, Philip, Philip Emmerman, and Sean Ho. Design and Analysis of a Parallel, Real-Time, Automatic Target Recognition Algorithm. Fort Belvoir, VA: Defense Technical Information Center, September 1996. http://dx.doi.org/10.21236/ada315570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Subhlok, Jaspal. Automatic Mapping of Task and Data Parallel Programs for Efficient Execution on Multicomputers. Fort Belvoir, VA: Defense Technical Information Center, November 1993. http://dx.doi.org/10.21236/ada274125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!