AI & ChatGPT searches , social queries for EXPLICIT DATA-GRAPH-EXECUTION
Search references for EXPLICIT DATA-GRAPH-EXECUTION. Phrases containing EXPLICIT DATA-GRAPH-EXECUTION
See searches and references containing EXPLICIT DATA-GRAPH-EXECUTION!
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
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
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
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
Explicit Multi-Threading (XMT) is a computer science paradigm for building and programming parallel computers designed around the parallel random-access
Explicit_multi-threading
Computer programming paradigm
abstractions to represent data execution pipelines as decoupled, directional topologies. This design allows developers to define explicit data-parallel dependencies
Stream_processing
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
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
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
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)
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
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
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
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)
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
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
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
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)
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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)
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
2026 Android mobile operating system
framework blocks thieves with passcodes by requiring explicit biometric authentication to access user data or disable device tracking. Allows users to protect
Android_17
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
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
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
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
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 frameserver program
Wiki. AviSynth Team. Retrieved 10 April 2013. "The Script Execution Model: The Filter Graph". AviSynth Wiki. AviSynth Team. Retrieved 25 October 2019
AviSynth
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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)
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
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)
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
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
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
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
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)
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
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
Method by which work is assigned
Scheduling is fundamental to computation itself, and an intrinsic part of the execution model of a computer system; the concept of scheduling makes it possible
Scheduling_(computing)
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
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
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
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
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
program-level execution. Instead of requiring the programmer to explicitly coordinate parallel tasks, the compiled program organizes its runtime execution in a
ILNumerics
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)
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
Distributed version control software system
control software system that is capable of managing versions of source code or data. It is often used to control source code by programmers who are developing
Git
Social network exclusively for AI agents
sandbox, arguing it could allow malicious skills to enable remote code execution and data exfiltration on host machines. At least one proof-of-concept exploit
Moltbook
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
Process to evaluate alternative hypotheses
a methodology for evaluating multiple competing hypotheses for observed data. It was developed by Richards (Dick) J. Heuer, Jr., a 45-year veteran of
Analysis of competing hypotheses
Analysis_of_competing_hypotheses
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
Tool to convert sequential code to parallel
work sharing candidates, performs the data-flow analysis to verify correct parallel execution, and partitions the data for threaded code generation as is
Automatic parallelization tool
Automatic_parallelization_tool
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)
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
data races, deadlocks, missed signals and live lock are common error types. Parallel programs can be divided into two general categories: explicitly and
Testing high-performance computing applications
Testing_high-performance_computing_applications
Use of functions that call themselves
recursive program, even if this program contains no explicit repetitions. — Niklaus Wirth, Algorithms + Data Structures = Programs, 1976 Most computer programming
Recursion_(computer_science)
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
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION
EXPLICIT DATA-GRAPH-EXECUTION