会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • TECHNOLOGIES FOR AUTOMATIC REORDERING OF SPARSE MATRICES
    • 稀疏矩阵自动重排技术
    • WO2017087078A1
    • 2017-05-26
    • PCT/US2016/054500
    • 2016-09-29
    • INTEL CORPORATION
    • RONG, HongboPARK, JongsooANDERSON, Todd A.
    • G06F9/44
    • G06F8/433G06F8/4434G06F8/4442G06F17/16
    • Technologies for automatic reordering of sparse matrices include a computing device to determine a distributivity of an expression defined in a code region of a program code. The expression is determined to be distributive if semantics of the expression are unaffected by a reordering of an input/output of the expression. The computing device performs inter-dependent array analysis on the expression to determine one or more clusters of inter-dependent arrays of the expression, wherein each array of a cluster of the one or more clusters is inter-dependent on each other array of the cluster, and performs bi-directional data flow analysis on the code region by iterative backward and forward propagation of reorderable arrays through expressions in the code region based on the one or more clusters of the inter-dependent arrays. The backward propagation is based on a backward transfer function and the forward propagation is based on a forward transfer function.
    • 用于稀疏矩阵的自动重新排序的技术包括用于确定在程序代码的代码区域中定义的表达式的分布性的计算设备。 如果表达式的语义不受表达式的输入/输出的重新排序影响,则表达式被确定为分布式的。 计算设备对该表达执行相互依赖的阵列分析以确定该表达的相互依赖的阵列的一个或多个群集,其中该一个或多个群集的群集的每个阵列相互依赖于该群集的每个其他阵列 并且通过基于相互依赖的阵列的一个或多个群集通过代码区域中的表达式对可再定向阵列的迭代后向和前向传播来对代码区域执行双向数据流分析。 后向传播基于后向传递函数,前向传播基于前向传递函数。