Searched refs:overhead (Results 1 - 25 of 32) sorted by relevance

12

/barrelfish-master/usr/bench/ump_bench/
H A Dlatency_cache.c24 static struct timestamps *overhead; variable in typeref:struct:timestamps
30 overhead = malloc(sizeof(struct timestamps) * MAX_COUNT);
31 assert(overhead != NULL);
55 /* Measure measurement overhead */
58 overhead[i].time0 = rdpmc(0);
60 overhead[i].time1 = rdpmc(0);
88 overhead[i].time1 - overhead[i].time0,
/barrelfish-master/usr/bench/
H A Dlrpc_bench.c35 static struct timestamps overhead[ITERATIONS]; variable in typeref:struct:timestamps
127 /* Measure measurement overhead */
129 overhead[i].time0 = rdpmc(0);
131 overhead[i].time1 = rdpmc(0);
/barrelfish-master/doc/015-disk-driver-arch/
H A Dconclusion.tex7 interface with disks. The overhead incurred is acceptable in the trade-off for
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsparutil.tex63 enough computation to make the overhead pay off.
H A Dumsstring.tex95 some overhead.
H A Dumsparallel.tex176 On hardware that provides a high-precision low-overhead timer,
H A Dumscompiler.tex1067 the type tests are never executed and thus they incur no overhead.
1138 be used, as it improves readability without adding any overhead.
H A Dumsdeveltools.tex438 efficiently implemented and not cause overhead that would distort the
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dpar_util.pl78 to make the overhead pay off."),
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dglobalstate.tex136 This allocation has no memory overhead, so e.g. allocating 8192 bytes
167 argument when the block gets freed. This implies some bookkeeping overhead.
/barrelfish-master/usr/skb/programs/
H A Dcompute_required_resources.pl10 % this file is used for the ASPLOS11 paper to compute the padding overhead for
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dannotate.tex87 Declaring \viewable{}s has little performance overhead when running
206 \viewableexpandthree{} silently succeeds with little overhead at
H A Dclients.tex393 \viewer{} has been created. To minimise the overhead of having to
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Deplexdiff.tex46 a problem has many variables. With the standalone eplex, this overhead is
H A Dgfd.tex258 minimising the overhead. GFD also supports versions of these constraints that
262 have the overhead of converting the index value, but may be
1247 only one suspension list is provided by GFD is to minimise the overhead in
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dprogramanalysis.tex161 efficiently implemented and not cause overhead that would distort the
H A Dpropiachr.tex130 unnecessary and computationally expensive overhead
/barrelfish-master/doc/023-coreboot/
H A Dcoreboot.tex259 Note that while this is deliberately very simple and low-overhead, just having
/barrelfish-master/doc/009-notifications/
H A DNotify.tex179 at, with no polling overhead. We could use a single IPI vector, but
/barrelfish-master/doc/008-tracing/
H A DTracing.tex771 compiled into the system, a certain overhead will exist -- and on the other hand
777 The memory overhead for buffers inside the tracing framework is constant during
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Ddbi.tex37 of data with minimal overhead:
H A Dembed.tex498 but can have a lot of overhead for complex structures.
/barrelfish-master/lib/tommath/
H A Dbn.tex1237 So why not always use Karatsuba or Toom-Cook? The simple answer is that they have so much overhead that they're not
1242 Toom-Cook has incredible overhead and is probably only useful for very large inputs. So far no known cutoff points
H A Dtommath.tex245 Multiple precision algorithms have the most overhead of any style of arithmetic. For the the most part the
246 overhead can be kept to a minimum with careful planning, but overall, it is not well suited for most memory starved
2886 At first it may seem like a good idea to choose $n = 1000$ since the exponent is approximately $1.1$. However, the overhead
2892 the algorithms incur an overhead (\textit{at the $O(n)$ work level}) since they require a system of equations to be solved. This makes the
3027 By inlining the calculation of the halves, the Karatsuba multiplier has a slightly lower overhead and can be used for smaller magnitude inputs.
3124 algorithm has a lower asymptotic running time of approximately $O(n^{1.464})$ but at an obvious cost in overhead. In this
3428 time required for a Comba based squaring and a Karatsuba based squaring meet. Due to the overhead inherent in the Karatsuba method, the cutoff
4398 of this algorithm has been optimized to avoid additional overhead associated with a division by $\beta^p$, the multiplication by $k$ or the addition
4535 In general the restricted Diminished Radix reduction algorithm is much faster since it has considerably lower overhead. However, this new
4580 positive. By using the unsigned versions the overhead i
[all...]
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex171 The critical issue in defining the queries lies in identifying which data are required and/or produced, without building an actual implementation of the system. Another issue is the format of the data, which should allow a simple and efficient implementation without extra overhead for data manipulation. It is most important to get this interface right from the start, as any change will create re-work and problems integrating different versions of the software.
432 \item[prolog terms] The third alternative is to use data files as before, but to format them as valid Prolog terms \index{Prolog term}that can directly read with the ECLiPSe term I/O predicates. This avoids the overhead of writing parsers in ECLiPSe, but may be difficult for the calling side of the application, unless that is also written in ECLiPSe. Note that we again may face quoting problems, in particular for single and double quotes.
504 \index{structure, nested}\index{nested structure}A very common data representation problem is how to access information about some structure from another structure, for example in RiskWise how to access the information about a router from an interface of the router. There are two main alternatives. The first is to insert the data of the first entity (router) directly in the representation of the second entity (interface) as an additional attribute, the second is to store a key which can be used to look up the entity. Although the first method has the advantage of avoiding the extra lookup, we do not recommend this approach. If we have recursive references to objects (in our example above if the router also contains a link to all its interfaces) then this direct representation becomes an infinite data structure, which causes problems for printing and debugging. If we use the second approach, we obviously need a way to find the entity belonging to a particular key without too much overhead. The choice of the key depends on the representation of our overall data structure, which we will discuss in the next sections.
1901 \item If nobody actually checks the code, then the whole process becomes useless overhead. This means that resources must be properly allocated to the review, it is not a task that reviewers can undertake in their spare time.

Completed in 158 milliseconds

12