Sciweavers

2563 search results - page 148 / 513
» Parallel matrix algorithms and applications
Sort
View
IOPADS
1997
152views more  IOPADS 1997»
15 years 5 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 3 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
102
Voted
HPDC
1998
IEEE
15 years 8 months ago
Adaptive Communication Algorithms for Distributed Heterogeneous Systems
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...
Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. ...
PPOPP
1999
ACM
15 years 8 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
CLUSTER
2008
IEEE
15 years 10 months ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...