Home
last modified time | relevance | path

Searched refs:time (Results 1 – 25 of 69) sorted by relevance

123

/oneTBB/doc/main/tbb_userguide/
H A Dappendix_A.rst8 threads. Each logical thread is serviced for a *time slice* by a
9 physical thread. If a thread runs longer than a time slice, as most do,
11 appendix details the costs incurred by time slicing.
14 The most obvious is the time for *context switching* between logical
26 not a cache primer.) When a logical thread gets its time slice, as it
27 references a piece of data for the first time, this data will be pulled
34 data. When thread A gets its next time slice, it will need to reload
36 worse yet, the next time slice for thread A may be on a different
41 lock on a resource, and its time slice runs out before it releases the
42 lock. No matter how short a time the thread intended to hold the lock,
[all …]
H A DTiming.rst8 clock* time, not CPU time, that matters. The reason is that better
9 parallelization typically increases aggregate CPU time by employing more
11 *faster* in real time.
15 provides a simple interface for measuring wall clock time. A
17 represents the current absolute time. Subtracting two ``tick_count``
18 values yields a relative time in ``tick_count::interval_t``, which you
H A Destimate_flow_graph_performance.rst19 A critical path is the most time consuming path from a node with no
26 More formally, let T be the total time consumed by all of the nodes
27 in your graph if executed sequentially. Then let C be the time
28 consumed along the path that takes the most time. The nodes along
31 the wall clock time for the parallel execution is at least C, and the
45 scheduling when estimating the time it takes for a node to execute
H A DLinux_C_Dynamic_Memory_Interface_Replacement.rst35 program load time using the ``LD_PRELOAD`` environment variable (without
41 scalable memory allocator library at program load time. For that you may
H A DWindows_C_Dynamic_Memory_Interface_Replacement.rst21 - Microsoft\* C run-time library functions: ``_msize``,
67 scalable memory allocator library at program load time. For that you may
H A DTask-Based_Programming.rst39 Oversubscription usually leads to *time sliced* execution of logical
59 distribute time slices in a round-robin fashion. This distribution is
60 called "fair", because each logical thread gets its fair share of time.
H A Duse_limiter_node.rst29 at a time, and to prevent the ``input_node`` from generating all ``M`` big
84 again. So in this example, at most four big objects exist at a time, the
/oneTBB/python/rml/
H A Dipc_utils.cpp88 char* get_shared_name(const char* prefix, int pid, unsigned long long time) { in get_shared_name() argument
95 sprintf( name, name_template, prefix, pid, time ); in get_shared_name()
102 unsigned long long time = get_start_time( pid ); in get_shared_name() local
103 return get_shared_name( prefix, pid, time ); in get_shared_name()
/oneTBB/python/tbb/
H A Dtest.py46 import time
79 time.sleep(mseconds/100.)
88 time.sleep(0.0001) # yield equivalent
183 time.sleep(3)
192 time.sleep(3)
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DREADME.md15 The times printed are for the traversal and update, and do not include time for computing the `root…
21 * The time to update the cells becomes very small, and consequently the overhead of `parallel_for_e…
33 …_test_parallel_preorder` - executes the example with suggested parameters to reduce execution time.
44 * `silent` - no output except elapsed time.
/oneTBB/examples/migration/recursive_fibonacci/
H A Dfibonacci.cpp39 auto time = std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count(); in measure() local
40 times.push_back(time); in measure()
H A DREADME.md22 * `I` - number of iteration to measure benchmark time.
/oneTBB/examples/parallel_for/game_of_life/
H A DREADME.md15 …light_test_game_of_life` - executes the example with suggested parameters to reduce execution time.
24 * `execution_time` - time (in sec) for execution `game_of_life` iterations.
/oneTBB/examples/parallel_pipeline/square/
H A DREADME.md14 …`make light_test_square` - executes the example with suggested parameters to reduce execution time.
26 * `silent` - no output except elapsed time.
/oneTBB/examples/parallel_reduce/convex_hull/
H A DREADME.md18 … light_test_convex_hull` - executes the example with suggested parameters to reduce execution time.
29 * `silent` - no output except elapsed time.
/oneTBB/examples/task_group/sudoku/
H A DREADME.md16 …make light_test_fractal` - executes the example with suggested parameters to reduce execution time.
27 * `silent` - no output except elapsed time.
/oneTBB/examples/parallel_for/tachyon/
H A DREADME.md25 …make light_test_tachyon` - executes the example with suggested parameters to reduce execution time.
35 * `no-display-updating` - disable run-time display updating.
48 * `space` - toggle run-time display updating mode while rendering (see no-display-updating above).
/oneTBB/examples/parallel_for/seismic/
H A DREADME.md16 …make light_test_seismic` - executes the example with suggested parameters to reduce execution time.
26 * `silent` - no output except elapsed time.
/oneTBB/examples/task_arena/fractal/
H A DREADME.md19 …make light_test_fractal` - executes the example with suggested parameters to reduce execution time.
32 * `silent` - no output except elapsed time.
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A DREADME.md10 Silent mode prints run time only, regular mode prints the shortest path length, and verbose mode pr…
33 * `silent` - no output except elapsed time.
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DLazy_Initialization.rst62 …An implementation without the use of lazy initialization would have *O(2^N)* time complexity due to
64 the tree becomes a list, making the time complexity *O(N)*.
/oneTBB/examples/parallel_for/tachyon/src/
H A Dmain.cpp144 global_startTime = (long)time(nullptr); in example_main()
152 global_elapsedTime = (long)(time(nullptr) - global_startTime); in example_main()
/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md17 …gons examined before stopping.) If the maps are split into 2 submaps, the time for each submap is …
25 …e need `N` polygons, then `N` "boxes" are chosen at random, then one-at-a-time the areas are expan…
40 …ht_test_polygon_overlay` - executes the example with suggested parameters to reduce execution time.
/oneTBB/examples/concurrent_hash_map/count_strings/
H A DREADME.md24 * `silent` - no output except elapsed time.
/oneTBB/examples/test_all/fibonacci/
H A DREADME.md16 …make light_test_fractal` - executes the example with suggested parameters to reduce execution time.

123