Searched refs:time (Results 276 - 300 of 381) sorted by relevance

<<111213141516

/barrelfish-2018-10-04/doc/022-armv8/
H A Dreport.tex83 some time. While the first wave of ARM-based microservers, based on the 32-bit
163 first time, of a boot process for ARM systems. ARM has specified that SBSA
179 As already described, the Barrelfish release current at time of writing
569 support GICv3, the current specification at time of writing.
590 and uses the large set of supplied services to do as much of the one-time
708 The unrelocated ELF image for a boot-time module (including that for
746 # Special boot time domains spawned by monitor
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextfd.tex207 and no compile-time processing is performed.
209 default compile-time transformation of the given expression
241 Each time a new better solution is found, the event 280 is raised.
251 Each time a new better solution is found, the event 280 is raised.
588 unnecessary space and time overhead.
820 The time needed to find the minimal solution is about five times
821 shorter than the time to generate all solutions.
867 most of the time this would not bring anything, and thus it would
898 more time in selecting the next variable to instantiate.
1223 \item Each time
[all...]
H A Deplex.tex440 create eplex instances dynamically at run-time. The can be done by calling
441 {\tt eplex_instance/1} at run-time.
454 at compile time, so it can always be declared by a directive.
558 K wakes the demon again, and the simplex fails this time.
753 The new constraints will be taken into account the next time the
975 external solver is invoked for one more time. This is because the extra
1414 \item time-outs from solving a problem.
1430 problems with a quadratic objective function. It also supports time-outs, and is better
1478 instead it requires this to be specified each time the problem is
H A Dsolverinter.tex201 This will however prevent the solver from performing any compile-time
/barrelfish-2018-10-04/doc/006-routing/
H A DRouting.tex78 \item \textbf{CPU}: Some ICDs, as for example the UMP driver on x86, require explicit polling to check for incoming messages. The more links a core has, the more time it has to spend polling.
177 Those additional channels are needed to ensure that the default monitor binding is not congested or even blocked by multi-hop messages. For example, suppose that a client's dispatcher receives a lot of multi-hop messages within a short period of time. The client reacts to this by allocating more memory. If multi-hop messages are sent over the default monitor binding, the message coming from the memory server will be blocked, therefore this will result in a dead lock. By creating new monitor bindings and not using the default monitor binding, we can prevent such a scenario.
184 We assign virtual circuit identifiers at random. At each node, we use a hash table to map virtual circuit identifiers to a pointer to the channel state. The use of a hash table allows efficient message forwarding. When a message arrives, it can be determined where to forward this message by means of a simple look-up in the hash table. The complexity of this lookup is linear in the number of virtual circuit identifiers that map to the same hash bucket (the number of buckets in the hash table is a compile time constant).
281 We decided to use a credit-based flow control mechanism: The number of messages in flight at any given time is limited. Once a sender has reached this limit, he has to wait until he receives an acknowledgement that the receiver has processed previously sent messages. We call this limit the \emph{window size}.
310 As pointed out in section \ref{section: message forwarding}, the multi-hop interconnect driver requires that the message payload is passed as one char array. If a user-defined message contains dynamic arguments (arguments whose size is only known at run-time), such as a string or a dynamic array, it is generally not possible to pass the message payload as one char array to the multi-hop interconnect driver. There are three possible approaches to send such a message:
324 When sending a user-defined message, we first calculate the size of its payload. The size of a message's payload is only known at compile-time if the message definition does not contain any dynamic arguments. Otherwise, the size of the payload has to be computed each time such a message is sent. After having computed the payload size, we allocate a memory region of that size and copy the message arguments to that region of memory. Finally, we pass a pointer to this memory region to the multi-hop interconnect driver.
340 The flounder-generated stubs register a callback function with the multi-hop interconnect driver at channel set-up time in order to be notified when a message arrives. As we send a user-defined message within a single multi-hop message, we therefore also receive a user-defined message in one multi-hop message.
659 \note{Resource requirements for channels, memory and cpu time.}
/barrelfish-2018-10-04/doc/014-bulk-transfer/
H A Dbulk-transfer.tex143 given point in time, some pbufs will be in application data processing
148 domains have read/write access to the shared memory at all the time.
385 does by maintaining the list of shared-pools. At the time of producer
412 available at given time. Ideally, production-pool should be big enough
542 producer may increase/decrease over time, the consumer may receive
575 this producer is dealing with one data-element at one time,
882 As consumer is dealing with one data-element at a time,
893 than one data-elements in consumption at any given moment of time.
944 slots. This flexibility allows consumer to take longer time on
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumslanguage.tex49 (it is implemented by parse-time preprocessing).
379 \about{MaxList} must be a list of fixed length at call time so that it is
981 the time needed for performing operations on the data.
995 The time complexity for extracting a substring when the position is given
1026 is a unit time operation,
1028 On the other hand, each time an atom is read into the system, it has to
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex104 of kind people donating their time, resources and kind words to help support my work. Writing a text of significant
133 This text is for people who stop and wonder when first examining algorithms such as RSA for the first time and asks
145 It's all because I broke my leg. That just happened to be at about the same time that Tom asked for someone to review the section of the book about
149 At the time of writing this, I've still not met Tom or Mads in meatspace. I've been following Tom's progress since his first splash on the
185 integers of significant magnitude to resist known cryptanalytic attacks. For example, at the time of this writing a
208 trivially factored\footnote{A Pollard-Rho factoring would take only $2^{16}$ time.} on the average desktop computer,
351 That is a single precision addition, multiplication and division are assumed to take the same time to
361 All of the algorithms presented in this text have a polynomial time work level. That is, of the form
385 & minutes to solve. Usually does not involve much computer time \\
388 & time usag
[all...]
/barrelfish-2018-10-04/lib/libc/resolv/
H A Dres_findzonecut.c31 #include <sys/time.h>
/barrelfish-2018-10-04/lib/libc/rpc/
H A Drpc_generic.c47 #include <sys/time.h>
110 * expensive call every time.
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Demu_util.c37 #include <sys/time.h>
H A Dbip_misc.c39 #include <time.h>
45 #include <sys/time.h>
460 * the date and time of the form:
1033 * Return time in seconds with a high resolution, but undefined epoch.
1034 * Only good to measure the difference between two time points.
1035 * This is currently real time on Unix and Windows, not cputime.
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/
H A Dapps.c2808 #include <time.h>
2830 #include <time.h>
2865 #include <time.h>
2919 #include <sys/time.h>
/barrelfish-2018-10-04/include/openssl/
H A Dts.h121 --time-stamped
178 ASN1_GENERALIZEDTIME *time; member in struct:TS_tst_info_st
515 time stamp token. */
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ts/
H A Dts.h121 --time-stamped
178 ASN1_GENERALIZEDTIME *time; member in struct:TS_tst_info_st
515 time stamp token. */
/barrelfish-2018-10-04/doc/018-Practical-guide/
H A DhelloWorldApp.tex300 run_client(myst); /* calling run_client for first time */
413 # Special boot time domains spawned by monitor
/barrelfish-2018-10-04/usr/replay/
H A Dslave.c25 #include <sys/time.h>
173 msg(" op:%-10s cnt:%8" PRIu64 " time:%13.2lf avg:%9.3lf\n", top2str[i], op_cnt, op_time, op_time/(double)op_cnt);
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ssl/
H A Dd1_clnt.c150 unsigned long Time=(unsigned long)time(NULL);
628 Time=(unsigned long)time(NULL); /* Time */
H A Dd1_srvr.c148 unsigned long Time=(unsigned long)time(NULL);
760 Time=(unsigned long)time(NULL); /* Time */
/barrelfish-2018-10-04/doc/004-virtual_memory/
H A DVirtualMemory.tex104 The size of a virtual address space is architecture dependent and established at compile time.
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dblockdevfs.tex86 and \emph{ahci} devices at the same time.
/barrelfish-2018-10-04/doc/016-serial-ports/
H A DSerial.tex202 Examples of serial port implementations at time of writing include:
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Druntime.tex367 Restriction: the exporting module's interface must be known at the time
387 reexportation time. That means that an IMPEXP descriptor always refers
404 compile time. At runtime, only a pointer to them is loaded using a
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dtkdebug.tex603 call stack to be refreshed automatically every time the tracer stops
605 the Delayed goals viewer to be automatically refreshed every time the
608 the tracer window to be raised (uncovered) automatically every time the
/barrelfish-2018-10-04/doc/026-device-queues/
H A Ddevif.tex312 client can alter the contents of this buffer. Dequeue can be called any time,
438 At any point in time an address $A$ can only be owned by one Agent at a time
542 At any point in time an address $A$ can only be in one set at the tame
887 The process on the other end of the queue can dequeue the buffers at any time but the queue

Completed in 394 milliseconds

<<111213141516