555 search results - page 69 / 111 » Improved results for a memory allocation problem |
CAL
2002
14 years 9 months ago
2002
Cache misses in small, limited-associativity primary caches very often replace live cache blocks, given the dominance of capacity and conflict misses. Towards motivating novel cach...
110
click to vote
TIP
2002
14 years 9 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
VISUALIZATION
2000
IEEE
15 years 2 months ago
2000
IEEE
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...