Search references for EXPLICIT DATA-GRAPH-EXECUTION. Phrases containing EXPLICIT DATA-GRAPH-EXECUTION
See searches and references containing EXPLICIT DATA-GRAPH-EXECUTION!EXPLICIT DATA-GRAPH-EXECUTION
Explicit data graph execution, or EDGE, is a type of instruction set architecture (ISA) which intends to improve computing performance compared to common
Explicit_data_graph_execution
Topics referred to by the same term
ThinkPad Edge, a Lenovo laptop computer series marketed from 2010 Explicit data graph execution, a computer instruction set architecture EDGE (telecommunication)
Edge
Efficient version of non-strict evaluation
mapped to a directed graph data structure in computer memory, and program execution then consists of rewriting parts of this graph ("reducing" it) so as
Graph_reduction
Graphical representation of a computer program or algorithm
control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during its execution, or control
Control-flow_graph
Programming paradigm based on asynchronous data streams
the data flows can change during the execution of a program. The use of data switches in the data flow graph could to some extent make a static data flow
Reactive_programming
Data query language developed by Facebook
GraphQL is a data query and manipulation language that allows specifying what data is to be retrieved ("declarative data fetching") or modified. A GraphQL
GraphQL
Explicit Multi-Threading (XMT) is a computer science paradigm for building and programming parallel computers designed around the parallel random-access
Explicit_multi-threading
Software design structured around a node graph
Node graph architecture is a software design structured around the notion of a node graph. Both the source code and the user interface are designed around
Node_graph_architecture
Human-readable data serialization language
float via explicit data type prefixed by (!!) e: !!str 123 # a string, disambiguated by explicit type f: !!str Yes # a string via explicit type g: Yes
YAML
Research project at Microsoft
Dryad runtime parallelizes the dataflow graph by distributing the computational vertices across various execution engines (which can be multiple processor
Dryad_(programming)
Computer programming paradigm
programming is a programming paradigm that models a program as a directed graph of the data flowing between operations, thus implementing dataflow principles
Dataflow_programming
Overview of and topical guide to computer science
of discrete structures. Used in digital computer systems. Graph theory – Foundations for data structures and searching algorithms. Mathematical logic –
Outline_of_computer_science
published from 2003 to 2006. TRIPS is a processor based on the Explicit Data Graph Execution (EDGE) concept. EDGE attempts to bypass certain performance
TRIPS_architecture
Web platform part of Microsoft 365
service for third-party applications, which hold data in tenant-bound containers accessed through Microsoft Graph. Microsoft Search is the tenant-wide search
SharePoint
Measuring the time or resources used by a section of a computer program
function and how much of program execution time it used. In 1982 gprof extended the concept to a complete call graph analysis. In 1994, Amitabh Srivastava
Profiling (computer programming)
Profiling_(computer_programming)
Shading language for WebGPU
designed with strong static validation, explicit resource binding, and portability in mind for secure execution in browsers. In web contexts, WebGPU implementations
WebGPU_Shading_Language
Unused memory in a computer system
be reached. More precisely, syntactic garbage is data that is unreachable due to the reference graph (there is no path to it), which can be determined
Garbage_(computer_science)
Data structure or code used by a compiler
representing a program into an intermediate graph structure that allows flow analysis and re-arrangement before execution. Use of an intermediate representation
Intermediate_representation
Flow chart in business processing
(EPC) is an ordered graph of events and functions. It provides various connectors that allow alternative and parallel execution of processes. Furthermore
Event-driven_process_chain
Conversion process for computer data
process of translating a data structure or object state into a format that can be stored (e.g. files in secondary storage devices, data buffers in primary storage
Serialization
Organized collection of data in computing
denormalized data, and are designed to scale horizontally. Some NoSQL databases, including graph databases such as Neo4j, represent data as nodes and
Database
API for graph data and graph operations
are explicitly described: GraphBLAS objects, including matrices and vectors, are opaque data structures. Non-blocking execution mode, which permits lazy
GraphBLAS
Case in parallel computing
vector instructions, which operate on multiple data items. The first step is to build the dependency graph, identifying which statements depend on which
Automatic_vectorization
Origins and events of data
The graph consists of three types of links or edges. The simplest link is an explicitly specified link between two actors. These links are explicitly specified
Data_lineage
Procedure in computing
of copying data between databases – it can significantly slow down the whole process. The common solution is to reduce the processing graph to only three
Extract,_transform,_load
Tree representation of the abstract syntactic structure of source code
{X}}]_{s}} . Abstract semantic graph (ASG), also called term graph Composite pattern Control-flow graph Directed acyclic graph (DAG) Document Object Model
Abstract_syntax_tree
Specialized form of workflow management in a scientific environment
the form of a directed graph, where each node represents a task to be executed and edges represent either data flow or execution dependencies between different
Scientific_workflow_system
Computer science field
problem. Symbolic algorithms avoid ever explicitly constructing the graph for the FSM; instead, they represent the graph implicitly using a formula in quantified
Model_checking
Process to determine relationships among statements
iteration space traversal graph and the loop carried dependence graph is: Iteration Space Traversal Graph: Loop Carried Dependence Graph: Work by Moyen, Rubiano
Loop_dependence_analysis
Mathematical model for data types
abstract data type (ADT) is a mathematical model for data types, defined by its behavior (semantics) from the point of view of a user of the data, specifically
Abstract_data_type
Concept in natural language processing
via Graph Embedding". Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics
Entity_linking
Executing several computations during overlapping time periods
Brinch Hansen LabVIEW – graphical, dataflow, functions are nodes in a graph, data is wires between the nodes; includes object-oriented language Limbo –
Concurrent_computing
random execution of code EXHIBITOR, which searches for execution sequences matching a given regular expression GENERATOR, which constructs the graph of reachable
Construction and Analysis of Distributed Processes
Construction_and_Analysis_of_Distributed_Processes
Process of analyzing computer program behavior
called at various points during the execution of a program. The collected information is represented by a control-flow graph (CFG) where the nodes are instructions
Program_analysis
Israeli-American computer scientist
develop their algorithms for the PRAM model. He went on to invent the explicit multi-threaded (XMT) computer architecture that enables implementation
Uzi_Vishkin
Model in software programming
causal context meta-data. One is to maintain an explicit dependency graph of the causal dependence relation. Because such a graph can grow arbitrarily
Causal_consistency
Concept in computer science
include singly and doubly linked lists and varieties of trees. Graphs and DAGs and other data structures with more general sharing are more difficult for
Separation_logic
Computational problem of graph theory
DijkstraSSSP takes the graph G {\displaystyle G} and the root node v {\displaystyle v} as input. The result of the execution in turn is the distancelist
Parallel all-pairs shortest path algorithm
Parallel_all-pairs_shortest_path_algorithm
different data as in data level parallelism, here different loops perform different tasks on different data. Let's say the time of execution of s1 and
Loop-level_parallelism
System with multiple networked computers
notifications, while messages are better suited for command execution, workflow orchestration, and explicit coordination. Modern architectures commonly combine
Distributed_computing
Classification of computer architectures
network. Systolic architectures use a global clock and explicit timing delays to synchronize data flow from processor to processor. Each processor in a
Duncan's_taxonomy
Machine learning software library
step-through a debugger, since data is augmented at each line of code rather than later in a computational graph. This execution paradigm is considered to
TensorFlow
Computer executable language
The Web Services Business Process Execution Language (WS-BPEL), commonly known as BPEL (Business Process Execution Language), is an OASIS standard executable
Business Process Execution Language
Business_Process_Execution_Language
Class of algorithms
tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a tree data structure exactly
Tree_traversal
Parallel programming model
an arbitrary graph of software modules. The module graph describes how a set of modules interact with each other using a set of typed data streams. The
Algorithmic_skeleton
Of a function, an additional effect besides returning a value
processors designed with pipelining (since 1990) or with out-of-order execution. Such a processor may require additional control circuitry to detect hidden
Side effect (computer science)
Side_effect_(computer_science)
Processing mode
for OLAP use a multidimensional data model, allowing for complex analytical and ad hoc queries with a rapid execution time. They borrow aspects of navigational
Online_analytical_processing
Computer frameserver program
dataflow language: a programming paradigm that describes a directed graph of the data flowing between operations. It lacks some procedural programming control
AviSynth
program-level execution. Instead of requiring the programmer to explicitly coordinate parallel tasks, the compiled program organizes its runtime execution in a
ILNumerics
In software, to have several parent classes
requires stating explicitly which parent class the feature to be used is invoked from i.e. Worker::Human.age. C++ does not support explicit repeated inheritance
Multiple_inheritance
Class of process mining techniques
analytics on the data in their organizations. However, BI has no process model, awareness or analytics. BPD complements BI by providing an explicit process view
Business_process_discovery
Modelling language and methodology for capturing knowledge and designing systems
of programming languages) specification for OPL and another detailed OPD graph grammar. To facilitate verification of the EBNF specification, David Shorter
Object_Process_Methodology
Concurrency control technique for databases
or more databases) exists in the Global augmented conflict graph (also blocking by a data-access lock is represented by an edge). Suppose the cycle does
Commitment_ordering
Open-source data analytics software
similar to specifying a query execution plan, making it easier for programmers to explicitly control the flow of their data processing task. SQL is oriented
Apache_Pig
Compiler that optimizes generated code
generate code that is optimized in aspects such as minimizing program execution time, memory usage, storage size, and power consumption. Optimization
Optimizing_compiler
Programming language
connector or circuit, is a labeled directed hypergraph. Such a graph represents the data-flow among the processes in the system. Reo has formal semantics
Reo_Coordination_Language
Estimate of time taken for running an algorithm
the size of the input. This implies that the execution time remains consistent regardless of how much data is processed. For instance, accessing a specific
Time_complexity
American technology company
compute graphs, improving execution performance and efficiency. The LPU was designed off on two key observations: AI workloads exhibit substantial data parallelism
Groq
Type of parallel computing architecture of tightly coupled nodes
SFMuDMeR = single function, multiple data, merged result(s). Systolic arrays use a pre-defined computational flow graph that connects their nodes. Kahn process
Systolic_array
Programming paradigm in which many processes are executed simultaneously
to some variable), and to unlock the data when it is finished. Therefore, to guarantee correct program execution, the above program can be rewritten to
Parallel_computing
mathematical model based on sample data, known as "training data", in order to make predictions or decisions without being explicitly programmed to perform the
Glossary_of_computer_science
Data structure that tracks variable use and definitions
accomplished: A directed acyclic graph (DAG) is created on the variable uses and definitions. The DAG specifies a data dependency among assignment statements
Use-define_chain
Higher-level programming standard for heterogeneous computing
higher-level than C++ AMP and CUDA since you do not need to build an explicit dependency graph between all the kernels, and it provides you with automatic asynchronous
SYCL
Model to describe distributed systems
class of discrete event dynamic system. A Petri net is a directed bipartite graph that has two types of elements: places and transitions. Place elements are
Petri_net
Network whose links change over time
Due to their first-order complexity can be counted in large graphs in a reasonable execution time. For example, Longa et al. show how to use Egocentric
Temporal_network
Decision support tool
intelligence, robotics and control) – Mathematical model of plan execution Binary decision diagram – Data structure for Boolean functions Boosting (machine learning) –
Decision_tree
List of concepts in artificial intelligence
graph (abstract data type) In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts
Glossary of artificial intelligence
Glossary_of_artificial_intelligence
Software resource tracking technique
collection schemes, it is often helpful to think of the reference graph, which is a directed graph where the vertices are objects and there is an edge from an
Reference_counting
Artificial intelligence data structure
generate a semantic network given a set of frames even though it lacks explicit arcs. References to Noam Chomsky and his generative grammar of 1950 are
Frame (artificial intelligence)
Frame_(artificial_intelligence)
arbitrary acyclic data flow graphs. In contract, MapReduce programs have a static structure (Map -> Reduce). Data Model: PACT's data model are records
Parallelization_contract
General-purpose programming language
type cast to explicitly convert a value from one type to another, or by using pointers or unions to reinterpret the underlying bits of a data object in some
C_(programming_language)
Process to evaluate alternative hypotheses
Bayesian) community. The work by Akram and Wang applies paradigms from graph theory. Other work focuses less on probabilistic methods and more on cognitive
Analysis of competing hypotheses
Analysis_of_competing_hypotheses
Computer hacking technique
technique used to attack data-driven applications, in which malicious SQL statements are inserted into an entry field for execution (e.g. to dump the database
SQL_injection
Computer software system
executed until it is explicitly uninstalled. Since most DSMS are data-driven, a continuous query produces new results as long as new data arrive at the system
Data_stream_management_system
Comprehensive outline of core abstractions in the field of computer science
the context of data structures, the term "abstraction" refers to the way in which a data structure represents and organizes data. Each data structure provides
List of abstractions (computer science)
List_of_abstractions_(computer_science)
AMD computing architecture
128-bit wide vector unit capable of SIMD (Single Instruction, Multiple Data) execution, a scalar unit for control and sequential logic, and a set of load/store
AI_engine
Programming language evaluation rules
C leaves the order undefined. Scheme requires the execution order to be the sequential execution of an unspecified permutation of the arguments. OCaml
Evaluation_strategy
Process of mathematical modelling, performed on a computer
quickly perceive trends by looking at graphs or even moving-images or motion-pictures generated from the data, as displayed by computer-generated-imagery
Computer_simulation
Distributed version control software system
from the original on 16 November 2015. Retrieved 20 December 2015. "Commit Graph". GitHub. 8 June 2016. Archived from the original on 20 January 2016. Retrieved
Git
Sequence of operations for a task
performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred
Algorithm
Set of rules defining correctly structured programs
comparison predicates: IS NULL and IS NOT NULL test whether data is or is not Null. SQL does not explicitly support universal quantification, and must work it
SQL_syntax
determine the execution path uniquely during backward execution, where the roles of tests and assertions are typically swapped. This explicit management
Reversible programming language
Reversible_programming_language
How software progresses through its implementation
In software, control flow (or flow of control) describes how execution progresses from one command to the next. In many contexts, such as machine code
Control_flow
Standard published by the Object Management Group
decision models from process execution data have been proposed as well. Here, a DMN decision model is derived from a data-enriched event log, along with
Decision_Model_and_Notation
Set of rules defining correctly structured C++ program
stackless functions whose execution may be suspended, by returning to the caller while the data needed to resume execution is stored separate from the
C++_syntax
Use of statistical arguments to assert falsehoods
distribution Misuse of p-values Misleading graph Post hoc analysis Simpson's paradox Statcheck Some data on accuracy of polls is available. Regarding
Misuse_of_statistics
Matrix in which most of the elements are zero
symmetric sparse matrix arises as the adjacency matrix of an undirected graph; it can be stored efficiently as an adjacency list. A block-diagonal matrix
Sparse_matrix
Performing order of mathematical operations
Casio. Retrieved 2019-08-01. "Implied Multiplication Versus Explicit Multiplication on TI Graphing Calculators". Texas Instruments. 2011. Retrieved 2025-07-22
Order_of_operations
Type of sub-graph
recurrent and statistically significant subgraphs or patterns of a larger graph. All networks, including biological networks, social networks, technological
Network_motif
Programming paradigm
Programming. Gregor Kiczales and colleagues at Xerox PARC developed the explicit concept of AOP and followed this with the AspectJ AOP extension to Java
Aspect-oriented_programming
Software framework to support the development of websites
Another technique is that of graph traversal such as used by Zope, where a URL is decomposed in steps that traverse an object graph (of models and views).[citation
Web_framework
Social networking service owned by Meta Platforms
March 2021. A "shadow profile" refers to the data Facebook collects about individuals without their explicit permission. For example, the "like" button
Canceled Intel GPGPU chip
included explicit cache control instructions to reduce cache thrashing during streaming operations which only read/write data once. Explicit prefetching
Larrabee_(microarchitecture)
benign. This is usually the most simple to implement since it results in an explicit scheme. Steinbrink, Cornelius (2017). "Simulation-based Validation of Smart
Co-simulation
Programming language used in Texas Instruments calculators
of several BASIC-like programming languages used by Texas Instruments' graphing calculators. It is a language family of three different and incompatible
TI-BASIC
In mathematics, a fibration of graphs, or graph fibration, is a homomorphism of directed graphs that satisfies a unique lifting property analogous to that
Fibrations_of_graphs
Programming language
as reduction on a program term graph, and there are often many different ways (strategies) to reduce a given term graph. Antoy et al. proved in the 1990s
Curry_(programming_language)
Software programming technique
which it is not aware of. Dependency injection makes implicit dependencies explicit and helps solve the following problems: How can a class be independent
Dependency_injection
Computer programming paradigm
randomized data access (such as databases). By sacrificing some flexibility in the model, the implications allow easier, faster and more efficient execution. Depending
Stream_processing
Programming language for statistics
commercial support for its Big Data Appliance, which integrates R into its other products. IBM provides commercial support for execution of R within Hadoop. Comparison
R_(programming_language)
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
Female
Hebrew
(×“Ö¼Ö¸× Ö¸×”) Feminine form of Hebrew Dan, DANA means "judge." Compare with other forms of Dana.
Female
Hebrew
(דִּיתָה) Pet form of Hebrew Yehuwdiyth, DITA means "Jewess" or "praised." Compare with another form of Dita.
Male
Hebrew
(דֶּרַע) Hebrew name DARA means "the arm." In the bible, this is the name of a son of Zerah. Compare with other forms of Dara.
Male
Irish
 From Irish Gaelic Mac Dara, DARA means "son of oak." Compare with other forms of Dara.
Female
Polish
 Variant spelling of Polish Dyta, DITA means "rich battle." Compare with another form of Dita.
Male
Turkish
Turkish name ATA means "ancestor."
Female
Polish
Short form of Polish Edyta, DYTA means "rich battle."
Male
English
English surname transferred to unisex forename use, possibly DANA means "from Denmark."
Boy/Male
Indian
Grape
Female
Finnish
Variant form of Finnish Aada, AATA means "noble."
Female
English
 English surname transferred to unisex forename use, possibly DANA means "from Denmark." Compare with other forms of Dana.
Male
Hebrew
Variant spelling of Hebrew Dathan, DATAN means "belonging to a fountain."
Female
Hungarian
 Short form of Hungarian Katalin, KATA means "pure." Compare with other forms of Kata.
Female
Russian
 Short form of Russian Yekaterina, KATA means "pure." Compare with other forms of Kata.
Female
Hindi/Indian
(लता) Hindi name derived from a plant name, from the Sanskrit word lata, LATA means "creeper," in reference to a creeping plant.
Male
Iranian/Persian
 Short form of Persian Dârayavahush, DARA means "possesses a lot, wealthy." Compare with other forms of Dara.
Female
English
 Middle English name DARA means "brave, daring." Compare with another form of Dara.
Female
Finnish
 Short form of Finnish Katariina, KATA means "pure." Compare with other forms of Kata.
Female
Slavic
 Short form of Slavic Bogdana, DANA means "gift from God." Compare with other forms of Dana.
Boy/Male
Muslim
Grape
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
Surname or Lastname
English and Norwegian (Røys)
English and Norwegian (Røys) : variant of Royse.
Girl/Female
English
The hazel tree;nut.
Boy/Male
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Oriya, Sanskrit, Telugu
Pleasant Look; Pleasing
Boy/Male
Hindu, Indian, Marathi
Jewel; Gem
Boy/Male
Hindu
One who is the first cause
Boy/Male
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi
Lord Shiva
Girl/Female
Muslim
Explorer, Guide, Leader
Girl/Female
Tamil
Dark, Fog, Flawed gold, Perfumed, Earth, Perfumed, A bud
Boy/Male
Australian, Celtic, Christian, Irish
Little Fair One
Surname or Lastname
English (southeastern)
English (southeastern) : either from a pet form of the personal name Pell, or a metonymic occupational name for a furrier, from Old French pellet ‘fur’, a diminutive of pel ‘skin’. Compare Pelletier.
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
a.
A word formerly used (as finis is now) at the conclusion of a book to indicate the end.
n.
The fruit of the date palm; also, the date palm itself.
a.
Tacitly comprised; fairly to be understood, though not expressed in words; implied; as, an implicit contract or agreement.
n.
An explicit declaration.
n.
The quality of being explicit; clearness; directness.
a.
Not implied merely, or conveyed by implication; distinctly stated; plain in language; open to the understanding; clear; not obscure or ambiguous; express; unequivocal; as, an explicit declaration.
n.
Exploit.
n.
To utilize; to make available; to get the value or usefulness out of; as, to exploit a mine or agricultural lands; to exploit public opinion.
n.
The point of time at which a transaction or event takes place, or is appointed to take place; a given point of time; epoch; as, the date of a battle.
a.
Not explicit; not clearly stated; indefinite; vague.
a.
Resting on another; trusting in the word or authority of another, without doubt or reserve; unquestioning; complete; as, implicit confidence; implicit obedience.
adv.
In an explicit manner; clearly; plainly; without disguise or reservation of meaning; not by inference or implication; as, he explicitly avows his intention.
adv.
Avowedly; explicitly.
v. t.
To note or fix the time of, as of an event; to give the date of; as, to date the building of the pyramids.
a.
Having no disguised meaning or reservation; unreserved; outspoken; -- applied to persons; as, he was earnest and explicit in his statement.
v. t.
To note the time of writing or executing; to express in an instrument the time of its execution; as, to date a letter, a bond, a deed, or a charter.
imp. & p. p.
of Explicate
p. pr. & vb. n.
of Explicate
v. t.
To draw out or entice forth; to bring to light; to bring out against the will; to deduce by reason or argument; as, to elicit truth by discussion.