Now showing items 1-3 of 3

    • A novel method for scaling iterative solvers: avoiding latency overhead of parallel sparse-matrix vector multiplies 

      Selvitopi, R. O.; Ozdal, M. M.; Aykanat, C. (Institute of Electrical and Electronics Engineers, 2015)
      In parallel linear iterative solvers, sparse matrix vector multiplication (SpMxV) incurs irregular point-to-point (P2P) communications, whereas inner product computations incur regular collective communications. These P2P ...
    • Query-log aware replicated declustering 

      Turk, A.; Oktay, K. Y.; Aykanat, C. (Institute of Electrical and Electronics Engineers, 2013)
      Data declustering and replication can be used to reduce I/O times related with processing of data intensive queries. Declustering parallelizes the query retrieval process by distributing the data items requested by queries ...
    • Selective replicated declustering for arbitrary queries 

      Oktay, K.Y.; Turk, A.; Aykanat, C. (2009)
      Data declustering is used to minimize query response times in data intensive applications. In this technique, query retrieval process is parallelized by distributing the data among several disks and it is useful in ...