会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明专利
    • DATA PROCESSING GRAPH COMPILATION
    • AU2019204087B2
    • 2019-08-15
    • AU2019204087
    • 2019-06-11
    • AB INITIO TECHNOLOGY LLC
    • STANFILL CRAIG WSHAPIRO RICHARD
    • G06F9/455
    • Disclosed herein are methods, software and computing systems for compiling a graph based program specification to execute on a computing system that supports concurrent execution of operations, including: receiving the graph-based program specification, the graph-based program specification including a graph that includes: a plurality of components, each corresponding to at least one operation; and a plurality of directed links, each directed link connecting an upstream component of the plurality of components to a downstream component of the plurality of components; and processing the graph-based program specification to generate processed code representing one or more groups of operations, the processing including: identifying a possible level of concurrency in a first group of the operations based at least in part on a topology of the graph, such that multiple operations in the first group are not prevented by the topology of the graph from executing concurrently; analyzing at least some of the operations in the first group to determine runtime characteristics associated with the analyzed operations, the analyzing including, for each of the analyzed operations, determining if that analyzed operation is a latent operation that potentially performs a computation over a period of time that is larger than a first threshold or that potentially waits for a response for a period of time that is larger than the first threshold; and generating processed code for executing the operations in the first group, where the processed code enforces a reduced level of concurrency in the first group, lower than the identified possible level of concurrency, unless at least two operations in the first group that are not prevented by the topology of the graph from executing concurrently are determined to be latent operations configured to perform computations, or wait for responses, for respective periods of time larger than the first threshold.
    • 59. 发明专利
    • HETEROGENEOUS EVENT QUEUE
    • CA3044287A1
    • 2018-06-21
    • CA3044287
    • 2017-12-15
    • AB INITIO TECHNOLOGY LLC
    • STANFILL CRAIG W
    • G06F9/54
    • Processing multiple kinds of event messages in a computing system includes storing received event messages in a data storage system that includes storage (220) for a first plurality of records (222) associated with event messages. Each event message includes a timestamp. Records (222) associated with event messages include a field (426) indicating a target delivery time for an event result for the event message, the target delivery time for at least some event messages being determined according to a kind of the event message. The stored event messages are processed to deliver event results based on information in the stored event messages and the target delivery times in the records (222) associated with the event messages. Event messages are prioritized to deliver event results according to stored information indicating priority. A target delivery time is computed for each event message in a first set of one or more event messages that store information indicating the same priority for all of the event messages in the first set based on a fixed delay relative to its respective timestamp. Event results are delivered for event messages that are deliverable based on a comparison of their target delivery times to a clock time.