800 search results - page 115 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
139
Voted
WMPI
2004
ACM
15 years 8 months ago
2004
ACM
Abstract. Many applications with large data spaces that cannot run on a typical workstation (due to page faults) call for techniques to expand the effective memory size. One such t...
143
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
148
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
257
Voted
Publication
Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitativel...
191
click to vote
ISSAC
1997
Springer
15 years 7 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...