| /third_party/curl/docs/cmdline-opts/ |
| D | parallel-immediate.d | 1 Long: parallel-immediate
2 Help: Do not wait for multiplexing (with --parallel)
4 See-also: parallel parallel-max
6 ---
7 When doing parallel transfers, this option will instruct curl that it should
8 rather prefer opening up more connections in parallel at once rather than
|
| D | parallel-max.d | 1 Long: parallel-max
3 Help: Maximum concurrency for parallel transfers
5 See-also: parallel
7 ---
8 When asked to do parallel transfers, using --parallel, this option controls
|
| D | Makefile.inc | 8 # Copyright (C) 1998 - 2021, Daniel Stenberg, <daniel@haxx.se>, et al.
25 abstract-unix-socket.d \
26 alt-svc.d \
29 aws-sigv4.d \
33 cert-status.d \
34 cert-type.d \
37 compressed-ssh.d \
40 connect-timeout.d \
41 connect-to.d \
42 continue-at.d \
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | delta_stepping_shortest_paths.hpp | 11 * This source file implements the Delta-stepping algorithm: *
13 * Ulrich Meyer and Peter Sanders. Parallel Shortest Path for Arbitrary *
14 * Graphs. In Proceedings from the 6th International Euro-Par *
15 * Conference on Parallel Processing, pages 461--470, 2000. *
17 * Ulrich Meyer, Peter Sanders: [Delta]-stepping: A Parallelizable *
18 * Shortest Path Algorithm. J. Algorithms 49(1): 114-152, 2003. *
23 * - Implement "shortcuts", which bound the number of reinsertions *
25 * expensive in a distributed-memory setting, but it could be *
28 * - The size of the "buckets" data structure can be bounded to *
32 * - If we partition light/heavy edges ahead of time, we could improve *
[all …]
|
| D | betweenness_centrality.hpp | 13 #error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been include…
32 #include <boost/property_map/parallel/distributed_property_map.hpp>
36 // NGE - Needed for minstd_rand at L807, should pass vertex list
122 namespace graph { namespace parallel { namespace detail { namespace
140 /* Delta-stepping Betweenness Centrality */
157 typedef typename boost::graph::parallel::process_group_type<Graph>::type
200 using boost::parallel::synchronize; in synchronize()
207 using boost::parallel::simple_trigger; in setup_triggers()
214 boost::parallel::trigger_receive_context) in handle_msg_relax()
241 // position_in_bucket property map with non-singular iterators. This
[all …]
|
| D | connected_components_parallel_search.hpp | 1 // Copyright (C) 2004-2006 The Trustees of Indiana University.
14 #error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been include…
19 #include <boost/graph/parallel/algorithm.hpp>
24 #include <boost/graph/parallel/properties.hpp>
25 #include <boost/graph/parallel/process_group.hpp>
32 #include <boost/graph/parallel/container_traits.hpp>
36 // Connected components algorithm based on a parallel search.
38 // Every N nodes starts a parallel search from the first vertex in
164 if (i->first == i->second) { in uniqify()
167 i->second = collisions[i->second]; in uniqify()
[all …]
|
| D | eager_dijkstra_shortest_paths.hpp | 1 // Copyright (C) 2004-2006 The Trustees of Indiana University.
22 #error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been include…
27 #include <boost/property_map/parallel/caching_property_map.hpp>
33 #include <boost/graph/parallel/container_traits.hpp>
52 /* Total wall-clock time used by the algorithm.*/
66 out << "Problem = \"Single-Source Shortest Paths\"\n" in print()
104 /* Since the eager formulation of Parallel Dijkstra's algorithm can
114 boost::parallel::caching_property_map<PredecessorMap> c_pred(m_predecessor); in examine_edge()
115 boost::parallel::caching_property_map<DistanceMap> c_dist(m_distance); in examine_edge()
125 relax() occurs with the 80-bit precision of the x87 floating in examine_edge()
[all …]
|
| D | crauser_et_al_shortest_paths.hpp | 1 // Copyright (C) 2004-2006 The Trustees of Indiana University.
19 * 722--731, 1998. Springer. *
21 * This implementation is, however, restricted to the distributed-memory *
23 * distributed. In a shared-memory (single address space) context, we *
30 #error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been include…
35 #include <boost/graph/parallel/algorithm.hpp>
41 #include <boost/property_map/parallel/caching_property_map.hpp>
47 #include <boost/graph/parallel/container_traits.hpp>
63 /* Total wall-clock time used by the algorithm.*/
77 out << "Problem = \"Single-Source Shortest Paths\"\n" in print()
[all …]
|
| D | boman_et_al_graph_coloring.hpp | 1 // Copyright (C) 2005-2008 The Trustees of Indiana University.
13 #error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been include…
17 #include <boost/graph/parallel/algorithm.hpp>
19 #include <boost/graph/parallel/process_group.hpp>
26 #include <boost/graph/parallel/container_traits.hpp>
40 * and Fredrik Manne. A Scalable Parallel Graph Coloring Algorithm for *
51 /* Total wall-clock time used by the algorithm.*/
87 T operator()(const Key&) const { return (std::numeric_limits<T>::max)(); } in operator ()()
116 using namespace boost::graph::parallel; in boman_et_al_graph_coloring()
117 using boost::parallel::all_reduce; in boman_et_al_graph_coloring()
[all …]
|
| D | distributed_graph_utility.hpp | 1 // Copyright (C) 2005-2006 The Trustees of Indiana University.
11 #include <boost/property_map/parallel/global_index_map.hpp>
17 #error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been include…
107 boost::parallel::global_index_map<VertexIndexMap, VertexGlobalMap>
127 T operator()(const K&) const { return (std::numeric_limits<T>::max)(); } in operator ()()
|
| /third_party/flutter/skia/src/pathops/ |
| D | SkDLineIntersection.cpp | 4 * Use of this source code is governed by a BSD-style license that can be
12 void SkIntersections::cleanUpParallelLines(bool parallel) { in cleanUpParallelLines() argument
16 if (fUsed == 2 && !parallel) { in cleanUpParallelLines()
43 SkDVector aLen = a[1] - a[0]; in intersectRay()
44 SkDVector bLen = b[1] - b[0]; in intersectRay()
49 byLen * axLen - ayLen * bxLen == 0 ( == denom ) in intersectRay()
51 double denom = bLen.fY * aLen.fX - aLen.fY * bLen.fX; in intersectRay()
54 SkDVector ab0 = a[0] - b[0]; in intersectRay()
55 double numerA = ab0.fY * bLen.fX - bLen.fY * ab0.fX; in intersectRay()
56 double numerB = ab0.fY * aLen.fX - aLen.fY * ab0.fX; in intersectRay()
[all …]
|
| /third_party/curl/docs/ |
| D | PARALLEL-TRANSFERS.md | 1 # Parallel transfers
4 parallel.
6 ## -Z, --parallel
9 to it at the same time. It will do up to `--parallel-max` concurrent
14 The progress meter that is displayed when doing parallel transfers is
36 72 -- 37.9G 0 101 30 23 0:00:55 0:00:34 0:00:22 2752M
54 This is early days for parallel transfer support. Keep your eyes open for
|
| D | options-in-versions | 13 --abstract-unix-socket 7.53.0
14 --alt-svc 7.64.1
15 --anyauth 7.10.6
16 --append (-a) 4.8
17 --aws-sigv4 7.75.0
18 --basic 7.10.6
19 --cacert 7.5
20 --capath 7.9.8
21 --cert (-E) 5.0
22 --cert-status 7.41.0
[all …]
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | ssca.cpp | 24 #include <boost/graph/parallel/distribution.hpp>
31 #include <boost/property_map/parallel/distributed_property_map.hpp>
39 #include <boost/graph/parallel/algorithm.hpp>
46 #include <boost/graph/parallel/container_traits.hpp>
106 value = this->f(gen); in generator_iterator()
110 pointer operator->() const { return &value; } in operator ->()
156 int new_distance = get(weight, e) == (std::numeric_limits<Weight>::max)() ? in tree_edge()
157 (std::numeric_limits<Weight>::max)() : get(distance, source(e, g)) + get(weight, e); in tree_edge()
181 typedef typename boost::graph::parallel::process_group_type<Graph>::type in generate_sources()
192 uniform_int<vertices_size_type> rand_vertex(0, num_vertices(g) - 1); in generate_sources()
[all …]
|
| /third_party/eudev/man/ |
| D | udevd.8 | 11 .\" -----------------------------------------------------------------
13 .\" -----------------------------------------------------------------
16 .\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
20 .\" -----------------------------------------------------------------
22 .\" -----------------------------------------------------------------
27 .\" -----------------------------------------------------------------
29 .\" -----------------------------------------------------------------
31 udevd \- Device event managing daemon
36 …-\-daemon\fR] [\fB\-\-debug\fR] [\fB\-\-children\-max=\fR] [\fB\-\-exec\-delay=\fR] [\fB\-\-event\…
44 \fBudev.conf\fR(5), its command\-line options, environment variables, and on the kernel command\-li…
[all …]
|
| D | udevd.xml | 2 <?xml-stylesheet type="text/xsl" href="http://docbook.sourceforge.net/release/xsl/current/xhtml/doc…
3 <!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.2//EN"
4 "http://www.oasis-open.org/docbook/xml/4.2/docbookx.dtd">
35 <arg><option>--daemon</option></arg>
36 <arg><option>--debug</option></arg>
37 <arg><option>--children-max=</option></arg>
38 <arg><option>--exec-delay=</option></arg>
39 <arg><option>--event-timeout=</option></arg>
40 <arg><option>--resolve-names=early|late|never</option></arg>
41 <arg><option>--version</option></arg>
[all …]
|
| /third_party/node/deps/npm/node_modules/node-gyp/.github/workflows/ |
| D | Python_tests.yml | 1 # TODO: Line 15, enable python-version: 3.5
2 # TODO: Line 36, enable pytest --doctest-modules
8 runs-on: ${{ matrix.os }}
10 fail-fast: false
11 max-parallel: 15
13 os: [macos-latest, ubuntu-latest, windows-latest]
14 python-version: [2.7, 3.6, 3.7, 3.8] # 3.5,
16 - uses: actions/checkout@v1
17 - name: Set up Python ${{ matrix.python-version }}
18 uses: actions/setup-python@v1
[all …]
|
| /third_party/boost/boost/numeric/odeint/external/openmp/ |
| D | openmp_range_algebra.hpp | 31 /** \brief OpenMP-parallelized range algebra.
46 _Pragma("omp parallel for schedule(runtime)") \
58 #pragma omp parallel for schedule(runtime) in BOOST_ODEINT_GEN_FOR_EACH()
65 #pragma omp parallel for schedule(runtime)
73 #pragma omp parallel for schedule(runtime)
82 #pragma omp parallel for schedule(runtime)
92 #pragma omp parallel for schedule(runtime)
103 #pragma omp parallel for schedule(runtime)
115 #pragma omp parallel for schedule(runtime)
128 #pragma omp parallel for schedule(runtime)
[all …]
|
| D | openmp_nested_algebra.hpp | 31 /** \brief OpenMP-parallelized algebra, wrapping another, non-parallelized algebra.
33 * NestedState must be a model of Random Access Range, where the elements are sub-states
34 * which will be processed in parallel.
48 _Pragma("omp parallel for schedule(runtime)") \
63 #pragma omp parallel for schedule(runtime) in BOOST_ODEINT_GEN_FOR_EACH()
70 #pragma omp parallel for schedule(runtime)
78 #pragma omp parallel for schedule(runtime)
87 #pragma omp parallel for schedule(runtime)
97 #pragma omp parallel for schedule(runtime)
108 #pragma omp parallel for schedule(runtime)
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | file_dependencies.cpp | 3 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
22 2. Produce a "parallel" recompilation order (same as above, but group files
23 which can be built in parallel)
123 // and the order with files that can be compiled in parallel in main()
136 // Parallel compilation ordering in main()
148 maxdist = (std::max)(time[source(*j, g)], maxdist); in main()
153 cout << "parallel make ordering, " << endl in main()
154 << "vertices with same group number can be made in parallel" in main()
164 // if I change yow.h what files need to be re-made? in main()
166 cout << "A change to yow.h will cause what to be re-made?" << endl; in main()
[all …]
|
| /third_party/boost/tools/build/src/engine/modules/ |
| D | sequence.cpp | 16 #ifndef max
17 # define max(a,b) ((a)>(b)?(a):(b)) macro
23 /* Returns all of 'elements' for which corresponding element in parallel */ in sequence_select_highest_ranked()
26 LIST * const elements = lol_get( frame->args, 0 ); in sequence_select_highest_ranked()
27 LIST * const rank = lol_get( frame->args, 1 ); in sequence_select_highest_ranked()
30 int highest_rank = -1; in sequence_select_highest_ranked()
38 highest_rank = max( highest_rank, current ); in sequence_select_highest_ranked()
58 LIST * function = lol_get( frame->args, 0 ); in sequence_transform()
59 LIST * sequence = lol_get( frame->args, 1 ); in sequence_transform()
64 RULE * rule = bindrule( function_name, frame->prev->module ); in sequence_transform()
[all …]
|
| /third_party/node/deps/npm/test/tap/ |
| D | debug-logs.js | 9 var common = require('../common-tap.js')
32 name: 'debug-logs',
35 true: 'node -e "process.exit(0)"',
36 false: 'node -e "process.exit(1)"'
64 // to the log folder pruning logic in parallel, resulting in FEWER files
66 var procCount = Math.max(require('os').cpus().length * 2, 12)
70 // var f = path.join(cachedir, '_logs', num + '-debug.log')
72 common.npm(['run', '--logs-max=10', 'false'], conf, function (err, code) {
82 common.npm(['run', '--logs-max=10', 'false'], conf, function (err, code) {
87 common.npm(['run', '--logs-max=5', 'true'], conf, function (err, code) {
[all …]
|
| /third_party/node/.github/workflows/ |
| D | pythonpackage.yml | 7 runs-on: ubuntu-latest
9 fail-fast: false
10 max-parallel: 1
12 python-version: [3.8] # [2.7, 3.5, 3.6, 3.7]
14 - uses: actions/checkout@v2
15 - name: Set up Python ${{ matrix.python-version }}
16 uses: actions/setup-python@v1
18 python-version: ${{ matrix.python-version }}
19 - name: Compile Node.js
22 make -j2 V=1
[all …]
|
| /third_party/ltp/testcases/kernel/controllers/io-throttle/ |
| D | run_io_throttle_test.sh | 15 # Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 # Boston, MA 021110-1307, USA.
23 . ./myfunctions-io.sh
33 dev=`df -P . | sed '1d' | cut -d' ' -f1 | sed 's/[p]*[0-9]*$//'`
37 phys_bw=`./iobw -direct 1 $BUFSIZE $DATASIZE | grep TOTAL | awk '{print $7}'`
38 if [ $? -ne 0 ]; then
46 MYGROUP=cgroup-$i
47 echo "($MYGROUP) max i/o bw: " \
54 if [ -f /dev/blockioctl/blockio.bandwidth ]; then
56 elif [ -f /dev/blockioctl/blockio.bandwidth-max ]; then
[all …]
|
| /third_party/boost/tools/build/doc/src/ |
| D | sequence.adoc | 7 multi-element lists. In that case, all but the first element are
14 has a non-null value.
25 4. `rule insertion-sort ( s * : ordered * )`
27 Insertion-sort `s` using the BinaryPredicate `ordered`.
47 9. `rule max-element ( elements + : ordered ? )`
52 10. `rule select-highest-ranked ( elements * : ranks * )`
55 parallel list `rank` is equal to the maximum value in `rank`.
|