scholarly journals Exploring the potential of heterogeneous von neumann/dataflow execution models

2016 ◽  
Vol 43 (3S) ◽  
pp. 298-310 ◽  
Author(s):  
Tony Nowatzki ◽  
Vinay Gangadhar ◽  
Karthikeyan Sankaralingam
Keyword(s):  
Von Neumann ◽  
Dataflow Execution ◽  
Execution Models

scholarly journals An Expressive Language and Efficient Execution System for Software Agents

2005 ◽  
Vol 23 ◽  
pp. 625-666 ◽  
Author(s):  
G. Barish ◽  
C. A. Knoblock
Keyword(s):  
Software Agents ◽  
Parallel Execution ◽  
Multiple Sources ◽  
Von Neumann ◽  
Query Engine ◽  
Dataflow Model ◽  
Dataflow Execution ◽  
And Control ◽  
Do So ◽  
Efficient Execution

Software agents can be used to automate many of the tedious, time-consuming information processing tasks that humans currently have to complete manually. However, to do so, agent plans must be capable of representing the myriad of actions and control flows required to perform those tasks. In addition, since these tasks can require integrating multiple sources of remote information ? typically, a slow, I/O-bound process ? it is desirable to make execution as efficient as possible. To address both of these needs, we present a flexible software agent plan language and a highly parallel execution system that enable the efficient execution of expressive agent plans. The plan language allows complex tasks to be more easily expressed by providing a variety of operators for flexibly processing the data as well as supporting subplans (for modularity) and recursion (for indeterminate looping). The executor is based on a streaming dataflow model of execution to maximize the amount of operator and data parallelism possible at runtime. We have implemented both the language and executor in a system called THESEUS. Our results from testing THESEUS show that streaming dataflow execution can yield significant speedups over both traditional serial (von Neumann) as well as non-streaming dataflow-style execution that existing software and robot agent execution systems currently support. In addition, we show how plans written in the language we present can represent certain types of subtasks that cannot be accomplished using the languages supported by network query engines. Finally, we demonstrate that the increased expressivity of our plan language does not hamper performance; specifically, we show how data can be integrated from multiple remote sources just as efficiently using our architecture as is possible with a state-of-the-art streaming-dataflow network query engine.

Lectures on von Neumann Algebras

2019 ◽  
Author(s):  
Serban-Valentin Stratila ◽  
Laszlo Zsido
Keyword(s):  
Von Neumann Algebras ◽  
Von Neumann

John von Neumann

2004 ◽  
Vol 174 (12) ◽  
pp. 1371 ◽  
Author(s):  
Mikhail I. Monastyrskii
Keyword(s):  
John Von Neumann ◽  
Von Neumann

Information mechanics

2017 ◽  
Author(s):  
Sandip Tiwari
Keyword(s):  
Information Flow ◽  
Irreversible Processes ◽  
State Machines ◽  
Science And Engineering ◽  
Von Neumann ◽  
Principle Of Maximum Entropy ◽  
Information Manipulation ◽  
Classical Quantum ◽  
Physical Laws ◽  
Principle Of Maximum

Information is physical, so its manipulation through devices is subject to its own mechanics: the science and engineering of behavioral description, which is intermingled with classical, quantum and statistical mechanics principles. This chapter is a unification of these principles and physical laws with their implications for nanoscale. Ideas of state machines, Church-Turing thesis and its embodiment in various state machines, probabilities, Bayesian principles and entropy in its various forms (Shannon, Boltzmann, von Neumann, algorithmic) with an eye on the principle of maximum entropy as an information manipulation tool. Notions of conservation and non-conservation are applied to example circuit forms folding in adiabatic, isothermal, reversible and irreversible processes. This brings out implications of fluctuation and transitions, the interplay of errors and stability and the energy cost of determinism. It concludes discussing networks as tools to understand information flow and decision making and with an introduction to entanglement in quantum computing.

Unbounded Linear Operators

2018 ◽  
Author(s):  
D. E. Edmunds ◽  
W. D. Evans
Keyword(s):  
Hilbert Spaces ◽  
Linear Operators ◽  
Von Neumann ◽  
Limit Circle ◽  
Sectorial Operators ◽  
Closed Operators ◽  
The Stability ◽  
Symmetric Operators ◽  
Unbounded Linear Operators ◽  
Special Case

This chapter is concerned with closable and closed operators in Hilbert spaces, especially with the special classes of symmetric, J-symmetric, accretive and sectorial operators. The Stone–von Neumann theory of extensions of symmetric operators is treated as a special case of results for compatible adjoint pairs of closed operators. Also discussed in detail is the stability of closedness and self-adjointness under perturbations. The abstract results are applied to operators defined by second-order differential expressions, and Sims’ generalization of the Weyl limit-point, limit-circle characterization for symmetric expressions to J-symmetric expressions is proved.

Hamilton-Jacobi Theory

2018 ◽  
Author(s):  
Peter Mann
Keyword(s):  
Phase Space ◽  
Bbgky Hierarchy ◽  
Distribution Functions ◽  
Symplectic Integrators ◽  
Partition Functions ◽  
Von Neumann ◽  
Equipartition Theorem ◽  
Recurrence Theorem ◽  
Phase Amplitude ◽  
Canonical Ensembles

This chapter focuses on Liouville’s theorem and classical statistical mechanics, deriving the classical propagator. The terms ‘phase space volume element’ and ‘Liouville operator’ are defined and an n-particle phase space probability density function is constructed to derive the Liouville equation. This is deconstructed into the BBGKY hierarchy, and radial distribution functions are used to develop n-body correlation functions. Koopman–von Neumann theory is investigated as a classical wavefunction approach. The chapter develops an operatorial mechanics based on classical Hilbert space, and discusses the de Broglie–Bohm formulation of quantum mechanics. Partition functions, ensemble averages and the virial theorem of Clausius are defined and Poincaré’s recurrence theorem, the Gibbs H-theorem and the Gibbs paradox are discussed. The chapter also discusses commuting observables, phase–amplitude decoupling, microcanonical ensembles, canonical ensembles, grand canonical ensembles, the Boltzmann factor, Mayer–Montroll cluster expansion and the equipartition theorem and investigates symplectic integrators, focusing on molecular dynamics.

Sign in / Sign up

Export Citation Format

Share Document