Home
last modified time | relevance | path

Searched refs:numTasks (Results 1 – 25 of 410) sorted by relevance

12345678910>>...17

/dports/math/py-or-tools/or-tools-9.2/ortools/sat/samples/
H A DRankingSampleSat.java38 int numTasks = starts.length; in rankTasks() local
41 Literal[][] precedences = new Literal[numTasks][numTasks]; in rankTasks()
42 for (int i = 0; i < numTasks; ++i) { in rankTasks()
43 for (int j = 0; j < numTasks; ++j) { in rankTasks()
82 for (int i = 0; i < numTasks; ++i) { in rankTasks()
89 vars[numTasks] = ranks[i]; in rankTasks()
90 coefs[numTasks] = -1; in rankTasks()
100 int numTasks = 4; in main() local
115 if (t < numTasks / 2) { in main()
156 objectiveVars[numTasks] = makespan; in main()
[all …]
H A DAssignmentSat.cs30 int numTasks = costs.GetLength(1); in Main()
40 IntVar[,] x = new IntVar[numWorkers, numTasks]; in Main()
42 IntVar[] xFlat = new IntVar[numWorkers * numTasks]; in Main()
43 int[] costsFlat = new int[numWorkers * numTasks]; in Main()
46 for (int j = 0; j < numTasks; ++j) in Main()
49 int k = i * numTasks + j; in Main()
61 IntVar[] vars = new IntVar[numTasks]; in Main()
62 for (int j = 0; j < numTasks; ++j) in Main()
70 for (int j = 0; j < numTasks; ++j) in Main()
101 for (int j = 0; j < numTasks; ++j) in Main()
H A DAssignmentSat.java40 final int numTasks = costs[0].length; in main() local
50 IntVar[][] x = new IntVar[numWorkers][numTasks]; in main()
52 IntVar[] xFlat = new IntVar[numWorkers * numTasks]; in main()
53 int[] costsFlat = new int[numWorkers * numTasks]; in main()
55 for (int j = 0; j < numTasks; ++j) { in main()
57 int k = i * numTasks + j; in main()
68 IntVar[] vars = new IntVar[numTasks]; in main()
69 for (int j = 0; j < numTasks; ++j) { in main()
75 for (int j = 0; j < numTasks; ++j) { in main()
102 for (int j = 0; j < numTasks; ++j) { in main()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/marl/src/
H A Dscheduler_bench.cpp22 run(state, [&](int numTasks) { in BENCHMARK_DEFINE_F() argument
24 for (auto i = 0; i < numTasks; i++) { in BENCHMARK_DEFINE_F()
34 run(state, [&](int numTasks) { in BENCHMARK_DEFINE_F() argument
37 wg.add(numTasks); in BENCHMARK_DEFINE_F()
38 for (auto i = 0; i < numTasks; i++) { in BENCHMARK_DEFINE_F()
55 run(state, cfg, [&](int numTasks) { in BENCHMARK_DEFINE_F() argument
58 wg.add(numTasks); in BENCHMARK_DEFINE_F()
59 for (auto i = 0; i < numTasks; i++) { in BENCHMARK_DEFINE_F()
H A Dnon_marl_bench.cpp58 auto const numTasks = Schedule::numTasks(state); in SingleQueueTaskExecutor() local
71 for (int i = 0; i < numTasks; i++) { in SingleQueueTaskExecutor()
126 auto const numTasks = Schedule::numTasks(state); in MultiQueueTaskExecutor() local
132 for (int i = 0; i < numTasks; i++) { in MultiQueueTaskExecutor()
/dports/devel/spark/spark-2.1.1/core/src/test/scala/org/apache/spark/scheduler/
H A DFakeTask.scala35 def createTaskSet(numTasks: Int, prefLocs: Seq[TaskLocation]*): TaskSet = {
36 createTaskSet(numTasks, stageAttemptId = 0, prefLocs: _*)
39 def createTaskSet(numTasks: Int, stageAttemptId: Int, prefLocs: Seq[TaskLocation]*): TaskSet = {
40 createTaskSet(numTasks, stageId = 0, stageAttemptId, prefLocs: _*)
43 def createTaskSet(numTasks: Int, stageId: Int, stageAttemptId: Int, prefLocs: Seq[TaskLocation]*):
45 if (prefLocs.size != 0 && prefLocs.size != numTasks) {
48 val tasks = Array.tabulate[Task[_]](numTasks) { i =>
/dports/math/py-or-tools/or-tools-9.2/ortools/linear_solver/samples/
H A DAssignmentMip.cs30 int numTasks = costs.GetLength(1); in Main()
42 Variable[,] x = new Variable[numWorkers, numTasks]; in Main()
45 for (int j = 0; j < numTasks; ++j) in Main()
58 for (int j = 0; j < numTasks; ++j) in Main()
64 for (int j = 0; j < numTasks; ++j) in Main()
79 for (int j = 0; j < numTasks; ++j) in Main()
100 for (int j = 0; j < numTasks; ++j) in Main()
H A DAssignmentMip.java38 int numTasks = costs[0].length; in main() local
55 MPVariable[][] x = new MPVariable[numWorkers][numTasks]; in main()
57 for (int j = 0; j < numTasks; ++j) { in main()
68 for (int j = 0; j < numTasks; ++j) { in main()
73 for (int j = 0; j < numTasks; ++j) { in main()
85 for (int j = 0; j < numTasks; ++j) { in main()
104 for (int j = 0; j < numTasks; ++j) { in main()
/dports/www/chromium-legacy/chromium-88.0.4324.182/ios/chrome/browser/network_activity/
H A Dnetwork_activity_indicator_manager.mm49 - (void)startNetworkTasks:(NSUInteger)numTasks forGroup:(NSString*)group {
52 DCHECK_GT(numTasks, 0U);
59 count += numTasks;
61 _totalCount += numTasks;
65 if (_totalCount == numTasks) {
71 - (void)stopNetworkTasks:(NSUInteger)numTasks forGroup:(NSString*)group {
74 DCHECK_GT(numTasks, 0U);
78 DCHECK(count >= numTasks);
79 count -= numTasks;
85 _totalCount -= numTasks;
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-mapreduce-project/hadoop-mapreduce-client/hadoop-mapreduce-client-hs/src/test/java/org/apache/hadoop/mapreduce/v2/hs/
H A DMockHistoryContext.java39 public MockHistoryContext(int numJobs, int numTasks, int numAttempts) { in MockHistoryContext() argument
43 jobs = MockHistoryJobs.newHistoryJobs(numJobs, numTasks, numAttempts); in MockHistoryContext()
51 public MockHistoryContext(int appid, int numJobs, int numTasks, in MockHistoryContext() argument
56 jobs = MockHistoryJobs.newHistoryJobs(getApplicationID(), numJobs, numTasks, in MockHistoryContext()
65 public MockHistoryContext(int appid, int numTasks, int numAttempts, Path confPath) { in MockHistoryContext() argument
66 super(appid, numTasks, numAttempts, confPath); in MockHistoryContext()
71 public MockHistoryContext(int appid, int numJobs, int numTasks, int numAttempts, in MockHistoryContext() argument
76 jobs = MockHistoryJobs.newHistoryJobs(getApplicationID(), numJobs, numTasks, in MockHistoryContext()
/dports/graphics/embree/embree-3.13.2/common/algorithms/
H A Dparallel_sort.h396 const size_t numTasks) in tbbRadixIteration() argument
399 …parallel_for_affinity(numTasks,[&] (size_t taskIndex) { tbbRadixIteration0(shift,src,dst,taskIndex… in tbbRadixIteration()
400 …parallel_for_affinity(numTasks,[&] (size_t taskIndex) { tbbRadixIteration1(shift,src,dst,taskIndex… in tbbRadixIteration()
403 void tbbRadixSort(const size_t numTasks) in tbbRadixSort() argument
408 tbbRadixIteration(0*BITS,0,src,tmp,numTasks); in tbbRadixSort()
409 tbbRadixIteration(1*BITS,0,tmp,src,numTasks); in tbbRadixSort()
410 tbbRadixIteration(2*BITS,0,src,tmp,numTasks); in tbbRadixSort()
411 tbbRadixIteration(3*BITS,1,tmp,src,numTasks); in tbbRadixSort()
415 tbbRadixIteration(0*BITS,0,src,tmp,numTasks); in tbbRadixSort()
416 tbbRadixIteration(1*BITS,0,tmp,src,numTasks); in tbbRadixSort()
[all …]
H A Dparallel_partition.h66 size_t numTasks; variable
148 parallel_for(numTasks,[&] (const size_t taskID) { in partition()
149 const size_t startID = (taskID+0)*N/numTasks; in partition()
150 const size_t endID = (taskID+1)*N/numTasks; in partition()
159 counter_start[numTasks] = N; in partition()
160 counter_left[numTasks] = 0; in partition()
163 for (size_t i=0; i<numTasks; i++) { in partition()
170 for (size_t i=1; i<numTasks; i++) in partition()
181 for (size_t i=0; i<numTasks; i++) in partition()
207 parallel_for(numTasks,[&] (const size_t taskID) { in partition()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/pthread/
H A Dtest_pthread_mandelbrot.cpp281 int numTasks = NUM_THREADS; variable
352 for(int i = 0; i < numTasks; ++i) in register_tasks()
357 …delImag, outputImage, sizeof(float)*W, sizeof(uint32_t)*W, W*i/numTasks, 0, 1, W/numTasks, H, left… in register_tasks()
360 …delImag, outputImage, sizeof(float)*W, sizeof(uint32_t)*W, W*i/numTasks, 0, 1, W/numTasks, H, left… in register_tasks()
367 …numTasks = EM_ASM_INT(return (typeof document !== 'undefined' && document.getElementById('num_thre… in register_tasks()
368 if (numTasks < 1) numTasks = 1; in register_tasks()
369 if (numTasks > emscripten_num_logical_cores()) numTasks = emscripten_num_logical_cores(); in register_tasks()
374 for(int i = 0; i < numTasks; ++i) in register_tasks()
389 if (td >= numTasks) in wait_tasks()
518 for(int i = 0; i < numTasks; ++i) in main_tick()
[all …]
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-mapreduce-project/hadoop-mapreduce-client/hadoop-mapreduce-client-app/src/test/java/org/apache/hadoop/mapreduce/v2/app/
H A DMockAppContext.java50 public MockAppContext(int appid, int numTasks, int numAttempts, Path confPath) { in MockAppContext() argument
54 Job job = MockJobs.newJob(appID, 0, numTasks, numAttempts, confPath); in MockAppContext()
59 public MockAppContext(int appid, int numJobs, int numTasks, int numAttempts) { in MockAppContext() argument
60 this(appid, numJobs, numTasks, numAttempts, false); in MockAppContext()
63 public MockAppContext(int appid, int numJobs, int numTasks, int numAttempts, in MockAppContext() argument
67 jobs = MockJobs.newJobs(appID, numJobs, numTasks, numAttempts, hasFailedTasks); in MockAppContext()
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-config/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GPUQREngine/Source/
H A DGPUQREngine_UberKernel.cu21 int numTasks // The # of items in the work list in GPUQREngine_UberKernel() argument
26 dim3 grid(numTasks, 1); in GPUQREngine_UberKernel()
29 qrKernel<<<grid, threads, 0, kernelStream>>>(gpuWorkQueue, numTasks); in GPUQREngine_UberKernel()

12345678910>>...17