Searched refs:cost (Results 1 – 11 of 11) sorted by relevance
291 UInt16 cost[BZ_N_GROUPS]; in sendMTFValues() local402 cost[i] = 0; in sendMTFValues()469 cost[0] = cost01 & 0xffff; in sendMTFValues()470 cost[1] = cost01 >> 16; in sendMTFValues()471 cost[2] = cost23 & 0xffff; in sendMTFValues()472 cost[3] = cost23 >> 16; in sendMTFValues()473 cost[4] = cost45 & 0xffff; in sendMTFValues()474 cost[5] = cost45 >> 16; in sendMTFValues()481 cost[j] += s->len[j][icv]; in sendMTFValues()492 if (cost[i] < bc) { in sendMTFValues()[all …]
20 A more subtle cost is *cache cooling*. Processors keep recently accessed35 evicted data, at the cost of hundreds of cycles for each cache miss. Or40 Another cost is *lock preemption.* This happens if a thread acquires a
7 A parallel loop construct incurs overhead cost for every chunk of work
35 Notice that highly-concurrent containers come at a cost. They typically
55 cost in space, because it must allocate at least one cache line’s
86 the cost of reducing potential parallelism. The overhead as a fraction
23 The cost of operations that take place during the initialization
37 compared to cost of solving the subproblems.
124 consideration, because the atomic counting incurs a cost for each
221 …y used for software interchange, for a price no more than your reasonable cost of physically perfo…
1076 # cost of reduced performance. This can be particularly helpful with template