805 search results - page 35 / 161 » Modeling the performance of algorithms on flash memory devic... |
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
CGO
2009
IEEE
14 years 3 months ago
2009
IEEE
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
PC
2007
13 years 8 months ago
2007
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
CCS
2007
ACM
14 years 2 months ago
2007
ACM
As computing models change, so too do the demands on storage. Distributed and virtualized systems introduce new vulnerabilities, assumptions, and performance requirements on disks...