All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

174 885 (0,74s)

Result

Analytical Modelling of Linear Codes

analytical model is around 96%.In this paper, we describe a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrices...

IN - Informatika

  • 2006
  • D
  • Link
Result

Analytical Modelling of Linear Codes

analytical model is around 96%.In this paper, we describe a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrices...

IN - Informatika

  • 2006
  • A
Result

On The Accuracy of Cache Sharing Models

accesses. Past research has developed analytical models that estimate the cache designs have multiple cores sharing a cache. To accurately model a workload these workloads. We extend this research by pres...

IN - Informatika

  • 2012
  • D
  • Link
Result

Performance Optimization and Evaluation for Linear Codes

analytical model is around 96%.In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrices)...

IN - Informatika

  • 2005
  • D
Result

A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices

on Intel x86 architecture with L1 and L2 caches. The average accuracy of our analytical model is around 95% in case of L2 cache and 88% in case of L1 cache. of a cache suffersfrom low spatial and...

IN - Informatika

  • 2006
  • D
Result

Analytical Modeling of Optimized Sparse Linear Code

and FPU arithmetic instructions and improve the temporal cache locality. We develop a probabilistic model for estimation of the numbers of cache misses for 3 types of data caches. The accuracy of our analytica...

JC - Počítačový hardware a software

  • 2004
  • D
Result

Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants

temporal and spatial locality. We also describe a probabilistic analytical model of the cache behavior during the standard and recursive Cholesky factorization and use it for studying effects of these transformations. Auto...

JD - Využití počítačů, robotika a její aplikace

  • 2004
  • D
Result

Timing Penalties Associated with Cache Sharing

of memory caches is not captured by the common approaches to modeling of software memory cache models into software performance models is hindered by the fact that existing cache models ...

IN - Informatika

  • 2009
  • D
Result

When Misses Differ: Investigating Impact of Cache Misses on Observed Performance

Although modeling of memory caches for the purpose of cache design and process scheduling has advanced considerably, the effects of cache sharing are still not captured by common approaches to modeling of ...

IN - Informatika

  • 2009
  • D
Result

A new code transformation technique for nested loops

. We also describe a formal method for predicting cache behavior and evaluate results of the model accuracy by the measurements on a cache monitor. The comparisonsFor good performance of every computer program, good cac...

IN - Informatika

  • 2014
  • Jx
  • Link
  • 1 - 10 out of 174 885