Searched refs:durations (Results 1 - 17 of 17) sorted by relevance

/barrelfish-2018-10-04/usr/bench/tenaciousd_bench/
H A Dtenaciousd_bench.c21 static uint64_t durations[ITERATIONS][2]; variable
49 durations[i][0] = middle - start;
55 durations[i][1] = end - middle;
63 i, durations[i][0], durations[i][1]);
/barrelfish-2018-10-04/usr/bench/
H A Dipi_bench.c44 static uint64_t durations[ITERATIONS]; local
56 durations[i] = end - begin;
62 printf("durations[%d] = %lu\n", i, durations[i]);
64 sumd += durations[i];
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Delipsys_fd.c479 Int durations[MAX_NUMBER_TASKS]; local
513 durations[i] = IVal(dereference(StrArg(StructDurations,i)));
515 increasing_starts[_EndDate(i+1)] = max_ends[i] = gmax(AuxPPW) + durations[i];
517 increasing_ends[_KeyDate(i+1)] = gmax(AuxPPW) + durations[i];
653 /* Compute the sum of the durations of the tasks in the curent maximal subset */
655 sum_subset = sum_subset + durations[partial_index[n_partial_schedule]];
692 if (min_starts[index_k] + sum_subset + durations[index_k] > latest_end ) {
705 if (earliest_start + sum_subset + durations[index_k]> max_ends[index_k]){
751 if (earliest_start + sum_subset + durations[index_k] > latest_end)
1017 if (latest_end - sum_subset < IVal(AuxStart) + durations[index_
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dprobing_for_scheduling.pl35 % - use a version of cumulative that allows updates to durations
70 Durations: List of integers or fd variables (Task durations)
73 CostFunction: Expression in terms of task start times and durations,
185 % Implements a heuristic that tries not allowing any durations to be
188 % If durations are allowed to increase, for the rare case when
213 % Introduced because 'cumulative' cannot deal with variable durations
294 list of task start times, durations and resources; and a maximum
382 "Durations":"a list of (n) task durations (integers or
387 "CostFun":"An expression involving start times and durations
432 "Durations":"A list of (n) task durations (integer
[all...]
H A Dic_probing_for_scheduling.pl71 Durations: List of integers or ic variables (Task durations)
74 CostFunction: Expression in terms of task start times and durations,
186 % Implements a heuristic that tries not allowing any durations to be
189 % If durations are allowed to increase, for the rare case when
213 % Introduced because 'cumulative' cannot deal with variable durations
294 list of task start times, durations and resources; and a maximum
382 "Durations":"a list of (n) task durations (integers or
387 "CostFun":"An expression involving start times and durations
432 "Durations":"A list of (n) task durations (integers or
H A Dic_make_overlap_bivs.pl148 and durations mean they can't or must overlap.
H A Dmake_overlap_bivs.pl148 and durations mean they can't or must overlap.
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Delipsys_fd.pl86 % Same number of starting dates and durations
93 % Array of durations
97 SDurations =.. [durations|Durations],
H A Dfd_elipsys.pl75 % Same number of starting dates and durations
82 % Array of durations
86 SDurations =.. [durations|Durations],
H A Dfd.pl3002 known durations. Given the starting times and durations, this
3049 by their starting times and durations is scheduled as first. It is
3084 with starting times Starts and durations Durations, with respect to the
3093 times (Starts) and durations (Durations). The actual ordering of tasks
3118 disjunctive(starts(X[1..10], Y[1..10]), durations(5, 7), [_g1124[1, 2]],
3137 disjunctive(starts(X[1, 2], Y[9, 10], Z[4, 5]), durations(3, 7, 5), [1,
/barrelfish-2018-10-04/usr/eclipseclp/GecodeInterface/
H A Dgfd.cpp3087 IntArgs durations(size);
3088 res = assign_IntArgs_from_ec_array(size, darr, durations);
3106 unary(*solver, starts, durations, scheduled);
3108 unary(*solver, starts, durations);
3137 IntVarArgs durations(size);
3138 res = assign_IntVarArgs_from_ec_array(solver, size, darr, durations);
3163 unary(*solver, starts, durations, ends, scheduled);
3165 unary(*solver, starts, ends, durations);
3194 IntVarArgs durations(size);
3195 res = assign_IntVarArgs_from_ec_array(solver, size, darr, durations);
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dintroduction.tex95 of tasks (start times, durations and resource needs), and a maximum
H A Dgfd.tex800 Constrains the tasks with specified start times and durations to not overlap in time. A version with optional tasks is also available:
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsolversintro.tex115 of tasks (start times, durations and resource needs), and a maximum
H A Drepairtut.tex267 durations, which are related by a
282 \verb0Interval0 to account for the task durations.
H A Dhybrid.tex166 To complete the program, we can give durations of $3$ and $5$ to {\em
849 The problem involves tasks with durations, start times and resources.
851 and durations.
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/
H A Dclients.tex189 start times, durations and resource requirements of a scheduling

Completed in 89 milliseconds