Sciweavers

307 search results - page 20 / 62
» A Structure for Modern Computer Narratives
Sort
View
ICPP
2009
IEEE
13 years 5 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
SIGCSE
2008
ACM
211views Education» more  SIGCSE 2008»
13 years 7 months ago
Cluster computing for web-scale data processing
In this paper we present the design of a modern course in cluster computing and large-scale data processing. The defining differences between this and previously published designs...
Aaron Kimball, Sierra Michels-Slettvet, Christophe...
ICCS
2001
Springer
14 years 6 hour ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
ISDA
2006
IEEE
14 years 1 months ago
From Gene to Drug: A Proof of Concept for a Plausible Computational Pathway
The last decade has witnessed an exponential growth of sequence information in the field of biological macromolecules such as proteins and nucleic acids and their interactions wit...
Sandhya Shenoy, B. Jayaram, N. Latha, Pooja Narang...
ICPP
2009
IEEE
14 years 2 months ago
Perfomance Models for Blocked Sparse Matrix-Vector Multiplication Kernels
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...