Sciweavers

36 search results - page 6 / 8
» A new parallel matrix multiplication algorithm on distribute...
Sort
View
147
Voted
IPPS
2009
IEEE
15 years 9 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...
122
Voted
ICPP
2005
IEEE
15 years 8 months ago
Incremental Parallelization Using Navigational Programming: A Case Study
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin L...
111
Voted
SPAA
2006
ACM
15 years 8 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
130
Voted
PPAM
2005
Springer
15 years 8 months ago
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
Pavel Tvrdík, Ivan Simecek
117
Voted
ISPDC
2008
IEEE
15 years 9 months ago
Algorithms for Network Topology Discovery using End-to-End Measurements
Identifying and inferring performances of a network topology is a well known problem. Achieving this by using only end-to-end measurements at the application level is a method kno...
Laurent Bobelin, Traian Muntean