3600 search results - page 12 / 720 » The settling-time reducibility ordering |
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper shows how the relative size of components can be used to increase matching performance – saving orders of magnitude in component area. The relative size information...
SIAMSC
2010
13 years 2 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
SIAMSC
2011
13 years 2 months ago
2011
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
ISCA
1991
IEEE
13 years 11 months ago
1991
IEEE
When address reference streams exhibit high degrees of spatial and temporal locality, many of the higher order address lines carry redundant information. By caching the higher ord...
SBACPAD
2005
IEEE
14 years 1 months ago
2005
IEEE
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...