/barrelfish-2018-10-04/usr/bench/tenaciousd_bench/ |
H A D | tenaciousd_bench.c | 21 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 D | ipi_bench.c | 44 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 D | elipsys_fd.c | 479 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 D | probing_for_scheduling.pl | 35 % - 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 D | ic_probing_for_scheduling.pl | 71 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 D | ic_make_overlap_bivs.pl | 148 and durations mean they can't or must overlap.
|
H A D | make_overlap_bivs.pl | 148 and durations mean they can't or must overlap.
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | elipsys_fd.pl | 86 % Same number of starting dates and durations 93 % Array of durations 97 SDurations =.. [durations|Durations],
|
H A D | fd_elipsys.pl | 75 % Same number of starting dates and durations 82 % Array of durations 86 SDurations =.. [durations|Durations],
|
H A D | fd.pl | 3002 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 D | gfd.cpp | 3087 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 D | introduction.tex | 95 of tasks (start times, durations and resource needs), and a maximum
|
H A D | gfd.tex | 800 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 D | solversintro.tex | 115 of tasks (start times, durations and resource needs), and a maximum
|
H A D | repairtut.tex | 267 durations, which are related by a 282 \verb0Interval0 to account for the task durations.
|
H A D | hybrid.tex | 166 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 D | clients.tex | 189 start times, durations and resource requirements of a scheduling
|