Graphs, Betweenness Centrality, and the GPU.

An article discussing the use of graphics processing units to solve big data problems using the graph computation of betweenness centrality is introduced.

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 61; no. 8; pp. 84 - 85
Autor principal: Owens, John D.
Formato: Artículo
Publicado: Association for Computing Machinery Aug2018
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=131002274&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 131002274
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Aug2018
      vid: 61
      iid: 8
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        131002274
        10.1145/3230483
      ppf: 84
      ppct: 1
      formats:
      tig:
        atl: Graphs, Betweenness Centrality, and the GPU.
      aug:
        au: Owens, John D.
        affil: Child Family Professor of Engineering and Entrepreneurship in the Department of Electrical and Computer Engineering at the University of California, Davis, CA, USA
      su:
        Betweenness relations (Mathematics)
        Big data
        Graphics processing units
      sug:
        subj:
          Betweenness relations (Mathematics)
          Big data
          Graphics processing units
      ab: An article discussing the use of graphics processing units to solve big data problems using the graph computation of betweenness centrality is introduced.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2018
    holdings:
      @attributes:
        islocal: N