Executing graph-based program specifications

A standard and procedural technology, applied in the direction of multi-channel program device, program control design, program code conversion, etc., can solve the problems of calculation mismatch and difficulty in adapting, and achieve the effect of improving calculation efficiency and realizing efficiency gain

Active Publication Date: 2017-05-10
INITIO TECH
View PDF5 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although it is possible to efficiently perform computations that can be represented in the MapReduce framework and whose inputs and outputs can be modified for storage in the MapRed

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Executing graph-based program specifications
  • Executing graph-based program specifications
  • Executing graph-based program specifications

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0059] refer to figure 1 , the task-based computing system 100 uses the high-level program specification 110 to control the computing resources and storage resources of the computing platform 150 to perform calculations specified by the program specification 110 . Compiler / interpreter 120 receives high-level program specification 110 and generates task-based specification 130 in a form executable by task-based runtime interface / controller 140 . The compiler / interpreter 120 recognizes one or more "execution sets" of one or more "components", which may be instantiated individually or as a unit as fine-grained tasks to be applied to each of a plurality of data elements . As described in more detail below, part of the compilation or interpretation process involves identifying these execution sets and preparing them for execution. It should be understood that compiler / interpreter 120 may use any of a variety of algorithms including steps such as parsing high-level program specifi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A graph-based program specification (110) includes components corresponding to tasks and directed links between ports of the components, including: a first type of link configuration defined by respective output and input ports of linked components, and a second type of link configuration defined by respective output and input ports of linked components. A compiler (120) recognizes different types of link configurations and provides in a target program specification occurrences of a target primitive for executing a function for each occurrence of a data element flowing over a link of the second type. A computing node (152) initiates execution of the target program specification, and determines at runtime, for components associated with the occurrences of the target primitive, an order in which instances of tasks corresponding to the components are to be invoked, and/or a computing node on which instances of tasks corresponding to the components are to be executed.

Description

[0001] Cross References to Related Applications [0002] This application claims priority to US Application Serial No. 62 / 044,628, filed September 2, 2014, and US Application Serial No. 62 / 164,175, filed May 20, 2015. technical field [0003] This specification relates to a method for implementing a graph-based program specification. Background technique [0004] One approach to dataflow computation utilizes a graph-based representation in which computational components corresponding to the nodes (vertices) of the graph pass through dataflows corresponding to the links (directed edges) of the graph (called a "dataflow graph"). )coupling. A downstream component connected to an upstream component by a dataflow link receives an ordered stream of input data elements and processes the input data elements in the order received, optionally generating one or more corresponding streams of output data elements. A system for performing such graph-based computations is described in pr...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F13/36G06F9/45G06F9/44G06F9/50
CPCG06F8/433G06F8/447G06F9/5066G06F13/36G06F8/34G06F9/4494G06F9/44505G06F9/44521G06F8/43
Inventor C·W·斯坦菲尔R·夏皮罗A·韦斯A·F·罗伯茨约瑟夫·斯凯芬顿·沃莱三世J·古尔德S·A·库克利希
Owner INITIO TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap