Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics.

Emerging data-intensive applications attempt to process and provide insight into vast amounts of online data. A new class of linear algebra algorithms can efficiently execute sparse matrix-matrix and matrix-vector multiplications on large-scale, shared memory multiprocessor systems, enabling analyst...

Descripción completa

Detalles Bibliográficos
Publicado en:Computer (00189162) Vol. 48; no. 8; pp. 26 - 35
Autores principales: Buono, Daniele, Gunnels, John A., Que, Xinyu, Checconi, Fabio, Petrini, Fabrizio, Tuan, Tai-Ching, Long, Chris
Formato: Artículo
Publicado: IEEE Aug2015
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=108932515&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 108932515
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00189162
        PUT
      jtl: Computer (00189162)
      issn: 00189162
      maglogo: N
    pubinfo:
      dt: Aug2015
      vid: 48
      iid: 8
      pid: 13605
      pub: IEEE
    artinfo:
      ui:
        108932515
        10.1109/MC.2015.228
      ppf: 26
      ppct: 9
      formats:
      tig:
        atl: Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics.
      aug:
        au:
          Buono, Daniele
          Gunnels, John A.
          Que, Xinyu
          Checconi, Fabio
          Petrini, Fabrizio
          Tuan, Tai-Ching
          Long, Chris
        affil:
          IBM T.J. Watson Research Center
          University of Maryland
          US Department of Defense
      su:
        Online data processing
        Linear algebra
        Computer storage devices
        Multiprocessors
        Social networks
      sug:
        subj:
          Online data processing
          Linear algebra
          Computer storage devices
          Multiprocessors
          Social networks
      keyword:
        Concurrent programming
        data analysis
        Data-intensive applications
        graph analytics
        irregular applications
        Memory management
        shared memory multiprocessor systems
        software
        Software engineering
        sparse linear algebra
        Sparse matrices
        system performance
      ab: Emerging data-intensive applications attempt to process and provide insight into vast amounts of online data. A new class of linear algebra algorithms can efficiently execute sparse matrix-matrix and matrix-vector multiplications on large-scale, shared memory multiprocessor systems, enabling analysts to more easily discern meaningful data relationships, such as those in social networks.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2015
    holdings:
      @attributes:
        islocal: N