Computer Architecture for High-Speed, Graph-Traversal

    公开(公告)号:US20190258401A1

    公开(公告)日:2019-08-22

    申请号:US15901376

    申请日:2018-02-21

    Abstract: A computer architecture for graph-traversal provides a processor for bottom-up sequencing through the graph data according to vertex degree. This ordered sequencing reduces redundant edge checks. In one embodiment, vertex adjacency data describing the graph may be allocated among different memory structures in the memory hierarchy to provide faster access to vertex data associated with vertices of higher degree reducing data access time. The adjacency data also may be coded to provide higher compression in memory of vertex data having high vertex degree.

    High Density Content Addressable Memory
    14.
    发明申请

    公开(公告)号:US20170163534A1

    公开(公告)日:2017-06-08

    申请号:US14959614

    申请日:2015-12-04

    Inventor: Jing Li

    CPC classification number: H04L45/7457 G06F13/1636 G06F13/287 G11C8/10

    Abstract: An associative memory that can be integrated with standard computer memory flexibly reduces its parallelism to match the memory bus speed thereby providing substantial increases in memory density possible by a multiplexing of sense amplifiers that otherwise dominate the memory structure. Apparent parallel operation is provided by an accumulator that reassembles the multiplex data. Higher memory density makes dual use of the associative memory as a content addressable memory and random-access memory possible.

Patent Agency Ranking